<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <author>
    <name>Vanilla</name>
  </author>
  <generator uri="https://hexo.io/">Hexo</generator>
  <id>https://blog.vanilla-chan.cn/</id>
  <link href="https://blog.vanilla-chan.cn/" rel="alternate"/>
  <link href="https://blog.vanilla-chan.cn/atom.xml" rel="self"/>
  <rights>All rights reserved 2026, Vanilla</rights>
  <subtitle>永远可爱 永远善良</subtitle>
  <title>Vanilla Yukirin</title>
  <updated>2026-03-05T21:42:02.000Z</updated>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="GPU" scheme="https://blog.vanilla-chan.cn/tags/GPU/"/>
    <category term="BIOS" scheme="https://blog.vanilla-chan.cn/tags/BIOS/"/>
    <category term="PCIe" scheme="https://blog.vanilla-chan.cn/tags/PCIe/"/>
    <category term="eGPU" scheme="https://blog.vanilla-chan.cn/tags/eGPU/"/>
    <content>
      <![CDATA[<h2 id="Solution"><a href="#Solution" class="headerlink" title="Solution"></a>Solution</h2><p>开机按Del键，进入bois</p><p>依次进入：</p><ul><li>Chipset</li><li>System Agent (SA) Configuration</li><li>PCI Express Configuration</li><li>PCI Express Root port 2</li></ul><p>修改选项 <code>PCIe Speed</code>，默认为Auto。</p><p>修改后，按 <code>F4</code> 保存并退出。</p><h2 id="Tips"><a href="#Tips" class="headerlink" title="Tips"></a>Tips</h2><p>支持跑3.0x8和4.0x8，但是<strong>听说</strong>对于40系显卡由于不明原因，不能跑在4.0下，只能退而求其次跑3.0x8。30系显卡反而支持4.0x8，享受两倍带宽。</p><p>所以，其实更建议用30系的卡外接？</p><h2 id="Reference"><a href="#Reference" class="headerlink" title="Reference"></a>Reference</h2><p><a href="https://doc.bee-link.com.cn/books/gti13-ultra-bios">GTi13 Ultra BIOS设置 | 零刻知识库</a></p><p><a href="https://doc.bee-link.com.cn/books/gti13-ultra-bios/page/pcie">切换PCIE通道速度 | 零刻知识库</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2026/03/06/GTi13Ultra-BIOS-PCIe-Configuration/</id>
    <link href="https://blog.vanilla-chan.cn/2026/03/06/GTi13Ultra-BIOS-PCIe-Configuration/"/>
    <published>2026-03-05T21:42:02.000Z</published>
    <summary>
      <![CDATA[记录零刻 GTi13 Ultra 在 BIOS 中切换 PCIe 通道速率的步骤与注意事项，并补充 30/40 系显卡在 3.0x8 与 4.0x8 下的兼容性经验。省流：开机 Del 进 BIOS，按 Chipset -> SA -> PCI Express Root Port 2 修改 PCIe Speed，40 系优先 3.0x8，30 系可尝试 4.0x8。]]>
    </summary>
    <title>零刻GTi13Ultra进入BIOS切换显卡PCIe通道</title>
    <updated>2026-03-05T21:42:02.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Z-Image" scheme="https://blog.vanilla-chan.cn/tags/Z-Image/"/>
    <category term="LoRA" scheme="https://blog.vanilla-chan.cn/tags/LoRA/"/>
    <category term="ML" scheme="https://blog.vanilla-chan.cn/tags/ML/"/>
    <content>
      <![CDATA[<h2 id="训练工具准备"><a href="#训练工具准备" class="headerlink" title="训练工具准备"></a>训练工具准备</h2><h3 id="安装环境"><a href="#安装环境" class="headerlink" title="安装环境"></a>安装环境</h3><p>我使用ai-toolkit进行训练。个人偏好使用conda来配置训练环境：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">conda</span> create -n ai-toolkit python=<span class="number">3</span>.<span class="number">12</span></span><br><span class="line"><span class="attribute">conda</span> activate ai-toolkit</span><br><span class="line"><span class="attribute">git</span> clone https://github.com/ostris/ai-toolkit.git</span><br><span class="line"><span class="attribute">pip</span> install --no-cache-dir torch==<span class="number">2</span>.<span class="number">7</span>.<span class="number">0</span> torchvision==<span class="number">0</span>.<span class="number">22</span>.<span class="number">0</span> torchaudio==<span class="number">2</span>.<span class="number">7</span>.<span class="number">0</span> --index-url https://download.pytorch.org/whl/cu126</span><br><span class="line"><span class="attribute">pip</span> install -r requirements.txt</span><br></pre></td></tr></table></figure><p>然后启动GUI来进行之后的操作。GUI不需要保持运行状态也可执行任务，只是用来启动/暂停/监控任务的。</p><figure class="highlight routeros"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">cd ui</span><br><span class="line">npm <span class="built_in">run</span> build_and_start</span><br></pre></td></tr></table></figure><p>【补充】如果在训练开始时遇到了“clip代码中<code>from pkg_resources import packaging</code>报错缺少<code>pkg_resources</code>”的问题</p><p>检测当前环境是否缺这个包：</p><figure class="highlight llvm"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">python -<span class="keyword">c</span> <span class="string">&quot;import setuptools, pkg_resources; print(&#x27;setuptools&#x27;, setuptools.__version__)&quot;</span></span><br></pre></td></tr></table></figure><p>输出：<code>No module named pkg_resources</code>，那么用下面的修复</p><p>修复：</p><figure class="highlight cmake"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">python -m pip <span class="keyword">install</span> -U <span class="string">&quot;setuptools&lt;81&quot;</span> wheel</span><br></pre></td></tr></table></figure><p>原因：“setuptools81移除pkg_resources”这个包。</p><p>【补充】训练用的环境是哪个环境？</p><p>官方推荐使用<code>.venv</code>的方式安装环境。代码中也是优先检测项目内的虚拟环境，如果存在就直接用（<code>.venv\Scripts\python.exe</code>和<code>venv\Scripts\python.exe</code>）；否则就会使用当前终端的环境变量。所以，如果用全局环境或conda，就不要创建venv却不配环境。</p><h3 id="Z-Image-Turbo模型准备"><a href="#Z-Image-Turbo模型准备" class="headerlink" title="Z-Image-Turbo模型准备"></a>Z-Image-Turbo模型准备</h3><p>下载模型本体</p><figure class="highlight css"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">pip install modelscope</span><br><span class="line">modelscope download <span class="attr">--model</span> Tongyi-MAI/Z-<span class="selector-tag">Image</span>-Turbo <span class="attr">--local_dir</span> &quot;.\&quot;</span><br></pre></td></tr></table></figure><h2 id="构建数据集"><a href="#构建数据集" class="headerlink" title="构建数据集"></a>构建数据集</h2><h3 id="tagger"><a href="#tagger" class="headerlink" title="tagger"></a>tagger</h3><p>请claude帮我写了个调用lmstudio-api的代码。模型采用的是<code>qwen3-VL-8B:Q6K</code>。</p><p>提示词采用三段结构：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># 默认 Prompt</span></span><br><span class="line">DEFAULT_PROMPT = <span class="string">&quot;&quot;&quot;请详细描述这张图片中的内容，包括主体、动作、背景、风格等。</span></span><br><span class="line"><span class="string">只需返回描述文本，不要使用markdown符号，不要任何额外说明。</span></span><br><span class="line"><span class="string">首先进行整体描述，例如：人物、镜头、动作/表情、场景类别等。</span></span><br><span class="line"><span class="string">之后进行详细描述。&quot;&quot;&quot;</span></span><br><span class="line">DEFAULT_PREFIX = <span class="string">&quot;&quot;</span>  <span class="comment"># 前缀 prompt（如：需在描述中的第一句话提及画中的人物是xxx。）</span></span><br><span class="line">DEFAULT_SUFFIX = <span class="string">&quot;&quot;</span>  <span class="comment"># 后缀 prompt（适合放一些额外的需求补充，如：不对画面中的文字信息进行描述）</span></span><br></pre></td></tr></table></figure><p>然后前驱和后继prompt可以通过参数来控制，方便对混合数据集进行差异化打标。</p><p><code>tagger.py</code>完整代码如下：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br><span class="line">171</span><br><span class="line">172</span><br><span class="line">173</span><br><span class="line">174</span><br><span class="line">175</span><br><span class="line">176</span><br><span class="line">177</span><br><span class="line">178</span><br><span class="line">179</span><br><span class="line">180</span><br><span class="line">181</span><br><span class="line">182</span><br><span class="line">183</span><br><span class="line">184</span><br><span class="line">185</span><br><span class="line">186</span><br><span class="line">187</span><br><span class="line">188</span><br><span class="line">189</span><br><span class="line">190</span><br><span class="line">191</span><br><span class="line">192</span><br><span class="line">193</span><br><span class="line">194</span><br><span class="line">195</span><br><span class="line">196</span><br><span class="line">197</span><br><span class="line">198</span><br><span class="line">199</span><br><span class="line">200</span><br><span class="line">201</span><br><span class="line">202</span><br><span class="line">203</span><br><span class="line">204</span><br><span class="line">205</span><br><span class="line">206</span><br><span class="line">207</span><br><span class="line">208</span><br><span class="line">209</span><br><span class="line">210</span><br><span class="line">211</span><br><span class="line">212</span><br><span class="line">213</span><br><span class="line">214</span><br><span class="line">215</span><br><span class="line">216</span><br><span class="line">217</span><br><span class="line">218</span><br><span class="line">219</span><br><span class="line">220</span><br><span class="line">221</span><br><span class="line">222</span><br><span class="line">223</span><br><span class="line">224</span><br><span class="line">225</span><br><span class="line">226</span><br><span class="line">227</span><br><span class="line">228</span><br><span class="line">229</span><br><span class="line">230</span><br><span class="line">231</span><br><span class="line">232</span><br><span class="line">233</span><br><span class="line">234</span><br><span class="line">235</span><br><span class="line">236</span><br><span class="line">237</span><br><span class="line">238</span><br><span class="line">239</span><br><span class="line">240</span><br><span class="line">241</span><br><span class="line">242</span><br><span class="line">243</span><br><span class="line">244</span><br><span class="line">245</span><br><span class="line">246</span><br><span class="line">247</span><br><span class="line">248</span><br><span class="line">249</span><br><span class="line">250</span><br><span class="line">251</span><br><span class="line">252</span><br><span class="line">253</span><br><span class="line">254</span><br><span class="line">255</span><br><span class="line">256</span><br><span class="line">257</span><br><span class="line">258</span><br><span class="line">259</span><br><span class="line">260</span><br><span class="line">261</span><br><span class="line">262</span><br><span class="line">263</span><br><span class="line">264</span><br><span class="line">265</span><br><span class="line">266</span><br><span class="line">267</span><br><span class="line">268</span><br><span class="line">269</span><br><span class="line">270</span><br><span class="line">271</span><br><span class="line">272</span><br><span class="line">273</span><br><span class="line">274</span><br><span class="line">275</span><br><span class="line">276</span><br><span class="line">277</span><br><span class="line">278</span><br><span class="line">279</span><br><span class="line">280</span><br><span class="line">281</span><br><span class="line">282</span><br><span class="line">283</span><br><span class="line">284</span><br><span class="line">285</span><br><span class="line">286</span><br><span class="line">287</span><br><span class="line">288</span><br><span class="line">289</span><br><span class="line">290</span><br><span class="line">291</span><br><span class="line">292</span><br><span class="line">293</span><br><span class="line">294</span><br><span class="line">295</span><br><span class="line">296</span><br><span class="line">297</span><br><span class="line">298</span><br><span class="line">299</span><br><span class="line">300</span><br><span class="line">301</span><br><span class="line">302</span><br><span class="line">303</span><br><span class="line">304</span><br><span class="line">305</span><br><span class="line">306</span><br><span class="line">307</span><br><span class="line">308</span><br><span class="line">309</span><br><span class="line">310</span><br><span class="line">311</span><br><span class="line">312</span><br><span class="line">313</span><br><span class="line">314</span><br><span class="line">315</span><br><span class="line">316</span><br><span class="line">317</span><br><span class="line">318</span><br><span class="line">319</span><br><span class="line">320</span><br><span class="line">321</span><br><span class="line">322</span><br><span class="line">323</span><br><span class="line">324</span><br><span class="line">325</span><br><span class="line">326</span><br><span class="line">327</span><br><span class="line">328</span><br><span class="line">329</span><br><span class="line">330</span><br><span class="line">331</span><br><span class="line">332</span><br><span class="line">333</span><br><span class="line">334</span><br><span class="line">335</span><br><span class="line">336</span><br><span class="line">337</span><br><span class="line">338</span><br><span class="line">339</span><br><span class="line">340</span><br><span class="line">341</span><br><span class="line">342</span><br><span class="line">343</span><br><span class="line">344</span><br><span class="line">345</span><br><span class="line">346</span><br><span class="line">347</span><br><span class="line">348</span><br><span class="line">349</span><br><span class="line">350</span><br><span class="line">351</span><br><span class="line">352</span><br><span class="line">353</span><br><span class="line">354</span><br><span class="line">355</span><br><span class="line">356</span><br><span class="line">357</span><br><span class="line">358</span><br><span class="line">359</span><br><span class="line">360</span><br><span class="line">361</span><br><span class="line">362</span><br><span class="line">363</span><br><span class="line">364</span><br><span class="line">365</span><br><span class="line">366</span><br><span class="line">367</span><br><span class="line">368</span><br><span class="line">369</span><br><span class="line">370</span><br><span class="line">371</span><br><span class="line">372</span><br><span class="line">373</span><br><span class="line">374</span><br><span class="line">375</span><br><span class="line">376</span><br><span class="line">377</span><br><span class="line">378</span><br><span class="line">379</span><br><span class="line">380</span><br><span class="line">381</span><br><span class="line">382</span><br><span class="line">383</span><br><span class="line">384</span><br><span class="line">385</span><br><span class="line">386</span><br><span class="line">387</span><br><span class="line">388</span><br><span class="line">389</span><br><span class="line">390</span><br><span class="line">391</span><br><span class="line">392</span><br><span class="line">393</span><br><span class="line">394</span><br><span class="line">395</span><br><span class="line">396</span><br><span class="line">397</span><br><span class="line">398</span><br><span class="line">399</span><br><span class="line">400</span><br><span class="line">401</span><br><span class="line">402</span><br><span class="line">403</span><br><span class="line">404</span><br><span class="line">405</span><br><span class="line">406</span><br><span class="line">407</span><br><span class="line">408</span><br><span class="line">409</span><br><span class="line">410</span><br><span class="line">411</span><br><span class="line">412</span><br><span class="line">413</span><br><span class="line">414</span><br><span class="line">415</span><br><span class="line">416</span><br><span class="line">417</span><br><span class="line">418</span><br><span class="line">419</span><br><span class="line">420</span><br><span class="line">421</span><br><span class="line">422</span><br><span class="line">423</span><br><span class="line">424</span><br><span class="line">425</span><br><span class="line">426</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">使用 LM Studio API 给图片打标</span></span><br><span class="line"><span class="string">支持单张图片测试和批量文件夹处理</span></span><br><span class="line"><span class="string">&quot;&quot;&quot;</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> base64</span><br><span class="line"><span class="keyword">import</span> requests</span><br><span class="line"><span class="keyword">import</span> json</span><br><span class="line"><span class="keyword">import</span> argparse</span><br><span class="line"><span class="keyword">import</span> os</span><br><span class="line"><span class="keyword">import</span> shutil</span><br><span class="line"><span class="keyword">import</span> hashlib</span><br><span class="line"><span class="keyword">from</span> pathlib <span class="keyword">import</span> Path</span><br><span class="line"><span class="keyword">from</span> datetime <span class="keyword">import</span> datetime</span><br><span class="line"><span class="keyword">from</span> typing <span class="keyword">import</span> <span class="type">Optional</span>, <span class="type">List</span>, <span class="type">Tuple</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== 配置参数 ====================</span></span><br><span class="line"></span><br><span class="line">DEFAULT_API_URL = <span class="string">&quot;http://localhost:1234/v1/chat/completions&quot;</span></span><br><span class="line">DEFAULT_MODEL = <span class="string">&quot;qwen/qwen3-vl-8b&quot;</span></span><br><span class="line">TIMEOUT = <span class="number">30</span>  <span class="comment"># API 请求超时时间（秒）</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 默认 Prompt（用户可以根据需要修改）</span></span><br><span class="line">DEFAULT_PROMPT = <span class="string">&quot;&quot;&quot;请详细描述这张图片中的内容，包括主体、动作、背景、风格等。</span></span><br><span class="line"><span class="string">只需返回描述文本，不要使用markdown符号，不要任何额外说明。</span></span><br><span class="line"><span class="string">首先进行整体描述，例如：人物、镜头、动作/表情、场景类别等。</span></span><br><span class="line"><span class="string">之后进行详细描述。&quot;&quot;&quot;</span></span><br><span class="line">DEFAULT_PREFIX = <span class="string">&quot;&quot;</span>  <span class="comment"># 前缀 prompt（如：需在描述中的第一句话提及画中的人物是xxx。）</span></span><br><span class="line">DEFAULT_SUFFIX = <span class="string">&quot;&quot;</span>  <span class="comment"># 后缀 prompt（适合放一些额外的需求补充，如：不对画面中的文字信息进行描述）</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 生成配置</span></span><br><span class="line">MAX_TOKENS = <span class="number">2048</span></span><br><span class="line">TEMPERATURE = <span class="number">0.7</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 支持的图片格式</span></span><br><span class="line">SUPPORTED_EXTS = &#123;<span class="string">&quot;.jpg&quot;</span>, <span class="string">&quot;.jpeg&quot;</span>, <span class="string">&quot;.png&quot;</span>, <span class="string">&quot;.webp&quot;</span>&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== 核心函数 ====================</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">calculate_md5</span>(<span class="params">file_path: <span class="built_in">str</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;计算文件的 MD5 hash&quot;&quot;&quot;</span></span><br><span class="line">    md5_hash = hashlib.md5()</span><br><span class="line">    <span class="keyword">with</span> <span class="built_in">open</span>(file_path, <span class="string">&quot;rb&quot;</span>) <span class="keyword">as</span> f:</span><br><span class="line">        <span class="keyword">for</span> chunk <span class="keyword">in</span> <span class="built_in">iter</span>(<span class="keyword">lambda</span>: f.read(<span class="number">4096</span>), <span class="string">b&quot;&quot;</span>):</span><br><span class="line">            md5_hash.update(chunk)</span><br><span class="line">    <span class="keyword">return</span> md5_hash.hexdigest()</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">encode_image</span>(<span class="params">image_path: <span class="built_in">str</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;将图片转换为 base64 编码&quot;&quot;&quot;</span></span><br><span class="line">    <span class="keyword">with</span> <span class="built_in">open</span>(image_path, <span class="string">&quot;rb&quot;</span>) <span class="keyword">as</span> img_file:</span><br><span class="line">        encoded_string = base64.b64encode(img_file.read()).decode(<span class="string">&quot;utf-8&quot;</span>)</span><br><span class="line">    <span class="keyword">return</span> encoded_string</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">call_lm_studio_api</span>(<span class="params"></span></span><br><span class="line"><span class="params">    image_base64: <span class="built_in">str</span>,</span></span><br><span class="line"><span class="params">    prompt: <span class="built_in">str</span>,</span></span><br><span class="line"><span class="params">    prefix: <span class="built_in">str</span> = <span class="string">&quot;&quot;</span>,</span></span><br><span class="line"><span class="params">    suffix: <span class="built_in">str</span> = <span class="string">&quot;&quot;</span>,</span></span><br><span class="line"><span class="params">    api_url: <span class="built_in">str</span> = DEFAULT_API_URL,</span></span><br><span class="line"><span class="params">    model: <span class="built_in">str</span> = DEFAULT_MODEL,</span></span><br><span class="line"><span class="params"></span>) -&gt; <span class="type">Optional</span>[<span class="built_in">str</span>]:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    调用 LM Studio API 进行图片打标</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    参数:</span></span><br><span class="line"><span class="string">        image_base64: 图片的 base64 编码</span></span><br><span class="line"><span class="string">        prompt: 主要提示词</span></span><br><span class="line"><span class="string">        prefix: 前缀提示词（如触发词）</span></span><br><span class="line"><span class="string">        suffix: 后缀提示词</span></span><br><span class="line"><span class="string">        api_url: API 地址</span></span><br><span class="line"><span class="string">        model: 模型名称</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    返回:</span></span><br><span class="line"><span class="string">        成功: 返回标签文本</span></span><br><span class="line"><span class="string">        失败: 返回 None</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line">    <span class="comment"># 组合完整的 prompt：前缀 + 主体 + 后缀</span></span><br><span class="line">    full_prompt = <span class="string">f&quot;<span class="subst">&#123;prefix&#125;</span><span class="subst">&#123;prompt&#125;</span><span class="subst">&#123;suffix&#125;</span>&quot;</span>.strip()</span><br><span class="line">    payload = &#123;</span><br><span class="line">        <span class="string">&quot;model&quot;</span>: model,</span><br><span class="line">        <span class="string">&quot;messages&quot;</span>: [</span><br><span class="line">            &#123;</span><br><span class="line">                <span class="string">&quot;role&quot;</span>: <span class="string">&quot;user&quot;</span>,</span><br><span class="line">                <span class="string">&quot;content&quot;</span>: [</span><br><span class="line">                    &#123;<span class="string">&quot;type&quot;</span>: <span class="string">&quot;text&quot;</span>, <span class="string">&quot;text&quot;</span>: full_prompt&#125;,</span><br><span class="line">                    &#123;</span><br><span class="line">                        <span class="string">&quot;type&quot;</span>: <span class="string">&quot;image_url&quot;</span>,</span><br><span class="line">                        <span class="string">&quot;image_url&quot;</span>: &#123;<span class="string">&quot;url&quot;</span>: <span class="string">f&quot;data:image/jpeg;base64,<span class="subst">&#123;image_base64&#125;</span>&quot;</span>&#125;,</span><br><span class="line">                    &#125;,</span><br><span class="line">                ],</span><br><span class="line">            &#125;</span><br><span class="line">        ],</span><br><span class="line">        <span class="string">&quot;max_tokens&quot;</span>: MAX_TOKENS,</span><br><span class="line">        <span class="string">&quot;temperature&quot;</span>: TEMPERATURE,</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        response = requests.post(api_url, json=payload, timeout=TIMEOUT)</span><br><span class="line">        response.raise_for_status()</span><br><span class="line"></span><br><span class="line">        result = response.json()</span><br><span class="line">        caption = result[<span class="string">&quot;choices&quot;</span>][<span class="number">0</span>][<span class="string">&quot;message&quot;</span>][<span class="string">&quot;content&quot;</span>]</span><br><span class="line">        <span class="keyword">return</span> caption.strip()</span><br><span class="line"></span><br><span class="line">    <span class="keyword">except</span> requests.Timeout:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;  ⚠ 超时 (&gt;<span class="subst">&#123;TIMEOUT&#125;</span>s)&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line">    <span class="keyword">except</span> requests.ConnectionError:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;  ❌ 连接失败：无法连接到 LM Studio API (<span class="subst">&#123;api_url&#125;</span>)&quot;</span>)</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;     请确保：&quot;</span>)</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;     1. LM Studio 已启动&quot;</span>)</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;     2. 已加载 <span class="subst">&#123;model&#125;</span> 模型&quot;</span>)</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;     3. API 服务已开启（Developer → Start Server）&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line">    <span class="keyword">except</span> KeyError:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;  ❌ API 返回格式错误&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line">    <span class="keyword">except</span> Exception <span class="keyword">as</span> e:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;  ❌ API 错误: <span class="subst">&#123;<span class="built_in">str</span>(e)&#125;</span>&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">tag_single_image</span>(<span class="params"></span></span><br><span class="line"><span class="params">    image_path: <span class="built_in">str</span>,</span></span><br><span class="line"><span class="params">    prompt: <span class="built_in">str</span> = DEFAULT_PROMPT,</span></span><br><span class="line"><span class="params">    prefix: <span class="built_in">str</span> = DEFAULT_PREFIX,</span></span><br><span class="line"><span class="params">    suffix: <span class="built_in">str</span> = DEFAULT_SUFFIX,</span></span><br><span class="line"><span class="params">    api_url: <span class="built_in">str</span> = DEFAULT_API_URL,</span></span><br><span class="line"><span class="params">    model: <span class="built_in">str</span> = DEFAULT_MODEL,</span></span><br><span class="line"><span class="params"></span>) -&gt; <span class="type">Optional</span>[<span class="built_in">str</span>]:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    单张图片打标（测试模式）</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    返回:</span></span><br><span class="line"><span class="string">        成功: 返回标签文本</span></span><br><span class="line"><span class="string">        失败: 返回 None</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line">    <span class="keyword">if</span> <span class="keyword">not</span> os.path.exists(image_path):</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;❌ 图片不存在: <span class="subst">&#123;image_path&#125;</span>&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📷 处理图片: <span class="subst">&#123;image_path&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;🔄 正在调用 API...&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 显示完整 prompt（用于调试）</span></span><br><span class="line">    full_prompt = <span class="string">f&quot;<span class="subst">&#123;prefix&#125;</span><span class="subst">&#123;prompt&#125;</span><span class="subst">&#123;suffix&#125;</span>&quot;</span>.strip()</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📝 完整 Prompt: <span class="subst">&#123;full_prompt&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        image_base64 = encode_image(image_path)</span><br><span class="line">        caption = call_lm_studio_api(</span><br><span class="line">            image_base64, prompt, prefix, suffix, api_url, model</span><br><span class="line">        )</span><br><span class="line">        <span class="keyword">return</span> caption</span><br><span class="line">    <span class="keyword">except</span> Exception <span class="keyword">as</span> e:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;❌ 编码图片失败: <span class="subst">&#123;<span class="built_in">str</span>(e)&#125;</span>&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">None</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">collect_images</span>(<span class="params">input_dir: <span class="built_in">str</span></span>) -&gt; <span class="type">List</span>[<span class="built_in">str</span>]:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    递归收集所有支持的图片文件</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    返回:</span></span><br><span class="line"><span class="string">        图片路径列表</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line">    images = []</span><br><span class="line">    input_path = Path(input_dir)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> <span class="keyword">not</span> input_path.exists():</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;❌ 输入目录不存在: <span class="subst">&#123;input_dir&#125;</span>&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> images</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> file_path <span class="keyword">in</span> input_path.rglob(<span class="string">&quot;*&quot;</span>):</span><br><span class="line">        <span class="keyword">if</span> file_path.is_file() <span class="keyword">and</span> file_path.suffix.lower() <span class="keyword">in</span> SUPPORTED_EXTS:</span><br><span class="line">            images.append(<span class="built_in">str</span>(file_path))</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="built_in">sorted</span>(images)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">save_caption</span>(<span class="params">txt_path: <span class="built_in">str</span>, caption: <span class="built_in">str</span></span>):</span><br><span class="line">    <span class="string">&quot;&quot;&quot;保存标签到文本文件&quot;&quot;&quot;</span></span><br><span class="line">    <span class="keyword">with</span> <span class="built_in">open</span>(txt_path, <span class="string">&quot;w&quot;</span>, encoding=<span class="string">&quot;utf-8&quot;</span>) <span class="keyword">as</span> f:</span><br><span class="line">        f.write(caption)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">log_error</span>(<span class="params">log_file: <span class="built_in">str</span>, image_path: <span class="built_in">str</span>, error_msg: <span class="built_in">str</span></span>):</span><br><span class="line">    <span class="string">&quot;&quot;&quot;记录失败日志&quot;&quot;&quot;</span></span><br><span class="line">    timestamp = datetime.now().strftime(<span class="string">&quot;%Y-%m-%d %H:%M:%S&quot;</span>)</span><br><span class="line">    <span class="keyword">with</span> <span class="built_in">open</span>(log_file, <span class="string">&quot;a&quot;</span>, encoding=<span class="string">&quot;utf-8&quot;</span>) <span class="keyword">as</span> f:</span><br><span class="line">        f.write(<span class="string">f&quot;<span class="subst">&#123;timestamp&#125;</span> | <span class="subst">&#123;image_path&#125;</span> | <span class="subst">&#123;error_msg&#125;</span>\n&quot;</span>)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">batch_tag_folder</span>(<span class="params"></span></span><br><span class="line"><span class="params">    input_dir: <span class="built_in">str</span>,</span></span><br><span class="line"><span class="params">    output_dir: <span class="built_in">str</span>,</span></span><br><span class="line"><span class="params">    prompt: <span class="built_in">str</span> = DEFAULT_PROMPT,</span></span><br><span class="line"><span class="params">    prefix: <span class="built_in">str</span> = DEFAULT_PREFIX,</span></span><br><span class="line"><span class="params">    suffix: <span class="built_in">str</span> = DEFAULT_SUFFIX,</span></span><br><span class="line"><span class="params">    api_url: <span class="built_in">str</span> = DEFAULT_API_URL,</span></span><br><span class="line"><span class="params">    model: <span class="built_in">str</span> = DEFAULT_MODEL,</span></span><br><span class="line"><span class="params">    overwrite: <span class="built_in">bool</span> = <span class="literal">False</span>,</span></span><br><span class="line"><span class="params"></span>):</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    批量处理文件夹</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    参数:</span></span><br><span class="line"><span class="string">        input_dir: 输入目录（递归处理）</span></span><br><span class="line"><span class="string">        output_dir: 输出目录（扁平化，使用 MD5 命名）</span></span><br><span class="line"><span class="string">        prompt: 打标提示词</span></span><br><span class="line"><span class="string">        prefix: 前缀提示词（如触发词）</span></span><br><span class="line"><span class="string">        suffix: 后缀提示词</span></span><br><span class="line"><span class="string">        api_url: LM Studio API 地址</span></span><br><span class="line"><span class="string">        model: 模型名称</span></span><br><span class="line"><span class="string">        overwrite: 是否覆盖已有标签</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line">    <span class="comment"># 创建输出目录</span></span><br><span class="line">    output_path = Path(output_dir)</span><br><span class="line">    output_path.mkdir(parents=<span class="literal">True</span>, exist_ok=<span class="literal">True</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 收集所有图片</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📁 扫描输入目录: <span class="subst">&#123;input_dir&#125;</span>&quot;</span>)</span><br><span class="line">    images = collect_images(input_dir)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> <span class="keyword">not</span> images:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;❌ 未找到任何图片文件&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span></span><br><span class="line"></span><br><span class="line">    <span class="comment"># 组合完整 prompt</span></span><br><span class="line">    full_prompt = <span class="string">f&quot;<span class="subst">&#123;prefix&#125;</span><span class="subst">&#123;prompt&#125;</span><span class="subst">&#123;suffix&#125;</span>&quot;</span>.strip()</span><br><span class="line"></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;✓ 找到 <span class="subst">&#123;<span class="built_in">len</span>(images)&#125;</span> 张图片&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📂 输出目录: <span class="subst">&#123;output_dir&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;🤖 模型: <span class="subst">&#123;model&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📝 完整 Prompt: <span class="subst">&#123;full_prompt&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">&quot;-&quot;</span> * <span class="number">60</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 失败日志路径</span></span><br><span class="line">    log_file = output_path / <span class="string">&quot;failed.log&quot;</span></span><br><span class="line"></span><br><span class="line">    <span class="comment"># 统计信息</span></span><br><span class="line">    success_count = <span class="number">0</span></span><br><span class="line">    skipped_count = <span class="number">0</span></span><br><span class="line">    failed_count = <span class="number">0</span></span><br><span class="line"></span><br><span class="line">    <span class="comment"># 用于去重的 hash 集合</span></span><br><span class="line">    processed_hashes = <span class="built_in">set</span>()</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> idx, image_path <span class="keyword">in</span> <span class="built_in">enumerate</span>(images, <span class="number">1</span>):</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;[<span class="subst">&#123;idx&#125;</span>/<span class="subst">&#123;<span class="built_in">len</span>(images)&#125;</span>] <span class="subst">&#123;Path(image_path).name&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line">        <span class="keyword">try</span>:</span><br><span class="line">            <span class="comment"># 计算 MD5 hash</span></span><br><span class="line">            file_hash = calculate_md5(image_path)</span><br><span class="line"></span><br><span class="line">            <span class="comment"># 检查是否已处理过（去重）</span></span><br><span class="line">            <span class="keyword">if</span> file_hash <span class="keyword">in</span> processed_hashes:</span><br><span class="line">                <span class="built_in">print</span>(<span class="string">f&quot;  ⊘ 跳过（重复文件，MD5: <span class="subst">&#123;file_hash[:<span class="number">8</span>]&#125;</span>...）&quot;</span>)</span><br><span class="line">                skipped_count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">continue</span></span><br><span class="line"></span><br><span class="line">            <span class="comment"># 获取文件扩展名</span></span><br><span class="line">            ext = Path(image_path).suffix.lower()</span><br><span class="line"></span><br><span class="line">            <span class="comment"># 输出文件名（使用 MD5）</span></span><br><span class="line">            output_image_name = <span class="string">f&quot;<span class="subst">&#123;file_hash&#125;</span><span class="subst">&#123;ext&#125;</span>&quot;</span></span><br><span class="line">            output_txt_name = <span class="string">f&quot;<span class="subst">&#123;file_hash&#125;</span>.txt&quot;</span></span><br><span class="line"></span><br><span class="line">            output_image_path = output_path / output_image_name</span><br><span class="line">            output_txt_path = output_path / output_txt_name</span><br><span class="line"></span><br><span class="line">            <span class="comment"># 检查是否已有标签文件</span></span><br><span class="line">            <span class="keyword">if</span> output_txt_path.exists() <span class="keyword">and</span> <span class="keyword">not</span> overwrite:</span><br><span class="line">                <span class="built_in">print</span>(<span class="string">f&quot;  ⊘ 跳过（已存在标签文件）&quot;</span>)</span><br><span class="line">                processed_hashes.add(file_hash)</span><br><span class="line">                skipped_count += <span class="number">1</span></span><br><span class="line">                <span class="keyword">continue</span></span><br><span class="line"></span><br><span class="line">            <span class="comment"># 编码图片</span></span><br><span class="line">            image_base64 = encode_image(image_path)</span><br><span class="line"></span><br><span class="line">            <span class="comment"># 调用 API</span></span><br><span class="line">            caption = call_lm_studio_api(</span><br><span class="line">                image_base64, prompt, prefix, suffix, api_url, model</span><br><span class="line">            )</span><br><span class="line"></span><br><span class="line">            <span class="keyword">if</span> caption <span class="keyword">is</span> <span class="literal">None</span>:</span><br><span class="line">                failed_count += <span class="number">1</span></span><br><span class="line">                log_error(<span class="built_in">str</span>(log_file), image_path, <span class="string">&quot;API 调用失败或超时&quot;</span>)</span><br><span class="line">                <span class="keyword">continue</span></span><br><span class="line"></span><br><span class="line">            <span class="comment"># 复制图片到输出目录</span></span><br><span class="line">            <span class="keyword">if</span> <span class="keyword">not</span> output_image_path.exists():</span><br><span class="line">                shutil.copy2(image_path, output_image_path)</span><br><span class="line"></span><br><span class="line">            <span class="comment"># 保存标签</span></span><br><span class="line">            save_caption(<span class="built_in">str</span>(output_txt_path), caption)</span><br><span class="line"></span><br><span class="line">            <span class="built_in">print</span>(<span class="string">f&quot;  ✓ 已保存: <span class="subst">&#123;output_txt_name&#125;</span>&quot;</span>)</span><br><span class="line">            processed_hashes.add(file_hash)</span><br><span class="line">            success_count += <span class="number">1</span></span><br><span class="line"></span><br><span class="line">        <span class="keyword">except</span> Exception <span class="keyword">as</span> e:</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">f&quot;  ❌ 处理失败: <span class="subst">&#123;<span class="built_in">str</span>(e)&#125;</span>&quot;</span>)</span><br><span class="line">            failed_count += <span class="number">1</span></span><br><span class="line">            log_error(<span class="built_in">str</span>(log_file), image_path, <span class="built_in">str</span>(e))</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 打印统计信息</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">&quot;-&quot;</span> * <span class="number">60</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;✅ 成功: <span class="subst">&#123;success_count&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;⊘ 跳过: <span class="subst">&#123;skipped_count&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;❌ 失败: <span class="subst">&#123;failed_count&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> failed_count &gt; <span class="number">0</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;📋 失败日志: <span class="subst">&#123;log_file&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== CLI 入口 ====================</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">main</span>():</span><br><span class="line">    parser = argparse.ArgumentParser(</span><br><span class="line">        description=<span class="string">&quot;使用 LM Studio API 给图片打标&quot;</span>,</span><br><span class="line">        formatter_class=argparse.RawDescriptionHelpFormatter,</span><br><span class="line">        epilog=<span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">示例用法:</span></span><br><span class="line"><span class="string">  # 单张图片测试</span></span><br><span class="line"><span class="string">  python tagger.py --image &quot;D:\\test\\sample.jpg&quot;</span></span><br><span class="line"><span class="string">  </span></span><br><span class="line"><span class="string">  # 批量处理文件夹</span></span><br><span class="line"><span class="string">  python tagger.py --input &quot;D:\\dataset\\images&quot; --output &quot;D:\\dataset\\tagged&quot;</span></span><br><span class="line"><span class="string">  </span></span><br><span class="line"><span class="string">  # 强制覆盖已有标签</span></span><br><span class="line"><span class="string">  python tagger.py --input &quot;...&quot; --output &quot;...&quot; --overwrite</span></span><br><span class="line"><span class="string">  </span></span><br><span class="line"><span class="string">  # 自定义 API 地址和模型</span></span><br><span class="line"><span class="string">  python tagger.py --input &quot;...&quot; --output &quot;...&quot; --api-url &quot;http://192.168.1.100:1234&quot; --model &quot;qwen/qwen2-vl-72b&quot;</span></span><br><span class="line"><span class="string">        &quot;&quot;&quot;</span>,</span><br><span class="line">    )</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 模式选择</span></span><br><span class="line">    mode_group = parser.add_mutually_exclusive_group(required=<span class="literal">True</span>)</span><br><span class="line">    mode_group.add_argument(<span class="string">&quot;--image&quot;</span>, <span class="built_in">type</span>=<span class="built_in">str</span>, <span class="built_in">help</span>=<span class="string">&quot;单张图片路径（测试模式）&quot;</span>)</span><br><span class="line">    mode_group.add_argument(<span class="string">&quot;--input&quot;</span>, <span class="built_in">type</span>=<span class="built_in">str</span>, <span class="built_in">help</span>=<span class="string">&quot;输入目录（批量处理模式）&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 批量处理参数</span></span><br><span class="line">    parser.add_argument(<span class="string">&quot;--output&quot;</span>, <span class="built_in">type</span>=<span class="built_in">str</span>, <span class="built_in">help</span>=<span class="string">&quot;输出目录（批量模式必需）&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 可选参数</span></span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--prompt&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=DEFAULT_PROMPT,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">f&#x27;打标提示词（默认: &quot;<span class="subst">&#123;DEFAULT_PROMPT&#125;</span>&quot;）&#x27;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--prefix&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=DEFAULT_PREFIX,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">&#x27;前缀提示词（如触发词），示例: &quot;sks woman, &quot;&#x27;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--suffix&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=DEFAULT_SUFFIX,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">&#x27;后缀提示词，示例: &quot;, high quality, masterpiece&quot;&#x27;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--api-url&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=DEFAULT_API_URL,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">f&quot;LM Studio API 地址（默认: <span class="subst">&#123;DEFAULT_API_URL&#125;</span>）&quot;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--model&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=DEFAULT_MODEL,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">f&quot;模型名称（默认: <span class="subst">&#123;DEFAULT_MODEL&#125;</span>）&quot;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(<span class="string">&quot;--overwrite&quot;</span>, action=<span class="string">&quot;store_true&quot;</span>, <span class="built_in">help</span>=<span class="string">&quot;覆盖已有标签文件&quot;</span>)</span><br><span class="line"></span><br><span class="line">    args = parser.parse_args()</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 单张图片测试模式</span></span><br><span class="line">    <span class="keyword">if</span> args.image:</span><br><span class="line">        caption = tag_single_image(</span><br><span class="line">            args.image,</span><br><span class="line">            prompt=args.prompt,</span><br><span class="line">            prefix=args.prefix,</span><br><span class="line">            suffix=args.suffix,</span><br><span class="line">            api_url=args.api_url,</span><br><span class="line">            model=args.model,</span><br><span class="line">        )</span><br><span class="line"></span><br><span class="line">        <span class="keyword">if</span> caption:</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">&quot;\n&quot;</span> + <span class="string">&quot;=&quot;</span> * <span class="number">60</span>)</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">&quot;📝 打标结果:&quot;</span>)</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">&quot;=&quot;</span> * <span class="number">60</span>)</span><br><span class="line">            <span class="built_in">print</span>(caption)</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">&quot;=&quot;</span> * <span class="number">60</span>)</span><br><span class="line">        <span class="keyword">else</span>:</span><br><span class="line">            <span class="built_in">print</span>(<span class="string">&quot;\n❌ 打标失败&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 批量处理模式</span></span><br><span class="line">    <span class="keyword">elif</span> args.<span class="built_in">input</span>:</span><br><span class="line">        <span class="keyword">if</span> <span class="keyword">not</span> args.output:</span><br><span class="line">            parser.error(<span class="string">&quot;批量模式需要指定 --output 参数&quot;</span>)</span><br><span class="line"></span><br><span class="line">        batch_tag_folder(</span><br><span class="line">            input_dir=args.<span class="built_in">input</span>,</span><br><span class="line">            output_dir=args.output,</span><br><span class="line">            prompt=args.prompt,</span><br><span class="line">            prefix=args.prefix,</span><br><span class="line">            suffix=args.suffix,</span><br><span class="line">            api_url=args.api_url,</span><br><span class="line">            model=args.model,</span><br><span class="line">            overwrite=args.overwrite,</span><br><span class="line">        )</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">if</span> __name__ == <span class="string">&quot;__main__&quot;</span>:</span><br><span class="line">    main()</span><br><span class="line"></span><br></pre></td></tr></table></figure><p>用法：</p><ol><li><p>单张图片测试，不会保存图片和标签</p><p> <code>python tagger.py --image 图片路径 --prefix &quot;在输出中首先说明图片中的人物叫做Vanilla。&quot; --suffix &quot;保持客观表述，不要美化&quot;</code></p></li><li><p>将一个文件夹内的所有图片（递归）进行打标，然后以图文对的形式（单层，非递归）保存至另一文件夹</p><p> <code>python tagger.py --input 输入文件夹路径 --output 输出文件夹路径 --prefix 前驱提示词 --suffix 后继提示词</code></p></li><li><p>补充性打标。删除output文件夹中不满意的标签文本文件，然后再次执行指令。代码会跳过已经存在的图文对，只对缺失的进行打标。</p></li><li><p>覆盖。加入<code>--overwrite</code>参数，不检查是否存在标签/图文对，直接覆盖打标。</p><p> <code>python tagger.py --input 输入文件夹路径 --output 输出文件夹路径 --prefix 前驱提示词 --suffix 后继提示词 -overwrite</code></p></li></ol><p>使用md5进行去重。所以输入文件夹中若有2张相同内容图片，只会被打标一次。</p><p>我本次微调用了3个数据集。</p><ul><li>需要模拟的角色（共计497张）：<code>python .\tagger.py --input C:\Users\Vanilla\Downloads\vanilla20260213 --prefix &quot;不需要说的太好看，客观描述即可。多描述五官。在输出中提到该人的名字是Vanilla。&quot; --output c:\Users\Vanilla\Downloads\vanilla20260213_tag</code></li><li>有助于模型学习的cos照（由于太多，走silicon并发，共计499张）：<code>python .\tagger_silicon_concurrent.py --input c:\Users\Vanilla\Desktop\pic\cos20260214 --output c:\Users\Vanilla\Downloads\cos20260214_tag</code></li><li>其他图片（共计247张）：<code>python .\tagger.py --input c:\Users\Vanilla\Downloads\3d20260213 --output c:\Users\Vanilla\Downloads\3d20260213_tag</code></li></ul><p>【补充】如果是为了训练一个人脸LoRA，那么似乎是没有必要进行打标的。打标只是为了确保模型在微调之后的泛化性。如果只是希望模型微调后生成的人脸完全一致，那么建议不打标。如果也要微调画风的话，那么应该还是要打标。</p><h3 id="previewer"><a href="#previewer" class="headerlink" title="previewer"></a>previewer</h3><p>再一次的，让claude写个一个html生成器，方便图文对应的预览所有图文对。</p><p>完整<code>previewer.py</code>如下：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br><span class="line">171</span><br><span class="line">172</span><br><span class="line">173</span><br><span class="line">174</span><br><span class="line">175</span><br><span class="line">176</span><br><span class="line">177</span><br><span class="line">178</span><br><span class="line">179</span><br><span class="line">180</span><br><span class="line">181</span><br><span class="line">182</span><br><span class="line">183</span><br><span class="line">184</span><br><span class="line">185</span><br><span class="line">186</span><br><span class="line">187</span><br><span class="line">188</span><br><span class="line">189</span><br><span class="line">190</span><br><span class="line">191</span><br><span class="line">192</span><br><span class="line">193</span><br><span class="line">194</span><br><span class="line">195</span><br><span class="line">196</span><br><span class="line">197</span><br><span class="line">198</span><br><span class="line">199</span><br><span class="line">200</span><br><span class="line">201</span><br><span class="line">202</span><br><span class="line">203</span><br><span class="line">204</span><br><span class="line">205</span><br><span class="line">206</span><br><span class="line">207</span><br><span class="line">208</span><br><span class="line">209</span><br><span class="line">210</span><br><span class="line">211</span><br><span class="line">212</span><br><span class="line">213</span><br><span class="line">214</span><br><span class="line">215</span><br><span class="line">216</span><br><span class="line">217</span><br><span class="line">218</span><br><span class="line">219</span><br><span class="line">220</span><br><span class="line">221</span><br><span class="line">222</span><br><span class="line">223</span><br><span class="line">224</span><br><span class="line">225</span><br><span class="line">226</span><br><span class="line">227</span><br><span class="line">228</span><br><span class="line">229</span><br><span class="line">230</span><br><span class="line">231</span><br><span class="line">232</span><br><span class="line">233</span><br><span class="line">234</span><br><span class="line">235</span><br><span class="line">236</span><br><span class="line">237</span><br><span class="line">238</span><br><span class="line">239</span><br><span class="line">240</span><br><span class="line">241</span><br><span class="line">242</span><br><span class="line">243</span><br><span class="line">244</span><br><span class="line">245</span><br><span class="line">246</span><br><span class="line">247</span><br><span class="line">248</span><br><span class="line">249</span><br><span class="line">250</span><br><span class="line">251</span><br><span class="line">252</span><br><span class="line">253</span><br><span class="line">254</span><br><span class="line">255</span><br><span class="line">256</span><br><span class="line">257</span><br><span class="line">258</span><br><span class="line">259</span><br><span class="line">260</span><br><span class="line">261</span><br><span class="line">262</span><br><span class="line">263</span><br><span class="line">264</span><br><span class="line">265</span><br><span class="line">266</span><br><span class="line">267</span><br><span class="line">268</span><br><span class="line">269</span><br><span class="line">270</span><br><span class="line">271</span><br><span class="line">272</span><br><span class="line">273</span><br><span class="line">274</span><br><span class="line">275</span><br><span class="line">276</span><br><span class="line">277</span><br><span class="line">278</span><br><span class="line">279</span><br><span class="line">280</span><br><span class="line">281</span><br><span class="line">282</span><br><span class="line">283</span><br><span class="line">284</span><br><span class="line">285</span><br><span class="line">286</span><br><span class="line">287</span><br><span class="line">288</span><br><span class="line">289</span><br><span class="line">290</span><br><span class="line">291</span><br><span class="line">292</span><br><span class="line">293</span><br><span class="line">294</span><br><span class="line">295</span><br><span class="line">296</span><br><span class="line">297</span><br><span class="line">298</span><br><span class="line">299</span><br><span class="line">300</span><br><span class="line">301</span><br><span class="line">302</span><br><span class="line">303</span><br><span class="line">304</span><br><span class="line">305</span><br><span class="line">306</span><br><span class="line">307</span><br><span class="line">308</span><br><span class="line">309</span><br><span class="line">310</span><br><span class="line">311</span><br><span class="line">312</span><br><span class="line">313</span><br><span class="line">314</span><br><span class="line">315</span><br><span class="line">316</span><br><span class="line">317</span><br><span class="line">318</span><br><span class="line">319</span><br><span class="line">320</span><br><span class="line">321</span><br><span class="line">322</span><br><span class="line">323</span><br><span class="line">324</span><br><span class="line">325</span><br><span class="line">326</span><br><span class="line">327</span><br><span class="line">328</span><br><span class="line">329</span><br><span class="line">330</span><br><span class="line">331</span><br><span class="line">332</span><br><span class="line">333</span><br><span class="line">334</span><br><span class="line">335</span><br><span class="line">336</span><br><span class="line">337</span><br><span class="line">338</span><br><span class="line">339</span><br><span class="line">340</span><br><span class="line">341</span><br><span class="line">342</span><br><span class="line">343</span><br><span class="line">344</span><br><span class="line">345</span><br><span class="line">346</span><br><span class="line">347</span><br><span class="line">348</span><br><span class="line">349</span><br><span class="line">350</span><br><span class="line">351</span><br><span class="line">352</span><br><span class="line">353</span><br><span class="line">354</span><br><span class="line">355</span><br><span class="line">356</span><br><span class="line">357</span><br><span class="line">358</span><br><span class="line">359</span><br><span class="line">360</span><br><span class="line">361</span><br><span class="line">362</span><br><span class="line">363</span><br><span class="line">364</span><br><span class="line">365</span><br><span class="line">366</span><br><span class="line">367</span><br><span class="line">368</span><br><span class="line">369</span><br><span class="line">370</span><br><span class="line">371</span><br><span class="line">372</span><br><span class="line">373</span><br><span class="line">374</span><br><span class="line">375</span><br><span class="line">376</span><br><span class="line">377</span><br><span class="line">378</span><br><span class="line">379</span><br><span class="line">380</span><br><span class="line">381</span><br><span class="line">382</span><br><span class="line">383</span><br><span class="line">384</span><br><span class="line">385</span><br><span class="line">386</span><br><span class="line">387</span><br><span class="line">388</span><br><span class="line">389</span><br><span class="line">390</span><br><span class="line">391</span><br><span class="line">392</span><br><span class="line">393</span><br><span class="line">394</span><br><span class="line">395</span><br><span class="line">396</span><br><span class="line">397</span><br><span class="line">398</span><br><span class="line">399</span><br><span class="line">400</span><br><span class="line">401</span><br><span class="line">402</span><br><span class="line">403</span><br><span class="line">404</span><br><span class="line">405</span><br><span class="line">406</span><br><span class="line">407</span><br><span class="line">408</span><br><span class="line">409</span><br><span class="line">410</span><br><span class="line">411</span><br><span class="line">412</span><br><span class="line">413</span><br><span class="line">414</span><br><span class="line">415</span><br><span class="line">416</span><br><span class="line">417</span><br><span class="line">418</span><br><span class="line">419</span><br><span class="line">420</span><br><span class="line">421</span><br><span class="line">422</span><br><span class="line">423</span><br><span class="line">424</span><br><span class="line">425</span><br><span class="line">426</span><br><span class="line">427</span><br><span class="line">428</span><br><span class="line">429</span><br><span class="line">430</span><br><span class="line">431</span><br><span class="line">432</span><br><span class="line">433</span><br><span class="line">434</span><br><span class="line">435</span><br><span class="line">436</span><br><span class="line">437</span><br><span class="line">438</span><br><span class="line">439</span><br><span class="line">440</span><br><span class="line">441</span><br><span class="line">442</span><br><span class="line">443</span><br><span class="line">444</span><br><span class="line">445</span><br><span class="line">446</span><br><span class="line">447</span><br><span class="line">448</span><br><span class="line">449</span><br><span class="line">450</span><br><span class="line">451</span><br><span class="line">452</span><br><span class="line">453</span><br><span class="line">454</span><br><span class="line">455</span><br><span class="line">456</span><br><span class="line">457</span><br><span class="line">458</span><br><span class="line">459</span><br><span class="line">460</span><br><span class="line">461</span><br><span class="line">462</span><br><span class="line">463</span><br><span class="line">464</span><br><span class="line">465</span><br><span class="line">466</span><br><span class="line">467</span><br><span class="line">468</span><br><span class="line">469</span><br><span class="line">470</span><br><span class="line">471</span><br><span class="line">472</span><br><span class="line">473</span><br><span class="line">474</span><br><span class="line">475</span><br><span class="line">476</span><br><span class="line">477</span><br><span class="line">478</span><br><span class="line">479</span><br><span class="line">480</span><br><span class="line">481</span><br><span class="line">482</span><br><span class="line">483</span><br><span class="line">484</span><br><span class="line">485</span><br><span class="line">486</span><br><span class="line">487</span><br><span class="line">488</span><br><span class="line">489</span><br><span class="line">490</span><br><span class="line">491</span><br><span class="line">492</span><br><span class="line">493</span><br><span class="line">494</span><br><span class="line">495</span><br><span class="line">496</span><br><span class="line">497</span><br><span class="line">498</span><br><span class="line">499</span><br><span class="line">500</span><br><span class="line">501</span><br><span class="line">502</span><br><span class="line">503</span><br><span class="line">504</span><br><span class="line">505</span><br><span class="line">506</span><br><span class="line">507</span><br><span class="line">508</span><br><span class="line">509</span><br><span class="line">510</span><br><span class="line">511</span><br><span class="line">512</span><br><span class="line">513</span><br><span class="line">514</span><br><span class="line">515</span><br><span class="line">516</span><br><span class="line">517</span><br><span class="line">518</span><br><span class="line">519</span><br><span class="line">520</span><br><span class="line">521</span><br><span class="line">522</span><br><span class="line">523</span><br><span class="line">524</span><br><span class="line">525</span><br><span class="line">526</span><br><span class="line">527</span><br><span class="line">528</span><br><span class="line">529</span><br><span class="line">530</span><br><span class="line">531</span><br><span class="line">532</span><br><span class="line">533</span><br><span class="line">534</span><br><span class="line">535</span><br><span class="line">536</span><br><span class="line">537</span><br><span class="line">538</span><br><span class="line">539</span><br><span class="line">540</span><br><span class="line">541</span><br><span class="line">542</span><br><span class="line">543</span><br><span class="line">544</span><br><span class="line">545</span><br><span class="line">546</span><br><span class="line">547</span><br><span class="line">548</span><br><span class="line">549</span><br><span class="line">550</span><br><span class="line">551</span><br><span class="line">552</span><br><span class="line">553</span><br><span class="line">554</span><br><span class="line">555</span><br><span class="line">556</span><br><span class="line">557</span><br><span class="line">558</span><br><span class="line">559</span><br><span class="line">560</span><br><span class="line">561</span><br><span class="line">562</span><br><span class="line">563</span><br><span class="line">564</span><br><span class="line">565</span><br><span class="line">566</span><br><span class="line">567</span><br><span class="line">568</span><br><span class="line">569</span><br><span class="line">570</span><br><span class="line">571</span><br><span class="line">572</span><br><span class="line">573</span><br><span class="line">574</span><br><span class="line">575</span><br><span class="line">576</span><br><span class="line">577</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">数据集预览 HTML 生成器</span></span><br><span class="line"><span class="string">扫描图片-文本对，生成静态 HTML 预览页面</span></span><br><span class="line"><span class="string">&quot;&quot;&quot;</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">import</span> os</span><br><span class="line"><span class="keyword">import</span> argparse</span><br><span class="line"><span class="keyword">import</span> html</span><br><span class="line"><span class="keyword">from</span> pathlib <span class="keyword">import</span> Path</span><br><span class="line"><span class="keyword">from</span> typing <span class="keyword">import</span> <span class="type">List</span>, <span class="type">Tuple</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== 配置参数 ====================</span></span><br><span class="line"></span><br><span class="line">DEFAULT_IMAGE_WIDTH = <span class="number">40</span>  <span class="comment"># 图片占比（%）</span></span><br><span class="line">SUPPORTED_FORMATS = &#123;<span class="string">&quot;.jpg&quot;</span>, <span class="string">&quot;.jpeg&quot;</span>, <span class="string">&quot;.png&quot;</span>, <span class="string">&quot;.webp&quot;</span>&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== 核心函数 ====================</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">scan_image_pairs</span>(<span class="params">directory: <span class="built_in">str</span></span>) -&gt; <span class="type">List</span>[<span class="type">Tuple</span>[<span class="built_in">str</span>, <span class="built_in">str</span>, <span class="built_in">str</span>]]:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    扫描目录，找到所有图-文对</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    返回:</span></span><br><span class="line"><span class="string">        [(image_path, txt_path, filename), ...]</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line">    pairs = []</span><br><span class="line">    directory_path = Path(directory)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> <span class="keyword">not</span> directory_path.exists():</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;❌ 目录不存在: <span class="subst">&#123;directory&#125;</span>&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span> pairs</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 收集所有图片文件</span></span><br><span class="line">    <span class="keyword">for</span> file_path <span class="keyword">in</span> directory_path.iterdir():</span><br><span class="line">        <span class="keyword">if</span> file_path.is_file() <span class="keyword">and</span> file_path.suffix.lower() <span class="keyword">in</span> SUPPORTED_FORMATS:</span><br><span class="line">            <span class="comment"># 查找对应的 txt 文件</span></span><br><span class="line">            txt_path = file_path.with_suffix(<span class="string">&quot;.txt&quot;</span>)</span><br><span class="line"></span><br><span class="line">            <span class="keyword">if</span> txt_path.exists():</span><br><span class="line">                pairs.append(</span><br><span class="line">                    (</span><br><span class="line">                        file_path.name,  <span class="comment"># 相对路径（只需文件名）</span></span><br><span class="line">                        <span class="built_in">str</span>(txt_path),  <span class="comment"># txt 文件的完整路径</span></span><br><span class="line">                        file_path.name,  <span class="comment"># 用于显示的文件名</span></span><br><span class="line">                    )</span><br><span class="line">                )</span><br><span class="line">            <span class="keyword">else</span>:</span><br><span class="line">                <span class="built_in">print</span>(<span class="string">f&quot;⚠ 未找到对应的标签文件: <span class="subst">&#123;file_path.name&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="built_in">sorted</span>(pairs, key=<span class="keyword">lambda</span> x: x[<span class="number">2</span>])  <span class="comment"># 按文件名排序</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">read_caption</span>(<span class="params">txt_path: <span class="built_in">str</span></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;读取标签文件内容&quot;&quot;&quot;</span></span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        <span class="keyword">with</span> <span class="built_in">open</span>(txt_path, <span class="string">&quot;r&quot;</span>, encoding=<span class="string">&quot;utf-8&quot;</span>) <span class="keyword">as</span> f:</span><br><span class="line">            <span class="keyword">return</span> f.read().strip()</span><br><span class="line">    <span class="keyword">except</span> Exception <span class="keyword">as</span> e:</span><br><span class="line">        <span class="keyword">return</span> <span class="string">f&quot;[读取失败: <span class="subst">&#123;<span class="built_in">str</span>(e)&#125;</span>]&quot;</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">generate_html</span>(<span class="params"></span></span><br><span class="line"><span class="params">    image_pairs: <span class="type">List</span>[<span class="type">Tuple</span>[<span class="built_in">str</span>, <span class="built_in">str</span>, <span class="built_in">str</span>]],</span></span><br><span class="line"><span class="params">    title: <span class="built_in">str</span> = <span class="string">&quot;数据集预览&quot;</span>,</span></span><br><span class="line"><span class="params">    image_width: <span class="built_in">int</span> = DEFAULT_IMAGE_WIDTH,</span></span><br><span class="line"><span class="params"></span>) -&gt; <span class="built_in">str</span>:</span><br><span class="line">    <span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">    生成完整的 HTML 内容</span></span><br><span class="line"><span class="string"></span></span><br><span class="line"><span class="string">    参数:</span></span><br><span class="line"><span class="string">        image_pairs: [(image_filename, txt_path, display_name), ...]</span></span><br><span class="line"><span class="string">        title: 页面标题</span></span><br><span class="line"><span class="string">        image_width: 图片区域占比（%）</span></span><br><span class="line"><span class="string">    &quot;&quot;&quot;</span></span><br><span class="line"></span><br><span class="line">    <span class="comment"># 读取所有标签</span></span><br><span class="line">    cards_html = []</span><br><span class="line">    <span class="keyword">for</span> idx, (image_path, txt_path, filename) <span class="keyword">in</span> <span class="built_in">enumerate</span>(image_pairs):</span><br><span class="line">        caption = read_caption(txt_path)</span><br><span class="line"></span><br><span class="line">        <span class="comment"># HTML 转义，避免特殊字符问题</span></span><br><span class="line">        caption_escaped = html.escape(caption)</span><br><span class="line">        filename_escaped = html.escape(filename)</span><br><span class="line"></span><br><span class="line">        card_html = <span class="string">f&#x27;&#x27;&#x27;</span></span><br><span class="line"><span class="string">        &lt;div class=&quot;card&quot; data-index=&quot;<span class="subst">&#123;idx&#125;</span>&quot;&gt;</span></span><br><span class="line"><span class="string">            &lt;div class=&quot;image-section&quot;&gt;</span></span><br><span class="line"><span class="string">                &lt;img data-src=&quot;./<span class="subst">&#123;image_path&#125;</span>&quot; class=&quot;lazy&quot; alt=&quot;<span class="subst">&#123;filename_escaped&#125;</span>&quot; loading=&quot;lazy&quot;&gt;</span></span><br><span class="line"><span class="string">            &lt;/div&gt;</span></span><br><span class="line"><span class="string">            &lt;div class=&quot;caption-section&quot;&gt;</span></span><br><span class="line"><span class="string">                &lt;div class=&quot;filename&quot;&gt;<span class="subst">&#123;filename_escaped&#125;</span>&lt;/div&gt;</span></span><br><span class="line"><span class="string">                &lt;div class=&quot;divider&quot;&gt;&lt;/div&gt;</span></span><br><span class="line"><span class="string">                &lt;div class=&quot;caption-text&quot;&gt;<span class="subst">&#123;caption_escaped&#125;</span>&lt;/div&gt;</span></span><br><span class="line"><span class="string">            &lt;/div&gt;</span></span><br><span class="line"><span class="string">        &lt;/div&gt;</span></span><br><span class="line"><span class="string">        &#x27;&#x27;&#x27;</span></span><br><span class="line">        cards_html.append(card_html)</span><br><span class="line"></span><br><span class="line">    text_width = <span class="number">100</span> - image_width</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 完整的 HTML 模板</span></span><br><span class="line">    html_content = <span class="string">f&quot;&quot;&quot;&lt;!DOCTYPE html&gt;</span></span><br><span class="line"><span class="string">&lt;html lang=&quot;zh-CN&quot;&gt;</span></span><br><span class="line"><span class="string">&lt;head&gt;</span></span><br><span class="line"><span class="string">    &lt;meta charset=&quot;UTF-8&quot;&gt;</span></span><br><span class="line"><span class="string">    &lt;meta name=&quot;viewport&quot; content=&quot;width=device-width, initial-scale=1.0&quot;&gt;</span></span><br><span class="line"><span class="string">    &lt;title&gt;<span class="subst">&#123;html.escape(title)&#125;</span>&lt;/title&gt;</span></span><br><span class="line"><span class="string">    &lt;style&gt;</span></span><br><span class="line"><span class="string">        * &#123;&#123;</span></span><br><span class="line"><span class="string">            margin: 0;</span></span><br><span class="line"><span class="string">            padding: 0;</span></span><br><span class="line"><span class="string">            box-sizing: border-box;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        body &#123;&#123;</span></span><br><span class="line"><span class="string">            font-family: -apple-system, BlinkMacSystemFont, &quot;Segoe UI&quot;, Roboto, &quot;Helvetica Neue&quot;, Arial, sans-serif;</span></span><br><span class="line"><span class="string">            background-color: #f5f5f5;</span></span><br><span class="line"><span class="string">            color: #333;</span></span><br><span class="line"><span class="string">            line-height: 1.6;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        header &#123;&#123;</span></span><br><span class="line"><span class="string">            background: #fff;</span></span><br><span class="line"><span class="string">            padding: 20px 40px;</span></span><br><span class="line"><span class="string">            box-shadow: 0 2px 4px rgba(0,0,0,0.1);</span></span><br><span class="line"><span class="string">            position: sticky;</span></span><br><span class="line"><span class="string">            top: 0;</span></span><br><span class="line"><span class="string">            z-index: 100;</span></span><br><span class="line"><span class="string">            display: flex;</span></span><br><span class="line"><span class="string">            align-items: center;</span></span><br><span class="line"><span class="string">            gap: 20px;</span></span><br><span class="line"><span class="string">            flex-wrap: wrap;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        h1 &#123;&#123;</span></span><br><span class="line"><span class="string">            color: #1a73e8;</span></span><br><span class="line"><span class="string">            font-size: 24px;</span></span><br><span class="line"><span class="string">            font-weight: 500;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #searchBox &#123;&#123;</span></span><br><span class="line"><span class="string">            flex: 1;</span></span><br><span class="line"><span class="string">            min-width: 200px;</span></span><br><span class="line"><span class="string">            padding: 10px 15px;</span></span><br><span class="line"><span class="string">            border: 2px solid #e0e0e0;</span></span><br><span class="line"><span class="string">            border-radius: 6px;</span></span><br><span class="line"><span class="string">            font-size: 14px;</span></span><br><span class="line"><span class="string">            transition: border-color 0.2s;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #searchBox:focus &#123;&#123;</span></span><br><span class="line"><span class="string">            outline: none;</span></span><br><span class="line"><span class="string">            border-color: #1a73e8;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #stats &#123;&#123;</span></span><br><span class="line"><span class="string">            color: #666;</span></span><br><span class="line"><span class="string">            font-size: 14px;</span></span><br><span class="line"><span class="string">            white-space: nowrap;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #container &#123;&#123;</span></span><br><span class="line"><span class="string">            max-width: 1400px;</span></span><br><span class="line"><span class="string">            margin: 30px auto;</span></span><br><span class="line"><span class="string">            padding: 0 20px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .card &#123;&#123;</span></span><br><span class="line"><span class="string">            background: #fff;</span></span><br><span class="line"><span class="string">            border-radius: 8px;</span></span><br><span class="line"><span class="string">            box-shadow: 0 2px 4px rgba(0,0,0,0.1);</span></span><br><span class="line"><span class="string">            margin-bottom: 20px;</span></span><br><span class="line"><span class="string">            display: flex;</span></span><br><span class="line"><span class="string">            overflow: hidden;</span></span><br><span class="line"><span class="string">            transition: box-shadow 0.3s, transform 0.2s;</span></span><br><span class="line"><span class="string">            min-height: 200px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .card:hover &#123;&#123;</span></span><br><span class="line"><span class="string">            box-shadow: 0 4px 12px rgba(0,0,0,0.15);</span></span><br><span class="line"><span class="string">            transform: translateY(-2px);</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .card.hidden &#123;&#123;</span></span><br><span class="line"><span class="string">            display: none;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section &#123;&#123;</span></span><br><span class="line"><span class="string">            width: <span class="subst">&#123;image_width&#125;</span>%;</span></span><br><span class="line"><span class="string">            min-width: 200px;</span></span><br><span class="line"><span class="string">            display: flex;</span></span><br><span class="line"><span class="string">            align-items: center;</span></span><br><span class="line"><span class="string">            justify-content: center;</span></span><br><span class="line"><span class="string">            background: #fafafa;</span></span><br><span class="line"><span class="string">            padding: 20px;</span></span><br><span class="line"><span class="string">            cursor: pointer;</span></span><br><span class="line"><span class="string">            position: relative;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section img &#123;&#123;</span></span><br><span class="line"><span class="string">            max-width: 100%;</span></span><br><span class="line"><span class="string">            max-height: 500px;</span></span><br><span class="line"><span class="string">            object-fit: contain;</span></span><br><span class="line"><span class="string">            border-radius: 4px;</span></span><br><span class="line"><span class="string">            transition: opacity 0.3s;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section img.lazy &#123;&#123;</span></span><br><span class="line"><span class="string">            opacity: 0;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section img.loaded &#123;&#123;</span></span><br><span class="line"><span class="string">            opacity: 1;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section:hover::after &#123;&#123;</span></span><br><span class="line"><span class="string">            content: &quot;🔍 点击放大&quot;;</span></span><br><span class="line"><span class="string">            position: absolute;</span></span><br><span class="line"><span class="string">            bottom: 10px;</span></span><br><span class="line"><span class="string">            right: 10px;</span></span><br><span class="line"><span class="string">            background: rgba(0,0,0,0.7);</span></span><br><span class="line"><span class="string">            color: #fff;</span></span><br><span class="line"><span class="string">            padding: 5px 10px;</span></span><br><span class="line"><span class="string">            border-radius: 4px;</span></span><br><span class="line"><span class="string">            font-size: 12px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .caption-section &#123;&#123;</span></span><br><span class="line"><span class="string">            width: <span class="subst">&#123;text_width&#125;</span>%;</span></span><br><span class="line"><span class="string">            padding: 20px 30px;</span></span><br><span class="line"><span class="string">            display: flex;</span></span><br><span class="line"><span class="string">            flex-direction: column;</span></span><br><span class="line"><span class="string">            gap: 12px;</span></span><br><span class="line"><span class="string">            overflow-y: auto;</span></span><br><span class="line"><span class="string">            max-height: 600px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .filename &#123;&#123;</span></span><br><span class="line"><span class="string">            font-weight: 600;</span></span><br><span class="line"><span class="string">            color: #1a73e8;</span></span><br><span class="line"><span class="string">            font-size: 14px;</span></span><br><span class="line"><span class="string">            word-break: break-all;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .divider &#123;&#123;</span></span><br><span class="line"><span class="string">            height: 1px;</span></span><br><span class="line"><span class="string">            background: #e0e0e0;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .caption-text &#123;&#123;</span></span><br><span class="line"><span class="string">            color: #333;</span></span><br><span class="line"><span class="string">            font-size: 14px;</span></span><br><span class="line"><span class="string">            white-space: pre-wrap;</span></span><br><span class="line"><span class="string">            word-wrap: break-word;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        /* 灯箱样式 */</span></span><br><span class="line"><span class="string">        #lightbox &#123;&#123;</span></span><br><span class="line"><span class="string">            display: none;</span></span><br><span class="line"><span class="string">            position: fixed;</span></span><br><span class="line"><span class="string">            top: 0;</span></span><br><span class="line"><span class="string">            left: 0;</span></span><br><span class="line"><span class="string">            width: 100%;</span></span><br><span class="line"><span class="string">            height: 100%;</span></span><br><span class="line"><span class="string">            background: rgba(0, 0, 0, 0.9);</span></span><br><span class="line"><span class="string">            z-index: 1000;</span></span><br><span class="line"><span class="string">            justify-content: center;</span></span><br><span class="line"><span class="string">            align-items: center;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox.active &#123;&#123;</span></span><br><span class="line"><span class="string">            display: flex;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox img &#123;&#123;</span></span><br><span class="line"><span class="string">            max-width: 90%;</span></span><br><span class="line"><span class="string">            max-height: 90%;</span></span><br><span class="line"><span class="string">            object-fit: contain;</span></span><br><span class="line"><span class="string">            box-shadow: 0 0 50px rgba(0,0,0,0.5);</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .close &#123;&#123;</span></span><br><span class="line"><span class="string">            position: absolute;</span></span><br><span class="line"><span class="string">            top: 20px;</span></span><br><span class="line"><span class="string">            right: 40px;</span></span><br><span class="line"><span class="string">            color: #fff;</span></span><br><span class="line"><span class="string">            font-size: 40px;</span></span><br><span class="line"><span class="string">            font-weight: 300;</span></span><br><span class="line"><span class="string">            cursor: pointer;</span></span><br><span class="line"><span class="string">            transition: color 0.2s;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .close:hover &#123;&#123;</span></span><br><span class="line"><span class="string">            color: #1a73e8;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .nav &#123;&#123;</span></span><br><span class="line"><span class="string">            position: absolute;</span></span><br><span class="line"><span class="string">            top: 50%;</span></span><br><span class="line"><span class="string">            transform: translateY(-50%);</span></span><br><span class="line"><span class="string">            background: rgba(255,255,255,0.1);</span></span><br><span class="line"><span class="string">            color: #fff;</span></span><br><span class="line"><span class="string">            font-size: 40px;</span></span><br><span class="line"><span class="string">            padding: 20px;</span></span><br><span class="line"><span class="string">            cursor: pointer;</span></span><br><span class="line"><span class="string">            border-radius: 4px;</span></span><br><span class="line"><span class="string">            user-select: none;</span></span><br><span class="line"><span class="string">            transition: background 0.2s;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .nav:hover &#123;&#123;</span></span><br><span class="line"><span class="string">            background: rgba(255,255,255,0.2);</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .nav.prev &#123;&#123;</span></span><br><span class="line"><span class="string">            left: 20px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        #lightbox .nav.next &#123;&#123;</span></span><br><span class="line"><span class="string">            right: 20px;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        /* 响应式设计 */</span></span><br><span class="line"><span class="string">        @media (max-width: 768px) &#123;&#123;</span></span><br><span class="line"><span class="string">            header &#123;&#123;</span></span><br><span class="line"><span class="string">                padding: 15px 20px;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            h1 &#123;&#123;</span></span><br><span class="line"><span class="string">                font-size: 20px;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            .card &#123;&#123;</span></span><br><span class="line"><span class="string">                flex-direction: column;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            .image-section,</span></span><br><span class="line"><span class="string">            .caption-section &#123;&#123;</span></span><br><span class="line"><span class="string">                width: 100% !important;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            .image-section &#123;&#123;</span></span><br><span class="line"><span class="string">                min-height: 200px;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            #lightbox .nav &#123;&#123;</span></span><br><span class="line"><span class="string">                font-size: 30px;</span></span><br><span class="line"><span class="string">                padding: 10px;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        /* 加载动画 */</span></span><br><span class="line"><span class="string">        @keyframes shimmer &#123;&#123;</span></span><br><span class="line"><span class="string">            0% &#123;&#123; background-position: -468px 0; &#125;&#125;</span></span><br><span class="line"><span class="string">            100% &#123;&#123; background-position: 468px 0; &#125;&#125;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        .image-section.loading &#123;&#123;</span></span><br><span class="line"><span class="string">            background: linear-gradient(90deg, #f0f0f0 0px, #f8f8f8 40px, #f0f0f0 80px);</span></span><br><span class="line"><span class="string">            background-size: 800px;</span></span><br><span class="line"><span class="string">            animation: shimmer 2s infinite;</span></span><br><span class="line"><span class="string">        &#125;&#125;</span></span><br><span class="line"><span class="string">    &lt;/style&gt;</span></span><br><span class="line"><span class="string">&lt;/head&gt;</span></span><br><span class="line"><span class="string">&lt;body&gt;</span></span><br><span class="line"><span class="string">    &lt;header&gt;</span></span><br><span class="line"><span class="string">        &lt;h1&gt;📊 <span class="subst">&#123;html.escape(title)&#125;</span>&lt;/h1&gt;</span></span><br><span class="line"><span class="string">        &lt;input type=&quot;text&quot; id=&quot;searchBox&quot; placeholder=&quot;🔍 输入关键词过滤...&quot;&gt;</span></span><br><span class="line"><span class="string">        &lt;span id=&quot;stats&quot;&gt;总计: &lt;strong&gt;<span class="subst">&#123;<span class="built_in">len</span>(image_pairs)&#125;</span>&lt;/strong&gt; 张 | 显示: &lt;strong id=&quot;visibleCount&quot;&gt;<span class="subst">&#123;<span class="built_in">len</span>(image_pairs)&#125;</span>&lt;/strong&gt; 张&lt;/span&gt;</span></span><br><span class="line"><span class="string">    &lt;/header&gt;</span></span><br><span class="line"><span class="string">    </span></span><br><span class="line"><span class="string">    &lt;div id=&quot;container&quot;&gt;</span></span><br><span class="line"><span class="string">        <span class="subst">&#123;<span class="string">&quot;&quot;</span>.join(cards_html)&#125;</span></span></span><br><span class="line"><span class="string">    &lt;/div&gt;</span></span><br><span class="line"><span class="string">    </span></span><br><span class="line"><span class="string">    &lt;div id=&quot;lightbox&quot;&gt;</span></span><br><span class="line"><span class="string">        &lt;span class=&quot;close&quot;&gt;&amp;times;&lt;/span&gt;</span></span><br><span class="line"><span class="string">        &lt;span class=&quot;nav prev&quot;&gt;‹&lt;/span&gt;</span></span><br><span class="line"><span class="string">        &lt;span class=&quot;nav next&quot;&gt;›&lt;/span&gt;</span></span><br><span class="line"><span class="string">        &lt;img id=&quot;lightboxImg&quot; src=&quot;&quot; alt=&quot;&quot;&gt;</span></span><br><span class="line"><span class="string">    &lt;/div&gt;</span></span><br><span class="line"><span class="string">    </span></span><br><span class="line"><span class="string">    &lt;script&gt;</span></span><br><span class="line"><span class="string">        // ==================== 懒加载 ====================</span></span><br><span class="line"><span class="string">        const imageObserver = new IntersectionObserver((entries, observer) =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            entries.forEach(entry =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">                if (entry.isIntersecting) &#123;&#123;</span></span><br><span class="line"><span class="string">                    const img = entry.target;</span></span><br><span class="line"><span class="string">                    const imageSection = img.closest(&#x27;.image-section&#x27;);</span></span><br><span class="line"><span class="string">                    imageSection.classList.add(&#x27;loading&#x27;);</span></span><br><span class="line"><span class="string">                    </span></span><br><span class="line"><span class="string">                    img.src = img.dataset.src;</span></span><br><span class="line"><span class="string">                    img.onload = () =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">                        img.classList.add(&#x27;loaded&#x27;);</span></span><br><span class="line"><span class="string">                        img.classList.remove(&#x27;lazy&#x27;);</span></span><br><span class="line"><span class="string">                        imageSection.classList.remove(&#x27;loading&#x27;);</span></span><br><span class="line"><span class="string">                    &#125;&#125;;</span></span><br><span class="line"><span class="string">                    observer.unobserve(img);</span></span><br><span class="line"><span class="string">                &#125;&#125;</span></span><br><span class="line"><span class="string">            &#125;&#125;);</span></span><br><span class="line"><span class="string">        &#125;&#125;, &#123;&#123;</span></span><br><span class="line"><span class="string">            rootMargin: &#x27;50px&#x27;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        document.querySelectorAll(&#x27;img.lazy&#x27;).forEach(img =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            imageObserver.observe(img);</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // ==================== 搜索过滤 ====================</span></span><br><span class="line"><span class="string">        const searchBox = document.getElementById(&#x27;searchBox&#x27;);</span></span><br><span class="line"><span class="string">        const cards = document.querySelectorAll(&#x27;.card&#x27;);</span></span><br><span class="line"><span class="string">        const visibleCountSpan = document.getElementById(&#x27;visibleCount&#x27;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        searchBox.addEventListener(&#x27;input&#x27;, (e) =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            const keyword = e.target.value.toLowerCase().trim();</span></span><br><span class="line"><span class="string">            let visibleCount = 0;</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            cards.forEach(card =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">                const filename = card.querySelector(&#x27;.filename&#x27;).textContent.toLowerCase();</span></span><br><span class="line"><span class="string">                const caption = card.querySelector(&#x27;.caption-text&#x27;).textContent.toLowerCase();</span></span><br><span class="line"><span class="string">                </span></span><br><span class="line"><span class="string">                if (filename.includes(keyword) || caption.includes(keyword)) &#123;&#123;</span></span><br><span class="line"><span class="string">                    card.classList.remove(&#x27;hidden&#x27;);</span></span><br><span class="line"><span class="string">                    visibleCount++;</span></span><br><span class="line"><span class="string">                &#125;&#125; else &#123;&#123;</span></span><br><span class="line"><span class="string">                    card.classList.add(&#x27;hidden&#x27;);</span></span><br><span class="line"><span class="string">                &#125;&#125;</span></span><br><span class="line"><span class="string">            &#125;&#125;);</span></span><br><span class="line"><span class="string">            </span></span><br><span class="line"><span class="string">            visibleCountSpan.textContent = visibleCount;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // ==================== 灯箱效果 ====================</span></span><br><span class="line"><span class="string">        const lightbox = document.getElementById(&#x27;lightbox&#x27;);</span></span><br><span class="line"><span class="string">        const lightboxImg = document.getElementById(&#x27;lightboxImg&#x27;);</span></span><br><span class="line"><span class="string">        const closeBtn = lightbox.querySelector(&#x27;.close&#x27;);</span></span><br><span class="line"><span class="string">        const prevBtn = lightbox.querySelector(&#x27;.prev&#x27;);</span></span><br><span class="line"><span class="string">        const nextBtn = lightbox.querySelector(&#x27;.next&#x27;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        let currentIndex = 0;</span></span><br><span class="line"><span class="string">        const allImages = Array.from(document.querySelectorAll(&#x27;.image-section img&#x27;));</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // 点击图片打开灯箱</span></span><br><span class="line"><span class="string">        document.querySelectorAll(&#x27;.image-section&#x27;).forEach((section, index) =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            section.addEventListener(&#x27;click&#x27;, () =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">                const img = section.querySelector(&#x27;img&#x27;);</span></span><br><span class="line"><span class="string">                if (img.src) &#123;&#123;</span></span><br><span class="line"><span class="string">                    currentIndex = parseInt(section.closest(&#x27;.card&#x27;).dataset.index);</span></span><br><span class="line"><span class="string">                    lightboxImg.src = img.src;</span></span><br><span class="line"><span class="string">                    lightbox.classList.add(&#x27;active&#x27;);</span></span><br><span class="line"><span class="string">                &#125;&#125;</span></span><br><span class="line"><span class="string">            &#125;&#125;);</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // 关闭灯箱</span></span><br><span class="line"><span class="string">        closeBtn.addEventListener(&#x27;click&#x27;, () =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            lightbox.classList.remove(&#x27;active&#x27;);</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        lightbox.addEventListener(&#x27;click&#x27;, (e) =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            if (e.target === lightbox) &#123;&#123;</span></span><br><span class="line"><span class="string">                lightbox.classList.remove(&#x27;active&#x27;);</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // 上一张/下一张</span></span><br><span class="line"><span class="string">        prevBtn.addEventListener(&#x27;click&#x27;, () =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            currentIndex = (currentIndex - 1 + allImages.length) % allImages.length;</span></span><br><span class="line"><span class="string">            lightboxImg.src = allImages[currentIndex].src || allImages[currentIndex].dataset.src;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        nextBtn.addEventListener(&#x27;click&#x27;, () =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            currentIndex = (currentIndex + 1) % allImages.length;</span></span><br><span class="line"><span class="string">            lightboxImg.src = allImages[currentIndex].src || allImages[currentIndex].dataset.src;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">        </span></span><br><span class="line"><span class="string">        // 键盘快捷键</span></span><br><span class="line"><span class="string">        document.addEventListener(&#x27;keydown&#x27;, (e) =&gt; &#123;&#123;</span></span><br><span class="line"><span class="string">            if (lightbox.classList.contains(&#x27;active&#x27;)) &#123;&#123;</span></span><br><span class="line"><span class="string">                if (e.key === &#x27;Escape&#x27;) &#123;&#123;</span></span><br><span class="line"><span class="string">                    lightbox.classList.remove(&#x27;active&#x27;);</span></span><br><span class="line"><span class="string">                &#125;&#125; else if (e.key === &#x27;ArrowLeft&#x27;) &#123;&#123;</span></span><br><span class="line"><span class="string">                    prevBtn.click();</span></span><br><span class="line"><span class="string">                &#125;&#125; else if (e.key === &#x27;ArrowRight&#x27;) &#123;&#123;</span></span><br><span class="line"><span class="string">                    nextBtn.click();</span></span><br><span class="line"><span class="string">                &#125;&#125;</span></span><br><span class="line"><span class="string">            &#125;&#125;</span></span><br><span class="line"><span class="string">        &#125;&#125;);</span></span><br><span class="line"><span class="string">    &lt;/script&gt;</span></span><br><span class="line"><span class="string">&lt;/body&gt;</span></span><br><span class="line"><span class="string">&lt;/html&gt;&quot;&quot;&quot;</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> html_content</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">save_html</span>(<span class="params">html_content: <span class="built_in">str</span>, output_path: <span class="built_in">str</span></span>):</span><br><span class="line">    <span class="string">&quot;&quot;&quot;保存 HTML 文件&quot;&quot;&quot;</span></span><br><span class="line">    <span class="keyword">try</span>:</span><br><span class="line">        <span class="keyword">with</span> <span class="built_in">open</span>(output_path, <span class="string">&quot;w&quot;</span>, encoding=<span class="string">&quot;utf-8&quot;</span>) <span class="keyword">as</span> f:</span><br><span class="line">            f.write(html_content)</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;✅ 成功生成预览文件: <span class="subst">&#123;output_path&#125;</span>&quot;</span>)</span><br><span class="line">    <span class="keyword">except</span> Exception <span class="keyword">as</span> e:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">f&quot;❌ 保存失败: <span class="subst">&#123;<span class="built_in">str</span>(e)&#125;</span>&quot;</span>)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="comment"># ==================== CLI 入口 ====================</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">def</span> <span class="title function_">main</span>():</span><br><span class="line">    parser = argparse.ArgumentParser(</span><br><span class="line">        description=<span class="string">&quot;数据集预览 HTML 生成器&quot;</span>,</span><br><span class="line">        formatter_class=argparse.RawDescriptionHelpFormatter,</span><br><span class="line">        epilog=<span class="string">&quot;&quot;&quot;</span></span><br><span class="line"><span class="string">示例用法:</span></span><br><span class="line"><span class="string">  # 基本用法（在输入目录生成 preview.html）</span></span><br><span class="line"><span class="string">  python generate_preview.py --input &quot;./dataset&quot;</span></span><br><span class="line"><span class="string">  </span></span><br><span class="line"><span class="string">  # 自定义输出路径</span></span><br><span class="line"><span class="string">  python generate_preview.py --input &quot;./dataset&quot; --output &quot;./my_preview.html&quot;</span></span><br><span class="line"><span class="string">  </span></span><br><span class="line"><span class="string">  # 自定义标题和布局</span></span><br><span class="line"><span class="string">  python generate_preview.py --input &quot;./images&quot; --title &quot;我的 LoRA 数据集&quot; --image-width 35</span></span><br><span class="line"><span class="string">        &quot;&quot;&quot;</span>,</span><br><span class="line">    )</span><br><span class="line"></span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--input&quot;</span>, <span class="built_in">type</span>=<span class="built_in">str</span>, required=<span class="literal">True</span>, <span class="built_in">help</span>=<span class="string">&quot;输入目录（包含图片和 txt 文件）&quot;</span></span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--output&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">str</span>,</span><br><span class="line">        default=<span class="literal">None</span>,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">&quot;输出 HTML 文件路径（默认: 在输入目录下生成 preview.html）&quot;</span>,</span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--title&quot;</span>, <span class="built_in">type</span>=<span class="built_in">str</span>, default=<span class="string">&quot;数据集预览&quot;</span>, <span class="built_in">help</span>=<span class="string">&quot;页面标题（默认: 数据集预览）&quot;</span></span><br><span class="line">    )</span><br><span class="line">    parser.add_argument(</span><br><span class="line">        <span class="string">&quot;--image-width&quot;</span>,</span><br><span class="line">        <span class="built_in">type</span>=<span class="built_in">int</span>,</span><br><span class="line">        default=DEFAULT_IMAGE_WIDTH,</span><br><span class="line">        <span class="built_in">help</span>=<span class="string">f&quot;图片区域占比百分比（默认: <span class="subst">&#123;DEFAULT_IMAGE_WIDTH&#125;</span>）&quot;</span>,</span><br><span class="line">    )</span><br><span class="line"></span><br><span class="line">    args = parser.parse_args()</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 验证参数</span></span><br><span class="line">    <span class="keyword">if</span> args.image_width &lt; <span class="number">20</span> <span class="keyword">or</span> args.image_width &gt; <span class="number">80</span>:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;⚠ 图片宽度应在 20-80 之间，已重置为默认值 40&quot;</span>)</span><br><span class="line">        args.image_width = DEFAULT_IMAGE_WIDTH</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 如果没有指定输出路径，默认在输入目录下生成</span></span><br><span class="line">    <span class="keyword">if</span> args.output <span class="keyword">is</span> <span class="literal">None</span>:</span><br><span class="line">        args.output = os.path.join(args.<span class="built_in">input</span>, <span class="string">&quot;preview.html&quot;</span>)</span><br><span class="line"></span><br><span class="line">    <span class="comment"># 执行生成</span></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;📁 扫描目录: <span class="subst">&#123;args.<span class="built_in">input</span>&#125;</span>&quot;</span>)</span><br><span class="line">    image_pairs = scan_image_pairs(args.<span class="built_in">input</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> <span class="keyword">not</span> image_pairs:</span><br><span class="line">        <span class="built_in">print</span>(<span class="string">&quot;❌ 未找到任何图-文对&quot;</span>)</span><br><span class="line">        <span class="keyword">return</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;✓ 找到 <span class="subst">&#123;<span class="built_in">len</span>(image_pairs)&#125;</span> 对图-文对&quot;</span>)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;🔨 生成 HTML...&quot;</span>)</span><br><span class="line"></span><br><span class="line">    html_content = generate_html(</span><br><span class="line">        image_pairs, title=args.title, image_width=args.image_width</span><br><span class="line">    )</span><br><span class="line"></span><br><span class="line">    save_html(html_content, args.output)</span><br><span class="line">    <span class="built_in">print</span>(<span class="string">f&quot;\n🎉 完成！请用浏览器打开 <span class="subst">&#123;args.output&#125;</span> 查看预览&quot;</span>)</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="keyword">if</span> __name__ == <span class="string">&quot;__main__&quot;</span>:</span><br><span class="line">    main()</span><br></pre></td></tr></table></figure><p>用法：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">#在数据集目录生成 preview.html</span></span><br><span class="line">python previewer.py --<span class="built_in">input</span> <span class="string">&quot;D:\dataset\tagged&quot;</span></span><br><span class="line"><span class="comment">#输出：D:\dataset\tagged\preview.html</span></span><br><span class="line"><span class="comment">#双击打开即可查看</span></span><br></pre></td></tr></table></figure><p>发现有不满意的标签或图片，就去文件夹里面删，然后再次用<code>tagger.py</code>重新生成标签即可。</p><h3 id="上传数据集"><a href="#上传数据集" class="headerlink" title="上传数据集"></a>上传数据集</h3><p>到此为止，我们的数据集（图文对）均保存在一个文件夹内，一张图对应一个同名的文本文档，文本文档内是其tag。</p><p>打开ai-toolkit界面，点击左侧Datasets选项，新建一个数据集，然后将准备好的数据文件夹拖入。</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20260214-203137-64181.png" alt=""></p><h2 id="训练参数设置"><a href="#训练参数设置" class="headerlink" title="训练参数设置"></a>训练参数设置</h2><p>这部分主要是参考他人经验。</p><p>推荐显存大小在12G甚至16G以上、内存足够大（越大越好）。其实云端挺不错的，租个4090之类的也跑不了几个小时。</p><p>左侧点击“New Job”按钮。</p><h3 id="基本设置"><a href="#基本设置" class="headerlink" title="基本设置"></a>基本设置</h3><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20260214-225406-45001.png" alt=""></p><ul><li>Training Name：填写本次训练的名字。</li><li>Trigger Word：LoRA触发词。可不填。</li><li>Model：选Z-Image-Turbo。</li><li>Name or Path：如果提前下载好了，则填写下载的文件夹路径；否则默认填写。</li><li>Traing Adapter Path：Turbo模型比较特殊，由于是蒸馏加速的，直接练lora会导致模型失去这种加速性质，所以需要使用别人训练好的一个adapter。如果没有自己下载就默认填写，开始运行的时候会自动下载。详细见<a href="https://www.modelscope.cn/models/ostris/zimage_turbo_training_adapter">zimage_turbo_training_adapter · 模型库</a>。</li><li>Low VRAM和Layer Offloading：如果没有24G显存，建议如图开启。</li><li>Linear Rank：设置LoRA的大小，推荐选16、32等。</li><li>Save Every：每多少step进行保存一次权重。如果是练人脸LoRA，由于一共只需1000~3000step就有效果，所以可适当调小（比如我设置250step）</li><li>Max Step Saves to Keep：最多保存（最新的）多少个模型权重文件。建议拉大。一个LoRA才不到100MB，不缺这点硬盘空间。</li></ul><h3 id="训练设置"><a href="#训练设置" class="headerlink" title="训练设置"></a>训练设置</h3><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20260214-230143-57642.png" alt=""></p><ul><li><p>Steps：训练多少步。可以通过这两个经验来估算：</p><ol><li>每张人脸图片学习10次左右就足够了，故设置不超过数据集大小×10</li><li><p>人脸LoRA模型学习1000~3000次，模型差不多就拟合的很好了</p><p>可以通过这两种方式来进行估算。可以适当调大，因为之后可设置Sample输入来观察模型各个截断的变化。</p></li></ol></li><li><p>Learning Rate和Weight Decay：保持默认。发现效果不够好的话再尝试修改。</p></li><li><p>Cache Text Embeddings：缓存文本嵌入数据以节约显存。</p></li><li><p>Do Differential Guidance：打开。</p></li></ul><h3 id="数据集设置"><a href="#数据集设置" class="headerlink" title="数据集设置"></a>数据集设置</h3><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20260214-231600-26777.png" alt=""></p><ul><li>Target Dataset：选方才创建的数据集。</li><li>Resolutions：将图片缩放到哪个尺寸下进行训练。如果显存足够，那么越大越好。参考：<ul><li>16G显存可以选择性选上1536，我实测会用满显存，稍微降速。</li><li>选768+1024+1280，占用不会满，速度约6sec/iter（4070Ti Super）</li><li>选512+768+1024，速度约4.5sec/iter（4070Ti Super）</li><li>速度不稳定。</li></ul></li></ul><h3 id="测试设置"><a href="#测试设置" class="headerlink" title="测试设置"></a>测试设置</h3><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20260214-232226-22145.png" alt=""></p><ul><li>Sample Every：每多少步骤进行一次测试采样。建议与之前的“Save Every”保持一致。</li><li>Width&amp;Height：采样输出图片的大小。建议覆盖之前Resolutions选择的图片尺寸，或者根据实际需求选择。</li><li>Seed：我建议固定42方便观察与后续实验对比。</li><li>Prompt：必填，即文本提示词。如果有设置触发词，则需要先填在前面。</li></ul><h3 id="开始训练"><a href="#开始训练" class="headerlink" title="开始训练"></a>开始训练</h3><p>然后就可以点击右上角“Create Job”开始训练啦！</p><p>我训练了人脸LoRA：</p><ul><li>在750step时初感有效</li><li>1000step就能看出五官相似</li><li>1250step学习到了角色固定的发型</li><li>1750step时有张sample给角色带上了常戴的眼镜（数据集里面有一部分是戴眼镜的）</li></ul><p>Samples页可以看到每次Sample的图片。Loss Graph页可观察曲线，但通常下降不会太明显。</p><h2 id="Reference"><a href="#Reference" class="headerlink" title="Reference"></a>Reference</h2><p><a href="https://zhuanlan.zhihu.com/p/1991604982705832652">Z-image-turbo初级炼丹记录：针对“蒸馏模型”的LoRA训练 - 知乎</a></p><p><a href="https://github.com/ostris/ai-toolkit">ostris/ai-toolkit：用于微调扩散模型的终极训练工具包 —- ostris/ai-toolkit: The ultimate training toolkit for finetuning diffusion models</a></p><p><a href="https://www.modelscope.cn/models/Tongyi-MAI/Z-Image-Turbo">造相-Z-Image-Turbo · 模型库</a></p><p><a href="https://www.modelscope.cn/models/ostris/zimage_turbo_training_adapter">zimage_turbo_training_adapter · 模型库</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2026/02/14/Z-Image-Turbo-Finetune-LoRA/</id>
    <link href="https://blog.vanilla-chan.cn/2026/02/14/Z-Image-Turbo-Finetune-LoRA/"/>
    <published>2026-02-14T15:53:25.000Z</published>
    <summary>使用ai-toolkit微调Z-Image-Turbo模型的过程记录。</summary>
    <title>Z-Image-Turbo进行LoRA微调流程</title>
    <updated>2026-02-14T15:53:25.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="WSL" scheme="https://blog.vanilla-chan.cn/tags/WSL/"/>
    <category term="Windows" scheme="https://blog.vanilla-chan.cn/tags/Windows/"/>
    <category term="Port" scheme="https://blog.vanilla-chan.cn/tags/Port/"/>
    <content>
      <![CDATA[<p>现象：原本某些端口正常使用，重启一次电脑原本好的端口提示被占用了。</p><p>原因：Win11在部分虚拟化网络组件（如Hyper-V/WinNAT）下会预留一段端口区间，导致常用端口被系统占用。</p><p>解决：把动态端口范围固定到49152-65535，并重启 WinNAT 后重新检查占用的端口区间。</p><span id="more"></span><h2 id="问题复现"><a href="#问题复现" class="headerlink" title="问题复现"></a>问题复现</h2><p>查看目前动态范围</p><figure class="highlight dart"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">netsh <span class="built_in">int</span> ipv4 <span class="keyword">show</span> dynamicport tcp</span><br></pre></td></tr></table></figure><p>查看当前占用</p><figure class="highlight angelscript"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">netsh <span class="keyword">interface</span> <span class="symbol">ipv4</span> <span class="symbol">show</span> <span class="symbol">excludedportrange</span> <span class="symbol">protocol</span>=<span class="symbol">tcp</span></span><br></pre></td></tr></table></figure><p>结果如下：</p><figure class="highlight yaml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">Protocol</span> <span class="string">tcp</span> <span class="string">Port</span> <span class="string">Exclusion</span> <span class="string">Ranges</span></span><br><span class="line"><span class="string">Start</span> <span class="string">Port</span>    <span class="string">End</span> <span class="string">Port</span></span><br><span class="line"><span class="string">----------</span>    <span class="string">--------</span></span><br><span class="line">      <span class="number">1988        </span><span class="number">2087</span>      </span><br><span class="line">      <span class="number">5357        </span><span class="number">5357</span></span><br><span class="line">      <span class="number">8313        </span><span class="number">8412</span></span><br><span class="line">      <span class="number">8413        </span><span class="number">8512</span></span><br><span class="line">      <span class="number">8513        </span><span class="number">8612</span></span><br><span class="line">      <span class="number">8613        </span><span class="number">8712</span></span><br><span class="line">      <span class="number">8713        </span><span class="number">8812</span></span><br><span class="line">      <span class="number">8813        </span><span class="number">8912</span></span><br><span class="line">      <span class="number">8913        </span><span class="number">9012</span></span><br><span class="line">      <span class="number">9013        </span><span class="number">9112</span></span><br><span class="line">     <span class="number">10745</span>       <span class="number">10844</span></span><br><span class="line">     <span class="number">50000</span>       <span class="number">50059</span>     <span class="string">*</span></span><br><span class="line"><span class="string">*</span> <span class="bullet">-</span> <span class="string">Administered</span> <span class="string">port</span> <span class="string">exclusions.</span></span><br></pre></td></tr></table></figure><p>其中，这次我正好想要使用的8675端口正好在里面。有时候还会随机到3000、8000这种更重要的端口。</p><h2 id="解决步骤"><a href="#解决步骤" class="headerlink" title="解决步骤"></a>解决步骤</h2><h3 id="修改端口区间"><a href="#修改端口区间" class="headerlink" title="修改端口区间"></a>修改端口区间</h3><p><strong>需要管理员</strong></p><figure class="highlight routeros"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">netsh int ipv4 <span class="built_in">set</span> dynamic tcp <span class="attribute">start</span>=49152 <span class="attribute">num</span>=16384</span><br><span class="line">netsh int<span class="built_in"> ipv6 </span><span class="built_in">set</span> dynamic tcp <span class="attribute">start</span>=49152 <span class="attribute">num</span>=16384</span><br></pre></td></tr></table></figure><p>将系统动态端口范围设置为<code>49152~65535(49152+16384-1)</code></p><h3 id="重启WinNAT服务"><a href="#重启WinNAT服务" class="headerlink" title="重启WinNAT服务"></a>重启WinNAT服务</h3><p><strong>需要管理员</strong></p><figure class="highlight dos"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">net</span> stop winnat</span><br><span class="line"><span class="built_in">net</span> <span class="built_in">start</span> winnat</span><br></pre></td></tr></table></figure><h3 id="再次查看当前端口占用"><a href="#再次查看当前端口占用" class="headerlink" title="再次查看当前端口占用"></a>再次查看当前端口占用</h3><p>区间</p><figure class="highlight dart"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">netsh <span class="built_in">int</span> ipv4 <span class="keyword">show</span> dynamicport tcp</span><br></pre></td></tr></table></figure><p>例如：</p><figure class="highlight asciidoc"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="section">Protocol tcp Dynamic Port Range</span></span><br><span class="line"><span class="section">---------------------------------</span></span><br><span class="line">Start Port      : 49152</span><br><span class="line">Number of Ports : 16384</span><br></pre></td></tr></table></figure><p>占用端口</p><figure class="highlight angelscript"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">netsh <span class="keyword">interface</span> <span class="symbol">ipv4</span> <span class="symbol">show</span> <span class="symbol">excludedportrange</span> <span class="symbol">protocol</span>=<span class="symbol">tcp</span></span><br></pre></td></tr></table></figure><p>例如：</p><figure class="highlight vhdl"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">Protocol tcp <span class="keyword">Port</span> Exclusion Ranges</span><br><span class="line"></span><br><span class="line">Start <span class="keyword">Port</span>    <span class="keyword">End</span> <span class="keyword">Port</span></span><br><span class="line"><span class="comment">----------    --------</span></span><br><span class="line">      <span class="number">5357</span>        <span class="number">5357</span>      </span><br><span class="line">     <span class="number">50000</span>       <span class="number">50059</span>     *</span><br><span class="line"></span><br><span class="line">* - Administered <span class="keyword">port</span> exclusions.</span><br></pre></td></tr></table></figure><p>此时端口占用显著收敛，目标端口不再被系统预留，问题解除。</p><h2 id="Reference"><a href="#Reference" class="headerlink" title="Reference"></a>Reference</h2><p><a href="https://zhuanlan.zhihu.com/p/474392069">解决 Windows 10 端口被 Hyper-V 随机保留（占用）的问题 - 知乎</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2026/02/13/fix-win11-port-occupied/</id>
    <link href="https://blog.vanilla-chan.cn/2026/02/13/fix-win11-port-occupied/"/>
    <published>2026-02-13T10:49:01.000Z</published>
    <summary>
      <![CDATA[<p>现象：原本某些端口正常使用，重启一次电脑原本好的端口提示被占用了。</p>
<p>原因：Win11在部分虚拟化网络组件（如Hyper-V/WinNAT）下会预留一段端口区间，导致常用端口被系统占用。</p>
<p>解决：把动态端口范围固定到49152-65535，并重启 WinNAT 后重新检查占用的端口区间。</p>]]>
    </summary>
    <title>解决Windows11端口被随机占用的问题</title>
    <updated>2026-03-06T09:14:08.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Research" scheme="https://blog.vanilla-chan.cn/categories/Research/"/>
    <category term="LLM" scheme="https://blog.vanilla-chan.cn/tags/LLM/"/>
    <content>
      <![CDATA[<p>现在很多大模型越训练越丧失随机性或者说创造性。这篇论文提出了一个简单且无需训练的方法，只需要加一句提示词，就解决了LLM在经过对齐训练（比如RLHF）后出现了”模式坍塌“（Mode Collapse）问题，即模型的输出变得单一、缺乏创造力。</p><span id="more"></span><h2 id="问题分析：为什么LLM的输出会变得单调"><a href="#问题分析：为什么LLM的输出会变得单调" class="headerlink" title="问题分析：为什么LLM的输出会变得单调"></a>问题分析：为什么LLM的输出会变得单调</h2><p>经过了对齐训练后的模型往往会丧失多样性，导致对于同一个问题的回答千篇一律（本质相同）。这在<strong>创意性写作</strong>、<strong>社会模拟</strong>、<strong><em>多元对齐</em></strong>、<strong>合成数据</strong>生成等的任务上，会带来非常负面的影响。</p><p>以前的人们觉得这是算法导致的，但是这篇论文发现<strong>数据</strong>才是主因。这里的数据指的是，人类标注者——作为一名人类——天生就喜欢”典型“、”常见“的回答（认知心理学中的<strong><em>典型性偏差</em></strong>）。这导致模型在训练中只会输出那个概率最高的、最“典型”的回答，丢弃掉了<strong><em>长尾</em></strong>的、更有创意的选项。</p><blockquote><p>多元对齐（pluralistic alignment）：在设计和训练LLM时不追求与某单一价值观、文化规范或用户偏好对齐，而是讲究包容多种甚至可能会互相冲突的价值体系、文化背景、道德立场或用户需求。</p><p>典型性偏差（typicality bias）：人们在判断某事物是否属于某个类别时，倾向于依据该事物与该类别”典型成员“的相似程度，而不是看客观的统计学概率或者定义好的规则。在这里是说，人类在标注的时候，自然而然的会喜欢自己看过的、熟悉的、觉得比较正常而经典的故事（比如让LLM讲个故事，总是会有”松鼠森林精灵”之类的吧）</p><p>长尾（long tail）：统计学/机器学习的术语，来源于概率分布的形状。在现实世界的分布中，少数的项目出现在频率极高的头部，而大量的项目各自出现的频率很低，但是加起来占比很大，这部分低频项目构成了一个很长的“尾巴”，即长尾。</p></blockquote><h2 id="解决方案：Verbalized-Sampling（VS）"><a href="#解决方案：Verbalized-Sampling（VS）" class="headerlink" title="解决方案：Verbalized Sampling（VS）"></a>解决方案：Verbalized Sampling（VS）</h2><p>作者提出了一个超级简答的方案！不需要训练，因为这种方案就是一种提示词策略就好了！</p><p>核心思想：<strong>不要让LLM生成一个回答，而是一口气生成一组回答，并且“口头”输出他们的概率。</strong></p><p>原理是这样的：当要求模型输出一个“分布”的时候，LLM会调用预训练阶段的知识，从而恢复被压抑的多样性；而如果只是要求得到仅一个结果时，LLM会坍塌到那个最典型的结果上。</p><p>如果不知道怎么做，直接看下面的提示词模板就好啦。</p><h2 id="提示词模板"><a href="#提示词模板" class="headerlink" title="提示词模板"></a>提示词模板</h2><p>作者给出了一个提示词模板：</p><figure class="highlight livecodeserver"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">System prompt: You are <span class="keyword">a</span> helpful assistant. For <span class="keyword">each</span> query, please generate <span class="keyword">a</span> <span class="built_in">set</span> <span class="keyword">of</span> <span class="literal">five</span> possible responses, <span class="keyword">each</span> <span class="keyword">within</span> <span class="keyword">a</span> separate &lt;response&gt; tag. Responses should <span class="keyword">each</span> <span class="built_in">include</span> <span class="keyword">a</span> &lt;<span class="keyword">text</span>&gt; <span class="keyword">and</span> <span class="keyword">a</span> <span class="keyword">numeric</span> &lt;probability&gt;. Please sample <span class="keyword">at</span> <span class="built_in">random</span> <span class="built_in">from</span> <span class="keyword">the</span> [full distribution / tails <span class="keyword">of</span> <span class="keyword">the</span> distribution, such that <span class="keyword">the</span> probability <span class="keyword">of</span> <span class="keyword">each</span> response is less than <span class="number">0.10</span>].</span><br><span class="line">User prompt: Write <span class="keyword">a</span> <span class="keyword">short</span> story about <span class="keyword">a</span> bear.</span><br></pre></td></tr></table></figure><p>翻译一下：</p><figure class="highlight xml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">System prompt: 你是一个乐于助人的助手。对于每一个提问，请生成一组共五个可能的回答，每个回答需包含在一个单独的 <span class="tag">&lt;<span class="name">response</span>&gt;</span> 标签内。每个回答都应包含一个 <span class="tag">&lt;<span class="name">text</span>&gt;</span> 和一个数值 <span class="tag">&lt;<span class="name">probability</span>&gt;</span>。请从 [完整分布 / 分布的尾部，即每个回答的概率需小于 0.10] 中进行随机采样。</span><br><span class="line">User prompt: 写一个关于熊的短故事。</span><br></pre></td></tr></table></figure><h2 id="实验效果：各个领域都很好"><a href="#实验效果：各个领域都很好" class="headerlink" title="实验效果：各个领域都很好"></a>实验效果：各个领域都很好</h2><p>作者在多个领域进行了测试，效果显著：</p><ul><li>创意写作（诗歌、故事、笑话）：VS方法生成的内容多样性比直接提问提高了1.6~2.1倍率，且质量没有下降，甚至在人类的评估中得分更高。</li><li>对话模拟：在捐款谈判时，VS能模拟出更像真人的行为（包括拒绝，改变主意），而普通的prompt只会生成前篇一律的礼貌回复。</li><li>开放式回答：在回答“列举美国的一个州”这种问题的时候，VS能覆盖更广泛的真实分布，而不是只盯着加州和德州。</li><li>合成数据生成：用VS生成的数据去训练小模型，效果比用普通的prompt生成的数据要更好，因为数据更多样化。</li></ul><h3 id="数据集和测试方法"><a href="#数据集和测试方法" class="headerlink" title="数据集和测试方法"></a>数据集和测试方法</h3><p>这里涉及到了若干数据集的测试方法。</p><h4 id="创意写作"><a href="#创意写作" class="headerlink" title="创意写作"></a>创意写作</h4><p>数据集：</p><ul><li><p>诗歌续写：<a href="https://www.poemhunter.com/">www.poemhunter.com</a></p></li><li><p>故事创作：BookMIA dataset</p></li><li><p>笑话写作：从Reddit的r/DadJokes数据集中精选了100个主题提示词</p></li></ul><p>对于每个任务，随机算100个数据点，使用VS方法每次生成$k=5$个候选项，总共采样$N=30$个回答。</p><p>评估指标：</p><ul><li><p>多样性</p><ul><li>语义多样性：计算回答之间的Embedding余弦相似度，相似度越低，多样性越高。</li><li>词汇多样性：使用ROUGE-L指标。</li></ul></li><li><p>质量</p><ul><li>使用Claude-3.7-Sonnet作为裁判模型，根据特定的评分标准（如幽默感、情节丰富度）进行打分。</li><li>同时还进行了人类评估。</li></ul></li></ul><h4 id="对话模拟"><a href="#对话模拟" class="headerlink" title="对话模拟"></a>对话模拟</h4><p> 模拟一个“被劝说者”，与一个GPT-4.1扮演的“劝说者”进行多轮对话，最后决定是否捐款 。模型基于给定的人设生成回复。对比直接Prompt和VS方法生成的对话结果。</p><p>数据集：</p><ul><li>Persuasion ForGood数据集，包含1017组关于劝说向“救助儿童会”捐款的对话。筛选后使用了939个有效样本。</li></ul><p>测试流程：</p><ul><li>LLM扮演“被劝说者”，以相同的人设（比如“手头紧但有爱心”）开始扮演。</li><li>让GPT-4.1扮演“劝说者”，负责发起对话并劝说捐款。</li><li><p>在每一轮对话中，当轮到LLM（被劝说者）回复时，不直接生成一句话，而是按照VS进行以下操作：</p><ol><li>生成候选项及附带概率</li><li>从这些候选项中挑一个发回给“劝说者”</li><li>挑选的策略可以是按概率加权采样，也尝试了随机均匀采样。</li></ol></li><li><p>对话一直进行到结束，最后记录模型最终决定捐款的金额。</p></li></ul><p>评估指标：</p><ul><li><p>捐款金额分布：使用KS检验和L1距离，对比LLM的捐款金额分布与真实人类数据（Persuasion ForGood）的分布差异。</p></li><li><p>语言风格：评估回复的词汇丰富度（Distinct-N）和可读性 。</p></li></ul><h4 id="开放式问答"><a href="#开放式问答" class="headerlink" title="开放式问答"></a>开放式问答</h4><p>测试模型在面对有多个正确答案的问题时，能否覆盖更广泛的答案空间。枚举型问答，例如“列举一个美国的州” 。</p><p>数据集：</p><ul><li>改编自CoverageQA基准测试。使用40个问题，每个问题至少20个标准答案。</li></ul><p>每个问题采样$N=100$个回答。</p><p>评估指标：</p><ul><li>KL散度：对比模型输出的分布与预训练预料分布（使用RedPajama数据集作为代理）的差异。KL散度低说明模型越好地还原了预训练时的知识分布。</li><li>覆盖率：生成的答案覆盖了多少个不同的正确答案。</li><li>准确率：确保生成的答案就算多样但是依然是正确的。</li></ul><h4 id="合成数据生成"><a href="#合成数据生成" class="headerlink" title="合成数据生成"></a>合成数据生成</h4><p>测试VS生成的数据是否比普通数据更能提升小模型的性能。任务：生成数学竞赛题。</p><p>数据集：</p><ul><li><p>正向样本生成</p><ul><li>MATH500</li><li>OlympiadBench</li><li>Minerva Math</li><li>用<a href="https://github.com/huggingface/Math-Verify">huggingface/Math-Verify</a>在上述三个数据集上进行验证</li></ul></li><li><p>负向样本生成</p><ul><li>GSM8K</li></ul></li></ul><p>测试方法：</p><ul><li><p>正向样本生成</p><ol><li>让LLM（GPT-4.1或Gemini）用VS方法生成1000道新的数学题。</li><li>用这些题去微调较小的模型（Qwen2.5-7B，Qwen3-1.7B，Qwen3-4B）。</li><li>在上述三个数学基准测试集上测试微调后的小模型的解题准确率。准确率越高，说明微调的效果越好，说明微调数据多样性越好。</li></ol></li><li><p>负向样本生成</p><ol><li>从GSM8K中随机选50道题，对每道题使用GPT-4.1生成$k=5$个回答，共采样$N=10$个回答。</li><li>生成的要求是“看似合理但实质错误”的解题过程。</li><li>使用和前面一样的Embedding余弦相似度作为多样性评分方法。</li></ol></li></ul><h4 id="其他辅助测试"><a href="#其他辅助测试" class="headerlink" title="其他辅助测试"></a>其他辅助测试</h4><ul><li>常识推理：使用SimpleQA数据集，验证VS在增加多样性的同时没有产生幻觉。</li><li>随机数生成：让模型掷骰子，看分布是否接近均匀分布。</li><li>安全性：使用StrongReject基准测试，确保VS不会因为探索“长尾分布”而绕开安全护栏。</li></ul><blockquote><p>StrongReject：一个基准数据集，用来评估模型安全性。包含353条有害提示词。用官方设定的安全裁判机制，由GPT-4.1担任裁判。评估模型是否拒绝有害指令、LLM回答的置信度是否高、LLM回答的是否具体。</p><p>安全护栏：模型经过了对齐训练后形成的一种拒绝执行有害指令的内在机制。</p></blockquote><h2 id="其他发现"><a href="#其他发现" class="headerlink" title="其他发现"></a>其他发现</h2><ol><li>越强的模型，用上了VS之后，收益会更大。因为它们能更好地理解“概率”并遵循指令。</li><li>增加多样性没有让模型变得不安全或者产生幻觉。事实准确性和安全性没有下降。</li></ol><h2 id="动手测试"><a href="#动手测试" class="headerlink" title="动手测试"></a>动手测试</h2><p>我写了个 demo 网站：<a href="https://yukirin.me/demo/verbalized-sampling">Verbalized Sampling Demo</a></p><p>使用 <code>deepseek-V3.2(no thinking)</code> 和 <code>Qwen3-30B-A3B-Instruct-2507</code> 作为 llm 模型，使用 <code>Qwen3-Embedding-0.6B</code> 作为向量计算模型。计算 <code>标准方法类内平均距离</code> 和 <code>VS方法类内平均距离</code>，以及提升幅度。</p><p>首先，给予提示词 <code>构造一个问题</code>，在标准方法和VS方法的系统提示词下，各自生成 5 个问题。这样加起来共计 11 个问题。对于这 11 个问题，使用上述两个模型，在两种提示词下，设置每次生成 5 个 response，并计算这 5 个 resonese 的类内距离。</p><div class="table-container"><table><thead><tr><th><strong>模型</strong></th><th><strong>dpsk</strong></th><th><strong>dpsk</strong></th><th><strong>qwen3</strong></th><th><strong>qwen3</strong></th></tr></thead><tbody><tr><td><strong>prompt↓</strong></td><td><strong>标准回答</strong></td><td><strong>尾部采样</strong></td><td><strong>标准回答</strong></td><td><strong>尾部采样</strong></td></tr><tr><td>构造一个问题</td><td>0.7133</td><td>0.65</td><td>0.6651</td><td>0.7147</td></tr><tr><td>什么是量子计算？</td><td>0.2526</td><td>0.1914</td><td>0.2984</td><td>0.3137</td></tr><tr><td>如何学习编程？</td><td>0.3334</td><td>0.4792</td><td>0.5445</td><td>0.4623</td></tr><tr><td>AI在未来会怎样影响就业？</td><td>0.3253</td><td>0.315</td><td>0.4897</td><td>0.439</td></tr><tr><td>请解释一下气候变化的原因。</td><td>0.1793</td><td>0.4877</td><td>0.4028</td><td>0.4877</td></tr><tr><td>推荐几本好书。</td><td>0.294</td><td>0.5732</td><td>0.4553</td><td>0.4779</td></tr><tr><td>什么是科学？</td><td>0.261</td><td>0.2592</td><td>0.2155</td><td>0.286</td></tr><tr><td>如何做晚餐？</td><td>0.4464</td><td>0.3398</td><td>0.4029</td><td>0.3844</td></tr><tr><td>解释气候变化。</td><td>0.262</td><td>0.4832</td><td>0.2811</td><td>0.3251</td></tr><tr><td>谁发明了电话？</td><td>0.2416</td><td>0.1486</td><td>0.2596</td><td>0.3564</td></tr><tr><td>如何学会编程？</td><td>0.2952</td><td>0.4219</td><td>0.443</td><td>0.47</td></tr><tr><td><strong>平均</strong></td><td><strong>0.327645455</strong></td><td><strong>0.395381818</strong></td><td><strong>0.405263636</strong></td><td><strong>0.428836364</strong></td></tr></tbody></table></div><p>可以看出，两个模型使用尾部采样后，相比标准回答，均有提升，并且 <code>deepseek-V3.2(no thinking)</code> 的提升（20.67%）要大于  <code>Qwen3-30B-A3B-Instruct-2507</code>  的提升（0.582%），符合文章结论“越强的模型收益会更大”。</p><p>对于构造数学题目数据集的任务，给予提示词<code>出一道小学奥数题</code>，设置每次生成 5 个 response，两个模型分别在两种系统提示词下重复生成 10 次。</p><div class="table-container"><table><thead><tr><th>模型</th><th><strong>dpsk</strong></th><th><strong>dpsk</strong></th><th><strong>qwen3</strong></th><th><strong>qwen3</strong></th></tr></thead><tbody><tr><td><strong>序号</strong></td><td><strong>标准回答</strong></td><td><strong>尾部采样</strong></td><td><strong>标准回答</strong></td><td><strong>尾部采样</strong></td></tr><tr><td>1</td><td>0.566</td><td>0.6318</td><td>0.6481</td><td>0.6481</td></tr><tr><td>2</td><td>0.6204</td><td>0.6293</td><td>0.5918</td><td>0.6132</td></tr><tr><td>3</td><td>0.6047</td><td>0.5711</td><td>0.6094</td><td>0.6739</td></tr><tr><td>4</td><td>0.5645</td><td>0.5397</td><td>0.6192</td><td>0.5456</td></tr><tr><td>5</td><td>0.5456</td><td>0.6249</td><td>0.527</td><td>0.652</td></tr><tr><td>6</td><td>0.588</td><td>0.6418</td><td>0.5945</td><td>0.5622</td></tr><tr><td>7</td><td>0.535</td><td>0.6236</td><td>0.5412</td><td>0.6411</td></tr><tr><td>8</td><td>0.5938</td><td>0.5615</td><td>0.6586</td><td>0.6199</td></tr><tr><td>9</td><td>0.6457</td><td>0.4604</td><td>0.5664</td><td>0.6119</td></tr><tr><td>10</td><td>0.5822</td><td>0.6259</td><td>0.6277</td><td>0.5005</td></tr><tr><td><strong>平均</strong></td><td><strong>0.58459</strong></td><td><strong>0.591</strong></td><td><strong>0.59839</strong></td><td><strong>0.60684</strong></td></tr></tbody></table></div><p><strong>DeepSeek-V3.2</strong>：类内平均距离从 <strong>0.58459</strong> 提升至 <strong>0.5910</strong>，提升幅度约为 <strong>1.10%</strong>。</p><p><strong>Qwen3-30B-A3B</strong>：类内平均距离从 <strong>0.59839</strong> 提升至 <strong>0.60684</strong>，提升幅度约为 <strong>1.41%</strong>。</p><p>在逻辑约束较强的数学场景下，VS方法（尾部采样）依然能稳定提升生成样本的多样性，但是效果较小。</p><blockquote><p>上述数据均无法通过 t 检验和 U 检验，有待进一步研究……</p></blockquote><h2 id="References"><a href="#References" class="headerlink" title="References"></a>References</h2><p><a href="https://arxiv.org/abs/2510.01171">[2510.01171] Verbalized Sampling: How to Mitigate Mode Collapse and Unlock LLM Diversity</a></p><p><a href="https://www.bilibili.com/video/BV1jXSeBUEKA/?share_source=copy_web&amp;vd_source=35bd7933e51379473c3a49c28092b2b0">为什么不同大模型在很多问题的回答偏向同质化？语言化采样：如何缓解模式崩溃并释放大模型多样性</a></p><p><a href="https://www.bilibili.com/video/BV1yhUGB8E6T/">一句 Prompt，让大模型不再千篇一律：Verbalized Sampling 全解析 哔哩哔哩</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/12/17/Verbalized-Sampling/</id>
    <link href="https://blog.vanilla-chan.cn/2025/12/17/Verbalized-Sampling/"/>
    <published>2025-12-17T06:14:56.000Z</published>
    <summary>
      <![CDATA[<p>现在很多大模型越训练越丧失随机性或者说创造性。这篇论文提出了一个简单且无需训练的方法，只需要加一句提示词，就解决了LLM在经过对齐训练（比如RLHF）后出现了”模式坍塌“（Mode Collapse）问题，即模型的输出变得单一、缺乏创造力。</p>]]>
    </summary>
    <title>仅通过一句提示词，就可以让大模型变得更有创造力</title>
    <updated>2025-12-17T06:14:56.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="WSL" scheme="https://blog.vanilla-chan.cn/tags/WSL/"/>
    <category term="conda" scheme="https://blog.vanilla-chan.cn/tags/conda/"/>
    <content>
      <![CDATA[<h2 id="直接使用win的fonts目录"><a href="#直接使用win的fonts目录" class="headerlink" title="直接使用win的fonts目录"></a>直接使用win的fonts目录</h2><p>因为WSL2是运行在win环境中的。我对于WSL2能使用中文字体的需求主要来自于python画图的时候能和win下使用相同的代码（使用相同的字体文件）而不乱码。所以最好的方法当然是直接使用win的<code>C:\Windows\Fonts</code>目录下的字体文件啦。</p><h3 id="创建local-conf"><a href="#创建local-conf" class="headerlink" title="创建local.conf"></a>创建local.conf</h3><p>WSL2 自动将 Windows 的 C 盘挂载在 <code>/mnt/c</code>，所以我们可以直接指向 Windows 的字体目录。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> nano /etc/fonts/local.conf</span><br></pre></td></tr></table></figure><p>如果文件是空的，直接粘贴以下内容；如果文件已有内容，请确保 <code>&lt;dir&gt;/mnt/c/Windows/Fonts&lt;/dir&gt;</code> 被添加在 <code>&lt;fontconfig&gt;</code> 标签内~</p><figure class="highlight xml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">&lt;?xml version=<span class="string">&quot;1.0&quot;</span>?&gt;</span></span><br><span class="line"><span class="meta">&lt;!DOCTYPE <span class="keyword">fontconfig</span> <span class="keyword">SYSTEM</span> <span class="string">&quot;fonts.dtd&quot;</span>&gt;</span></span><br><span class="line"><span class="tag">&lt;<span class="name">fontconfig</span>&gt;</span></span><br><span class="line">    <span class="tag">&lt;<span class="name">dir</span>&gt;</span>/mnt/c/Windows/Fonts<span class="tag">&lt;/<span class="name">dir</span>&gt;</span></span><br><span class="line"><span class="tag">&lt;/<span class="name">fontconfig</span>&gt;</span></span><br></pre></td></tr></table></figure><p>按 <code>Ctrl + O</code> 保存，<code>Enter</code> 确认，然后 <code>Ctrl + X</code> 退出。</p><h3 id="刷新系统字体缓存"><a href="#刷新系统字体缓存" class="headerlink" title="刷新系统字体缓存"></a>刷新系统字体缓存</h3><p>配置文件修改后，需要让 Linux 系统重新扫描字体目录。</p><p>执行以下命令（因为 Windows 字体比较多，所以可能比较慢）：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> fc-cache -fv</span><br></pre></td></tr></table></figure><p>验证是否成功：你可以用 <code>fc-list</code> 命令查看是否识别到了中文字体：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">fc-list :lang=zh | grep <span class="string">&quot;Microsoft YaHei&quot;</span></span><br><span class="line">fc-list :lang=zh | grep <span class="string">&quot;SimHei&quot;</span></span><br></pre></td></tr></table></figure><p>如果能输出路径（如 <code>/mnt/c/Windows/Fonts/msyh.ttc</code>），说明挂载成功。</p><h2 id="一个小bug"><a href="#一个小bug" class="headerlink" title="一个小bug"></a>一个小bug</h2><p>但是当我在尝试的时候，发现上面两个都没有结果。</p><p>Gemini 说可能是 <code>sudo</code> 的问题，让我直接 <code>fc-cache -fv</code> 一下，但是还是找不出来。</p><p>但是的但是，这次 <code>fc-cache</code> 时，输出日志的开头为：</p><figure class="highlight swift"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">xxx<span class="meta">@xxx</span>:<span class="operator">~</span>$ fc<span class="operator">-</span>cache <span class="operator">-</span>fv</span><br><span class="line"><span class="type">Font</span> directories:</span><br><span class="line">        <span class="regexp">/home/</span>vanilla0302<span class="regexp">/anaconda3/</span>fonts</span><br><span class="line">        <span class="regexp">/home/</span>vanilla0302<span class="regexp">/.local/</span>share<span class="operator">/</span>fonts</span><br><span class="line">        <span class="regexp">/usr/</span>local<span class="regexp">/share/</span>fonts</span><br><span class="line">        <span class="operator">……</span></span><br></pre></td></tr></table></figure><p>注意到，这里居然有个anaconda3的字体目录，但是却没有方才添加的 <code>/mnt/c/Windows/Fonts</code>。</p><p>这说明，可能 <code>fc-cache</code> 其实是 Anaconda 环境下的 <code>fc-cache</code> 而不是系统自带的？但是总之，并没有检测到方才添加的 <code>/mnt/c/Windows/Fonts</code>。</p><h3 id="检查是否可读"><a href="#检查是否可读" class="headerlink" title="检查是否可读"></a>检查是否可读</h3><p>首先检查文件是否可读，排除权限问题：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">ls</span> -l /mnt/c/Windows/Fonts/msyh.ttc</span><br></pre></td></tr></table></figure><p>输出：</p><figure class="highlight tap"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">-r--------<span class="number"> 2 </span>vanilla0302 vanilla0302<span class="number"> 19704352 </span>Mar<span class="number"> 30 </span><span class="number"> 2025 </span>/mnt/c/Windows/Fonts/msyh.ttc</span><br></pre></td></tr></table></figure><p>这个权限是足够的，能找到文件就行，只读就够了。</p><h3 id="创建用户级配置文件"><a href="#创建用户级配置文件" class="headerlink" title="创建用户级配置文件"></a>创建用户级配置文件</h3><p>我在用户目录下，创建字体设置，这样 Anaconda 也能读取的到。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">mkdir</span> -p ~/.config/fontconfig</span><br><span class="line">nano ~/.config/fontconfig/fonts.conf</span><br></pre></td></tr></table></figure><p>和之前一样，贴入字体配置：</p><figure class="highlight xml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">&lt;?xml version=<span class="string">&quot;1.0&quot;</span>?&gt;</span></span><br><span class="line"><span class="meta">&lt;!DOCTYPE <span class="keyword">fontconfig</span> <span class="keyword">SYSTEM</span> <span class="string">&quot;fonts.dtd&quot;</span>&gt;</span></span><br><span class="line"><span class="tag">&lt;<span class="name">fontconfig</span>&gt;</span></span><br><span class="line">    <span class="tag">&lt;<span class="name">dir</span>&gt;</span>/mnt/c/Windows/Fonts<span class="tag">&lt;/<span class="name">dir</span>&gt;</span></span><br><span class="line"><span class="tag">&lt;/<span class="name">fontconfig</span>&gt;</span></span><br></pre></td></tr></table></figure><p>按 <code>Ctrl + O</code> 保存，<code>Enter</code> 确认，然后 <code>Ctrl + X</code> 退出。</p><h3 id="刷新系统字体缓存-1"><a href="#刷新系统字体缓存-1" class="headerlink" title="刷新系统字体缓存"></a>刷新系统字体缓存</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">fc-cache -fv</span><br></pre></td></tr></table></figure><p>这一次刷新的时候，可以找到一条来自win的字体文件夹了：</p><figure class="highlight gauss"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">/mnt/c/Windows/<span class="built_in">Fonts</span>: caching, <span class="keyword">new</span> cache contents: <span class="number">1111</span> <span class="built_in">fonts</span>, <span class="number">0</span> dirs</span><br></pre></td></tr></table></figure><h3 id="再次验证"><a href="#再次验证" class="headerlink" title="再次验证"></a>再次验证</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">fc-list | grep -i <span class="string">&quot;yahei&quot;</span></span><br><span class="line">fc-list | grep -i <span class="string">&quot;SimHei&quot;</span></span><br></pre></td></tr></table></figure><p>我的输出结果为：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">$ fc-list | grep -i <span class="string">&quot;yahei&quot;</span></span><br><span class="line"></span><br><span class="line">/mnt/c/Windows/Fonts/msyhbd.ttc: Microsoft YaHei,微软雅黑:style=Bold,Negreta,tučné,fed,Fett,Έντονα,Negrita,Lihavoitu,Gras,Félkövér,Grassetto,Vet,Halvfet,Pogrubiony,Negrito,Полужирный,Fet,Kalın,Krepko,Lodia</span><br><span class="line">/mnt/c/Windows/Fonts/msyh.ttc: Microsoft YaHei UI:style=Regular,Normal,obyčejné,Standard,Κανονικά,Normaali,Normál,Normale,Standaard,Normalny,Обычный,Normálne,Navadno,Arrunta</span><br><span class="line">/mnt/c/Windows/Fonts/msyh.ttc: Microsoft YaHei,微软雅黑:style=Regular,Normal,obyčejné,Standard,Κανονικά,Normaali,Normál,Normale,Standaard,Normalny,Обычный,Normálne,Navadno,Arrunta</span><br><span class="line">/mnt/c/Windows/Fonts/msyhbd.ttc: Microsoft YaHei UI:style=Bold,Negreta,tučné,fed,Fett,Έντονα,Negrita,Lihavoitu,Gras,Félkövér,Grassetto,Vet,Halvfet,Pogrubiony,Negrito,Полужирный,Fet,Kalın,Krepko,Lodia</span><br><span class="line">/mnt/c/Windows/Fonts/msyhl.ttc: Microsoft YaHei UI,Microsoft YaHei UI Light:style=Light,Regular</span><br><span class="line">/mnt/c/Windows/Fonts/msyhl.ttc: Microsoft YaHei,微软雅黑,Microsoft YaHei Light,微软雅黑 Light:style=Light,Regular</span><br><span class="line"></span><br><span class="line">$ fc-list | grep -i <span class="string">&quot;SimHei&quot;</span></span><br><span class="line"></span><br><span class="line">/mnt/c/Windows/Fonts/simhei.ttf: SimHei,黑体:style=Regular,Normal,obyčejné,Standard,Κανονικά,Normaali,Normál,Normale,Standaard,Normalny,Обычный,Normálne,Navadno,Arrunta</span><br></pre></td></tr></table></figure><p>由此可见，导入成功。</p><h3 id="刷新-Matplotlib-缓存"><a href="#刷新-Matplotlib-缓存" class="headerlink" title="刷新 Matplotlib 缓存"></a>刷新 Matplotlib 缓存</h3><p>Matplotlib 维护着一个<strong>独立的字体缓存文件</strong>（JSON格式），它不会自动实时去同步系统的变化，尤其是当你是在 Conda 虚拟环境中时。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># 删除matplotlib缓存</span></span><br><span class="line"><span class="built_in">rm</span> -rf ~/.cache/matplotlib</span><br><span class="line"><span class="comment"># 如果运行代码还是有中文乱码，那么尝试把root下的缓存也删了</span></span><br><span class="line"><span class="built_in">sudo</span> <span class="built_in">rm</span> -rf /root/.cache/matplotlib</span><br></pre></td></tr></table></figure><p>我在删除当前用户的 matplotlib 缓存之后就成功显示中文了。</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/12/16/WSL2-Use-CN-Fonts/</id>
    <link href="https://blog.vanilla-chan.cn/2025/12/16/WSL2-Use-CN-Fonts/"/>
    <published>2025-12-16T08:44:52.000Z</published>
    <summary>因为WSL2是运行在win环境中的。我对于WSL2能使用中文字体的需求主要来自于python画图的时候能和win下使用相同的代码（使用相同的字体文件）而不乱码。所以最好的方法当然是直接使用win的 C:\Windows\Fonts 目录下的字体文件啦。</summary>
    <title>WSL2如何使用中文字体</title>
    <updated>2025-12-16T08:44:52.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="WSL" scheme="https://blog.vanilla-chan.cn/tags/WSL/"/>
    <category term="conda" scheme="https://blog.vanilla-chan.cn/tags/conda/"/>
    <category term="ssh" scheme="https://blog.vanilla-chan.cn/tags/ssh/"/>
    <content>
      <![CDATA[<h2 id="安装WSL与基础设置"><a href="#安装WSL与基础设置" class="headerlink" title="安装WSL与基础设置"></a>安装WSL与基础设置</h2><p>对于一台从未安装过wsl的win11系统，在命令行中输入<code>wsl --install</code>即可开始安装。</p><figure class="highlight subunit"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line">C:\Users\Vanilla&gt;wsl</span><br><span class="line">适用于 Linux 的 Windows 子系统没有已安装的分发。</span><br><span class="line">可通过安装包含以下说明的分发来解决此问题：</span><br><span class="line"></span><br><span class="line">使用“wsl.exe --list --online&#x27; ”列出可用的分发</span><br><span class="line">和 “wsl.exe --install &lt;Distro&gt;” 进行安装。</span><br><span class="line"></span><br><span class="line">C:\Users\Vanilla&gt;wsl --list --online</span><br><span class="line">以下是可安装的有效分发的列表。</span><br><span class="line">使用“wsl.exe --install &lt;Distro&gt;”安装。</span><br><span class="line"></span><br><span class="line">NAME                            FRIENDLY NAME</span><br><span class="line">AlmaLinux<span class="string">-8</span>                     AlmaLinux OS 8</span><br><span class="line">AlmaLinux<span class="string">-9</span>                     AlmaLinux OS 9</span><br><span class="line">AlmaLinux-Kitten<span class="string">-10</span>             AlmaLinux OS Kitten 10</span><br><span class="line">AlmaLinux<span class="string">-10</span>                    AlmaLinux OS 10</span><br><span class="line">Debian                          Debian GNU/Linux</span><br><span class="line">FedoraLinux<span class="string">-42</span>                  Fedora Linux 42</span><br><span class="line">SUSE-Linux-Enterprise<span class="string">-15</span>-SP6    SUSE Linux Enterprise 15 SP6</span><br><span class="line">SUSE-Linux-Enterprise<span class="string">-15</span>-SP7    SUSE Linux Enterprise 15 SP7</span><br><span class="line">Ubuntu                          Ubuntu</span><br><span class="line">Ubuntu<span class="string">-24</span>.04                    Ubuntu 24.04 LTS</span><br><span class="line">archlinux                       Arch Linux</span><br><span class="line">kali-linux                      Kali Linux Rolling</span><br><span class="line">openSUSE-Tumbleweed             openSUSE Tumbleweed</span><br><span class="line">openSUSE-Leap<span class="string">-15</span>.6              openSUSE Leap 15.6</span><br><span class="line">Ubuntu<span class="string">-20</span>.04                    Ubuntu 20.04 LTS</span><br><span class="line">Ubuntu<span class="string">-22</span>.04                    Ubuntu 22.04 LTS</span><br><span class="line">OracleLinux_7_9                 Oracle Linux 7.9</span><br><span class="line">OracleLinux_8_10                Oracle Linux 8.10</span><br><span class="line">OracleLinux_9_5                 Oracle Linux 9.5</span><br><span class="line"></span><br><span class="line">C:\Users\Vanilla&gt;wsl --install Ubuntu<span class="string">-22</span>.04</span><br><span class="line">wsl: 使用旧分发注册。请考虑改用基于 tar 的分发。</span><br><span class="line">正在下载: Ubuntu 22.04 LTS</span><br><span class="line">……</span><br></pre></td></tr></table></figure><p>如果下载的很慢或者一直卡在<code>0.0%</code>，可以加上参数<code>--web-download</code>或者搜索其他的解决方法。</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">wsl</span> --install Ubuntu-<span class="number">22</span>.<span class="number">04</span> --web-download</span><br></pre></td></tr></table></figure><h3 id="设置用户信息"><a href="#设置用户信息" class="headerlink" title="设置用户信息"></a>设置用户信息</h3><p>在下载安装完成之后，会自动启动WSL，并让你输入用户名：</p><figure class="highlight actionscript"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">Enter <span class="keyword">new</span> UNIX username:</span><br></pre></td></tr></table></figure><p>用户名的要求是<code>^[a-z][-a-z0-9]*\$</code>，即第一个字符必须为小写字母，之后可以为小写字母、数字和<code>-</code>。</p><p>之后会要求输入密码：</p><figure class="highlight ada"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">New</span> password:</span><br><span class="line">Retype <span class="keyword">new</span> password:</span><br></pre></td></tr></table></figure><p>可使用<code>passwd</code>以修改或重置密码。</p><h3 id="更新和升级软件包"><a href="#更新和升级软件包" class="headerlink" title="更新和升级软件包"></a>更新和升级软件包</h3><p>正如使用Ubuntu一样：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update &amp;&amp; <span class="built_in">sudo</span> apt upgrade</span><br></pre></td></tr></table></figure><p>就像使用linux一样，WSL不会自动更新软件，需要我们自行控制。</p><h2 id="使用镜像网络模式"><a href="#使用镜像网络模式" class="headerlink" title="使用镜像网络模式"></a>使用镜像网络模式</h2><p><code>Mirrored</code>相比于<code>Nat</code>，支持<code>IPv6</code>等高级功能，并可以直接访问局域网中的网络应用程序，实现真正的“双W合一”（开个玩笑。指Windows和WSL合为一体）<del>，并且也方便配置代理</del>。</p><h3 id="设置镜像模式"><a href="#设置镜像模式" class="headerlink" title="设置镜像模式"></a>设置镜像模式</h3><p>打开<code>WSL Settings</code>，<code>网络</code>，将<code>网络模式</code>的<code>Nat</code>改为<code>Mirrored</code>，并启动下面的<code>主机地址回环</code>选项。</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250918-004935-51511.png" alt=""></p><p>重启WSL：</p><figure class="highlight ada"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">wsl <span class="comment">--shutdown</span></span><br><span class="line">wsl</span><br></pre></td></tr></table></figure><h3 id="配置代理"><a href="#配置代理" class="headerlink" title="配置代理"></a>配置代理</h3><p>想必之前你已经注意到很多次这句话了：</p><figure class="highlight avrasm"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="symbol">wsl:</span> 检测到 localhost 代理配置，但未镜像到 WSL。NAT 模式下的 WSL 不支持 localhost 代理。</span><br></pre></td></tr></table></figure><p>而镜像模式可以很顺利的解决这个问题。</p><p>在<code>~</code>用户目录下创建两个文件，分别代表启动和关闭代理。</p><p>创建<code>.proxy_on</code>脚本：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">nano ~/.proxy_on</span><br></pre></td></tr></table></figure><p>然后写入：</p><figure class="highlight routeros"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">PORT</span>=<span class="string">&quot;<span class="variable">$&#123;PORT:-7897&#125;</span>&quot;</span>; <span class="attribute">HOST</span>=<span class="string">&quot;<span class="variable">$&#123;HOST:-127.0.0.1&#125;</span>&quot;</span>; <span class="attribute">URL</span>=<span class="string">&quot;http://<span class="variable">$HOST</span>:<span class="variable">$PORT</span>&quot;</span></span><br><span class="line"><span class="built_in">export</span> <span class="attribute">http_proxy</span>=<span class="string">&quot;<span class="variable">$URL&lt;/span&gt;&amp;quot;&lt;/span&gt;; &lt;span class="built_in"&gt;export&lt;/span&gt; &lt;span class="attribute"&gt;https_proxy&lt;/span&gt;=&lt;span class="string"&gt;&amp;quot;&lt;span class="variable"&gt;$URL</span>&quot;</span>; <span class="built_in">export</span> <span class="attribute">all_proxy</span>=<span class="string">&quot;<span class="variable">$URL&lt;/span&gt;&amp;quot;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;&lt;span class="built_in"&gt;export&lt;/span&gt; &lt;span class="attribute"&gt;HTTP_PROXY&lt;/span&gt;=&lt;span class="string"&gt;&amp;quot;&lt;span class="variable"&gt;$URL</span>&quot;</span>; <span class="built_in">export</span> <span class="attribute">HTTPS_PROXY</span>=<span class="string">&quot;<span class="variable">$URL&lt;/span&gt;&amp;quot;&lt;/span&gt;; &lt;span class="built_in"&gt;export&lt;/span&gt; &lt;span class="attribute"&gt;ALL_PROXY&lt;/span&gt;=&lt;span class="string"&gt;&amp;quot;&lt;span class="variable"&gt;$URL</span>&quot;</span></span><br><span class="line"><span class="built_in">export</span> <span class="attribute">no_proxy</span>=<span class="string">&quot;localhost,127.0.0.1,::1,10.0.0.0/8,172.16.0.0/12,192.168.0.0/16&quot;</span></span><br><span class="line"><span class="built_in">export</span> <span class="attribute">NO_PROXY</span>=<span class="string">&quot;<span class="variable">$no_proxy&lt;/span&gt;&amp;quot;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;git&lt;span class="built_in"&gt; config &lt;/span&gt;--global http.proxy  &lt;span class="string"&gt;&amp;quot;&lt;span class="variable"&gt;$URL</span>&quot;</span></span><br><span class="line">git<span class="built_in"> config </span>--global https.proxy <span class="string">&quot;<span class="variable">$URL&lt;/span&gt;&amp;quot;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;echo &lt;span class="string"&gt;&amp;quot;[proxy_on] -&amp;gt; &lt;span class="variable"&gt;$URL</span>&quot;</span></span><br></pre></td></tr></table></figure><p>同理，创建<code>.proxy_off</code>：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">nano ~/.proxy_off</span><br></pre></td></tr></table></figure><p>写入：</p><figure class="highlight jboss-cli"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">unset</span> http_proxy https_proxy all_proxy HTTP_PROXY HTTPS_PROXY ALL_PROXY no_proxy NO_PROXY</span><br><span class="line">git config <span class="params">--global</span> <span class="params">--unset</span> http.proxy  2&gt;<span class="string">/dev/null</span> || <span class="literal">true</span></span><br><span class="line">git config <span class="params">--global</span> <span class="params">--unset</span> https.proxy 2&gt;<span class="string">/dev/null</span> || <span class="literal">true</span></span><br><span class="line"><span class="keyword">echo</span> <span class="string">&quot;[proxy_off] done&quot;</span></span><br></pre></td></tr></table></figure><p>修改bash配置文件，设置指令别名:</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line">nano ~/.bashrc</span><br><span class="line"><span class="comment"># 添加下面两行</span></span><br><span class="line"><span class="built_in">alias</span> proxyon=<span class="string">&#x27;source ~/.proxy_on&#x27;</span></span><br><span class="line"><span class="built_in">alias</span> proxyoff=<span class="string">&#x27;source ~/.proxy_off&#x27;</span></span><br></pre></td></tr></table></figure><p>刷新配置文件：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">source</span> ~/.bashrc</span><br></pre></td></tr></table></figure><p>之后，使用<code>proxyon</code>和<code>proxyoff</code>控制代理的启动与停止。</p><h2 id="配置ssh"><a href="#配置ssh" class="headerlink" title="配置ssh"></a>配置ssh</h2><h3 id="安装OpenSSH-Server并修改端口"><a href="#安装OpenSSH-Server并修改端口" class="headerlink" title="安装OpenSSH-Server并修改端口"></a>安装OpenSSH-Server并修改端口</h3><p>检查<code>sudo nano /etc/wsl.conf</code>内存在：</p><figure class="highlight ini"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="section">[boot]</span></span><br><span class="line"><span class="attr">systemd</span>=<span class="literal">true</span></span><br></pre></td></tr></table></figure><p>确保启动了systemd，方便使用systemctl。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update</span><br><span class="line"><span class="built_in">sudo</span> apt install -y openssh-server</span><br><span class="line"><span class="built_in">sudo</span> systemctl <span class="built_in">enable</span> ssh</span><br><span class="line"><span class="built_in">sudo</span> systemctl start ssh</span><br><span class="line"><span class="built_in">sudo</span> systemctl status ssh</span><br></pre></td></tr></table></figure><p>最后一步可能是<code>active (running)</code>，也可能是<code>fail</code>和显示22端口占用的报错。这就是因为windows的ssh服务器正在使用22端口，导致了这种情况。需要手动修改WSL的ssh服务器端口。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> nano /etc/ssh/sshd_config</span><br></pre></td></tr></table></figure><p>找到<code>#Port 22</code>修改为<code>Port xxxxx</code>（取消注释，修改为自己喜欢的端口）</p><p>应用变更：</p><figure class="highlight dts"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">sudo systemctl restart ssh</span><br><span class="line">sudo systemctl status ssh</span><br><span class="line"></span><br><span class="line">● ssh.service - OpenBSD Secure Shell server</span><br><span class="line"><span class="symbol">     Loaded:</span> loaded (<span class="keyword">/lib/</span>systemd<span class="keyword">/system/</span>ssh.<span class="attr">service</span><span class="punctuation">;</span> <span class="attr">enabled</span><span class="punctuation">;</span> vendor preset: enabled)</span><br><span class="line"><span class="symbol">     Active:</span> active (running) since Thu <span class="number">2025</span><span class="number">-09</span><span class="number">-18</span> <span class="number">01</span>:<span class="number">05</span>:<span class="number">29</span> CST<span class="punctuation">;</span> <span class="number">4</span>s ago</span><br></pre></td></tr></table></figure><p>现在应该能够看到绿色的<code>active (running)</code>了。</p><p>同时，也可以在windows命令行内成功连接了：</p><figure class="highlight nginx"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">ssh</span> USENAME@<span class="number">127.0.0.1</span> -p xxxxx</span><br></pre></td></tr></table></figure><h3 id="配置免密"><a href="#配置免密" class="headerlink" title="配置免密"></a>配置免密</h3><p>在Windows命令行中使用<code>ssh-copy-id</code>传输密钥：</p><figure class="highlight applescript"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">ssh-<span class="keyword">copy</span>-<span class="built_in">id</span> -p xxxxx USERNAME@<span class="number">127.0</span><span class="number">.0</span><span class="number">.1</span></span><br></pre></td></tr></table></figure><p>如果显示不存在该指令，可参考<a href="https://www.cnblogs.com/zhouzhihao/p/17087666.html">解决：powershell无法使用ssh-copy-id命令</a>，使用power shell进行配置。</p><p>启动power shell，输入：</p><figure class="highlight powershell"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">function</span> <span class="title">ssh-copy-id</span><span class="params">([string]<span class="variable">$userAtMachine</span>, <span class="variable">$args</span>)</span></span>&#123;   </span><br><span class="line">    <span class="variable">$publicKey</span> = <span class="string">&quot;<span class="variable">$ENV:USERPROFILE</span>&quot;</span> + <span class="string">&quot;/.ssh/id_rsa.pub&quot;</span></span><br><span class="line">    <span class="keyword">if</span> (!(<span class="built_in">Test-Path</span> <span class="string">&quot;<span class="variable">$publicKey&lt;/span&gt;&amp;quot;&lt;/span&gt;))&amp;#123;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;        &lt;span class="built_in"&gt;Write-Error&lt;/span&gt; &lt;span class="string"&gt;&amp;quot;ERROR: failed to open ID file &amp;#x27;&lt;span class="variable"&gt;$publicKey</span>&#x27;: No such file&quot;</span>            </span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">else</span> &#123;</span><br><span class="line">        &amp; <span class="built_in">cat</span> <span class="string">&quot;<span class="variable">$publicKey</span>&quot;</span> | ssh <span class="variable">$args</span> <span class="variable">$userAtMachine</span> <span class="string">&quot;umask 077; test -d .ssh || mkdir .ssh ; cat &gt;&gt; .ssh/authorized_keys || exit 1&quot;</span>      </span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>然后再使用<code>ssh-copy-id</code>传输密钥即可。</p><h3 id="局域网访问"><a href="#局域网访问" class="headerlink" title="局域网访问"></a>局域网访问</h3><p>打开windows的防火墙设置，手动配置入站规则。</p><p>或者以管理员模式启动power shell，输入：</p><figure class="highlight sqf"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">New-NetFirewallRule -DisplayName <span class="string">&quot;WSL SSH xxxxx&quot;</span> -<span class="built_in">Direction</span> Inbound -Protocol TCP -LocalPort xxxxx -<span class="built_in">Action</span> Allow -Profile <span class="keyword">Private</span></span><br></pre></td></tr></table></figure><p>（注意修改端口号）</p><h2 id="WSL常驻后台与开机自启动"><a href="#WSL常驻后台与开机自启动" class="headerlink" title="WSL常驻后台与开机自启动"></a>WSL常驻后台与开机自启动</h2><h3 id="后台常驻"><a href="#后台常驻" class="headerlink" title="后台常驻"></a>后台常驻</h3><p>当关闭终端的时候，WSL会自动关闭。这一点对于本地使用WSL无伤大雅——下次要用的时候输入<code>wsl</code>即可很快的开启。但是对于远程ssh使用，就比较不友好了。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">wsl --<span class="built_in">exec</span> dbus-launch <span class="literal">true</span></span><br></pre></td></tr></table></figure><h3 id="开机自启动"><a href="#开机自启动" class="headerlink" title="开机自启动"></a>开机自启动</h3><p>同理，根据<a href="https://zhuanlan.zhihu.com/p/1929539004044390932">Windows 11 开机自动启动 WSL 并实现局域网访问与迁移（Ubuntu-22.04 为例）</a>，我们可以在windows的任务计划程序中创建任务。</p><ol><li>常规标签页<ul><li>名称：AutoStart WSL</li><li>勾选：使用最高权限运行</li></ul></li><li>触发器<ul><li>新建触发器，开始任务设置为”登录时“</li></ul></li><li>操作<ul><li>程序填写：<code>wsl.exe</code></li><li>添加参数：<code>--exec dbus-launch true</code></li></ul></li><li>条件<ul><li>取消所有勾选</li></ul></li><li>设置<ul><li>勾选”允许按需允许“</li><li>勾选”错过时尽快允许“</li><li>勾选”如果任务失败，按以下频率重新启动“</li><li>取消勾选”如果……停止任务“</li></ul></li></ol><p>然后点击确定。</p><p>尝试重启windows系统，开机后直接尝试ssh连接，如果能够连接成功，说明wsl自启动设置成功，且能够保持后台运行。</p><h2 id="安装nvidia-utils"><a href="#安装nvidia-utils" class="headerlink" title="安装nvidia-utils"></a>安装nvidia-utils</h2><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update</span><br><span class="line"><span class="built_in">sudo</span> apt install -y nvidia-utils-570 </span><br><span class="line">nvidia-smi</span><br></pre></td></tr></table></figure><h2 id="安装CUDA-Toolkit"><a href="#安装CUDA-Toolkit" class="headerlink" title="安装CUDA Toolkit"></a>安装CUDA Toolkit</h2><p><strong>非必须。如果只是跑pytorch，在pytorch安装时就够了，不需要完整的CUDA Toolkit.</strong></p><p><a href="https://developer.nvidia.com/cuda-downloads">CUDA Toolkit 13.0 Update 1 Downloads | NVIDIA Developer</a></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250918-024905-46781.png" alt=""></p><p>注意选择<code>WSL-Ubuntu</code>。然后跟着下面的<code>Installation Instructions</code>运行即可。</p><p>配置环境变量：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">nano ~/.bashrc</span><br></pre></td></tr></table></figure><p>写入：</p><figure class="highlight routeros"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">export</span> <span class="attribute">PATH</span>=/usr/local/cuda/bin:$PATH&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;&lt;span class="built_in"&gt;export&lt;/span&gt; &lt;span class="attribute"&gt;LD_LIBRARY_PATH&lt;/span&gt;=/usr/local/cuda/lib64:$LD_LIBRARY_PAT</span><br></pre></td></tr></table></figure><p>export LD_LIBRARY_PATH=/usr/local/cuda/lib64:$LD_LIBRARY_PATH<br>并刷新环境：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">source</span> ~/.bashrc</span><br></pre></td></tr></table></figure><p>此时运行<code>nvcc -V</code>，会有输出：</p><figure class="highlight dart"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line">(<span class="keyword">base</span>) USERNAME<span class="meta">@NAME</span>:~$ nvcc -V</span><br><span class="line">nvcc: NVIDIA (R) Cuda compiler driver</span><br><span class="line">Copyright (c) <span class="number">2005</span><span class="number">-2025</span> NVIDIA Corporation</span><br><span class="line">Built <span class="keyword">on</span> Wed_Aug_20_01:<span class="number">58</span>:<span class="number">59</span>_PM_PDT_2025</span><br><span class="line">Cuda compilation tools, release <span class="number">13.0</span>, V13<span class="number">.0</span><span class="number">.88</span></span><br><span class="line">Build cuda_13<span class="number">.0</span>.r13<span class="number">.0</span>/compiler<span class="number">.36424714</span>_0</span><br></pre></td></tr></table></figure><h2 id="配置Anaconda"><a href="#配置Anaconda" class="headerlink" title="配置Anaconda"></a>配置Anaconda</h2><p>这里为了轻量化，使用Miniconda。</p><p>首先在官网上下载安装包，这里下载到的是<code>Miniconda3-latest-Linux-x86_64.sh</code>。并上传至<code>~</code>路径下。</p><p>然后安装：</p><figure class="highlight llvm"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">bash Miniconda<span class="number">3</span>-latest-Linux-<span class="keyword">x</span><span class="number">86</span>_<span class="number">64</span>.sh</span><br></pre></td></tr></table></figure><ol><li><code>yes</code>同意条款；</li><li>安装到<code>/home/USERNAME/miniconda3</code>；</li><li><code>yes</code>启动每次终端自动激活<code>(base)</code>。可用<code>conda init --reverse $SHELL</code>取消。</li></ol><p>安装完毕之后重启终端或执行：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">source</span> ~/.bashrc</span><br></pre></td></tr></table></figure><h3 id="配置pytorch-gpu环境"><a href="#配置pytorch-gpu环境" class="headerlink" title="配置pytorch_gpu环境"></a>配置pytorch_gpu环境</h3><p>测试cuda：</p><figure class="highlight ebnf"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">nvcc -V</span></span><br></pre></td></tr></table></figure><p>并记住cuda版本号。</p><p>新建虚拟环境：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">conda</span> create -n torch_env python=<span class="number">3</span>.<span class="number">13</span></span><br><span class="line"><span class="attribute">conda</span> activate torch_env</span><br></pre></td></tr></table></figure><p>安装<a href="https://pytorch.org/">PyTorch</a>，注意选择对应的cuda版本：</p><figure class="highlight cmake"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">pip3 <span class="keyword">install</span> torch torchvision</span><br></pre></td></tr></table></figure><p>测试pytorch与cuda：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">import</span> torch</span><br><span class="line"><span class="built_in">print</span>(<span class="string">&quot;Built with CUDA:&quot;</span>, torch.version.cuda) <span class="comment"># e.g. 12.4</span></span><br><span class="line"><span class="built_in">print</span>(<span class="string">&quot;CUDA available:&quot;</span>, torch.cuda.is_available()) <span class="comment"># 测试库是否支持载入cuda，期望True</span></span><br><span class="line"><span class="built_in">print</span>(<span class="string">&quot;Device count:&quot;</span>, torch.cuda.device_count()) <span class="comment"># 这里应 &gt;0</span></span><br></pre></td></tr></table></figure><p>小型压测：</p><figure class="highlight stylus"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br></pre></td><td class="code"><pre><span class="line">python - &lt;&lt;<span class="string">&#x27;PY&#x27;</span></span><br><span class="line">import torch, <span class="selector-tag">time</span></span><br><span class="line">device = <span class="string">&#x27;cuda&#x27;</span> <span class="keyword">if</span> torch<span class="selector-class">.cuda</span><span class="selector-class">.is_available</span>() <span class="keyword">else</span> <span class="string">&#x27;cpu&#x27;</span></span><br><span class="line"><span class="selector-tag">a</span> = torch<span class="selector-class">.randn</span>(<span class="number">8192</span>,<span class="number">8192</span>, device=device)</span><br><span class="line"><span class="selector-tag">b</span> = torch<span class="selector-class">.randn</span>(<span class="number">8192</span>,<span class="number">8192</span>, device=device)</span><br><span class="line">torch<span class="selector-class">.cuda</span><span class="selector-class">.synchronize</span>() <span class="keyword">if</span> device==<span class="string">&#x27;cuda&#x27;</span> <span class="keyword">else</span> None</span><br><span class="line">t0 = <span class="selector-tag">time</span><span class="selector-class">.time</span>()</span><br><span class="line">c = <span class="selector-tag">a</span> @ <span class="selector-tag">b</span></span><br><span class="line">torch<span class="selector-class">.cuda</span><span class="selector-class">.synchronize</span>() <span class="keyword">if</span> device==<span class="string">&#x27;cuda&#x27;</span> <span class="keyword">else</span> None</span><br><span class="line"><span class="function"><span class="title">print</span><span class="params">(device, <span class="string">&quot;gemm time:&quot;</span>, time.time()</span></span>-t0, <span class="string">&quot;s&quot;</span>)</span><br><span class="line">PY</span><br></pre></td></tr></table></figure><p>输出：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">cuda</span> gemm time: <span class="number">0</span>.<span class="number">10652017593383789</span> s</span><br><span class="line"><span class="attribute">cpu</span> gemm time: <span class="number">1</span>.<span class="number">7230277061462402</span> s # 自行调整一下上面的if语句即可得到纯cpu耗时</span><br></pre></td></tr></table></figure><h3 id="安装nvitop"><a href="#安装nvitop" class="headerlink" title="安装nvitop"></a>安装nvitop</h3><figure class="highlight ada"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">pip3 install <span class="comment">--upgrade nvitop</span></span><br><span class="line">nvitop</span><br></pre></td></tr></table></figure><p>需要注意的是，这个是跟着环境走的（？）。也就是说可能每个虚拟环境都需要安装一次。不过通常在<code>(base)</code>中安装就足够了。</p><h2 id="参考文献"><a href="#参考文献" class="headerlink" title="参考文献"></a>参考文献</h2><p><a href="https://learn.microsoft.com/zh-cn/windows/wsl/install">安装 WSL | Microsoft Learn</a></p><p>微软提高的WSL安装手册。</p><p><a href="https://learn.microsoft.com/zh-cn/windows/wsl/setup/environment">设置 WSL 开发环境 | Microsoft Learn</a></p><p>微软提供的WSL配置手册，内容包括设置用户名和密码，使用基本 WSL 命令，安装和自定义 Windows 终端，为 Git 版本控制、代码编辑和调试使用 VS Code 远程服务器，好的文件存储实践，设置数据库，装载外部驱动器，设置 GPU 加速等。</p><p><a href="https://www.bilibili.com/opus/989978313838559256">WSL Install (适用于windows的Linux子系统)下载速度提升 - 哔哩哔哩</a></p><p>wsl下载加速方法（评论区有很多）。</p><p><a href="https://github.com/microsoft/WSL/issues/10138#issuecomment-1593856698">aki-k 的评论：一种使wsl在退出后依然运行的方法</a></p><p>在issue中有人给出的一行指令解决该问题。</p><p><del><a href="https://github.com/gardengim/keepwsl">gardengim/keepwsl: A simple service to keep WSL alive</a></del></p><p>一个使WSL持续运行的脚本。</p><p><a href="https://zhuanlan.zhihu.com/p/1929539004044390932">Windows 11 开机自动启动 WSL 并实现局域网访问与迁移（Ubuntu-22.04 为例） - 知乎</a></p><p>在win11任务计划程序中创建一个登录时触发的任务，使WSL开机自启动。</p><p><a href="https://learn.microsoft.com/zh-cn/windows/wsl/networking#mirrored-mode-networking">使用 WSL 访问网络应用程序 | Microsoft Learn</a></p><p>镜像模式网络。</p><p><a href="https://www.cnblogs.com/zhouzhihao/p/17087666.html">解决：powershell无法使用ssh-copy-id命令 - octal_zhihao - 博客园</a></p><p>一个函数解决powershell使用ssh-copy-id命令。</p><p><a href="https://www.anaconda.com/download/success">Download Success | Anaconda</a></p><p>Anaconda/Miniconda下载地址。</p><p><a href="https://zhuanlan.zhihu.com/p/488731878">win10/11下wsl2安装gpu版的pytorch（避坑指南） - 知乎</a></p><p>讲述了如何安装cpu/gpu版本的cuda并配置pytorch环境。</p><p><a href="https://zhuanlan.zhihu.com/p/614024375">nvitop: 史上最强GPU性能实时监测工具 - 知乎</a></p><p>讲述了如何简单的安装与使用nvitop</p><p><a href="https://learn.microsoft.com/zh-cn/windows/wsl/tutorials/wsl-containers">WSL 上的 Docker 容器入门 | Microsoft Learn</a></p><p>微软提供的WSL+Docker配置指南。</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/12/16/WSL2-Install-Guide/</id>
    <link href="https://blog.vanilla-chan.cn/2025/12/16/WSL2-Install-Guide/"/>
    <published>2025-12-16T08:42:27.000Z</published>
    <summary>对于一台从未安装过wsl的win11系统，在命令行中输入 wsl --install 即可开始安装。</summary>
    <title>WSL2安装教程</title>
    <updated>2025-12-16T08:42:27.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Linux" scheme="https://blog.vanilla-chan.cn/tags/Linux/"/>
    <category term="frp" scheme="https://blog.vanilla-chan.cn/tags/frp/"/>
    <content>
      <![CDATA[<h2 id="相关软件"><a href="#相关软件" class="headerlink" title="相关软件"></a>相关软件</h2><p><a href="https://github.com/fatedier/frp">fatedier/frp: A fast reverse proxy to help you expose a local server behind a NAT or firewall to the internet.</a></p><p><a href="https://github.com/fatedier/frp/releases/tag/v0.64.0">Release v0.64.0 · fatedier/frp</a></p><p><a href="https://github.com/koho/frpmgr">koho/frpmgr: A user-friendly desktop GUI client for FRP on Windows.</a></p><p><a href="https://github.com/koho/frpmgr/releases/tag/v1.24.0">Release v1.24.0 · koho/frpmgr</a></p><h2 id="Linux服务器配置frps"><a href="#Linux服务器配置frps" class="headerlink" title="Linux服务器配置frps"></a>Linux服务器配置frps</h2><h3 id="准备压缩包"><a href="#准备压缩包" class="headerlink" title="准备压缩包"></a>准备压缩包</h3><p>在<a href="https://github.com/fatedier/frp/releases/tag/v0.64.0">Release v0.64.0 · fatedier/frp</a>中找到linux版本的压缩包，下载并上传至服务器上。</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250916-232004-96762.png" alt=""></p><p>或者直接在服务器上下载：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">wget</span> -c https://github.com/fatedier/frp/releases/download/v0.<span class="number">64</span>.<span class="number">0</span>/frp_0.<span class="number">64</span>.<span class="number">0</span>_linux_amd64.tar.gz</span><br></pre></td></tr></table></figure><p>然后解压：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">tar</span> -zxvf frp_0.<span class="number">64</span>.<span class="number">0</span>_linux_amd64.tar.gz</span><br></pre></td></tr></table></figure><p>会产生一个名为<code>frp_0.64.0_linux_amd64</code>的文件夹。</p><p>接下来为了方便操作，将文件夹重命名为<code>frp</code>：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">mv</span> frp_0.<span class="number">64</span>.<span class="number">0</span>_linux_amd64 frp</span><br><span class="line"><span class="attribute">cd</span> frp</span><br></pre></td></tr></table></figure><h3 id="修改frps配置"><a href="#修改frps配置" class="headerlink" title="修改frps配置"></a>修改frps配置</h3><p>在frp文件夹中，需要利用到两个文件：服务端<code>frps</code>和服务端配置<code>frps.toml</code>。</p><figure class="highlight nginx"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">nano</span> frps.toml</span><br></pre></td></tr></table></figure><p>这里展示一份简单的模板：</p><figure class="highlight ini"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="attr">bindPort</span> = <span class="number">1</span>xxxx <span class="comment"># 监听端口</span></span><br><span class="line"><span class="attr">auth.method</span> = <span class="string">&quot;token&quot;</span> <span class="comment"># 验证方式</span></span><br><span class="line"><span class="attr">auth.token</span> = <span class="string">&quot;xxxxxxxx&quot;</span> <span class="comment"># 填写token</span></span><br><span class="line"><span class="attr">transport.tls.force</span> = <span class="literal">false</span> <span class="comment"># 是否强制tls</span></span><br></pre></td></tr></table></figure><p>将其粘贴并修改，<code>Ctrl+X</code>保存。</p><h3 id="配置systemctl自启动"><a href="#配置systemctl自启动" class="headerlink" title="配置systemctl自启动"></a>配置systemctl自启动</h3><p>安全存放<code>frps</code>与<code>frps.toml</code></p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">cp</span> frps /usr/bin</span><br><span class="line"><span class="built_in">mkdir</span> /etc/frp</span><br><span class="line"><span class="built_in">cp</span> frps.toml /etc/frp</span><br></pre></td></tr></table></figure><p>设置自启动配置文件</p><figure class="highlight awk"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">nano <span class="regexp">/etc/</span>systemd<span class="regexp">/system/</span>frps.service</span><br></pre></td></tr></table></figure><p>写入如下内容</p><figure class="highlight ini"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line"><span class="section">[Unit]</span></span><br><span class="line"><span class="attr">Description</span>=My Frp Client Service - %i</span><br><span class="line"><span class="attr">After</span>=network.target syslog.target</span><br><span class="line"><span class="attr">Wants</span>=network.target</span><br><span class="line"></span><br><span class="line"><span class="section">[Service]</span></span><br><span class="line"><span class="attr">Type</span>=simple</span><br><span class="line"><span class="attr">Restart</span>=<span class="literal">on</span>-failure</span><br><span class="line"><span class="attr">RestartSec</span>=<span class="number">2</span>s</span><br><span class="line"><span class="attr">ExecStart</span>=/bin/bash -c <span class="string">&#x27;frps -c /etc/frp/frps.toml&#x27;</span></span><br><span class="line"></span><br><span class="line"><span class="section">[Install]</span></span><br><span class="line"><span class="attr">WantedBy</span>=multi-user.target                         </span><br></pre></td></tr></table></figure><p>启动</p><figure class="highlight nsis"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="params">system</span>ctl start frps</span><br><span class="line"><span class="params">system</span>ctl enable frps</span><br></pre></td></tr></table></figure><p>其他相关的检测指令</p><figure class="highlight nsis"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># 服务是否在跑</span></span><br><span class="line"><span class="params">system</span>ctl is-active frps</span><br><span class="line"></span><br><span class="line"><span class="comment"># 展示systemctl加载的service文件</span></span><br><span class="line"><span class="params">system</span>ctl cat frps</span><br><span class="line"></span><br><span class="line"><span class="comment"># 修改service后重新读取并重启frps</span></span><br><span class="line"><span class="params">system</span>ctl daemon-reload</span><br><span class="line"><span class="params">system</span>ctl restart frps</span><br><span class="line"></span><br><span class="line"><span class="comment"># 详细状态（打印日志）</span></span><br><span class="line"><span class="params">system</span>ctl --no-pager -l status frps</span><br><span class="line"></span><br><span class="line"><span class="comment"># 本次启动以来的关键日志</span></span><br><span class="line">journalctl -u frps -b --no-pager -n <span class="number">100</span></span><br></pre></td></tr></table></figure><p>其中，最后一条指令可能可以看到类似下面的内容：</p><figure class="highlight dns"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line">Sep <span class="number">16 16:40:09</span> bash[<span class="number">2486553</span>]: <span class="number">2025-09-16</span> <span class="number">16:40:09.218</span> [I] [frps/root.go:<span class="number">108</span>] frps uses config file: /etc/frp/frps.toml</span><br><span class="line">Sep <span class="number">16 16:40:09</span> bash[<span class="number">2486553</span>]: <span class="number">2025-09-16</span> <span class="number">16</span>:<span class="number">40:09.630</span> [I] [server/service.go:<span class="number">237</span>] frps tcp listen on <span class="number">0.0.0.0</span>:<span class="number">1</span>xxxx</span><br><span class="line">Sep <span class="number">16 16:40:09</span> bash[<span class="number">2486553</span>]: <span class="number">2025-09-16</span> <span class="number">16</span>:<span class="number">40:09.631</span> [I] [frps/root.go:<span class="number">117</span>] frps started successfully</span><br><span class="line">Sep <span class="number">16 16:40:10</span> bash[<span class="number">2486553</span>]: <span class="number">2025-09-16</span> <span class="number">16:40:10.147</span> [I] [server/service.go:<span class="number">582</span>] [a7347aa<span class="number">17447b173</span>] client login info: ip [<span class="number">183.247.9.41</span>:<span class="number">9962</span>] version [<span class="number">0</span>.<span class="number">64</span>.<span class="number">0</span>] hostname [] os [windows] arch [amd64]</span><br></pre></td></tr></table></figure><p>至此，<code>frps</code>配置完毕。</p><h2 id="Windows安装FRP管理器"><a href="#Windows安装FRP管理器" class="headerlink" title="Windows安装FRP管理器"></a>Windows安装FRP管理器</h2><p>虽然固然本地可以使用windows版的frpc启动frp，但是如果有多个端口需要映射到多台服务器上，并还需要稳定运行、断线重连，那么就需要一个稳定的frp管理器了。</p><h3 id="安装frpmgr"><a href="#安装frpmgr" class="headerlink" title="安装frpmgr"></a>安装frpmgr</h3><p>本文以<a href="https://github.com/koho/frpmgr/releases/tag/v1.24.0">Release v1.24.0 · koho/frpmgr</a>为例：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-003552-11053.png" alt=""></p><p>frpmgr在安装好了之后会随着系统启动而启动，并且没有托盘图标。如果要修改配置，可启动<code>FRP 管理器</code>进行修改。</p><h3 id="配置frpmgr"><a href="#配置frpmgr" class="headerlink" title="配置frpmgr"></a>配置frpmgr</h3><p>点击左下角的<code>新建配置</code>：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-004012-99165.png" alt=""></p><p>在<code>基本</code>中填入<code>服务器的名称</code>、<code>服务器的ip地址</code>、<code>服务器监听的端口</code>：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-004306-78735.png" alt=""></p><p>其中，服务器监听端口就是之前在<code>frps.toml</code>里面填的<code>bindPort</code>。</p><p>在<code>认证</code>中选择<code>Token</code>并填入<code>令牌</code>：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-004636-65955.png" alt=""></p><p>其中，<code>令牌</code>是之前在<code>frps.toml</code>中填写的<code>auth.token</code>。</p><h3 id="添加连接"><a href="#添加连接" class="headerlink" title="添加连接"></a>添加连接</h3><p>点击<code>添加</code>：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-004944-47783.png" alt=""></p><p>填写<code>新建代理</code>的<code>名称</code>、<code>本地端口</code>、<code>远程端口</code>：</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-005605-68739.png" alt=""></p><p>点击确定，看到这条连接前面的勾变为绿色，说明代理建立成功。</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250917-011907-10001.png" alt=""></p><p>通常，类型选择<code>tcp</code>足够用了。</p><p>特别地，对于<code>rdp</code>，如果想尝试一下走<code>udp</code>传输数据，可以试试<strong>在添加<code>3389</code>端口<code>tcp</code>的代理后</strong>，同理添加一条<code>3389</code>端口<code>udp</code>协议的代理。</p><p>浅浅测试下，走<code>udp</code>有可能可以降低延迟，但是貌似会导致画面传输的稳定性变差……？感兴趣的朋友可以试一试。</p><h2 id="参考文献"><a href="#参考文献" class="headerlink" title="参考文献"></a>参考文献</h2><p><a href="https://blog.csdn.net/airenKKK/article/details/127660989">公网访问内网中Wsl2服务器（借助frp）_公网访问wsl2服务-CSDN博客</a></p><p>讲述了如何配置frp服务器及systemctl配置（service脚本在其基础上修改），但基于<code>v0.45.0</code>版本，采用<code>.ini</code>配置文件，未配置<code>token</code>，不够安全。</p><p><a href="https://blog.hoshiroko.com/archives/37f497acabc8/">Frp 0.52及以上版本的全系统保姆级教程(包含frps和frpc的搭建与使用) | Mint’s Blog</a></p><p>基于<code>v0.52.0</code>版本的frp配置，采用<code>.toml</code>配置文件，但部分配置参数有所变动。</p><p><a href="https://zhuanlan.zhihu.com/p/265171894">frp同时转发远程桌面的 TCP 和 UDP 端口 - 知乎</a></p><p>提到了使用rdp时使用udp会让移动操作更跟手，评论区有人提出直接添加一条3389的udp即可。</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/09/17/Linux-server-setup-FRP-and-configure-Token/</id>
    <link href="https://blog.vanilla-chan.cn/2025/09/17/Linux-server-setup-FRP-and-configure-Token/"/>
    <published>2025-09-16T17:20:08.000Z</published>
    <summary>Linux服务器部署0.64.0版本frp并配置systemctl，Windows安装frpmgr管理多服务器多连接。</summary>
    <title>Linux服务器部署FRP及配置Token</title>
    <updated>2025-09-16T17:20:08.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Linux" scheme="https://blog.vanilla-chan.cn/tags/Linux/"/>
    <category term="WSL" scheme="https://blog.vanilla-chan.cn/tags/WSL/"/>
    <category term="Ubuntu" scheme="https://blog.vanilla-chan.cn/tags/Ubuntu/"/>
    <content>
      <![CDATA[<h1 id="增加WSL虚拟硬盘大小"><a href="#增加WSL虚拟硬盘大小" class="headerlink" title="增加WSL虚拟硬盘大小"></a>增加WSL虚拟硬盘大小</h1><h2 id="绪言"><a href="#绪言" class="headerlink" title="绪言"></a>绪言</h2><p>今天在WSL上训练模型，训练到<code>Epoch [17/40]</code>时出现了</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">&quot;/home/xxx/anaconda3/envs/tjjm/lib/python3.12/site-packages/torch/serialization.py&quot;</span>, line <span class="number">784</span>, <span class="keyword">in</span> __exit__</span><br><span class="line"></span><br><span class="line">    <span class="variable language_">self</span>.file_like.write_end_of_file()</span><br><span class="line"></span><br><span class="line">RuntimeError: [enforce fail at inline_container.cc:<span class="number">626</span>] . unexpected pos <span class="number">35558976</span> vs <span class="number">35558864</span></span><br></pre></td></tr></table></figure><p>发现是保存模型权重文件时失败了。</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">(tjjm) xxx@xxx:~$ df -h</span><br><span class="line">Filesystem      Size  Used Avail Use% Mounted on</span><br><span class="line">drivers        1000G  871G  130G  <span class="number">88</span>% /usr/lib/WSL/drivers</span><br><span class="line">/dev/sdc        251G  239G     <span class="number">0</span> <span class="number">100</span>% /</span><br><span class="line">C:\            1000G  871G  130G  <span class="number">88</span>% /mnt/c</span><br></pre></td></tr></table></figure><p>发现是WSL硬盘满了。但是此时WSL所在的C盘仍然有空间。</p><p>查资料大概得知，大概是这么个回事。</p><span id="more"></span><h2 id="WSL的虚拟硬盘空间上限"><a href="#WSL的虚拟硬盘空间上限" class="headerlink" title="WSL的虚拟硬盘空间上限"></a>WSL的虚拟硬盘空间上限</h2><p>在创建WSL时，会根据WSL setting中设置的<code>默认VHD大小</code>配置WSL初始虚拟磁盘大小。</p><p>而这个WSL是从旧系统上迁移（复制）过来的，当时可能C盘只有256G，所以默认VHD大小就是256000MB，导致该WSL的硬盘总大小即为256000MB。</p><p>不过，其为256G的原因也有可能是<strong>早期 WSL 版本最大默认值可能设置为 512GB 或 256GB</strong>。</p><p>迁移到新系统上来之后，WSL的VHD大小并未发生改变。</p><p>今天保存模型时，刚好达到了256G了，所以<strong>即使此时C盘依然有剩余空间，WSL的文件系统也不会主动多占用，也就是<code>ext4.vhdx</code>不会继续扩容了</strong>。</p><h2 id="查询剩余空间"><a href="#查询剩余空间" class="headerlink" title="查询剩余空间"></a>查询剩余空间</h2><p>正如绪言中描述的那样：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">df</span> -h</span><br></pre></td></tr></table></figure><p>然后找到类似于：</p><figure class="highlight nsis"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">File</span><span class="params">system</span>      Size  Used Avail Use% Mounted <span class="literal">on</span></span><br><span class="line">/dev/sdx        <span class="number">251</span>G  <span class="number">239</span>G     <span class="number">0</span> <span class="number">100</span>% /</span><br></pre></td></tr></table></figure><p>的一行。其中，<code>x</code>可能是字母<code>abcde...</code>，不固定。</p><h2 id="WSL虚拟硬盘扩容"><a href="#WSL虚拟硬盘扩容" class="headerlink" title="WSL虚拟硬盘扩容"></a>WSL虚拟硬盘扩容</h2><p>分为自动扩容和手动扩容两种方法。自动扩容请参考参考文献的 <strong>使用 <code>wsl --manage</code> 扩展 VHD 大小</strong> 一节。本文主要记录手动扩容的过程。</p><h3 id="终止WSL"><a href="#终止WSL" class="headerlink" title="终止WSL"></a>终止WSL</h3><p>输入：</p><figure class="highlight stylus"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">wsl<span class="selector-class">.exe</span> <span class="attr">--shutdown</span></span><br></pre></td></tr></table></figure><p>即可终止所有正在运行的WSL。</p><p>输入：</p><figure class="highlight stylus"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">wsl<span class="selector-class">.exe</span> -l -v</span><br></pre></td></tr></table></figure><p>可查看WSL状态。</p><h3 id="diskpart选中ext4-vhdx"><a href="#diskpart选中ext4-vhdx" class="headerlink" title="diskpart选中ext4.vhdx"></a>diskpart选中ext4.vhdx</h3><p>找到WSL的虚拟磁盘文件。这一步可以使用软件Everything搜索<code>ext4.vhdx</code>实现快速找到。</p><p>复制<code>ext4.vhdx</code>的文件路径，备用。</p><p>在cmd并输入<code>diskpart</code>。此时命令行窗口左侧的prompt应当会变成<code>DISKPART&gt;</code>。</p><p>输入：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">Select vdisk file=<span class="string">&quot;&lt;pathToVHD&gt;&quot;</span></span><br></pre></td></tr></table></figure><p>以选择该虚拟磁盘文件。其中的<code>&lt;pathToVHD&gt;</code>需替换为之前的<code>ext4.vhdx</code>文件路径。</p><p>比如我的完整指令是：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">Select vdisk file=<span class="string">&quot;C:\Users\Vanilla\AppData\Local\Packages\CanonicalGroupLimited.Ubuntu22.04LTS_79rhkp1fndgsc\LocalState\ext4.vhdx&quot;</span></span><br></pre></td></tr></table></figure><p>此步骤期望输出：</p><figure class="highlight mipsasm"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">DiskPart </span>已成功选择虚拟磁盘文件。</span><br></pre></td></tr></table></figure><h3 id="diskpart查看磁盘相关信息"><a href="#diskpart查看磁盘相关信息" class="headerlink" title="diskpart查看磁盘相关信息"></a>diskpart查看磁盘相关信息</h3><figure class="highlight ebnf"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">detail vdisk</span></span><br></pre></td></tr></table></figure><p>其中应该会有：</p><figure class="highlight makefile"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="section">虚拟大小:  256 GB</span></span><br><span class="line"><span class="section">物理大小:  240 GB</span></span><br></pre></td></tr></table></figure><h3 id="diskpart修改虚拟磁盘大小"><a href="#diskpart修改虚拟磁盘大小" class="headerlink" title="diskpart修改虚拟磁盘大小"></a>diskpart修改虚拟磁盘大小</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">expand</span> vdisk maximum=&lt;sizeInMegaBytes&gt;</span><br></pre></td></tr></table></figure><p>其中的<code>&lt;sizeInMegaBytes&gt;</code>替换为你希望的虚拟磁盘调整后的大小。<strong>注意，单位是MB。比如我想扩容到320GB，则应该填写320000，后面不带单位。</strong>即：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">expand</span> vdisk maximum=320000</span><br></pre></td></tr></table></figure><p>修改完毕之后可以退出</p><figure class="highlight awk"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">exit</span></span><br></pre></td></tr></table></figure><h3 id="将扩容后的文件系统大小应用于WSL"><a href="#将扩容后的文件系统大小应用于WSL" class="headerlink" title="将扩容后的文件系统大小应用于WSL"></a>将扩容后的文件系统大小应用于WSL</h3><p>启动WSL</p><figure class="highlight ebnf"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">wsl</span></span><br></pre></td></tr></table></figure><p>让WSL知道它可以通过从WSL分发命令行运行这些命令来扩展此分发的文件系统大小</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> mount -t devtmpfs none /dev</span><br><span class="line">mount | grep ext4</span><br></pre></td></tr></table></figure><p>设置大小</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> resize2fs /dev/sdx &lt;sizeInMegabytes&gt;M</span><br></pre></td></tr></table></figure><p>其中，<code>x</code>是任意字符，与前文保持一致。<code>&lt;sizeInMegabytes&gt;</code>也与前文保持一致。<strong>注意，此处需要带上单位M</strong>。</p><p>最后使用<code>df -h</code>检验是否成功扩容。</p><h2 id="参考文献"><a href="#参考文献" class="headerlink" title="参考文献"></a>参考文献</h2><p><a href="https://learn.microsoft.com/zh-cn/windows/WSL/disk-space">如何管理 WSL 磁盘空间 | Microsoft Learn</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/07/23/Increase-WSL-VHD-Size/</id>
    <link href="https://blog.vanilla-chan.cn/2025/07/23/Increase-WSL-VHD-Size/"/>
    <published>2025-07-23T15:00:34.000Z</published>
    <summary>
      <![CDATA[<h1 id="增加WSL虚拟硬盘大小"><a href="#增加WSL虚拟硬盘大小" class="headerlink" title="增加WSL虚拟硬盘大小"></a>增加WSL虚拟硬盘大小</h1><h2 id="绪言"><a href="#绪言" class="headerlink" title="绪言"></a>绪言</h2><p>今天在WSL上训练模型，训练到<code>Epoch [17/40]</code>时出现了</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">&quot;/home/xxx/anaconda3/envs/tjjm/lib/python3.12/site-packages/torch/serialization.py&quot;</span>, line <span class="number">784</span>, <span class="keyword">in</span> __exit__</span><br><span class="line"></span><br><span class="line">    <span class="variable language_">self</span>.file_like.write_end_of_file()</span><br><span class="line"></span><br><span class="line">RuntimeError: [enforce fail at inline_container.cc:<span class="number">626</span>] . unexpected pos <span class="number">35558976</span> vs <span class="number">35558864</span></span><br></pre></td></tr></table></figure>
<p>发现是保存模型权重文件时失败了。</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">(tjjm) xxx@xxx:~$ df -h</span><br><span class="line">Filesystem      Size  Used Avail Use% Mounted on</span><br><span class="line">drivers        1000G  871G  130G  <span class="number">88</span>% /usr/lib/WSL/drivers</span><br><span class="line">/dev/sdc        251G  239G     <span class="number">0</span> <span class="number">100</span>% /</span><br><span class="line">C:\            1000G  871G  130G  <span class="number">88</span>% /mnt/c</span><br></pre></td></tr></table></figure>
<p>发现是WSL硬盘满了。但是此时WSL所在的C盘仍然有空间。</p>
<p>查资料大概得知，大概是这么个回事。</p>]]>
    </summary>
    <title>增加WSL虚拟硬盘大小</title>
    <updated>2025-07-23T15:00:34.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="GPU" scheme="https://blog.vanilla-chan.cn/tags/GPU/"/>
    <content>
      <![CDATA[<h2 id="前言"><a href="#前言" class="headerlink" title="前言"></a>前言</h2><p>AI时代，一些普普通通的游戏卡的价格也开始越发魔幻；在大显存的需求下，魔改卡也层出不穷。到底哪张卡最值得购买？哪张卡溢价严重？这次我想从一个购买者的角度出发，不考虑显卡的零部件成本，只考虑性价比，来估算目前市面上的“高性价比显卡”到底是否真的那么有性价比。</p><h3 id="免责声明"><a href="#免责声明" class="headerlink" title="免责声明"></a>免责声明</h3><ul><li><p>数据只选取了一些旧显卡，未加入50系是考虑到首发价格会高很多。如果想要加入更多的显卡进行测试，可以自行收集数据并修改代码。</p></li><li><p>回归预测数据仅代表统计学下的意义，并不代表应售价；计算得到的溢价高也不完全代表实际溢价高。</p></li><li><p>本文不提供任何购买建议。本文不构成任何诊疗、法律或投资建议。</p></li></ul><h2 id="数据来源"><a href="#数据来源" class="headerlink" title="数据来源"></a>数据来源</h2><div class="table-container"><table><thead><tr><th style="text-align:center">显卡</th><th style="text-align:center">显存</th><th style="text-align:center">TSE</th><th style="text-align:center">FP32</th><th style="text-align:center">价格</th><th style="text-align:center">备注</th></tr></thead><tbody><tr><td style="text-align:center">2080ti-22g</td><td style="text-align:center">22</td><td style="text-align:center">7098</td><td style="text-align:center">12.74</td><td style="text-align:center">2800</td><td style="text-align:center">淘宝魔改卡店</td></tr><tr><td style="text-align:center">3060-12g</td><td style="text-align:center">12</td><td style="text-align:center">4096</td><td style="text-align:center">13.45</td><td style="text-align:center">1600</td><td style="text-align:center">显卡日报</td></tr><tr><td style="text-align:center">3080-20g</td><td style="text-align:center">20</td><td style="text-align:center">8893</td><td style="text-align:center">29.77</td><td style="text-align:center">3399</td><td style="text-align:center">淘宝魔改卡店</td></tr><tr><td style="text-align:center">3090-20g</td><td style="text-align:center">20</td><td style="text-align:center">10286</td><td style="text-align:center">35.58</td><td style="text-align:center">4500</td><td style="text-align:center">群友，屏蔽两组显存</td></tr><tr><td style="text-align:center">3090-24g</td><td style="text-align:center">24</td><td style="text-align:center">10286</td><td style="text-align:center">35.58</td><td style="text-align:center">6999</td><td style="text-align:center">淘宝魔改卡店</td></tr><tr><td style="text-align:center">3090ti-24g</td><td style="text-align:center">24</td><td style="text-align:center">10384</td><td style="text-align:center">40</td><td style="text-align:center">7500</td><td style="text-align:center">淘宝魔改卡店</td></tr><tr><td style="text-align:center">4070tis-16g</td><td style="text-align:center">16</td><td style="text-align:center">11765</td><td style="text-align:center">44.1</td><td style="text-align:center">6000</td><td style="text-align:center">显卡日报</td></tr><tr><td style="text-align:center">4080-16g</td><td style="text-align:center">16</td><td style="text-align:center">14253</td><td style="text-align:center">52.22</td><td style="text-align:center">7100</td><td style="text-align:center">显卡日报</td></tr><tr><td style="text-align:center">4090-24g</td><td style="text-align:center">24</td><td style="text-align:center">19481</td><td style="text-align:center">82.58</td><td style="text-align:center">18500</td><td style="text-align:center">淘宝魔改卡店</td></tr><tr><td style="text-align:center">5060Ti-16g</td><td style="text-align:center">16</td><td style="text-align:center">7136</td><td style="text-align:center">23.70</td><td style="text-align:center">3650</td><td style="text-align:center">显卡日报</td></tr><tr><td style="text-align:center">5060Ti-8g</td><td style="text-align:center">8</td><td style="text-align:center">7136</td><td style="text-align:center">23.70</td><td style="text-align:center">3100</td><td style="text-align:center">显卡日报</td></tr><tr><td style="text-align:center">4060Ti-16g</td><td style="text-align:center">16</td><td style="text-align:center">6287</td><td style="text-align:center">22</td><td style="text-align:center">2430</td><td style="text-align:center">闲鱼</td></tr></tbody></table></div><p>若无特殊说明，以上价格均为三风扇显卡。</p><p>TSE和FP32数据来自《显卡日报》与互联网。</p><p>来自《显卡日报》的价格数据是日低价再加上100~200元左右，因为一般最低价的显卡比较难买到。</p><h2 id="代码"><a href="#代码" class="headerlink" title="代码"></a>代码</h2><figure class="highlight matlab"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br></pre></td><td class="code"><pre><span class="line">car=[</span><br><span class="line">  <span class="number">22</span>,<span class="number">7098</span>,<span class="number">12.74</span>,<span class="number">2800</span>;<span class="comment">%2080ti-22g</span></span><br><span class="line">  <span class="number">12</span>,<span class="number">4096</span>,<span class="number">13.45</span>,<span class="number">1600</span>;<span class="comment">%3060-12g</span></span><br><span class="line">  <span class="number">20</span>,<span class="number">8893</span>,<span class="number">29.77</span>,<span class="number">3399</span>;<span class="comment">%3080-20g</span></span><br><span class="line">  <span class="number">20</span>,<span class="number">10286</span>,<span class="number">35.58</span>,<span class="number">4500</span>;<span class="comment">%3090-20g</span></span><br><span class="line">  <span class="number">24</span>,<span class="number">10286</span>,<span class="number">35.58</span>,<span class="number">6999</span>;<span class="comment">%3090-24g</span></span><br><span class="line">  <span class="number">24</span>,<span class="number">10384</span>,<span class="number">40</span>,<span class="number">7500</span>;<span class="comment">%3090ti-24g</span></span><br><span class="line">  <span class="number">16</span>,<span class="number">11765</span>,<span class="number">44.1</span>,<span class="number">6000</span>;<span class="comment">%4070tis-16g</span></span><br><span class="line">  <span class="number">16</span>,<span class="number">14253</span>,<span class="number">52.22</span>,<span class="number">7100</span>;<span class="comment">%4080-16g</span></span><br><span class="line">  <span class="number">24</span>,<span class="number">19481</span>,<span class="number">82.58</span>,<span class="number">18500</span>;<span class="comment">%4090-24g</span></span><br><span class="line">  <span class="number">16</span>,<span class="number">7136</span>,<span class="number">23.70</span>,<span class="number">3650</span>;<span class="comment">%5060Ti-16g</span></span><br><span class="line">  <span class="number">8</span>,<span class="number">7136</span>,<span class="number">23.70</span>,<span class="number">3100</span>;<span class="comment">%5060Ti-8g</span></span><br><span class="line">  <span class="number">16</span>,<span class="number">6287</span>,<span class="number">22</span>,<span class="number">2430</span>;<span class="comment">%4060Ti-16g</span></span><br><span class="line">];</span><br><span class="line">name=[<span class="string">&quot;2080ti-22g&quot;</span>,<span class="string">&quot;3060-12g&quot;</span>,<span class="string">&quot;3080-20g&quot;</span>,<span class="string">&quot;3090-20g&quot;</span>,<span class="string">&quot;3090-24g&quot;</span>,<span class="string">&quot;3090ti-24g&quot;</span>,<span class="string">&quot;4070tis-16g&quot;</span>,<span class="string">&quot;4080-16g&quot;</span>,<span class="string">&quot;4090-24g&quot;</span>,<span class="string">&quot;5060Ti-16g&quot;</span>,<span class="string">&quot;5060Ti-8g&quot;</span>,<span class="string">&quot;4060Ti-16g&quot;</span>];</span><br><span class="line">X=[<span class="built_in">ones</span>([<span class="built_in">size</span>(car,<span class="number">1</span>),<span class="number">1</span>]),car(:,[<span class="number">1</span>,<span class="number">2</span>,<span class="number">3</span>]),car(:,<span class="number">1</span>).^<span class="number">2</span>];</span><br><span class="line">Y=car(:,<span class="keyword">end</span>);</span><br><span class="line"></span><br><span class="line">[b,bint,e,eint,stat]=regress(Y,X);</span><br><span class="line">Y_pre=X*b;</span><br><span class="line">fprintf(<span class="string">&quot;R^2=%f,F=%f,p=%f,误差方差估计值=%f\n&quot;</span>,stat);</span><br><span class="line"></span><br><span class="line">fprintf(<span class="string">&quot;%f + %f*显存 + %f*TSE + %f*Tflops + %f*显存²= 售价\n&quot;</span>,b);</span><br><span class="line"></span><br><span class="line"><span class="keyword">for</span> <span class="built_in">i</span>=<span class="number">1</span>:<span class="number">12</span></span><br><span class="line">    fprintf(<span class="string">&quot;%s\t实际价=%.1f\t推测价=%.2f\t\t溢价=%.1f\t溢价率=%f%%\n&quot;</span>,name(<span class="built_in">i</span>),Y(<span class="built_in">i</span>),Y_pre(<span class="built_in">i</span>),e(<span class="built_in">i</span>),e(<span class="built_in">i</span>)/Y_pre(<span class="built_in">i</span>)*<span class="number">100</span>);</span><br><span class="line"><span class="keyword">end</span></span><br></pre></td></tr></table></figure><p>其中，溢价与溢价率的计算公式为：</p><script type="math/tex; mode=display">\begin{align}溢价&amp;=实际价-推测价\\溢价率&amp;=溢价/预测价\times 100\%\end{align}</script><h2 id="结果分析"><a href="#结果分析" class="headerlink" title="结果分析"></a>结果分析</h2><h3 id="线性回归"><a href="#线性回归" class="headerlink" title="线性回归"></a>线性回归</h3><h4 id="模型参数"><a href="#模型参数" class="headerlink" title="模型参数"></a>模型参数</h4><p>首先只考虑最简单的线性回归模型。得到的公式为：</p><script type="math/tex; mode=display">售价=-3474.8 + 171.7*显存 -0.4043*TSE + 286.9*Tflops</script><blockquote><p>需要注意的是，回归公式仅具有统计学下的意义，并不能得出“1G显存价值171元，每1Tflops算力价值287元”这种结论。</p></blockquote><p>模型的$R^2=0.919310,F=30.381531,p=0.000101&lt;0.05$，很惊讶发现线性回归模型就能够拟合的比较好了，但是误差仍然存在。</p><p>注意到$TSE$的系数竟然是负数。一方面，这可能是因为$TSE$与$Tflops$相关性较强导致的，自变量之间具有相关性；另一方面，由于我挑选出来显卡大多都是老显卡，这或许能够反映出购买老显卡的人（相比于TSE跑分）更看重显卡算力，而并不需要那么高的游戏性能。</p><h4 id="显卡对比"><a href="#显卡对比" class="headerlink" title="显卡对比"></a>显卡对比</h4><p>按照溢价率升序排序，得到结果如下：</p><div class="table-container"><table><thead><tr><th style="text-align:center">显卡</th><th style="text-align:center">实际价</th><th style="text-align:center">推测价</th><th style="text-align:center">溢价</th><th style="text-align:center">溢价率</th></tr></thead><tbody><tr><td style="text-align:center">3080-20g</td><td style="text-align:center">3399</td><td style="text-align:center">4905.22</td><td style="text-align:center"><strong>-1506.2</strong></td><td style="text-align:center"><strong>-30.706538%</strong></td></tr><tr><td style="text-align:center">3090-20g</td><td style="text-align:center">4500</td><td style="text-align:center">6008.92</td><td style="text-align:center"><strong>-1508.9</strong></td><td style="text-align:center"><strong>-25.111369%</strong></td></tr><tr><td style="text-align:center">4060Ti-16g</td><td style="text-align:center">2430</td><td style="text-align:center">3042.74</td><td style="text-align:center">-612.7</td><td style="text-align:center">-20.137674%</td></tr><tr><td style="text-align:center">4080-16g</td><td style="text-align:center">7100</td><td style="text-align:center">8492.17</td><td style="text-align:center">-1392.2</td><td style="text-align:center">-16.393571%</td></tr><tr><td style="text-align:center">4070tis-16g</td><td style="text-align:center">6000</td><td style="text-align:center">7168.46</td><td style="text-align:center">-1168.5</td><td style="text-align:center">-16.300022%</td></tr><tr><td style="text-align:center">3090ti-24g</td><td style="text-align:center">7500</td><td style="text-align:center">7924.34</td><td style="text-align:center">-424.3</td><td style="text-align:center">-5.354904%</td></tr><tr><td style="text-align:center">3090-24g</td><td style="text-align:center">6999</td><td style="text-align:center">6695.83</td><td style="text-align:center">303.2</td><td style="text-align:center">4.527723%</td></tr><tr><td style="text-align:center">4090-24g</td><td style="text-align:center">18500</td><td style="text-align:center">16462.66</td><td style="text-align:center"><strong>2037.3</strong></td><td style="text-align:center">12.375541%</td></tr><tr><td style="text-align:center">5060Ti-16g</td><td style="text-align:center">3650</td><td style="text-align:center">3187.20</td><td style="text-align:center">462.8</td><td style="text-align:center">14.520588%</td></tr><tr><td style="text-align:center">5060Ti-8g</td><td style="text-align:center">3100</td><td style="text-align:center">1813.38</td><td style="text-align:center">1286.6</td><td style="text-align:center">70.951228%</td></tr><tr><td style="text-align:center">3060-12g</td><td style="text-align:center">1600</td><td style="text-align:center">788.66</td><td style="text-align:center">811.3</td><td style="text-align:center"><strong>102.875630%</strong></td></tr><tr><td style="text-align:center">2080ti-22g</td><td style="text-align:center">2800</td><td style="text-align:center">1088.41</td><td style="text-align:center"><strong>1711.6</strong></td><td style="text-align:center"><strong>157.255214%</strong></td></tr></tbody></table></div><p>先观察几张比较“出名”的推理卡，可以发现线性模型并不能那么好的贴合市场现状。</p><p>模型计算出的结果中，<strong>3080-20g和3090-20g最有性价比</strong>，而<strong>3090ti-24g</strong>则性价比一般；<strong>2080ti-22g</strong>则获得相对性价比最低的称号。说明线性模型不完全能够体现如今大模型时代的显存刚需。</p><p>故此处不对线性回归模型的结果做过多分析。</p><h3 id="添加显存平方项"><a href="#添加显存平方项" class="headerlink" title="添加显存平方项"></a>添加显存平方项</h3><h4 id="模型参数-1"><a href="#模型参数-1" class="headerlink" title="模型参数"></a>模型参数</h4><p>考虑到大模型时代，大显存可能会越来越贵，故在模型中添加显存平方项。得到的回归公式为：</p><script type="math/tex; mode=display">\begin{align}售价&amp;=4575.03 &amp;31.1*显存^2 - 883.49*显存  &amp;-0.28*TSE &amp;+ 255.7*Tflops\\售价&amp;=-1707.731 &amp;+ 31.1(显存-14.22)^2  &amp;-0.28*TSE &amp;+ 255.7*Tflops\end{align}</script><p>模型的$R^2=0.951333,F=34.208928,p=0.000110&lt;0.05$，对比线性回归模型拟合效果更好。</p><p>观察显存项，发现是一个以 $显存=14.22G$ 为对称轴、开口向上的“二次函数”。这也许说明，显存位于14G附近时，一张显卡中的显存部分的价格相对来说较便宜（但是并不代表整张卡的性价比高）。</p><h4 id="显卡对比-1"><a href="#显卡对比-1" class="headerlink" title="显卡对比"></a>显卡对比</h4><p>按照溢价率升序排序，得到结果如下：</p><div class="table-container"><table><thead><tr><th style="text-align:center">显卡</th><th style="text-align:center">实际价</th><th style="text-align:center">推测价</th><th style="text-align:center">溢价</th><th style="text-align:center">溢价率</th></tr></thead><tbody><tr><td style="text-align:center">3080-20g</td><td style="text-align:center">3399</td><td style="text-align:center">4453.27</td><td style="text-align:center"><strong>-1054.3</strong></td><td style="text-align:center"><strong>-23.674103%</strong></td></tr><tr><td style="text-align:center">3090-20g</td><td style="text-align:center">4500</td><td style="text-align:center">5549.17</td><td style="text-align:center">-1049.2</td><td style="text-align:center"><strong>-18.906749%</strong></td></tr><tr><td style="text-align:center">5060Ti-8g</td><td style="text-align:center">3100</td><td style="text-align:center">3558.60</td><td style="text-align:center">-458.6</td><td style="text-align:center">-12.887211%</td></tr><tr><td style="text-align:center">3090ti-24g</td><td style="text-align:center">7500</td><td style="text-align:center">8584.42</td><td style="text-align:center"><strong>-1084.4</strong></td><td style="text-align:center">-12.632416%</td></tr><tr><td style="text-align:center">4080-16g</td><td style="text-align:center">7100</td><td style="text-align:center">7755.55</td><td style="text-align:center">-655.5</td><td style="text-align:center">-8.452616%</td></tr><tr><td style="text-align:center">3090-24g</td><td style="text-align:center">6999</td><td style="text-align:center">7481.69</td><td style="text-align:center">-482.7</td><td style="text-align:center">-6.451595%</td></tr><tr><td style="text-align:center">4070tis-16g</td><td style="text-align:center">6000</td><td style="text-align:center">6375.31</td><td style="text-align:center">-375.3</td><td style="text-align:center">-5.886922%</td></tr><tr><td style="text-align:center">4060Ti-16g</td><td style="text-align:center">2430</td><td style="text-align:center">2256.92</td><td style="text-align:center">173.1</td><td style="text-align:center">7.668806%</td></tr><tr><td style="text-align:center">4090-24g</td><td style="text-align:center">18500</td><td style="text-align:center">16926.99</td><td style="text-align:center"><strong>1573.0</strong></td><td style="text-align:center">9.292913%</td></tr><tr><td style="text-align:center">5060Ti-16g</td><td style="text-align:center">3650</td><td style="text-align:center">2454.11</td><td style="text-align:center">1195.9</td><td style="text-align:center">48.730365%</td></tr><tr><td style="text-align:center">2080ti-22g</td><td style="text-align:center">2800</td><td style="text-align:center">1443.02</td><td style="text-align:center"><strong>1357.0</strong></td><td style="text-align:center"><strong>94.037429%</strong></td></tr><tr><td style="text-align:center">3060-12g</td><td style="text-align:center">1600</td><td style="text-align:center">738.96</td><td style="text-align:center">861.0</td><td style="text-align:center"><strong>116.521950%</strong></td></tr></tbody></table></div><p><strong>最具有相对性价比（溢价率）的型号是3080-20g</strong>。听说这张卡在一个月前大降价，淘宝和咸鱼上都出现了很多货。目前（三风扇）价格只需要3.5k不到，就能够获得20g显存和不俗的算力，确实性价比高。但是其可能是矿+魔改卡，入手需斟酌。</p><p><strong>最具有绝对性价比（溢价）的型号是3090ti-24g</strong>。（听说）这张卡没有矿，架构也不算老，24g显存也很棒。但是相比于<strong>3080-20g</strong>，需要考虑这4GB显存与10Tflops的算力提升是否为刚需、是否值得为此多花一倍的价格。</p><p>此外，<strong>群友的3090-20g</strong>也是比较有性价比的。如果显存需求与<strong>3080-20g</strong>一样大，但是烦恼于3080算力较低，可以考虑。</p><p><strong>最不具有相对性价比（溢价率）的型号是3060-12g</strong>。这张卡的定位可能大致是“最便宜的12g显存显卡”吧，但是算力可能有点太小了？不过，其仅是溢价率高，实际溢价（738元）并不算多。若想要一张12g显卡，<strong>3060-12g</strong>确实不错。</p><p><strong>最不具有绝对性价比（溢价）的型号是4090-24g</strong>。不用多说，这张卡在2025年的涨价颇为魔幻。但是更加令我觉得奇怪的是，模型给出的预测价居然也高达16926.99元，溢价仅1.5k。这是否说明这张卡确实值这么多？不过也可能是因为数据中没有定位类似的显卡，<strong>4090-24g</strong>相当于一个离群数据，，故模型受其影响较大。</p><p>此外，神奇的注意到<strong>2080ti-22g的性价比非常低</strong>。<strong>2080ti-22g</strong>作为一张大显存，低算力的显卡，如今的售价完全是因为吃到了大模型时代的红利，22g显存卡在了部分人的刚需上。我觉得，如果不是对显存的需求那么大，更好的方案是加几百块，选择算力更强且架构更新的<strong>3080-20g</strong>。</p><h2 id="结论"><a href="#结论" class="headerlink" title="结论"></a>结论</h2><p><strong>3080-20g</strong>和<strong>3090-20g</strong>在溢价率（相对性价比）上表现最佳，其显存容量与算力水平的平衡性符合大模型时代的需求趋势，尤其适合对显存有较高要求但预算有限的用户。</p><p><strong>2080ti-22g</strong>的高溢价率反映了显存需求与算力之间的割裂性——大显存红利导致价格虚高，需结合实际使用场景判断。</p><p><strong>3090ti-24g</strong>的溢价率较低但溢价绝对值较高，架构也不算老，而且矿卡的情况也会少很多。</p><p>综上，当前市场中<strong>3080-20g</strong>确实是最具有性价比的选择。</p><h2 id="不足之处"><a href="#不足之处" class="headerlink" title="不足之处"></a>不足之处</h2><p>本研究主要是从大模型时代个人本地部署小模型推理与微调的角度出发，只考虑AI生产力，并没有将显卡的游戏水平、渲染水平、剪辑能力作为本研究的切入点。所以得出的结论的适用面有限。</p><p>数据量不够大，且数据的分布不均匀，容易受到离群点（4090-24g以及8g显卡）的影响。</p><p>没有考虑到旧显卡的架构问题。</p><p>没有考虑30系矿卡的稳定性问题。</p><p>没有考虑专业计算卡和涡轮卡。</p><p>没有考虑除nvidia之外的显卡。</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/06/02/%E5%93%AA%E5%BC%A0%E5%8D%A1%E5%80%BC%E5%BE%97%E4%B9%B0%EF%BC%9F%E5%B8%82%E9%9D%A2%E4%B8%8A%E9%83%A8%E5%88%86%E6%98%BE%E5%8D%A1%E4%BB%B7%E6%A0%BC%E5%9B%9E%E5%BD%92%E4%B8%8E%E9%A2%84%E6%B5%8B/</id>
    <link href="https://blog.vanilla-chan.cn/2025/06/02/%E5%93%AA%E5%BC%A0%E5%8D%A1%E5%80%BC%E5%BE%97%E4%B9%B0%EF%BC%9F%E5%B8%82%E9%9D%A2%E4%B8%8A%E9%83%A8%E5%88%86%E6%98%BE%E5%8D%A1%E4%BB%B7%E6%A0%BC%E5%9B%9E%E5%BD%92%E4%B8%8E%E9%A2%84%E6%B5%8B/"/>
    <published>2025-06-02T07:21:01.000Z</published>
    <summary>AI时代，一些普普通通的游戏卡的价格也开始越发魔幻；在大显存的需求下，魔改卡也层出不穷。到底哪张卡最值得购买？哪张卡溢价严重？这次我想从一个购买者的角度出发，不考虑显卡的零部件成本，只考虑性价比，来估算目前市面上的“高性价比显卡”到底是否真的那么有性价比。</summary>
    <title>哪张卡值得买？市面上部分显卡价格回归与预测</title>
    <updated>2025-06-02T07:21:01.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Web" scheme="https://blog.vanilla-chan.cn/tags/Web/"/>
    <category term="Linux" scheme="https://blog.vanilla-chan.cn/tags/Linux/"/>
    <category term="Nginx" scheme="https://blog.vanilla-chan.cn/tags/Nginx/"/>
    <category term="SSL" scheme="https://blog.vanilla-chan.cn/tags/SSL/"/>
    <category term="Certbot" scheme="https://blog.vanilla-chan.cn/tags/Certbot/"/>
    <content>
      <![CDATA[<h2 id="绪言"><a href="#绪言" class="headerlink" title="绪言"></a>绪言</h2><p>这篇文章其实内容不多，难度不大，只是自己记录一下。</p><p>Arisu拷打了我好几次我在阿里云上花钱购买SSL证书一事。</p><p>最近，一年将至，阿里云已经天天给我发邮件提醒我续费了。</p><p>今天下午有点时间，就干脆换成Let’s Encrypt吧。</p><h2 id="安装certbot"><a href="#安装certbot" class="headerlink" title="安装certbot"></a>安装certbot</h2><p>certbot类似一个软件，而这个软件需要使用snapd下载。所以先安装snapd。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update</span><br><span class="line"><span class="built_in">sudo</span> apt install snapd</span><br></pre></td></tr></table></figure><p>创建超链接</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> <span class="built_in">ln</span> -s /snap/bin/certbot /usr/bin/certbot</span><br></pre></td></tr></table></figure><h2 id="配置nginx"><a href="#配置nginx" class="headerlink" title="配置nginx"></a>配置nginx</h2><p>确认nginx已经配置成功，即至少包含：</p><figure class="highlight elixir"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">root<span class="variable">@2v4G</span><span class="symbol">:/etc/nginx/sites-available</span><span class="comment"># cat xxx</span></span><br><span class="line">server &#123;</span><br><span class="line">    listen <span class="number">80</span>;</span><br><span class="line">    server_name ************ ***.***.***.***;</span><br><span class="line">...</span><br></pre></td></tr></table></figure><p>在已经配置好了nginx的情况下，直接输入：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> certbot --nginx</span><br></pre></td></tr></table></figure><p>即可。</p><p>之后会提示几条协议：</p><figure class="highlight lasso"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br></pre></td><td class="code"><pre><span class="line">Saving debug <span class="keyword">log</span> <span class="keyword">to</span> /<span class="built_in">var</span>/<span class="keyword">log</span>/letsencrypt/letsencrypt.<span class="keyword">log</span></span><br><span class="line">Enter email address <span class="literal">or</span> hit Enter <span class="keyword">to</span> <span class="keyword">skip</span>.</span><br><span class="line"> (Enter <span class="string">&#x27;c&#x27;</span> <span class="keyword">to</span> cancel): ************</span><br><span class="line"></span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">Please read the Terms of Service at:</span><br><span class="line">https:<span class="comment">//letsencrypt.org/documents/LE-SA-v1.5-February-24-2025.pdf</span></span><br><span class="line">You must agree <span class="keyword">in</span> <span class="keyword">order</span> <span class="keyword">to</span> register <span class="keyword">with</span> the ACME server. <span class="keyword">Do</span> you agree?</span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">(Y)es/(N)o: Y</span><br><span class="line"></span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">Would you be willing, once your first certificate is successfully issued, <span class="keyword">to</span></span><br><span class="line">share your email address <span class="keyword">with</span> the Electronic Frontier Foundation, a founding</span><br><span class="line">partner of the <span class="keyword">Let</span><span class="string">&#x27;s Encrypt project and the non-profit organization that</span></span><br><span class="line"><span class="string">develops Certbot? We&#x27;</span>d like <span class="keyword">to</span> send you email about our work encrypting the web,</span><br><span class="line">EFF news, campaigns, <span class="literal">and</span> ways <span class="keyword">to</span> support digital freedom.</span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">(Y)es/(N)o: Y</span><br><span class="line">Account registered.</span><br><span class="line"></span><br><span class="line">Which names would you like <span class="keyword">to</span> activate HTTPS for?</span><br><span class="line">We recommend selecting either <span class="literal">all</span> domains, <span class="literal">or</span> <span class="literal">all</span> domains <span class="keyword">in</span> a VirtualHost/server block.</span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line"><span class="number">1</span>: ************</span><br><span class="line">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line"><span class="keyword">Select</span> the appropriate numbers separated <span class="keyword">by</span> commas <span class="literal">and</span>/<span class="literal">or</span> spaces, <span class="literal">or</span> leave input</span><br><span class="line">blank <span class="keyword">to</span> <span class="keyword">select</span> <span class="literal">all</span> options shown (Enter <span class="string">&#x27;c&#x27;</span> <span class="keyword">to</span> cancel): <span class="number">1</span></span><br><span class="line">Requesting a certificate for ************</span><br><span class="line"></span><br><span class="line">Successfully received certificate.</span><br><span class="line">Certificate is saved at: /etc/letsencrypt/live<span class="comment">/************/</span>fullchain.pem</span><br><span class="line">Key is saved at:         /etc/letsencrypt/live<span class="comment">/************/</span>privkey.pem</span><br><span class="line">This certificate expires <span class="keyword">on</span> <span class="number">2025</span><span class="number">-08</span><span class="number">-26.</span></span><br><span class="line">These files will be updated when the certificate renews.</span><br><span class="line">Certbot has <span class="built_in">set</span> up a scheduled task <span class="keyword">to</span> automatically renew this certificate <span class="keyword">in</span> the background.</span><br><span class="line"></span><br><span class="line">Deploying certificate</span><br><span class="line">Successfully deployed certificate for ************ <span class="keyword">to</span> /etc/nginx/sites<span class="params">-enabled</span><span class="comment">/************</span></span><br><span class="line"><span class="comment">Congratulations! You have successfully enabled HTTPS on https://************</span></span><br><span class="line"><span class="comment"></span></span><br><span class="line"><span class="comment">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span></span><br><span class="line"><span class="comment">If you like Certbot, please consider supporting our work by:</span></span><br><span class="line"><span class="comment"> * Donating to ISRG / Let&#x27;s Encrypt:   https://letsencrypt.org/donate</span></span><br><span class="line"><span class="comment"> * Donating to EFF:                    https://eff.org/donate-le</span></span><br><span class="line"><span class="comment">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span></span><br></pre></td></tr></table></figure><p>至此说明部署成功。</p><h2 id="自动更新"><a href="#自动更新" class="headerlink" title="自动更新"></a>自动更新</h2><p>使用snapan安装certbot这类安装方式默认会创建systemd timer，通常叫<code>snap.certbot.renew.timer</code>，<strong>每12小时</strong>检查一次，只有在证书<strong>剩余&lt;30天</strong>才会真的续期。</p><p>看有没有定时器 &amp; 下一次/上一次触发时间：</p><figure class="highlight dsconfig"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="string">sudo</span> <span class="string">systemctl</span> <span class="built_in">list-timers</span> | <span class="string">grep</span> <span class="string">certbot</span></span><br><span class="line"><span class="string">sudo</span> <span class="string">systemctl</span> <span class="string">status</span> <span class="string">snap</span>.<span class="string">certbot</span>.<span class="string">renew</span>.<span class="string">timer</span></span><br><span class="line"><span class="string">sudo</span> <span class="string">systemctl</span> <span class="string">status</span> <span class="string">snap</span>.<span class="string">certbot</span>.<span class="string">renew</span>.<span class="string">service</span></span><br></pre></td></tr></table></figure><p>尝试运行显示：</p><figure class="highlight yaml"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># sudo systemctl list-timers | grep certbot</span></span><br><span class="line"><span class="string">Wed</span> <span class="number">2025-09-17 10:16:00 </span><span class="string">CST</span> <span class="string">8h</span> <span class="string">left</span>            <span class="string">Tue</span> <span class="number">2025-09-16 20:15:00 </span><span class="string">CST</span> <span class="string">5h</span> <span class="string">46min</span> <span class="string">ago</span> <span class="string">snap.certbot.renew.timer</span>       <span class="string">snap.certbot.renew.service</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># sudo systemctl status snap.certbot.renew.timer</span></span><br><span class="line"><span class="string">snap.certbot.renew.timer</span></span><br><span class="line"><span class="string">●</span> <span class="string">snap.certbot.renew.timer</span> <span class="bullet">-</span> <span class="string">Timer</span> <span class="string">renew</span> <span class="string">for</span> <span class="string">snap</span> <span class="string">application</span> <span class="string">certbot.renew</span></span><br><span class="line">     <span class="attr">Loaded:</span> <span class="string">loaded</span> <span class="string">(/etc/systemd/system/snap.certbot.renew.timer;</span> <span class="string">enabled;</span> <span class="attr">vendor preset:</span> <span class="string">enabled)</span></span><br><span class="line">     <span class="attr">Active:</span> <span class="string">active</span> <span class="string">(waiting)</span> <span class="string">since</span> <span class="string">Wed</span> <span class="number">2025-09-03 06:13:56 </span><span class="string">CST;</span> <span class="number">1</span> <span class="string">week</span> <span class="number">6</span> <span class="string">days</span> <span class="string">ago</span></span><br><span class="line">    <span class="attr">Trigger:</span> <span class="string">Wed</span> <span class="number">2025-09-17 10:16:00 </span><span class="string">CST;</span> <span class="string">8h</span> <span class="string">left</span></span><br><span class="line">   <span class="attr">Triggers:</span> <span class="string">●</span> <span class="string">snap.certbot.renew.service</span></span><br><span class="line"></span><br><span class="line"><span class="string">Sep</span> <span class="number">03</span> <span class="number">06</span><span class="string">:13:56</span> <span class="string">2v4G</span> <span class="string">systemd[1]:</span> <span class="string">Started</span> <span class="string">Timer</span> <span class="string">renew</span> <span class="string">for</span> <span class="string">snap</span> <span class="string">application</span> <span class="string">certbot.renew.</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># sudo systemctl status snap.certbot.renew.service</span></span><br><span class="line"><span class="string">○</span> <span class="string">snap.certbot.renew.service</span> <span class="bullet">-</span> <span class="string">Service</span> <span class="string">for</span> <span class="string">snap</span> <span class="string">application</span> <span class="string">certbot.renew</span></span><br><span class="line">     <span class="attr">Loaded:</span> <span class="string">loaded</span> <span class="string">(/etc/systemd/system/snap.certbot.renew.service;</span> <span class="string">static)</span></span><br><span class="line">     <span class="attr">Active:</span> <span class="string">inactive</span> <span class="string">(dead)</span> <span class="string">since</span> <span class="string">Tue</span> <span class="number">2025-09-16 20:15:03 </span><span class="string">CST;</span> <span class="string">6h</span> <span class="string">ago</span></span><br><span class="line"><span class="attr">TriggeredBy:</span> <span class="string">●</span> <span class="string">snap.certbot.renew.timer</span></span><br><span class="line">    <span class="attr">Process:</span> <span class="number">936195</span> <span class="string">ExecStart=/usr/bin/snap</span> <span class="string">run</span> <span class="string">--timer=00:00~24:00/2</span> <span class="string">certbot.renew</span> <span class="string">(code=exited,</span> <span class="string">status=0/SUCCESS)</span></span><br><span class="line">   <span class="attr">Main PID:</span> <span class="number">936195</span> <span class="string">(code=exited,</span> <span class="string">status=0/SUCCESS)</span></span><br><span class="line">        <span class="attr">CPU:</span> <span class="number">1.</span><span class="string">796s</span></span><br><span class="line"></span><br><span class="line"><span class="string">Sep</span> <span class="number">16</span> <span class="number">20</span><span class="string">:15:00</span> <span class="string">2v4G</span> <span class="string">systemd[1]:</span> <span class="string">Starting</span> <span class="string">Service</span> <span class="string">for</span> <span class="string">snap</span> <span class="string">application</span> <span class="string">certbot.renew...</span></span><br><span class="line"><span class="string">Sep</span> <span class="number">16</span> <span class="number">20</span><span class="string">:15:03</span> <span class="string">2v4G</span> <span class="string">systemd[1]:</span> <span class="attr">snap.certbot.renew.service:</span> <span class="string">Deactivated</span> <span class="string">successfully.</span></span><br><span class="line"><span class="string">Sep</span> <span class="number">16</span> <span class="number">20</span><span class="string">:15:03</span> <span class="string">2v4G</span> <span class="string">systemd[1]:</span> <span class="string">Finished</span> <span class="string">Service</span> <span class="string">for</span> <span class="string">snap</span> <span class="string">application</span> <span class="string">certbot.renew.</span></span><br><span class="line"><span class="string">Sep</span> <span class="number">16</span> <span class="number">20</span><span class="string">:15:03</span> <span class="string">2v4G</span> <span class="string">systemd[1]:</span> <span class="attr">snap.certbot.renew.service:</span> <span class="string">Consumed</span> <span class="number">1.</span><span class="string">796s</span> <span class="string">CPU</span> <span class="string">time.</span></span><br></pre></td></tr></table></figure><p>第一行显示了上一次运行时间和下一次运行时间。</p><p>或者查看日志：</p><figure class="highlight stylus"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">sudo journalctl -u snap<span class="selector-class">.certbot</span><span class="selector-class">.renew</span><span class="selector-class">.service</span> -n <span class="number">100</span> <span class="attr">--no-pager</span></span><br></pre></td></tr></table></figure><p>输出类似于：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">10</span>:<span class="number">16</span>:<span class="number">05</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: Finished Service for snap application certbot.renew.</span><br><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">10</span>:<span class="number">16</span>:<span class="number">05</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: snap.certbot.renew.service: Consumed <span class="number">3</span>.<span class="number">348</span>s CPU time.</span><br><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">00</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: Starting Service for snap application certbot.renew...</span><br><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: snap.certbot.renew.service: Deactivated successfully.</span><br><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: Finished Service for snap application certbot.renew.</span><br><span class="line"><span class="attribute">Sep</span> <span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span> <span class="number">2</span>v4G systemd[<span class="number">1</span>]: snap.certbot.renew.service: Consumed <span class="number">1</span>.<span class="number">796</span>s CPU time.</span><br></pre></td></tr></table></figure><p>也间接的说明了目前的定时更新是由systemctl管理的service维护的。</p><h2 id="Certbot的官方日志"><a href="#Certbot的官方日志" class="headerlink" title="Certbot的官方日志"></a>Certbot的官方日志</h2><p>Certbot的所有操作，包括续期尝试，都会记录在日志文件中。</p><figure class="highlight stata"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">sudo <span class="keyword">cat</span> /<span class="keyword">var</span>/<span class="keyword">log</span>/letsencrypt/letsencrypt.<span class="keyword">log</span></span><br></pre></td></tr></table></figure><p>寻找包含<code>renew</code>或<code>certificates are not due for renewal yet</code>的字样。</p><ul><li>如果看到 <code>renewal succeeded</code>，说明续期成功了。</li><li>如果看到 <code>certificates are not due for renewal yet</code>，说明Certbot正常运行了检查，但因为证书尚未到期（通常是到期前30天内才会续订），所以跳过了本次续订。</li></ul><p>例如：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">2025</span>-<span class="number">09</span>-<span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span>,<span class="number">675</span>:DEBUG:certbot._internal.display.obj:Notifying user: The following certificates are not due for renewal yet:</span><br><span class="line"></span><br><span class="line"><span class="attribute">2025</span>-<span class="number">09</span>-<span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span>,<span class="number">675</span>:DEBUG:certbot._internal.display.obj:Notifying user:   /etc/letsencrypt/live/vanilla-chan.cn/fullchain.pem expires <span class="literal">on</span> <span class="number">2025</span>-<span class="number">10</span>-<span class="number">24</span> (skipped)</span><br><span class="line"></span><br><span class="line"><span class="attribute">2025</span>-<span class="number">09</span>-<span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span>,<span class="number">675</span>:DEBUG:certbot._internal.display.obj:Notifying user: No renewals were attempted.</span><br><span class="line"></span><br><span class="line"><span class="attribute">2025</span>-<span class="number">09</span>-<span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span>,<span class="number">675</span>:DEBUG:certbot._internal.display.obj:Notifying user: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line"></span><br><span class="line"><span class="attribute">2025</span>-<span class="number">09</span>-<span class="number">16</span> <span class="number">20</span>:<span class="number">15</span>:<span class="number">03</span>,<span class="number">675</span>:DEBUG:certbot._internal.renewal:no renewal failures</span><br></pre></td></tr></table></figure><p>这是一次检测日志，发现不需要更新证书。</p><h2 id="手动更新证书测试"><a href="#手动更新证书测试" class="headerlink" title="手动更新证书测试"></a>手动更新证书测试</h2><p>可以手动更新一次证书，测试更新证书功能是否正常：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> certbot renew --dry-run</span><br></pre></td></tr></table></figure><p>我这边的输出如下：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">Saving debug log to /var/log/letsencrypt/letsencrypt.log</span><br><span class="line"></span><br><span class="line"><span class="bullet">-</span> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">Processing /etc/letsencrypt/renewal/<span class="strong">****</span><span class="strong">****</span><span class="strong">****</span>.conf</span><br><span class="line"><span class="bullet">-</span> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">Account registered.</span><br><span class="line">Simulating renewal of an existing certificate for <span class="strong">****</span><span class="strong">****</span><span class="strong">****</span></span><br><span class="line"></span><br><span class="line"><span class="bullet">-</span> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br><span class="line">Congratulations, all simulated renewals succeeded: </span><br><span class="line">  /etc/letsencrypt/live/<span class="strong">****</span><span class="strong">****</span><span class="strong">****</span>/fullchain.pem (success)</span><br><span class="line"><span class="bullet">-</span> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span><br></pre></td></tr></table></figure><h2 id="查看证书状态"><a href="#查看证书状态" class="headerlink" title="查看证书状态"></a>查看证书状态</h2><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> certbot certificates</span><br></pre></td></tr></table></figure><p>输出类似于</p><figure class="highlight nestedtext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">Saving debug log to /var/log/letsencrypt/letsencrypt.log</span></span><br><span class="line"><span class="attribute"></span></span><br><span class="line"><span class="attribute">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span></span><br><span class="line"><span class="attribute">Found the following certs</span><span class="punctuation">:</span></span><br><span class="line">  <span class="attribute">Certificate Name</span><span class="punctuation">:</span> <span class="string">xxxxxxxxx.xxx</span></span><br><span class="line">    <span class="attribute">Serial Number</span><span class="punctuation">:</span> <span class="string">xxxxxxxxxxxxxxxxxxxxxxxx</span></span><br><span class="line">    <span class="attribute">Key Type</span><span class="punctuation">:</span> <span class="string">ECDSA</span></span><br><span class="line">    <span class="attribute">Domains</span><span class="punctuation">:</span> <span class="string">xxxxxxxxx.xxx</span></span><br><span class="line">    <span class="attribute">Expiry Date</span><span class="punctuation">:</span> <span class="string">2025-10-24 18:36:36+00:00 (VALID: 38 days)</span></span><br><span class="line">    <span class="attribute">Certificate Path</span><span class="punctuation">:</span> <span class="string">/etc/letsencrypt/live/xxxxxxxxx.xxx/fullchain.pem</span></span><br><span class="line">    <span class="attribute">Private Key Path</span><span class="punctuation">:</span> <span class="string">/etc/letsencrypt/live/xxxxxxxxx.xxx/privkey.pem</span></span><br><span class="line"><span class="bullet">-</span> <span class="string">- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</span></span><br></pre></td></tr></table></figure><h2 id="自动更新-1"><a href="#自动更新-1" class="headerlink" title="自动更新"></a><del>自动更新</del></h2><blockquote><p>本章节内容作废</p></blockquote><p>自动更新的原理：使用crontab来定时执行自动更新证书指令<code>certbot renew --quiet</code>。</p><p>在命令行输入：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">crontab -e</span><br></pre></td></tr></table></figure><p>然后会让你选择喜欢的文本编辑器：</p><figure class="highlight livecodeserver"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line">no crontab <span class="keyword">for</span> root - <span class="keyword">using</span> <span class="keyword">an</span> <span class="literal">empty</span> <span class="literal">one</span></span><br><span class="line"></span><br><span class="line">Select <span class="keyword">an</span> editor.  To change later, run <span class="string">&#x27;select-editor&#x27;</span>.</span><br><span class="line">  <span class="number">1.</span> /bin/nano        &lt;<span class="comment">---- easiest</span></span><br><span class="line">  <span class="number">2.</span> /usr/bin/vim.basic</span><br><span class="line">  <span class="number">3.</span> /usr/bin/vim.tiny</span><br><span class="line">  <span class="number">4.</span> /bin/ed</span><br><span class="line"></span><br><span class="line">Choose <span class="number">1</span><span class="number">-4</span> [<span class="number">1</span>]: <span class="number">1</span>                   </span><br><span class="line">crontab: installing <span class="built_in">new</span> crontab</span><br></pre></td></tr></table></figure><p>在打开的编辑器中，加入：</p><figure class="highlight basic"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="symbol">0 </span><span class="number">0</span> <span class="number">1</span> * * /<span class="keyword">usr</span>/bin/certbot renew --quiet</span><br></pre></td></tr></table></figure><p>这一行命令表示，在每个月的第一天的凌晨，执行一次自动更新指令。</p><p>具体的格式：</p><figure class="highlight gherkin"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">m   h   dom  mon  dow   command</span><br><span class="line">|<span class="string">   </span>|<span class="string">    </span>|<span class="string">    </span>|<span class="string">    </span>|<span class="string">       </span>|</span><br><span class="line">|<span class="string">   </span>|<span class="string">    </span>|<span class="string">    </span>|<span class="string">    </span>|<span class="string">       +---- 要执行的命令</span></span><br><span class="line"><span class="string"></span>|<span class="string">   </span>|<span class="string">    </span>|<span class="string">    </span>|<span class="string">    +------------ 星期几 (0 - 6)（星期天=0）</span></span><br><span class="line"><span class="string"></span>|<span class="string">   </span>|<span class="string">    </span>|<span class="string">    +----------------- 月份 (1 - 12)</span></span><br><span class="line"><span class="string"></span>|<span class="string">   </span>|<span class="string">    +---------------------- 日期 (1 - 31)</span></span><br><span class="line"><span class="string"></span>|<span class="string">   +--------------------------- 小时 (0 - 23)</span></span><br><span class="line"><span class="string">+------------------------------- 分钟 (0 - 59)</span></span><br></pre></td></tr></table></figure><h2 id="感悟"><a href="#感悟" class="headerlink" title="感悟"></a>感悟</h2><blockquote><p>原来这玩意配置这么简单呀</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250528-161329-52689.png" alt=""></p><p>阿里云的ssl我花了多少来着？100+？</p><p>似乎购买+配置的时间 &gt; 今天下午配置+写blog的时间</p><p>有点无感——我都不知道我现在到底配置好了没有（</p><p>但是我已经吧还有25天的阿里云的ssl给删了+nginx里面也没了</p><p>应该是成功了吧（笑</p></blockquote><h2 id="参考文献"><a href="#参考文献" class="headerlink" title="参考文献"></a>参考文献</h2><p><a href="https://www.cnblogs.com/superip/p/18083100">ubuntu上申请Let’s Encrypt HTTPS 证书 - super_ip - 博客园</a></p><p><a href="https://blog.csdn.net/re_xue/article/details/138003534">在 Ubuntu 22.04 上使用 Let‘s Encrypt 配置 Nginx SSL 证书_ubuntu let’s encrypt-CSDN博客</a></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/05/28/Ubuntu-Lets-Encrypt-Setup-Nginx-SSL-Auto-Renew/</id>
    <link href="https://blog.vanilla-chan.cn/2025/05/28/Ubuntu-Lets-Encrypt-Setup-Nginx-SSL-Auto-Renew/"/>
    <published>2025-05-28T07:57:49.000Z</published>
    <summary>这篇文章其实内容不多，难度不大，只是自己记录一下。Arisu拷打了我几次我在阿里云上花钱购买SSL证书一事。最近，一年将至，阿里云已经天天给我发邮件提醒我续费了。今天下午有点时间，就干脆换成Let's Encrypt吧。</summary>
    <title>在Ubuntu上使用Let's Encrypt配置Nginx SSL证书并自动更新</title>
    <updated>2025-05-28T07:57:49.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Linux" scheme="https://blog.vanilla-chan.cn/tags/Linux/"/>
    <category term="WSL" scheme="https://blog.vanilla-chan.cn/tags/WSL/"/>
    <category term="mamba_ssm" scheme="https://blog.vanilla-chan.cn/tags/mamba-ssm/"/>
    <category term="conda" scheme="https://blog.vanilla-chan.cn/tags/conda/"/>
    <category term="PyTorch" scheme="https://blog.vanilla-chan.cn/tags/PyTorch/"/>
    <content>
      <![CDATA[<p>起初的原因是，想要跑一个用到了mamba-ssm的项目，故尝试在wsl中配置mamba-ssm库。提示需要<code>pip install mamba-ssm</code>后报错频繁，遇到了许多问题。查阅了很多blog和issue，安装了很多次环境，仿佛已经对注意事项倒背如流，但是就是无法解决最后的<strong>selective_scan_cuda.cpython-310-x86_64-linux-gnu.so: undefined symbol: ZN3c107Warning</strong>……</p><span id="more"></span><h2 id="安装mamba-ssm"><a href="#安装mamba-ssm" class="headerlink" title="安装mamba-ssm"></a>安装mamba-ssm</h2><p>原本，安装mamba-ssm是非常简单的：</p><figure class="highlight cmake"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">pip <span class="keyword">install</span> mamba-ssm</span><br></pre></td></tr></table></figure><p>但是主要有两个难点：</p><ol><li>文件巨大，下载缓慢，以为是卡死</li><li>对python、CUDA、torch、numpy都有要求</li></ol><h2 id="更换Python版本"><a href="#更换Python版本" class="headerlink" title="更换Python版本"></a>更换Python版本</h2><p>首先我直接在之前用过的环境中</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">pip install mamba-ssm</span><br></pre></td></tr></table></figure><p>报错</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">NameError: name <span class="string">&#x27;bare_metal_version&#x27;</span> is not defined</span><br><span class="line">mamba_ssm was requested, but nvcc was not found.  Are you sure your environment has nvcc available?</span><br></pre></td></tr></table></figure><p>查询后发现，mamba-ssm 目前对 Python 3.12 支持不佳，同时windows中配置nvcc似乎比linux要更麻烦点。所以就选择在wsl中配置该环境。</p><p>之后我选择了Python 3.11。</p><h2 id="创建新环境"><a href="#创建新环境" class="headerlink" title="创建新环境"></a>创建新环境</h2><p>这里我选择<code>python=3.11</code></p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">conda create -n MAMBA_SSM python=3.11</span><br><span class="line">conda activate MAMBA_SSM</span><br></pre></td></tr></table></figure><h2 id="安装torch"><a href="#安装torch" class="headerlink" title="安装torch"></a>安装torch</h2><p>这里我选择<code>torch=2.4.1</code>。</p><p>详细列表可参见<a href="https://pytorch.org/get-started/previous-versions/">Previous PyTorch Versions</a></p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">pip install torch==2.4.1 torchvision==0.19.1 torchaudio==2.4.1 --index-url https://download.pytorch.org/whl/cu124</span><br></pre></td></tr></table></figure><p>可以通过<code>python -c &quot;import torch; print(torch.__version__); print(torch.version.cuda)&quot;</code>来检测当前torch版本。如果输出：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">2</span>.<span class="number">4</span>.<span class="number">1</span>+cu124</span><br><span class="line"><span class="attribute">12</span>.<span class="number">4</span></span><br></pre></td></tr></table></figure><h2 id="加速安装mamba-ssm"><a href="#加速安装mamba-ssm" class="headerlink" title="加速安装mamba_ssm"></a>加速安装mamba_ssm</h2><p>解决了上述问题后，如果在<code>pip install mamba_ssm</code>的过程中遇到</p><figure class="highlight subunit"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">Guessing wheel URL:  https://github.com/state-spaces/mamba/releases/download/v2.2.4/mamba_ssm<span class="string">-2</span>.2.4+cu12torch2.7cxx11abiTRUE-cp310-cp310-linux_x86_64.whl</span><br><span class="line"><span class="keyword">error: </span>&lt;urlopen error [Errno 110] Connection timed out&gt;</span><br><span class="line"><span class="keyword">ERROR: </span>Failed building wheel for mamba_ssm</span><br></pre></td></tr></table></figure><p>说明可能遇到了网络波动问题（真网络波动吗？</p><p>可以去<a href="https://github.com/state-spaces/mamba/releases">Releases · state-spaces/mamba</a>手动下载，<strong>注意选择与python、torch、CUDA版本均匹配的wheel文件</strong>。比如我是<code>python=3.11.11,torch=2.4.1+cu124，CUDA=12.8</code>，则下载<code>mamba_ssm-2.2.2+cu122torch2.4cxx11abiFALSE-cp311-cp311-linux_x86_64.whl</code>。（注：由于我选择的是2.2.2旧版本，所以需要在<a href="https://github.com/state-spaces/mamba/releases/tag/v2.2.2">Release v2.2.2 · state-spaces/mamba</a>中寻找）</p><p>传输到wsl中。</p><p>如果是子用户，可能还需要修改权限：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> <span class="built_in">chown</span> xxx:xxx /home/xxx/mamba_ssm-2.2.2+cu122torch2.4cxx11abiFALSE-cp311-cp311-linux_x86_64.whl</span><br></pre></td></tr></table></figure><p>然后使用pip安装：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">pip</span> install /home/xxx/mamba_ssm-<span class="number">2</span>.<span class="number">2</span>.<span class="number">2</span>+cu122torch2.<span class="number">4</span>cxx11abiFALSE-cp311-cp311-linux_x86_64.whl</span><br></pre></td></tr></table></figure><p>最后看到如：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">Successfully</span> installed ... mamba-ssm-<span class="number">2</span>.<span class="number">2</span>.<span class="number">2</span> ...</span><br></pre></td></tr></table></figure><p>可知安装成功。</p><h2 id="手动编译安装"><a href="#手动编译安装" class="headerlink" title="手动编译安装"></a>手动编译安装</h2><p>如果上述仍然没有办法成功安装并运行，可选择手动编译。</p><p>可参考：</p><p><a href="https://github.com/state-spaces/mamba/issues/217">Issue #217 · state-spaces/mamba</a></p><h2 id="安装gcc"><a href="#安装gcc" class="headerlink" title="安装gcc"></a>安装gcc</h2><p>如果遇到报错：</p><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">raise</span> RuntimeError(<span class="string">&quot;Failed to find C compiler. Please specify via CC environment variable.&quot;</span>)</span><br><span class="line">RuntimeError: Failed to find C compiler. Please specify via CC environment variable.</span><br></pre></td></tr></table></figure><p>这是triton在运行时需要用到C编译器，如gcc，但系统没有找到可用的C编译器。</p><p>我是ubuntu系统。故我需要输入：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update</span><br><span class="line"><span class="built_in">sudo</span> apt install build-essential</span><br></pre></td></tr></table></figure><p>会安装 gcc、g++ 等常用编译工具。</p><p>然后输入：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">gcc --version</span><br></pre></td></tr></table></figure><p>会显示版本号，如：</p><figure class="highlight apache"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="attribute">gcc</span> (Ubuntu <span class="number">11</span>.<span class="number">4</span>.<span class="number">0</span>-<span class="number">1</span>ubuntu1~<span class="number">22</span>.<span class="number">04</span>) <span class="number">11</span>.<span class="number">4</span>.<span class="number">0</span></span><br><span class="line"><span class="attribute">Copyright</span> (C) <span class="number">2021</span> Free Software Foundation, Inc.</span><br><span class="line"><span class="attribute">This</span> is free software; see the source for copying conditions.  There is NO</span><br><span class="line"><span class="attribute">warranty</span>; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.</span><br></pre></td></tr></table></figure><p>则说明安装正常。</p><h2 id="后记"><a href="#后记" class="headerlink" title="后记"></a>后记</h2><p>其实，上文的种种版本，我尝试过了无数次组合。</p><p>最终，在友人的鼓励下，翻了很多issue，我最终选择重新创建一个环境，并且按照<a href="https://github.com/state-spaces/mamba/issues/217#issuecomment-2775313822">这条评论</a>的版本，全部重装了一边。这次，一次性成功！</p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250524-192522-43481.png" alt=""></p><p>最后一次修改文章的各个版本号了，不改了。</p><h2 id="参考文献"><a href="#参考文献" class="headerlink" title="参考文献"></a>参考文献</h2><p><a href="https://blog.csdn.net/qq_45100200/article/details/139754231">Windows和Linux系统上的Mamba_ssm环境配置_mamba-ssm安装-CSDN博客</a></p><p>但是其实上面这条blog基本没用上。反复装了无数种排列组合后，conda新开了个环境，采用9527MY这位同志的版本组合，一次性成功了。</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/05/24/Linux%E4%B8%8B%E5%AE%89%E8%A3%85mamba-ssm%E8%B8%A9%E8%BF%87%E7%9A%84%E5%9D%91/</id>
    <link href="https://blog.vanilla-chan.cn/2025/05/24/Linux%E4%B8%8B%E5%AE%89%E8%A3%85mamba-ssm%E8%B8%A9%E8%BF%87%E7%9A%84%E5%9D%91/"/>
    <published>2025-05-24T11:31:06.000Z</published>
    <summary>
      <![CDATA[<p>起初的原因是，想要跑一个用到了mamba-ssm的项目，故尝试在wsl中配置mamba-ssm库。提示需要<code>pip install mamba-ssm</code>后报错频繁，遇到了许多问题。查阅了很多blog和issue，安装了很多次环境，仿佛已经对注意事项倒背如流，但是就是无法解决最后的<strong>selective_scan_cuda.cpython-310-x86_64-linux-gnu.so: undefined symbol: ZN3c107Warning</strong>……</p>]]>
    </summary>
    <title>Linux下安装mamba-ssm踩过的坑</title>
    <updated>2025-05-24T11:31:06.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="线段树" scheme="https://blog.vanilla-chan.cn/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/"/>
    <category term="2025ACM" scheme="https://blog.vanilla-chan.cn/tags/2025ACM/"/>
    <category term="线段树二分" scheme="https://blog.vanilla-chan.cn/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91%E4%BA%8C%E5%88%86/"/>
    <category term="主席树" scheme="https://blog.vanilla-chan.cn/tags/%E4%B8%BB%E5%B8%AD%E6%A0%91/"/>
    <content>
      <![CDATA[<h1 id="ZCPC17th-E-Easy-DP-Problem"><a href="#ZCPC17th-E-Easy-DP-Problem" class="headerlink" title="ZCPC17th E Easy DP Problem"></a>ZCPC17th E Easy DP Problem</h1><h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://codeforces.com/gym/102770/problem/E">Problem</a></h2><p>由于这题前面的思维推到部分我没有参与，主要是现学（复习）了一下主席树，所以主要讲主席树的部分。</p><p>题目可转化为：</p><p>给一个长度为 $n$ 的数组 $a_i$，有 $q$ 个询问，每次询问区间 $[l,r]$ 中最大的 $k$ 个数之和，再加上 $\sum_{i=1}^{r-l+1}i^2$。</p><p>$n\le10^5,q\le10^5,a_i\le10^6$</p><p>$T\le100,\sum n\le5\times10^5,\sum q\le5\times 10^5$</p><span id="more"></span><h2 id="Solution"><a href="#Solution" class="headerlink" title="Solution"></a>Solution</h2><p>主要讲一下这题主席树的写法吧。</p><p>以前，我只知道主席树可以用来可持久化，即对于每次修改，都新建一个版本；同时，可以访问之前任意时刻的版本进行查询。</p><p>对于一个数组，使用权值线段树找最大的k个数也是很经典的线段树上二分来解决。</p><p>求最大的k个数之和，只要多维护一个 $sum$，在线段树上二分的时候累计答案即可。</p><p>而这题需要查询的是区间 $[l,r]$ 上的最大值。</p><p>将数组 $a_i$ 对应到 $root_i$：</p><ul><li>$root_0$ 代表一个全空的权值线段树</li><li>$root_1$ 代表只放入了 $a_1$ 的权值线段树</li><li>$root_2$ 放入了 $a_1,a_2$</li><li>……</li></ul><p>那么，想要查询区间 $[1,i]$ 上的最大k个数之和，只需要在线段树 $root_i$ 上进行上述“线段树上二分”即可。</p><p>但是如果要查询区间 $[l,r]$ 上的最大k个数之和呢？类似前缀和与差分，只需要同时查询 $root_{l-1}$ 和 $root_r$ 这两颗线段树，节点的值做差即可得到区间 $[l,r]$ 上的节点权值。</p><h2 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h2><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">define</span> int ll</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> N 100010</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> M 1000010</span></span><br><span class="line"><span class="type">int</span> n,q;</span><br><span class="line"><span class="keyword">struct</span> <span class="title class_">node</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> lson, rson, cnt;</span><br><span class="line">    ll sum;</span><br><span class="line"><span class="meta">#<span class="keyword">define</span> lson(x) tree[x].lson</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> rson(x) tree[x].rson</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> cnt(x) tree[x].cnt</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> sum(x) tree[x].sum</span></span><br><span class="line">&#125;tree[N*<span class="number">20</span>];</span><br><span class="line">map&lt;ll, ll&gt;lsh;</span><br><span class="line">ll rlsh[N];</span><br><span class="line">ll lsh_cnt;</span><br><span class="line"><span class="type">int</span> cnt;</span><br><span class="line">ll a[N];</span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">new_node</span><span class="params">(<span class="type">int</span> old)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    cnt++;</span><br><span class="line">    tree[cnt] = tree[old];</span><br><span class="line">    <span class="keyword">return</span> cnt;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">upd</span><span class="params">(<span class="type">int</span> p)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    <span class="built_in">cnt</span>(p) = <span class="built_in">cnt</span>(<span class="built_in">lson</span>(p)) + <span class="built_in">cnt</span>(<span class="built_in">rson</span>(p));</span><br><span class="line">    <span class="built_in">sum</span>(p) = <span class="built_in">sum</span>(<span class="built_in">lson</span>(p)) + <span class="built_in">sum</span>(<span class="built_in">rson</span>(p));</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">build</span><span class="params">(<span class="type">int</span>&amp; p, <span class="type">int</span> l, <span class="type">int</span> r)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    p = <span class="built_in">new_node</span>(<span class="number">0</span>);</span><br><span class="line">    <span class="keyword">if</span> (l == r)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="type">int</span> mid = (l + r) &gt;&gt; <span class="number">1</span>;</span><br><span class="line">    <span class="built_in">build</span>(<span class="built_in">lson</span>(p), l, mid);</span><br><span class="line">    <span class="built_in">build</span>(<span class="built_in">rson</span>(p), mid + <span class="number">1</span>, r);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">change</span><span class="params">(<span class="type">int</span>&amp; p, <span class="type">int</span> p_old, <span class="type">int</span> l, <span class="type">int</span> r,ll v)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    p = <span class="built_in">new_node</span>(p_old);</span><br><span class="line">    <span class="keyword">if</span> (l == r)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">cnt</span>(p)++;</span><br><span class="line">        <span class="built_in">sum</span>(p) += rlsh[v];</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="type">int</span> mid = (l + r) &gt;&gt; <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">if</span> (v &lt;= mid)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">change</span>(<span class="built_in">lson</span>(p), <span class="built_in">lson</span>(p_old), l, mid, v);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">change</span>(<span class="built_in">rson</span>(p), <span class="built_in">rson</span>(p_old), mid + <span class="number">1</span>, r, v);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">upd</span>(p);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function">ll <span class="title">ask</span><span class="params">(<span class="type">int</span> p, <span class="type">int</span> pre, <span class="type">int</span> l, <span class="type">int</span> r,ll k)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    <span class="keyword">if</span> (l == r)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span> k * rlsh[l];</span><br><span class="line">    &#125;</span><br><span class="line">    ll delta_cnt = <span class="built_in">cnt</span>(<span class="built_in">rson</span>(p)) - <span class="built_in">cnt</span>(<span class="built_in">rson</span>(pre));</span><br><span class="line">    <span class="type">int</span> mid = (l + r) &gt;&gt; <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">if</span> (k &lt;= delta_cnt)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span> <span class="built_in">ask</span>(<span class="built_in">rson</span>(p), <span class="built_in">rson</span>(pre), mid + <span class="number">1</span>, r, k);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span> <span class="built_in">ask</span>(<span class="built_in">lson</span>(p), <span class="built_in">lson</span>(pre), l, mid, k - delta_cnt) + <span class="built_in">sum</span>(<span class="built_in">rson</span>(p)) - <span class="built_in">sum</span>(<span class="built_in">rson</span>(pre));</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br><span class="line"><span class="type">int</span> root[N];</span><br><span class="line">ll i2[N];</span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">solve</span><span class="params">()</span> </span>&#123;</span><br><span class="line">    cin &gt;&gt; n;</span><br><span class="line">    </span><br><span class="line">    <span class="keyword">for</span> (ll i = <span class="number">1</span>; i &lt;= n; i++) i2[i] = i2[i - <span class="number">1</span>] + i * i;</span><br><span class="line">    lsh.<span class="built_in">clear</span>();</span><br><span class="line">    cnt = <span class="number">0</span>;</span><br><span class="line">    lsh_cnt = <span class="number">0</span>;</span><br><span class="line">    </span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">1</span>; i &lt;= n; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        cin &gt;&gt; a[i];</span><br><span class="line">        lsh[a[i]] = <span class="number">0</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">for</span> (<span class="keyword">auto</span> it = lsh.<span class="built_in">begin</span>(); it != lsh.<span class="built_in">end</span>(); it++)</span><br><span class="line">    &#123;</span><br><span class="line">        it-&gt;second = ++lsh_cnt;</span><br><span class="line">        rlsh[lsh_cnt] = it-&gt;first;</span><br><span class="line">    &#125;</span><br><span class="line">    </span><br><span class="line">    <span class="built_in">build</span>(root[<span class="number">0</span>], <span class="number">1</span>, lsh_cnt);</span><br><span class="line">    </span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">1</span>; i &lt;= n; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">change</span>(root[i], root[i - <span class="number">1</span>], <span class="number">1</span>, lsh_cnt, lsh[a[i]]);</span><br><span class="line">    &#125;</span><br><span class="line">    </span><br><span class="line">    cin &gt;&gt; q;</span><br><span class="line">    <span class="keyword">while</span> (q--)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="type">int</span> l, r, k;</span><br><span class="line">        cin &gt;&gt; l &gt;&gt; r &gt;&gt; k;</span><br><span class="line">        ll ans = <span class="built_in">ask</span>(root[r], root[l - <span class="number">1</span>], <span class="number">1</span>, lsh_cnt, k);</span><br><span class="line">        ans += i2[r - l + <span class="number">1</span>];</span><br><span class="line">        cout &lt;&lt; ans &lt;&lt; endl;</span><br><span class="line">    &#125;</span><br><span class="line">    </span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/04/24/ZCPC17th-E-Easy-DP-Problem/</id>
    <link href="https://blog.vanilla-chan.cn/2025/04/24/ZCPC17th-E-Easy-DP-Problem/"/>
    <published>2025-04-24T03:09:58.000Z</published>
    <summary>
      <![CDATA[<h1 id="ZCPC17th-E-Easy-DP-Problem"><a href="#ZCPC17th-E-Easy-DP-Problem" class="headerlink" title="ZCPC17th E Easy DP Problem"></a>ZCPC17th E Easy DP Problem</h1><h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://codeforces.com/gym/102770/problem/E">Problem</a></h2><p>由于这题前面的思维推到部分我没有参与，主要是现学（复习）了一下主席树，所以主要讲主席树的部分。</p>
<p>题目可转化为：</p>
<p>给一个长度为 $n$ 的数组 $a_i$，有 $q$ 个询问，每次询问区间 $[l,r]$ 中最大的 $k$ 个数之和，再加上 $\sum_{i=1}^{r-l+1}i^2$。</p>
<p>$n\le10^5,q\le10^5,a_i\le10^6$</p>
<p>$T\le100,\sum n\le5\times10^5,\sum q\le5\times 10^5$</p>]]>
    </summary>
    <title>ZCPC17th E Easy DP Problem</title>
    <updated>2025-04-24T03:09:58.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="GPU" scheme="https://blog.vanilla-chan.cn/tags/GPU/"/>
    <category term="eGPU" scheme="https://blog.vanilla-chan.cn/tags/eGPU/"/>
    <content>
      <![CDATA[<h1 id="yoga14c2024-ultra7-155H-使用雷电4转接oculink外接RTX4070Ti-Super跑分"><a href="#yoga14c2024-ultra7-155H-使用雷电4转接oculink外接RTX4070Ti-Super跑分" class="headerlink" title="yoga14c2024(ultra7-155H)使用雷电4转接oculink外接RTX4070Ti Super跑分"></a>yoga14c2024(ultra7-155H)使用雷电4转接oculink外接RTX4070Ti Super跑分</h1><h2 id="自媒体跑分"><a href="#自媒体跑分" class="headerlink" title="自媒体跑分"></a>自媒体跑分</h2><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250301-165707-38098.png" alt=""></p><h2 id="内屏"><a href="#内屏" class="headerlink" title="内屏"></a>内屏</h2><script type="math/tex; mode=display">损耗=1-16731/24723\approx32.3\%\nonumber</script><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250421-112840-10001.png" alt=""></p><h2 id="外屏3-2k165fps"><a href="#外屏3-2k165fps" class="headerlink" title="外屏3.2k165fps"></a>外屏3.2k165fps</h2><script type="math/tex; mode=display">损耗=1-19549/24723\approx20.9\%\nonumber</script><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250421-112859-10001.png" alt=""></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/04/24/yoga14c2024-ultra7-155H-%E4%BD%BF%E7%94%A8%E9%9B%B7%E7%94%B54%E8%BD%AC%E6%8E%A5oculink%E5%A4%96%E6%8E%A5RTX4070Ti-Super%E8%B7%91%E5%88%86/</id>
    <link href="https://blog.vanilla-chan.cn/2025/04/24/yoga14c2024-ultra7-155H-%E4%BD%BF%E7%94%A8%E9%9B%B7%E7%94%B54%E8%BD%AC%E6%8E%A5oculink%E5%A4%96%E6%8E%A5RTX4070Ti-Super%E8%B7%91%E5%88%86/"/>
    <published>2025-04-24T02:33:05.000Z</published>
    <summary>省流：雷电损耗超级大。</summary>
    <title>yoga14c2024(ultra7-155H)使用雷电4转接oculink外接RTX4070Ti Super跑分</title>
    <updated>2025-04-24T02:33:05.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="GPU" scheme="https://blog.vanilla-chan.cn/tags/GPU/"/>
    <category term="eGPU" scheme="https://blog.vanilla-chan.cn/tags/eGPU/"/>
    <content>
      <![CDATA[<h1 id="ThinkBook16p2023-i9-13900H-使用m2转接oculink外接RTX4070Ti-Super跑分"><a href="#ThinkBook16p2023-i9-13900H-使用m2转接oculink外接RTX4070Ti-Super跑分" class="headerlink" title="ThinkBook16p2023(i9-13900H)使用m2转接oculink外接RTX4070Ti Super跑分"></a>ThinkBook16p2023(i9-13900H)使用m2转接oculink外接RTX4070Ti Super跑分</h1><h2 id="自媒体跑分"><a href="#自媒体跑分" class="headerlink" title="自媒体跑分"></a>自媒体跑分</h2><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250301-165707-38098.png" alt=""></p><h2 id="内屏"><a href="#内屏" class="headerlink" title="内屏"></a>内屏</h2><p><a href="https://www.3dmark.com/3dm/127107225">NVIDIA GeForce RTX 4070 Ti SUPER 显卡基准测试结果 - Intel Core i9-13900H Processor,LENOVO LNVNB161216</a></p><script type="math/tex; mode=display">损耗=1-22622/24723\approx8.50\%\nonumber</script><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250301-170027-49757.png" alt=""></p><h2 id="外屏2k60fps"><a href="#外屏2k60fps" class="headerlink" title="外屏2k60fps"></a>外屏2k60fps</h2><p><a href="https://www.3dmark.com/3dm/127108608">NVIDIA GeForce RTX 4070 Ti SUPER 显卡基准测试结果 - Intel Core i9-13900H Processor,LENOVO LNVNB161216</a></p><script type="math/tex; mode=display">损耗=1-23589/24723\approx4.59\%\nonumber</script><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250301-170141-34219.png" alt=""></p><h2 id="外屏3-2k165fps"><a href="#外屏3-2k165fps" class="headerlink" title="外屏3.2k165fps"></a>外屏3.2k165fps</h2><p><a href="https://www.3dmark.com/3dm/128595668">NVIDIA GeForce RTX 4070 Ti SUPER 显卡基准测试结果 - Intel Core i9-13900H Processor,LENOVO LNVNB161216</a></p><script type="math/tex; mode=display">损耗=1-24037/24723\approx2.77\%\nonumber</script><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250317-215512-10001.png" alt=""></p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/03/01/ThinkBook16p2023-i9-13900H-%E4%BD%BF%E7%94%A8m2%E8%BD%AC%E6%8E%A5oculink%E5%A4%96%E6%8E%A5RTX4070Ti-Super%E8%B7%91%E5%88%86/</id>
    <link href="https://blog.vanilla-chan.cn/2025/03/01/ThinkBook16p2023-i9-13900H-%E4%BD%BF%E7%94%A8m2%E8%BD%AC%E6%8E%A5oculink%E5%A4%96%E6%8E%A5RTX4070Ti-Super%E8%B7%91%E5%88%86/"/>
    <published>2025-03-01T09:33:53.000Z</published>
    <summary>省流：内屏损耗8%，外屏损耗2%~5%。</summary>
    <title>ThinkBook16p2023(i9-13900H)使用m2转接oculink外接RTX4070Ti Super跑分</title>
    <updated>2025-03-01T09:33:53.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="markdown" scheme="https://blog.vanilla-chan.cn/tags/markdown/"/>
    <content>
      <![CDATA[<h2 id="安装"><a href="#安装" class="headerlink" title="安装"></a>安装</h2><p><a href="https://github.com/microsoft/markitdown">microsoft/markitdown: Python tool for converting files and office documents to Markdown.</a></p><p>官网给出了两个方法：</p><p>目前（20250224），直接使用<code>pip install markitdown</code>会安装<code>markitdown-0.0.1a4</code>，而目前最新版是<code>markitdown-0.0.2a1</code>，故建议用第二种方法从源代码进行构建：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">git <span class="built_in">clone</span> git@github.com:microsoft/markitdown.git</span><br><span class="line"><span class="built_in">cd</span> markitdown</span><br><span class="line">pip install -e packages/markitdown</span><br></pre></td></tr></table></figure><h2 id="主要参数解释"><a href="#主要参数解释" class="headerlink" title="主要参数解释"></a>主要参数解释</h2><p><code>-h, --help</code>：显示帮助信息</p><p><code>-v, --version</code>：显示版本号</p><p><code>-o OUTPUT, --output OUTPUT</code>：指定输出文件名（如果不指定，将输出到控制台）</p><p><code>-d, --use-docintel</code>：使用文档智能服务来提取文本（需要有效的 Document Intelligence 端点）</p><p><code>-p, --use-plugins</code>：使用第三方插件来转换文件</p><p><code>--list-plugins</code>：列出已安装的第三方插件</p><h2 id="使用"><a href="#使用" class="headerlink" title="使用"></a>使用</h2><h3 id="基本信息"><a href="#基本信息" class="headerlink" title="基本信息"></a>基本信息</h3><p>在命令行输入 <code>markitdown -v</code> 会输出版本：</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">C:\Users\Vanilla&gt;</span><br><span class="line">markitdown 0.0.2a1</span><br></pre></td></tr></table></figure><p>输出帮助信息： <code>markitdown -h</code></p><p>测试第三方插件：<code>markitdown --list-plugins</code></p><h3 id="docx文件测试"><a href="#docx文件测试" class="headerlink" title="docx文件测试"></a>docx文件测试</h3><p>我选择之前美赛的论文进行测试。</p><p>这份完整的数模论文该有的部件都有：公式、图片、表格、题注、多级标题、加粗、斜体、链接、序号、页眉；其中，行间公式使用的是mathtype，行内公式使用的是word自带的公式编辑器。</p><h4 id="执行命令"><a href="#执行命令" class="headerlink" title="执行命令"></a>执行命令</h4><figure class="highlight powershell"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">Measure-Command</span> &#123;</span><br><span class="line">    markitdown .\MCM<span class="literal">-finish</span>.docx <span class="literal">-o</span> docx.md</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><h4 id="部分测试结果"><a href="#部分测试结果" class="headerlink" title="部分测试结果"></a>部分测试结果</h4><p><strong>摘要部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250224-195930-89896.png" alt=""></p><p>提取结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">Saving Juneau: Sustainable Development in Tourism</span><br><span class="line"></span><br><span class="line"><span class="strong">**Summary**</span></span><br><span class="line"></span><br><span class="line">Excessive tourism in Juneau City has caused environmental and social challenges. To address these issues and promote sustainable development, we developed a multi-objective optimization model for sustainable tourism and applied it to Juneau City.</span><br><span class="line"></span><br><span class="line">We constructed a general multi-objective optimization model with <span class="strong">**tourist numbers**</span> as the decision variable. The <span class="strong">**objective function**</span> integrates economic, environmental, and social factors, resulting in six goals. <span class="strong">**Constraints**</span> include carbon emissions, water resource utilization, and waste management. Further research will refine this model for application in other cities.</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>页眉完全没有被提取</li><li>标题 <code>Saving Juneau: Sustainable Development in Tourism</code> 原本是<code>标题</code>，这里变成了正常文本</li><li><strong>加粗</strong>正常</li></ul><p><strong>目录部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250224-200453-53491.png" alt=""></p><p>提取结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br></pre></td><td class="code"><pre><span class="line"><span class="strong">**Contents**</span></span><br><span class="line"></span><br><span class="line">[<span class="string">1 Introduction 3</span>](<span class="link">#_Toc188935048</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">1.1 Background 3</span>](<span class="link">#_Toc188935049</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">1.2 Restatement of the problem 3</span>](<span class="link">#_Toc188935050</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">1.3 Our works 4</span>](<span class="link">#_Toc188935051</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">2 Model Preparation 4</span>](<span class="link">#_Toc188935052</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">2.1 Assumptions and Justifications 4</span>](<span class="link">#_Toc188935053</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">2.2 Notations 5</span>](<span class="link">#_Toc188935054</span>)</span><br><span class="line"></span><br><span class="line">[<span class="string">3 Juneau: A Sustainable Tourism Model 6</span>](<span class="link">#_Toc188935055</span>)</span><br></pre></td></tr></table></figure><ul><li>原本目录是可以跳转的。可以发现，这里转换的保留了跳转域，但是完全不可用啊……</li></ul><p><strong>正文部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250506-110509-10001.png" alt=""></p><p>转换结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br></pre></td><td class="code"><pre><span class="line"><span class="section"># Introduction</span></span><br><span class="line"></span><br><span class="line"><span class="section">## Background</span></span><br><span class="line"></span><br><span class="line">![图示</span><br><span class="line"></span><br><span class="line">描述已自动生成](data:image/png;base64...)</span><br><span class="line"></span><br><span class="line">Figure :Current situation map of Juneau City[1]</span><br><span class="line"></span><br><span class="line">In 2023, Juneau, Alaska, hosted 1.6 million cruise passengers, with a daily peak of up to 20,000 visitors. While this influx brought significant economic benefits, it also caused overcrowding and accelerated glacial retreat, impacting natural attractions and potentially deterring future tourists. Additionally, excessive tourism has increased hidden costs related to infrastructure strain, environmental damage, and social challenges.</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li><p>一级、二级标题格式转换正常</p></li><li><p>图片似乎是想要转换为base64的格式，但是</p><ul><li><p>内容没有发生转换</p></li><li><p>图片描述是word自动生成的一句提示“图示描述已自动生成”，但是自动生成的描述去哪里了呢？</p></li><li>图片描述中间还有两个换行符是怎么回事</li></ul></li><li><p>图片题注变成了正常文本，但是图片序号（包含域信息）消失了</p></li><li>引用直接变成了纯文本</li></ul><p><strong>符号说明部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250225-102117-78916.png" alt=""></p><p>转换结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="bullet">*</span> <span class="strong">**Assumption 2:**</span> Ignoring the carbon footprint caused by tourists&#x27; use of transportation within the city of Juneau.</span><br><span class="line"><span class="bullet">*</span> Justification: Juneau has no direct roads. Most tourists choose cruise ships or planes to reach there. In contrast, the carbon footprint generated by tourists&#x27; sightseeing within the city can be negligible.</span><br><span class="line"></span><br><span class="line"><span class="section">## Notations</span></span><br><span class="line"></span><br><span class="line">| Notation | Description | Unit |</span><br><span class="line">| --- | --- | --- |</span><br><span class="line">|  | Direct income from tourism | USD |</span><br><span class="line">|  | The i-th source of direct income from tourism | USD |</span><br><span class="line">|  | Tax revenue | USD |</span><br><span class="line">|  | Daily water consumption per tourist | L/person/day |</span><br><span class="line">|  | Carbon footprint | t |</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>序号转换成功，这里使用的是 <code>*</code>，使用着</li><li>表格正常转换</li><li>表格中最左边一列是word公式，全部消失</li></ul><p><strong>附录部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250226-083708-14387.png" alt=""></p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line"><span class="section"># References</span></span><br><span class="line"></span><br><span class="line"><span class="bullet">1.</span> Background image source: Travel Juneau. (n.d.). <span class="emphasis">*Home*</span>. <span class="language-xml">&lt;https://www.traveljuneau.com/&gt;</span></span><br><span class="line"><span class="bullet">2.</span> LSC Transportation Consultants, Inc. (2024). <span class="emphasis">*Juneau visitor circulator study final report (Prepared for City and Borough of Juneau)*</span>. <span class="language-xml">&lt;https://juneau.org/wp-content/uploads/2024/02/Juneau-Visitor-Circulator-Study-Final-Report-2024-1.pdf&gt;</span></span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>斜体正常</li><li>链接正常，但是这里直接使用了 <code>&lt;link&gt;</code> 的方式而非 <code>markdown</code> 中更常用的 <code>[name](link)</code></li></ul><h4 id="测试总结"><a href="#测试总结" class="headerlink" title="测试总结"></a>测试总结</h4><div class="table-container"><table><thead><tr><th>文档部件</th><th>转换情况</th><th>备注</th></tr></thead><tbody><tr><td>文件类型</td><td>docx</td><td>最新版的word</td></tr><tr><td>文件大小</td><td>16.3MB</td><td>图片较多，分辨率较大；25页，计空格39578字</td></tr><tr><td>转换耗时</td><td>2.4986917</td><td>可以说是挺快的了</td></tr><tr><td>公式</td><td>×</td><td>所有公式直接消失了</td></tr><tr><td>图片</td><td>×</td><td>完全不可用</td></tr><tr><td>表格</td><td>√</td><td></td></tr><tr><td>题注</td><td>√</td><td>变成文字</td></tr><tr><td>多级标题</td><td>√</td><td>多级标题正常；普通标题变成正常文本</td></tr><tr><td>加粗</td><td>√</td><td></td></tr><tr><td>斜体</td><td>√</td><td></td></tr><tr><td>链接</td><td>√</td><td></td></tr><tr><td>序号</td><td>√</td><td></td></tr><tr><td>页眉</td><td>×</td><td>消失</td></tr><tr><td>目录</td><td>√</td><td>正常文本，域跳转不可用</td></tr></tbody></table></div><h3 id="pdf文件测试"><a href="#pdf文件测试" class="headerlink" title="pdf文件测试"></a>pdf文件测试</h3><h4 id="执行命令-1"><a href="#执行命令-1" class="headerlink" title="执行命令"></a>执行命令</h4><figure class="highlight powershell"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">Measure-Command</span> &#123;</span><br><span class="line">    markitdown .\MCM<span class="literal">-finish</span>.pdf <span class="literal">-o</span> pdf.md</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><h4 id="部分测试结果-1"><a href="#部分测试结果-1" class="headerlink" title="部分测试结果"></a>部分测试结果</h4><p><strong>摘要部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250224-195930-89896.png" alt=""></p><p>提取结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br></pre></td><td class="code"><pre><span class="line">Problem Chosen</span><br><span class="line">X</span><br><span class="line"></span><br><span class="line">2025</span><br><span class="line">MCM/ICM</span><br><span class="line">Summary Sheet</span><br><span class="line"></span><br><span class="line"><span class="code">      Team Control Number</span></span><br><span class="line"><span class="code"></span></span><br><span class="line">XXXXXXX</span><br><span class="line"></span><br><span class="line">  Saving Juneau: Sustainable Development in Tourism</span><br><span class="line"></span><br><span class="line">Summary</span><br><span class="line"></span><br><span class="line">Excessive tourism in Juneau City has caused environmental and social challenges.</span><br><span class="line">To address these issues and promote sustainable development, we developed a multi-</span><br><span class="line">objective optimization model for sustainable tourism and applied it to Juneau City.</span><br><span class="line"></span><br><span class="line">We  constructed  a  general  multi-objective  optimization  model  with  tourist</span><br><span class="line">numbers  as  the  decision  variable.  The  objective  function  integrates  economic,</span><br><span class="line">environmental, and social factors, resulting in six goals. Constraints include carbon</span><br><span class="line">emissions,  water  resource  utilization,  and  waste  management.  Further  research  will</span><br><span class="line">refine this model for application in other cities.</span><br><span class="line"></span><br><span class="line">Task  1: We  extended  the  model  by  adding  sales  tax  and  hotel  tax  as  decision</span><br><span class="line">variables and maximizing tax revenue with related constraints. Using literature review</span><br><span class="line">and linear regression, we determine the values, estimate the parameters and applied the</span><br><span class="line">NSGA-II  algorithm  to  find  Pareto  optimal  solutions. The  entropy  weight  method</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>页眉的文字也能够转换了，虽然格式有点乱，但是至少是有的</li><li>摘要部分的每一个自动换行都变成了换行符。这应该是与PDF存段落的方式（每行分开存储）有关</li><li>没有任何的格式（加粗没了）</li></ul><p><strong>目录部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250224-200453-53491.png" alt=""></p><p>提取结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br></pre></td><td class="code"><pre><span class="line">Team#XXXXXXX</span><br><span class="line"></span><br><span class="line">Page  2  of  25</span><br><span class="line"></span><br><span class="line">Contents</span><br><span class="line"></span><br><span class="line">1</span><br><span class="line"></span><br><span class="line">Introduction ..................................................................................................... 3</span><br><span class="line">1.1  Background ......................................................................................... 3</span><br><span class="line">1.2  Restatement of the problem ................................................................. 3</span><br><span class="line">1.3  Our works ............................................................................................ 4</span><br><span class="line">2  Model Preparation ........................................................................................... 4</span><br><span class="line">2.1  Assumptions and Justifications ........................................................... 4</span><br><span class="line">2.2  Notations ............................................................................................. 5</span><br><span class="line">3  Juneau: A Sustainable Tourism Model ............................................................ 6</span><br></pre></td></tr></table></figure><ul><li>页眉部分正常</li><li>没有能够跳转域信息</li><li>所见即所得：PDF中的所有文本都被成功的转换了，最大程度的保留了文本信息</li></ul><p><strong>正文部分</strong></p><p><img src="markitdown的安装和简单使用.assets/20250224-201451-89946.png" alt=""></p><p>转换结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line">1  Introduction</span><br><span class="line"></span><br><span class="line">1.1 Background</span><br><span class="line"></span><br><span class="line">Figure 1:Current situation map of Juneau City[1]</span><br><span class="line"></span><br><span class="line">In 2023, Juneau, Alaska, hosted 1.6 million cruise passengers, with a daily peak</span><br><span class="line">of up to 20,000 visitors. While this influx brought significant economic benefits, it also</span><br><span class="line">caused overcrowding and accelerated glacial retreat, impacting natural attractions and</span><br><span class="line">potentially  deterring  future  tourists.  Additionally,  excessive  tourism  has  increased</span><br><span class="line">hidden  costs  related  to  infrastructure  strain,  environmental  damage,  and  social</span><br><span class="line">challenges.</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li><p>没有一级、二级标题格式，但是有一级、二级序号</p></li><li><p>图片完全消失</p></li><li><p>图片题注当然也没有</p></li><li>引用变成了纯文本</li></ul><p><strong>符号说明部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250225-102117-78916.png" alt=""></p><p>转换结果：</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br></pre></td><td class="code"><pre><span class="line">  Justification: Juneau has no direct roads. Most tourists choose cruise ships or</span><br><span class="line">planes to reach there. In contrast, the carbon footprint generated by tourists&#x27;</span><br><span class="line">sightseeing within the city can be negligible.</span><br><span class="line"></span><br><span class="line">2.2 Notations</span><br><span class="line"></span><br><span class="line">Notation</span><br><span class="line"></span><br><span class="line">Description</span><br><span class="line">Direct income from tourism</span><br><span class="line">The i-th source of direct income from tourism</span><br><span class="line">Tax revenue</span><br><span class="line">Daily water consumption per tourist</span><br><span class="line"></span><br><span class="line">……</span><br><span class="line"></span><br><span class="line">Unit</span><br><span class="line">USD</span><br><span class="line">USD</span><br><span class="line">USD</span><br><span class="line">L/person/day</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>序号转换成了不知道是个什么东西： <code></code></li><li>表格格式转换失败，只有文字</li><li>表格中最左边一列是word公式，全部消失</li><li>遵循的是先行再列而不是先列再行，不符合逻辑</li></ul><p><strong>附录部分</strong></p><p><img src="https://vanilla-picture-with-picgo.oss-cn-shenzhen.aliyuncs.com/img-from-OSS-uploader/20250226-083708-14387.png" alt=""></p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line">References</span><br><span class="line"></span><br><span class="line">[1]  Background  image  source:  Travel  Juneau.  (n.d.). Home. https://www.traveljuneau.com/</span><br><span class="line"></span><br><span class="line">[2]  LSC  Transportation  Consultants,  Inc.  (2024).  Juneau  visitor  circulator  study  final  repo</span><br><span class="line"></span><br><span class="line">rt  (Prepared  for  City  and  Borough  of  Juneau).  https://juneau.org/wp-content/uploads/20</span><br><span class="line"></span><br><span class="line">24/02/Juneau-Visitor-Circulator-Study-Final-Report-2024-1.pdf</span><br></pre></td></tr></table></figure><p>可以发现：</p><ul><li>斜体格式消失</li><li>链接有的正常有的不正常，因为换行会把链接截断</li><li>链接没有使用markdown的格式而是裸露的网址</li></ul><h4 id="测试总结-1"><a href="#测试总结-1" class="headerlink" title="测试总结"></a>测试总结</h4><div class="table-container"><table><thead><tr><th>文档部件</th><th>转换情况</th><th>备注</th></tr></thead><tbody><tr><td>文件类型</td><td>pdf</td><td></td></tr><tr><td>文件大小</td><td>5.42MB</td><td>图片较多，分辨率较大；25页，计空格39578字</td></tr><tr><td>转换耗时</td><td>12.411024</td><td>比word转md慢，大约是其5倍</td></tr><tr><td>公式</td><td>×</td><td>所有公式直接消失了</td></tr><tr><td>图片</td><td>×</td><td>图片消失</td></tr><tr><td>表格</td><td>×</td><td>表格格式消失</td></tr><tr><td>题注</td><td>√</td><td>变成文字</td></tr><tr><td>多级标题</td><td>×</td><td>变成（带序号的）正常文本</td></tr><tr><td>加粗</td><td>×</td><td></td></tr><tr><td>斜体</td><td>×</td><td></td></tr><tr><td>链接</td><td>×</td><td>纯文本，且会被换行截断</td></tr><tr><td>序号</td><td>×</td><td>纯文本</td></tr><tr><td>页眉</td><td>√</td><td>纯文本</td></tr><tr><td>目录</td><td>√</td><td>纯正常文本</td></tr></tbody></table></div>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/02/27/markitdown%E7%9A%84%E5%AE%89%E8%A3%85%E5%92%8C%E7%AE%80%E5%8D%95%E4%BD%BF%E7%94%A8/</id>
    <link href="https://blog.vanilla-chan.cn/2025/02/27/markitdown%E7%9A%84%E5%AE%89%E8%A3%85%E5%92%8C%E7%AE%80%E5%8D%95%E4%BD%BF%E7%94%A8/"/>
    <published>2025-02-27T03:51:02.000Z</published>
    <summary>这篇blog介绍了markitdown工具的基本安装方法和主要功能，包括使用文档智能服务提取文本和第三方插件转换文件。通过测试Word文档和PDF文件，展示了工具在不同文件类型下的转换效果和局限性，如公式和图片转换失败、链接格式不一致等问题，同时强调了工具的高效性和适用性。</summary>
    <title>markitdown的安装和简单使用</title>
    <updated>2025-02-27T03:51:02.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Notes" scheme="https://blog.vanilla-chan.cn/categories/Notes/"/>
    <category term="大学物理" scheme="https://blog.vanilla-chan.cn/tags/%E5%A4%A7%E5%AD%A6%E7%89%A9%E7%90%86/"/>
    <category term="废纸篓" scheme="https://blog.vanilla-chan.cn/tags/%E5%BA%9F%E7%BA%B8%E7%AF%93/"/>
    <content>
      <![CDATA[<h1 id="振动"><a href="#振动" class="headerlink" title="振动"></a>振动</h1><h2 id="基础公式"><a href="#基础公式" class="headerlink" title="基础公式"></a>基础公式</h2><script type="math/tex; mode=display">\begin{align}x&amp;=A\cdot \cos(\omega t+\phi)\\v&amp;=-A\omega\cdot\sin(\omega t+\phi)\\a&amp;=-A\omega^2\cdot\cos(\omega t+\phi)=-\omega^2x\end{align}</script><h3 id="简谐振动的特征量"><a href="#简谐振动的特征量" class="headerlink" title="简谐振动的特征量"></a>简谐振动的特征量</h3><p>圆频率 $\omega$，周期 $T=\frac{2\pi}{\omega}$，频率 $v=\frac1T$</p><p>对于弹簧振子，有 $T=2\pi\sqrt\frac{m}{k}$；对于单摆，有 $T=2\pi\sqrt\frac{l}{g}$</p><p>振幅 $A=\sqrt{x_0^2+(\frac{v_0}{\omega})^2}$</p><p>初相位 $\omega=\arctan(-\frac{v_0}{\omega x_0})$</p><h2 id="简谐运动的判断"><a href="#简谐运动的判断" class="headerlink" title="简谐运动的判断"></a>简谐运动的判断</h2><p>回复力与位移成正比，且指向平衡位置：$F=-kx\Rightarrow ma=-kx\Rightarrow a=-\frac{k}{m}x$。所以，$k=m\omega^2$。</p><p>振动方程可化为 $m\frac{\mathrm d^2x}{\mathrm dt^2}=-kx$ 或 $\frac{\mathrm d^2x}{\mathrm dt^2}+\omega^2x=0$</p><p>对于单摆，$-gml\theta=ml^2\frac{\mathrm d^2\theta}{\mathrm dt^2}$</p><h2 id="简谐运动的能量"><a href="#简谐运动的能量" class="headerlink" title="简谐运动的能量"></a>简谐运动的能量</h2><script type="math/tex; mode=display">\begin{align}E_k&amp;=\frac12mv^2=\frac12mA^2\omega^2\sin^2(\omega t+\phi)\\E_p&amp;=\frac12kx^2=\frac12m\omega^2A^2\cos^2(\omega t+\phi)\\E&amp;=E_k+E_p=\frac12m\omega^2A^2\end{align}</script><h2 id="简谐运动的合成"><a href="#简谐运动的合成" class="headerlink" title="简谐运动的合成"></a>简谐运动的合成</h2><p>只能合成同周期的几个简谐振动。</p><p>使用旋转矢量法，画两个同心圆。</p><h1 id="波动"><a href="#波动" class="headerlink" title="波动"></a>波动</h1><h2 id="基础变量"><a href="#基础变量" class="headerlink" title="基础变量"></a>基础变量</h2><p>波速 $u$：振动状态（波）的传播速度，不是质元运动速度。</p><p>周期 $T$：一个完整波通过波线上某点所需的时间，频率 $\nu=\frac1T$，角频率 $\omega=2\pi\nu$。这里周期、频率和</p><p>波长 $\lambda$：波线上相邻的振动状态相同的两质元之间的距离，</p><p>$u=\lambda f=\lambda\frac1T\Rightarrow \lambda=uT$</p><h2 id="波函数"><a href="#波函数" class="headerlink" title="波函数"></a>波函数</h2><script type="math/tex; mode=display">\begin{align}y&amp;=A \cos \left[\omega\left(t \mp \frac{x}{u}\right)+\varphi_0\right]\\ &amp;\text { 或 } \\y&amp;=A \cos \left(\omega t \mp \frac{2 \pi}{\lambda} x+\varphi_0\right)\end{align}</script><p>其中，$x$ 表示的是位置，而 $y$ 才是振幅。</p><p>正向传播取负号，负向传播取正号。</p><p>可以发现，其相较于振动方程，就给 $t$ 多减去了一项 $\frac{x}{u}$，可以理解为距离原点 $x$ 处会有 $t’=x/u$ 的“领先”。</p><h3 id="如何求波函数"><a href="#如何求波函数" class="headerlink" title="如何求波函数"></a>如何求波函数</h3><p>先写出任意一个质点 $(x=d)$ 的振动方程（当然最好是取原点处的）：</p><p>$y=A\cos(\omega t+\varphi_0)$</p><p>而波每传播 $\lambda$，相位就落后 $2\pi$，所以要进行调整：</p><p>$y=A\cos[][\omega t+\varphi_0\mp\frac{2\pi}\lambda(x-d)]$</p><h2 id="波的能量"><a href="#波的能量" class="headerlink" title="波的能量"></a>波的能量</h2><p>和振动不一样，质元的能量密度时刻刻保持着动能和势能相等，但是总能量随着时间而变化。</p><p>在最大位移处，能量密度为0（想象一根绳子，最高峰处拉伸最小）；平衡位置处能量密度最大。</p><p>一个周期内平均能量密度为 $\overline W=\frac12\rho\omega^2A^2$</p><p>平均能流：单位时间内，通过垂直于波传播方向的面积 $\Delta S$ 的能量，类似于功率？</p><p>$\overline P=\frac12\Delta S \omega^2A^2u=\overline W u\Delta S$</p><p>平均能流密度/波的强度：单位面积的平均能流，也就是除去 $\Delta S$</p><p>$I=\overline W u$</p><h2 id="波的叠加"><a href="#波的叠加" class="headerlink" title="波的叠加"></a>波的叠加</h2><p>两个波相遇，相遇的地方叠加（合成），但是相遇前后还是保持着原来的性质。</p><h2 id="波的干涉"><a href="#波的干涉" class="headerlink" title="波的干涉"></a>波的干涉</h2><p>波在叠加时。在空间出现稳定的振动加强和减弱的分布，叫做波的干涉。</p><p>要求：<strong>频率相同，振动方向相同，相位差固定</strong>。</p><p>两列波的波程差为 $r_2-r_1$ ，相位差为 $\varphi_2-\varphi_1-2 \pi \frac{r_2-r_1}{\lambda}$</p><p>相位差等于 $\pi$ 的偶数倍时为加强点，奇数倍时为减弱点。</p><h1 id="波动光学"><a href="#波动光学" class="headerlink" title="波动光学"></a>波动光学</h1><h2 id="基础知识"><a href="#基础知识" class="headerlink" title="基础知识"></a>基础知识</h2><p><strong>可见光的范围</strong></p><p>$\lambda=400 \sim 760nm,\nu=7.5\times 10^{14}\sim 4.3\times 10^{14}Hz$</p><p><strong>光矢量</strong></p><p>光是矢量，用 $\vec E$表示</p><p><strong>真空中的光速</strong></p><p>$\nu=\frac{1}{T}=\frac{1}{\frac{\lambda}{c}}=\frac{c}{\lambda}$</p><p>即 $u=c=\lambda \nu$</p><p><strong>介质中的光速</strong></p><p>光速 $u=\frac{1}{\sqrt{\varepsilon\mu}}=\lambda_n\nu$</p><p>抓住<strong>频率不变</strong>，波长和波速会变化。</p><p><strong>介质的折射率</strong></p><p>折射率 $n=\frac{c}{u}=\sqrt{\varepsilon_r\mu_r}$</p><p>折射率是真空光速与当前介质中的光速之比。</p><p>可见光的空气折射率为 $1.0$，其他非气体透明介质的折射率均大于 $1$，并且<strong>随频率变化</strong>。</p><p><strong>介质中的波长</strong></p><p>$\lambda_n=\frac{u}{\nu}=\frac{\lambda}{n}$</p><p>介质中的波长可以用波速除以频率来计算，也可以用真空中的波长除以折射率。</p><h2 id="相干光"><a href="#相干光" class="headerlink" title="相干光"></a>相干光</h2><p>条件：<strong>频率相同</strong>，<strong>振动方向相同</strong>，<strong>相位差恒定</strong>。</p><p>两种产生相干光的方法：<strong>振幅分割法</strong>，<strong>波阵面分割法</strong>。</p><h2 id="双缝干涉"><a href="#双缝干涉" class="headerlink" title="双缝干涉"></a>双缝干涉</h2><p>两个缝之间的距离为 $d$，光缝与照射面之间的距离为 $d’$，且默认 $d’&gt;&gt;d$。</p><p>由于照射面上的不同位置距离两条缝有微小的距离差，也就是波程差</p><p>波程差 $\Delta r=r_2-r_1\approx d\sin \theta=d\frac{x}{d'}$。</p><p>（其中 $\sin\theta\approx\tan\theta=\frac{x}{d’}$）</p><p>也就是 $x=\frac{d’}{d}\Delta r$</p><p>发现波程差和 $x$ 是呈正比的，非常简洁。系数 $\frac{d’}{d}$ 非常大，起到了一个“放大”的作用，使得波长大到肉眼可见的程度。</p><p>当 $\Delta r=\pm k\lambda \Rightarrow x=\pm k\frac{d’}{d}\lambda$ 时，明纹；</p><p>当 $\Delta r=\pm \frac{2k+1}{2}\lambda \Rightarrow x=\pm \frac{2k+1}{2}\frac{d’}{d}\lambda$ 时，暗纹；</p><p>（$k=0,1,2,\dots$）</p><p>图像上，中央是<strong>中央明纹</strong>，向上是<strong>正一级明纹</strong>，向下是<strong>负一级明纹</strong>。</p><p><strong>条纹间距</strong> $\Delta x=\frac{d’}{d}\lambda$。</p><p><strong>当白光照射时，会出现彩色条纹</strong></p><h3 id="光栅衍射"><a href="#光栅衍射" class="headerlink" title="光栅衍射"></a>光栅衍射</h3><p>光栅可以看作是多个双缝的叠加</p><p>$d\sin\theta=k\lambda(k=0,\pm1,\pm2,\dots)$</p><h2 id="薄膜干涉"><a href="#薄膜干涉" class="headerlink" title="薄膜干涉"></a>薄膜干涉</h2><p>薄膜有厚度 $d$。外界光在薄膜的两个面上都可能发生反射。</p><p>设光在外界的折射率为 $n_1$，在薄膜内的折射率为 $n_2$，入射角（光线与法线的夹角）为 $i$</p><p>则有</p><p><strong>反射光的光程差</strong> $\delta_r=2d\sqrt{n_2^2-n_1^2\sin^2i}+\frac\lambda2$</p><p>其中，<strong>半波损失 $\frac\lambda2$ 只存在于反射面，且当光从光疏介质到光密介质时发生</strong>。</p><blockquote><p>薄膜（比如玻璃）的密度（折射率）比空气肯定是要大的，即对于空气而言，玻璃算光密介质、空气是光疏介质。因此，光从空气射入玻璃时发生的反射会有 $\frac\lambda2$ 差异；而如果是玻璃内的光线在[玻璃-空气]界面上发生了反射，则不会有这个 $\frac\lambda2$。</p></blockquote><p>与双缝干涉相同，$\delta_r=k\lambda(k=1,2,\dots)$ 时发生加强，$\delta_r=\frac{2k+1}{2}\lambda(k=0,1,2,\dots)$ 时发生减弱。</p><p>需要注意，加强型的 $k$ 从 $1$ 开始取（少了一个 $0$），而减弱型的 $k$ 从 $0$ 开始取（和双缝干涉一样）。</p><p><strong>透射光的光程差</strong> $\delta_t=2d\sqrt{n_2^2-n_1^2\sin^2i}$</p><p><strong>透射光没有半波损失。半波损失只存在于反射的情况</strong>。</p><p>透射光干涉和反射光干涉具有<strong>互补性</strong>，符合能量守恒定律。</p><h3 id="薄膜干涉的特殊情况"><a href="#薄膜干涉的特殊情况" class="headerlink" title="薄膜干涉的特殊情况"></a>薄膜干涉的特殊情况</h3><p>垂直入射</p><blockquote><p>（$n_1,n_2,n_1$）从 $n_1$ 射入 $n_2$，$n_2&gt;n_1$</p></blockquote><p>$n_1$ 射入 $n_2$ 时的反射会发生半波损失。</p><p>由于是垂直入射，所以 $\sin i=0$</p><p>所以 $\delta_r=2dn_2+\frac\lambda2$</p><blockquote><p>（$n_1,n_2,n_3$）从 $n_1$ 射入 $n_2$，$n_3&gt;n_2&gt;n_1$</p></blockquote><p>$n_1$ 射入 $n_2$ 时的反射回发生半波损失；$n_2$ 射入 $n_3$时的反射也有半波损失。相当于没有 $\frac\lambda2$。</p><p>由于是垂直入射，所以 $\sin i=0$</p><p>所以 $\delta_r=2dn_2$</p><h3 id="薄膜干涉的用途"><a href="#薄膜干涉的用途" class="headerlink" title="薄膜干涉的用途"></a>薄膜干涉的用途</h3><ol><li>测定波长 $\lambda$</li><li>测定薄膜厚度 $d$</li><li>提高薄膜的反射率、降低透射率；或者提高透射率、降低反射率</li></ol><p>镀膜 $n_2$ 时，可以镀增反膜和增透膜。其中，增透膜需要 $n_1&lt;n_2&lt;n_3$；增反膜需要 $n_1&lt;n_2&gt;n_3$。</p><h3 id="劈尖干涉"><a href="#劈尖干涉" class="headerlink" title="劈尖干涉"></a>劈尖干涉</h3><p>复杂一点的薄膜干涉。公式和薄膜干涉相同：</p><p>$S=2nd+\frac\lambda2=k\lambda(k=1,2,\dots)$ 时为明纹</p><p>$S=2nd+\frac\lambda2=\frac{2k+1}{2}\lambda(k=0,1,2,\dots)$ 时为暗纹</p><p><strong>厚度（高度）差</strong> $\Delta d=\frac{\lambda}{2n}$</p><p>若明（暗）纹之间的间距是 $L$（在斜面上观察），则 $\tan \theta=\Delta d/L$。</p><h4 id="判断工件情况"><a href="#判断工件情况" class="headerlink" title="判断工件情况"></a>判断工件情况</h4><p>向棱边弯曲，记为左弯，说明工件表面凹陷。</p><h3 id="牛顿环"><a href="#牛顿环" class="headerlink" title="牛顿环"></a>牛顿环</h3><p>明纹半径 $r=\sqrt{\frac{(2k-1)R\lambda}{2n}}$</p><p>暗纹半径 $r=\sqrt{\frac{kR\lambda}{n}}$</p><p>其中 $R$ 是平凸透镜的曲率半径。</p><p>好像就是令 $r=\sqrt{2d}$ ？</p><h3 id="干涉仪"><a href="#干涉仪" class="headerlink" title="干涉仪"></a>干涉仪</h3><p>$\Delta d=\Delta N\cdot \frac{\lambda}2$</p><p>即，反射镜移动的距离等于移动的条数 $\Delta N$ 乘以半波长。</p><h2 id="单缝衍射"><a href="#单缝衍射" class="headerlink" title="单缝衍射"></a>单缝衍射</h2><p>(夫琅禾费衍射)</p><p>一束光经过一条宽度为 $b$ 的缝隙，会发生衍射。</p><p>设其中某条光线的衍射角为 $\theta$，则光程差为 $b\sin\theta$（和双缝干涉一样）。</p><p>发生单缝衍射后，使用凸透镜汇聚到白屏上，也会有明暗相间的条纹，但是不再是像双缝干涉那样的等间距了。<strong>单缝衍射的条纹中间特别宽</strong>。</p><h3 id="明暗条纹的条件"><a href="#明暗条纹的条件" class="headerlink" title="明暗条纹的条件"></a>明暗条纹的条件</h3><p>$b\sin\theta=\pm k\lambda$ 时，暗纹中心</p><p>$b\sin\theta=\pm \frac{2k+1}{2}\lambda$ 时，明纹中心</p><p>$k=1,2,\dots$</p><p><em>可以发现上面的结论和双缝干涉的结论是相反的！</em></p><p>$-\lambda&lt;b\sin\theta&lt;\lambda$ 时，中央明纹</p><h3 id="条纹宽度"><a href="#条纹宽度" class="headerlink" title="条纹宽度"></a>条纹宽度</h3><p>中央明纹宽度</p><p>角宽度 $\Delta\theta_0=2\frac{\lambda}{b}$</p><p>明条纹宽度 $\Delta x=\frac{\lambda}{b}f$</p><h3 id="单缝衍射条纹特点"><a href="#单缝衍射条纹特点" class="headerlink" title="单缝衍射条纹特点"></a>单缝衍射条纹特点</h3><p>中央是明纹，两边对称分布明暗相间、等宽、等间距的直条纹</p><p>中央明纹的是其他明纹宽度的 $2$ 倍</p><p>明纹亮度随衍射级数 $k$ 大而减弱</p><h3 id="半波带数量"><a href="#半波带数量" class="headerlink" title="半波带数量"></a>半波带数量</h3><p><strong>半波带数目的计算公式</strong></p><p>在衍射角 $\theta$ 方向上，半波带数目 $N$ 的计算公式为：</p><p>$N = \frac{d\sin\theta}{\lambda/2}$</p><p><strong>物理意义</strong></p><p>半波带数目 $N$ 表示在给定衍射角方向上，从单缝的一端到另一端，相邻点源之间的光程差为 $\lambda/2$ 的区域的数量。</p><p>这个数目直接影响衍射图样的<strong>强度分布</strong>，是理解单缝衍射现象的重要参数。</p><h2 id="光栅衍射-1"><a href="#光栅衍射-1" class="headerlink" title="光栅衍射"></a>光栅衍射</h2><p>测量单色光波长时，使用<strong>光栅衍射</strong>精度最高。</p><p>和双缝干涉一样，$d\sin \theta=k\lambda$ 时是明纹。</p><p>特殊之处：当 $\frac{d}{a}=\frac{k}{k’}$ 时，该 $k$ 级条纹会</p><h1 id="气体动理论"><a href="#气体动理论" class="headerlink" title="气体动理论"></a>气体动理论</h1><h2 id="物态方程"><a href="#物态方程" class="headerlink" title="物态方程"></a>物态方程</h2><p>$1Pa=1N\cdot m^{-2}$</p><p>标准大气压：$45\degree$ 纬度海平面处，$0\degree C$ 时的大气压，$1atm=1.013\times10^5Pa$</p><p>温度 $T=273.15+t$</p><p>华氏度 $t_F=(\frac95\cdot t+32)\degree F$</p><p>理想气体物态方程 $pV=\nu RT=\frac{气体的质量m’}{相对分子质量M}RT$，其中的$\nu$ 是分子个数（单位mol），或者叫摩尔数，对应的还有 $N=\nu N_A$ 是分子个数（单位个）</p><p><strong>摩尔气体常数</strong> $R=8.31J\cdot mol^{-1}\cdot K^{-1}$</p><p>$p=nkT$（这里的 $n$ 是分子数的密度 $n=\frac{N}{V}$），其中<strong>玻尔兹曼常数</strong> $k=R/N_A=1.38\times10^{-23}J\cdot K^{-1}$</p><h2 id="速率"><a href="#速率" class="headerlink" title="速率"></a>速率</h2><p>最概然速率 $v_p=\sqrt{\frac{2kT}{m}}$</p><p>平均速率 $\overline v=\int_0^\infty vf(v)\mathrm dv=\sqrt{\frac{8kT}{\pi m}}$</p><p>方均根速率 $\sqrt{\overline{v^2}}=\sqrt{\frac{3kT}{m}}$</p><p>理想气体压强公式 $p=\frac23n(\frac12m\overline{v^2})=\frac23n\overline{\varepsilon_k}$</p><p>理想气体温度公式 $\overline{\varepsilon_k}=\frac12m\overline{v^2}=\frac32kT$</p><h2 id="内能"><a href="#内能" class="headerlink" title="内能"></a>内能</h2><p>刚性分子的自由度</p><div class="table-container"><table><thead><tr><th style="text-align:center">分子</th><th style="text-align:center">t平动</th><th style="text-align:center">r转动</th><th style="text-align:center">i总</th></tr></thead><tbody><tr><td style="text-align:center">单原子分子</td><td style="text-align:center">3</td><td style="text-align:center">0</td><td style="text-align:center">3</td></tr><tr><td style="text-align:center"><strong>双原子分子</strong></td><td style="text-align:center"><strong>3</strong></td><td style="text-align:center"><strong>2</strong></td><td style="text-align:center"><strong>5</strong></td></tr><tr><td style="text-align:center">多原子分子</td><td style="text-align:center">3</td><td style="text-align:center">3</td><td style="text-align:center">6</td></tr></tbody></table></div><p>【围观】分子的平均动能 $\overline{\varepsilon_k}=\frac{i}2kT$</p><p>$1mol$ 分子的平均动能 $E_{mol}=N_A \frac{i}2 kT=\frac{i}2RT$</p><p>【宏观】<strong>内能</strong>即一堆分子的平均动能 $E=\frac{m}{M}\frac{i}2RT$</p><h1 id="热力学"><a href="#热力学" class="headerlink" title="热力学"></a>热力学</h1><p>$Q=E_2-E_1+W=\Delta E+W$</p><p>$吸收的热量=内能的变化量+对外界做功$</p><p><strong>对外做功</strong>：$W=\int_{V_1}^{V_2}p\mathrm dV$</p><p>可以看 <code>p-V</code> 图中曲线与V轴围成的<strong>面积</strong>。</p><p>气体的<strong>内能变化量</strong>：$\Delta E=\frac{i}2\frac mM R(T_2-T_1)=\frac{i}2(p_2V_2-p_1V_1)$</p><h2 id="气体的变化过程"><a href="#气体的变化过程" class="headerlink" title="气体的变化过程"></a>气体的变化过程</h2><p>记下面几个特殊的</p><p>等体积变化，$W=0$</p><p>等压变化，压强是常数，面积是矩阵，$W=VR\Delta T$</p><p>等温变化，$pV$ 是常数，计算反比例函数面积，$W=VRT\ln \frac{V_2}{V_1}$</p><p>绝热变化，$Q=0$，$pV^{\gamma}=C\Rightarrow T_2/T_1=\frac{p_2V_2}{p_1v_1}=(\frac{V_1}{V_2})^{\gamma-1}$，$W=-vC_v\Delta T=\frac{p_1V_1-p_2V_2}{\gamma-1}$</p><h2 id="循环"><a href="#循环" class="headerlink" title="循环"></a>循环</h2><p>正循环，热机，$W&gt;0$，顺时针</p><p>热机产生净功 $A=Q_1-Q_2$，越多越好</p><p>热机效率 $\eta=\frac{A}Q=\frac{Q_1-Q_2}{Q_1吸}=1-\frac{Q_2}{Q_1}$</p><p>逆循环，致冷机，$W&lt;0$，逆时针</p><p>冷机产生净功 $A=Q_1-Q_2$，越少越好</p><p>制冷效率 $e=\frac{Q_2吸}{A}=\frac{Q_2}{Q_1-Q_2}$</p>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/01/13/%E3%80%8A%E5%A4%A7%E5%AD%A6%E7%89%A9%E7%90%86%EF%BC%88%E4%B8%8B%EF%BC%89%E3%80%8B%E7%AC%94%E8%AE%B0/</id>
    <link href="https://blog.vanilla-chan.cn/2025/01/13/%E3%80%8A%E5%A4%A7%E5%AD%A6%E7%89%A9%E7%90%86%EF%BC%88%E4%B8%8B%EF%BC%89%E3%80%8B%E7%AC%94%E8%AE%B0/"/>
    <published>2025-01-13T12:10:37.000Z</published>
    <summary>自学+考前自救的产物罢了</summary>
    <title>《大学物理（下）》笔记</title>
    <updated>2025-01-13T12:10:37.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="Notes" scheme="https://blog.vanilla-chan.cn/categories/Notes/"/>
    <category term="废纸篓" scheme="https://blog.vanilla-chan.cn/tags/%E5%BA%9F%E7%BA%B8%E7%AF%93/"/>
    <content>
      <![CDATA[<p>《概率论与数理统计》笔记</p><h1 id="随机事件与概率"><a href="#随机事件与概率" class="headerlink" title="随机事件与概率"></a>随机事件与概率</h1><h2 id="随机试验与随机事件"><a href="#随机试验与随机事件" class="headerlink" title="随机试验与随机事件"></a>随机试验与随机事件</h2><p><strong>随机试验</strong>是一个动作，<strong>随机事件</strong>是随机试验的结果。</p><ol><li>可重复性：试验可以在相同的条件下重复进行</li><li>多结果性：每次试验可能有多个可能的结果，且在试验之前能够明确所有可能的结果</li><li>不确定性：每次试验之前不能确定哪一个结果会出现</li></ol><p>满足上述三个特点的试验成为<strong>随机试验</strong>（简称试验）用E表示。</p><p>例如：从0~9这十个数字中任取一个数，是随机试验；从一批灯泡中任取一只，是随机试验。</p><p><strong>样本点</strong>：随机试验的所有可能的结果。</p><p><strong>样本空间</strong>：随机试验的所有可能的结果组成的<strong>集合</strong>。记作 $\Omega$。</p><blockquote><p>例：掷一枚均匀的骰子，观察出现的点数。</p></blockquote><p>样本空间：$\Omega=\{1,2,3,4,5,6\}$</p><p>样本空间也是一个事件，而且是<strong>必然事件</strong>。</p><p><code>投出1点</code>，即$\{1\}$ 是一个<strong>基本事件</strong>，$\{1\}\subseteq\Omega$。基本事件是由单个的样本点组成的事件，不能再细分。</p><p><code>7点出现</code> 是一个<strong>不可能事件</strong>，不含有任何样本点，记作 $\varnothing$</p><p>设<strong>随机事件</strong> $A=\{1,3,5\}\subseteq \Omega$，该随机事件是 $\Omega$ 的子集。</p><p><strong>事件A发生</strong>：属于A的任一样本点出现。</p><hr><blockquote><p>例：同时扔两枚硬币，A表示“正反各一枚”，B表示“至少有一枚是正面”。请写出试验的样本空间、基本事件以及事件A、事件B。</p></blockquote><p>样本空间 $\Omega=\{(正,正),(反,反),(正,反),(反,正)\}$</p><p><em>（这是一个有限集）</em></p><p>$A=\{(正,反),(反,正)\}$</p><p>$B=\{(正,反),(反,正),(正,正)\}$</p><hr><blockquote><p>例：观察某城市120急救电话台一昼夜接到的呼叫次数。A表示呼叫不超过十次。写出样本空间与事件A。</p></blockquote><p>$\Omega=\{0,1,2,3,4,\dots\}$</p><p><em>（这是一个无限集）</em></p><p>$A=\{0,1,2,3,\dots,10\}$</p><hr><h3 id="一些集合知识"><a href="#一些集合知识" class="headerlink" title="一些集合知识"></a>一些集合知识</h3><script type="math/tex; mode=display">\begin{align}A-B=A-AB=A\overline B\\A \cap B \subset A \subset A \cup B \subset \Omega\end{align}</script><p>互不相容（<strong>互斥</strong>）：$AB=\varnothing$</p><p>$A_1,A_2,\dots,A_n$ <strong>两两互斥</strong>：$A_iA_j=\varnothing$</p><p>对立事件：$A\cup B=\Omega \land A\cap B=\varnothing$</p><p>对立只能两个事件之间；互斥可以多个事件之间两两互斥。</p><p>$A,B对立 \Rightarrow A,B互斥$</p><p>$A,B对立 \Rightarrow \overline A与\overline B对立$</p><p>$A,B互斥 \not\Rightarrow \overline A与\overline B互斥$</p><p><strong>完备事件组</strong>：若 $A_1,\dots,A_n$ 满足：</p><script type="math/tex; mode=display">\begin{equation}\left\{\begin{array}{l}A_i \cap A_j=\phi \\\sum A_i=\Omega\end{array}\right.\end{equation}</script><p>即：各集合事件没有交集，且并集为全集。</p><p><strong>集合的分配率</strong>：</p><script type="math/tex; mode=display">\begin{align}(A\cup B)\cap C=(A\cap B)\cup(B\cap C)\\(A\cap B)\cup C=(A\cup C)\cap (B\cup C)\end{align}</script><p><strong>集合的对偶率</strong>：</p><script type="math/tex; mode=display">\begin{align}\overline{A\cup B}=\overline A \cap \overline B\\\overline{A\cap B}=\overline A \cup \overline B\end{align}</script><p><em>长线变短线，交并要变号</em></p><h2 id="频率与概率"><a href="#频率与概率" class="headerlink" title="频率与概率"></a>频率与概率</h2><p>频率：略。</p><p>概率：$E$ 是一个随机试验，$\Omega$ 是其样本空间。则对于每一个事件 $A$ 都有一个实数 $P(A)\in[0,1]$，称为事件 $A$ 发生的概率。</p><p>其中，$P$ 是一个集合函数，</p><ol><li>非负性：$P(A)\ge 0$</li><li>规范性：$P(\Omega)=1$</li><li>可列可加性：若$A_1,A_2,\dots,A_n,\dots$ 两两互斥，则 $P(\sum_{i=1}^\infty A_i)=\sum_{i=1}^\infty P(A_i)$</li></ol><p>$P(\varnothing)=0$，反之不成立，即 $P(A)=0\not\Rightarrow A=\varnothing$，概率为 $0$ 的事件不是不可能事件，也有可能发生。</p><p>由可列可加性可得：如果A,B互斥，则 $P(A+B)=P(A)+P(B)$。</p><p>反之，$P(A+B)=P(A)+P(B)-P(AB)\Rightarrow P(AB)=0\not \Rightarrow AB=\varnothing$</p><p>$P(A-B)=P(A)-P(AB)$。特别地，如果 $B\subseteq A$，则有 $P(A-B)=P(A)-P(B)$，且$P(A)\ge P(B)$</p><p>加法公式：$P(A\cup B)=P(A)+P(B)-P(AB)$</p><h2 id="古典概型和几何概型"><a href="#古典概型和几何概型" class="headerlink" title="古典概型和几何概型"></a>古典概型和几何概型</h2><h3 id="古典概型"><a href="#古典概型" class="headerlink" title="古典概型"></a>古典概型</h3><ol><li>有限个样本点</li><li>等可能性</li></ol><p>这一部分就是高中学的，略。</p><h3 id="几何概型"><a href="#几何概型" class="headerlink" title="几何概型"></a>几何概型</h3><p>长度，面积，体积。$P(A)=\frac{\mu(A)}{\mu(\Omega)}$</p><h2 id="条件概率与乘法公式"><a href="#条件概率与乘法公式" class="headerlink" title="条件概率与乘法公式"></a>条件概率与乘法公式</h2><h3 id="条件概率"><a href="#条件概率" class="headerlink" title="条件概率"></a>条件概率</h3><blockquote><p>引：在有两个孩子的家庭中，至少有一个男孩求另一个也是男孩的概率。</p><p>$\Omega=\{(男,男),(女,男),(男,女),(女,女)\}$</p><p>$A=\{(男,男),(女,男),(男,女)\}$</p><p>$B=\{(男,男)\}$</p><p>$P(B|A)=\frac13$</p><p>此时，样本空间变成了 $A$ 而不是 $\Omega$ 了。</p></blockquote><h4 id="定义"><a href="#定义" class="headerlink" title="定义"></a>定义</h4><p>某试验的样本空间是 $\Omega$，有 $A,B$ 两事件，$P(A)&gt;0$，在事件 $A$ 已发生的概率下事件 $B$ 的概率，就是 $B$ 对 $A$ 的条件概率，记作 $P(B|A)$。</p><p>简单的条件概率问题，可通过画图快速解决。</p><p>复杂一点的，套公式：</p><script type="math/tex; mode=display">\begin{align}P(A|B)&amp;=\frac{P(AB)}{P(B)}\quad P(B)&gt;0\\P(AB)&amp;=P(A|B) \cdot P(B)\end{align}</script><blockquote><p>记忆：挺好记的，$A|B$ 长的就像是 $A/B$，所以要 $\times P(B)$ 抵掉。（我乱说的，仅供辅助记忆）</p></blockquote><h4 id="公理"><a href="#公理" class="headerlink" title="公理"></a>公理</h4><ol><li>非负性。$P(A|B)\ge 0$</li><li>规范性。$P(A|\Omega)=1$</li><li>可列可加性。若$B_1,B_2,\dots$两两互斥，则有 $P(\sum_{i=1}^\infty B_i|A)=\sum_{i=1}^\infty P(B_i|A)$</li></ol><p>根据上述1、2可得：$0\le P(A|B)\le 1$</p><h4 id="性质"><a href="#性质" class="headerlink" title="性质"></a>性质</h4><p>$P(\varnothing|A)=0$</p><p>$P(B_1\cup B_2|A)=P(B_1|A)+P(B_2|A)-P(B_1B_2|A)$</p><p>特别地，当 $B_1,B_2$互斥，则有 $P(B_1\cup B_2|A)=P(B_1|A)+P(B_2|A)$</p><p>$P(B|A)+P(\overline B|A)=1$</p><h3 id="乘法公式"><a href="#乘法公式" class="headerlink" title="乘法公式"></a>乘法公式</h3><p>即上面的推的</p><script type="math/tex; mode=display">\begin{align}P(AB)&amp;=P(A|B) \cdot P(B)\quad P(B)&gt;0\\&amp;=P(B|A) \cdot P(A)\quad P(A)&gt;0\end{align}</script><p> 推广到三个事件：</p><script type="math/tex; mode=display">\begin{align}P(ABC)&amp;=P(AB)\cdot P(C|AB)\\&amp;=P(A)\cdot P(B|A) \cdot P(C|AB)\end{align}</script><blockquote><p>例：设某光学仪器厂制造的透镜，第一次落下时打破的概率为 0.5，若第一次落下未打破，第二次落下打破的概率为 0.7，若前两次落下未打破，第三次落下打破为概率为 0.9。求透镜落下三次而未打破的概率。</p></blockquote><p>设 $A_1,A_2,A_3$ 表示三次落下会打破。</p><p>故已知：</p><p>$P(A_1)=0.5$</p><p>$P(A_2|\overline {A_1})=0.7$</p><p>$P(A_3|\overline{A_1}\ \overline {A_2})=0.9$</p><p>欲求 $P(\overline{A_1}\ \overline{A_2}\ \overline{A_3})$。</p><p>看到题目给的信息可能第一反应：</p><p>$P(A_1)=0.5\Rightarrow P(\overline{A_1})=0.5$</p><p>$P(A_2)=P(A_2|\overline{A_1})\cdot P(A_1)=0.7\times 0.5=0.35$</p><p>$\dots$</p><p>但是这里需要求的是 $P(\overline{A_1}\ \overline{A_2}\ \overline{A_3})$</p><p>一定要看清楚题目要求的是什么。</p><p>直接用乘法公式展开得：</p><script type="math/tex; mode=display">\begin{align}P(\overline{A_1}\ \overline{A_2}\ \overline{A_3})&amp;=P(\overline{A_1}\ \overline{A_2})\cdot P(\overline{A_3}|\overline{A_1}\ \overline{A_2})\\&amp;=P(\overline{A_1})\cdot P(\overline{A_2}|\overline{A_1}) \cdot P(\overline{A_3}|\overline{A_1}\ \overline{A_2})\\&amp;=(1-P(A_1))\cdot (1-P(\overline{A_2}|\overline{A_1})) \cdot (1-P(\overline{A_3}|\overline{A_1}\ \overline{A_2}))\\&amp;=0.5\times 0.3\times 0.1\\&amp;=0.015\end{align}</script><p>先用乘法公式展开，可全部展开成变成题目所给的条件概率了。</p><p><strong>另外，注意区分题目问的到底是条件概率 $P(A|BC)$ 还是普通概率 $P(ABC)$。</strong></p><h2 id="全概率公式与贝叶斯公式"><a href="#全概率公式与贝叶斯公式" class="headerlink" title="全概率公式与贝叶斯公式"></a>全概率公式与贝叶斯公式</h2><h3 id="全概率公式"><a href="#全概率公式" class="headerlink" title="全概率公式"></a>全概率公式</h3><h4 id="定义-1"><a href="#定义-1" class="headerlink" title="定义"></a>定义</h4><p><strong>样本空间的划分</strong>，也叫做<strong>完备事件组</strong>：</p><p>设事件 $A_1,A_2,\dots,A_n$ 为样本空间 $\Omega$ 的一组事件，且满足：</p><ol><li>两两互斥：$A_iA_j=\varnothing (i\not =j)$</li><li>并集为样本空间：$\bigcup_{i=1}^nA_i=\Omega$</li></ol><p>则称 $A_1,A_2,\dots,A_n$ 为样本空间 $\Omega$  的一个划分。</p><p><strong>全概率公式</strong></p><p>设事件 $A_1,A_2,\dots,A_n$ 为样本空间 $\Omega$ 的一个<strong>划分</strong>，且 $P(A_i)&gt;0,i=1,2,\dots,n$，则对于任意事件 $B$，有</p><script type="math/tex; mode=display">\begin{align}P(B)=\sum_{i=1}^nP(A_i)P(B|A_i)\end{align}</script><h4 id="应用"><a href="#应用" class="headerlink" title="应用"></a>应用</h4><p>如果试验 $E$ 有两个相关的试验 $E_1,E_2$ 复合而成，$E_1$ 有若干种可能的结果，$E_2$ 在 $E_1$ 的基础上也有若干种可能的结果。如果求和 $E_2$ 的结果有关的概率，可以用全概率公式。试验 $E_1$ 的几种可能的结果就构成了完备事件组。</p><blockquote><p>例：设袋中有12个乒乓球，9个新球，3个旧球。第一次比赛取3球，比赛后放回；第二次比赛再任取3球，求第二次比赛取得3个新球的概率。</p></blockquote><p>这里的两次试验分别是：</p><p>$E_1=\{第一次比赛取三个球\}$</p><p>$E_2=\{第二次比赛取三个球\}$</p><p>设：</p><p>$A_i=第一次比赛恰取出i个新球(i=0,1,2,3)$</p><p>$B=第二次比赛取出了3个新球$</p><p>此时，$A_0,A_1,A_2,A_3$ 恰好构成了对于样本空间的一个划分。</p><p>套用全概率公式：</p><p>$P(B)=\sum_{i=0}^3P(A_i)P(B|A_i)$</p><h3 id="贝叶斯公式"><a href="#贝叶斯公式" class="headerlink" title="贝叶斯公式"></a>贝叶斯公式</h3><blockquote><p>引：设仑库中共有10箱产品，其中甲乙丙三厂各有 $5、3、2$ 箱, 且已知甲乙丙三厂的次品率分别为 $10 \% 、 15 \% 、 20 \%$，现从中任取1箱，再从该箱中任取1件产品，若取得的产品为次品，问该产品是甲厂生产的概率是多少?</p></blockquote><p>该问题不是求取得的产品为正品、次品问题，而是在明确知道产品品质的情况下，分析“货出谁家”的问题。</p><p>设</p><p>$A_1=\{甲厂生产的产品\}$</p><p>$A_2=\{乙厂生产的产品 \}$</p><p>$A_3=\{ 丙厂生产的产品 \}$</p><p>$B=\{ 取得次品 \}$ </p><p>该问题要求的是</p><p>$P(A_1|B)\quad i=1,2,3$</p><h4 id="推导"><a href="#推导" class="headerlink" title="推导"></a>推导</h4><p>由条件概率的定义</p><script type="math/tex; mode=display">\begin{align}P\left(A_j | B\right)=\frac{P\left(A_j B\right)}{P(B)}=\frac{P\left(A_j\right) P\left(B | A_j\right)}{P(B)}\end{align}</script><p>其中，由全概率公式可知</p><script type="math/tex; mode=display">\begin{align}P(B)=\sum_{i=1}^nP(A_i)P(B|A_i)\end{align}</script><p>代入得</p><script type="math/tex; mode=display">\begin{align}P(A_j|B)=\frac{P(A_j)P(B|A_j)}{\sum_{i=1}^nP(A_i)P(B|A_i)}\quad(j=1,2,\dots,n)\end{align}</script><h4 id="应用-1"><a href="#应用-1" class="headerlink" title="应用"></a>应用</h4><p>如果试验 $E$ 有两个相关的试验 $E_1, E_2$ 复合而成, $E_1$ 有若干种可能的结果，$E_2$ 在 $E_1$ 的基础上也有若干种可能的结果，如果已知和 $E_2$ 的结果有关某事件发生了，求和试验 $E_1$ 的结果有关事件的概率，可以用贝叶斯公式。试验 $E_1$ 的几种可能的结果就构成了完备事件组。</p><p>如果把样本空间的一个划分 $A_1, A_2, \dots, A_n$ 看作是导致事件 $B$ 发生的各种原因, 事件 $B$ 是伴随着“原因” $A_i$ 中的一个出现的。如果 $B$ 发生了, 求 $P\left(A_j | B\right)$ 可以用贝叶斯公式。</p><p>所以把 $P(A_1),P(A_2)$ 成为<strong>先验概率</strong>，把 $P(A_1|B),P(A|2,B)$ 称为<strong>后验概率</strong>。</p><blockquote><p>例：某商店由三个厂购进一批灯泡，其中甲厂占 $25\%$，乙厂占 $35\%$，丙厂占 $40 \%$ ，且各厂的次品率分别为 $5 \%, 4 \%, 2 \%$ 。如果消费者已经买到一个次品灯泡，问是哪个厂出产的可能性大？</p></blockquote><p>设：</p><p>$A_1=\{灯泡是甲厂出产的\}$</p><p>$A_2=\{灯泡是乙厂出产的\}$</p><p>$A_3=\{灯泡是丙厂出产的\}$</p><p>$B=\{买到一个次品灯泡\}$</p><p>题目的条件可以化为：</p><p>$P(A_1)=0.25,P(A_2)=0.35,P(A_3)=0.4$</p><p>$P(B|A_1)=0.05,P(B|A_2)=0.04,P(B|A_3)=0.02$</p><p>由全概率公式得：</p><p>$P(B)=\sum_{i=1}^3P(A_i)P(B|A_i)=0.0345$</p><p>由贝叶斯公式得：</p><p>$P(A_1|B)=\frac{P(A_1B)}{P(B)}=\frac{P(B|A_1)P(A_1)}{P(B)}=\frac{0.05\times0.25}{0.0345}=0.3623$</p><p>同理算出 $P(A_2|B),P(A_3|B)$ ，然后比较大小即可。</p><hr><h3 id="总结"><a href="#总结" class="headerlink" title="总结"></a>总结</h3><p>知因求果：全概率公式</p><p>执果索因：贝叶斯公式</p><h3 id="事件的独立性"><a href="#事件的独立性" class="headerlink" title="事件的独立性"></a>事件的独立性</h3><h4 id="性质-1"><a href="#性质-1" class="headerlink" title="性质"></a>性质</h4><p>若 $P(A)&gt;0,P(B)&gt;0$，则 $A$ 和 $B$ 独立的<strong>充分必要条件</strong>是：</p><script type="math/tex; mode=display">\begin{align}P(B|A)=P(B)\\P(A|B)=P(A)\end{align}</script><p>即，“$A$ 是否发生”对于 $B$ 事件没有影响，“$B$ 是否发生”对于 $A$ 也没有影响。</p><p>如果 $A$ 与 $B$ 相互独立，则 $\overline{A}$ 与 $B$、$A$ 与 $\overline{B}$、$\overline{A}$ 与$\overline{B}$ 都是两两独立的。</p><h1 id="随机变量及其分布"><a href="#随机变量及其分布" class="headerlink" title="随机变量及其分布"></a>随机变量及其分布</h1><h2 id="离散型分布"><a href="#离散型分布" class="headerlink" title="离散型分布"></a>离散型分布</h2><h3 id="01分布"><a href="#01分布" class="headerlink" title="01分布"></a>01分布</h3><p>01分布（也称为<strong>伯努利分布</strong>）只有两个样本点：0和1。其概率质量函数为：</p><script type="math/tex; mode=display">\begin{align}P(X = 1) = p\\P(X = 0) = 1 - p\end{align}</script><p>其中，$p$ 是事件发生的概率（$0 \leq p \leq 1$）。</p><p>记作 $X\sim B(1,p)$。</p><h3 id="二项分布"><a href="#二项分布" class="headerlink" title="二项分布"></a>二项分布</h3><p>如果有 $n$ 次独立的伯努利试验，每次试验成功的概率为 $p$，则随机变量 $X$ 表示成功的次数，服从二项分布，其概率质量函数为：</p><script type="math/tex; mode=display">\begin{align}P(X = k) = \binom{n}{k} p^k (1 - p)^{n - k}\end{align}</script><p>其中：</p><ul><li>$n$ 是试验的总次数。</li><li>$k$ 是成功的次数（$k = 0, 1, \ldots, n$）。</li><li>$\binom{n}{k}$ 是组合数，表示从 $n$ 次中选择 $k$ 次成功的方式。</li></ul><p>记作 $X\sim B(n,p)$。</p><h3 id="泊松分布"><a href="#泊松分布" class="headerlink" title="泊松分布"></a>泊松分布</h3><script type="math/tex; mode=display">\begin{align}P(X=k)=\frac{\lambda^ke^{-\lambda}}{k!}\end{align}</script><h3 id="泊松定理"><a href="#泊松定理" class="headerlink" title="泊松定理"></a>泊松定理</h3><p>当试验次数 $n$ 趋近于无穷大、成功概率 $p$ 趋近于零、但 $np$ 保持恒定的情况下，成功次数 $X$ 的分布趋近于 $\lambda=np$ 的泊松分布。</p><script type="math/tex; mode=display">\begin{align}\lim_{n\to \infty} P(X_n=k)=\frac{\lambda^ke^{-\lambda}}{k!}\end{align}</script><p>所以在 $n$ 较大、$p$ 较小时，常用泊松分布来代替计算二项分布。</p><script type="math/tex; mode=display">\begin{align}C_n^kp^k(1-p)^{n-k}\approx\frac{\lambda^ke^{-\lambda}}{k!}\end{align}</script><p>其中，$\lambda=np$。</p><h2 id="连续型分布"><a href="#连续型分布" class="headerlink" title="连续型分布"></a>连续型分布</h2><h3 id="均匀分布"><a href="#均匀分布" class="headerlink" title="均匀分布"></a>均匀分布</h3><p>略。</p><h3 id="指数分布"><a href="#指数分布" class="headerlink" title="指数分布"></a>指数分布</h3><script type="math/tex; mode=display">\begin{align}f(x)=\begin{cases}\lambda e^{-\lambda x}, &amp; x&gt;0 \\0, &amp; x \leq 0\end{cases}\end{align}</script><p>其中 $\lambda&gt;0$ 是常数。</p><p>通常用于各种寿命的分布，或者某一时间发生的等待时间。</p><p>容易看出，$f(x)$ 的原函数 $F(x)=-e^{-\lambda x}$。常需要计算随机变量在一段区间内的取值范围。</p><h3 id="正态分布"><a href="#正态分布" class="headerlink" title="正态分布"></a>正态分布</h3><p>正态分布的<strong>密度函数</strong>为：</p><script type="math/tex; mode=display">\begin{align}f(x)=\frac{1}{\sqrt{2\pi}\sigma}e^{-\frac{(x-\mu)^2}{2\sigma^2}}\end{align}</script><p>则其<strong>分布函数</strong>为</p><script type="math/tex; mode=display">\begin{align}F(x)=\frac{1}{\sqrt{2\pi}\sigma}\int_{-\infty}^xe^{-\frac{(x-\mu)^2}{2\sigma^2}}\mathrm dx\end{align}</script><p>正态分布用得很多。最常见（$\mathrm{N}ormal$）。二项分布、泊松分布的极限是正态分布。</p><p><strong>求导</strong>：</p><script type="math/tex; mode=display">\begin{align}f'(x)=-\frac{x-\mu}{\sigma^2}f(x)\end{align}</script><p>在 $x=\mu$ 处取得<strong>极大值</strong> $f(\mu)=\frac{1}{\sqrt{2\pi}\sigma}$。</p><p>随着 $\sigma\uparrow$，$f(\mu)\downarrow$，图像变<strong>平坦</strong>。</p><h3 id="标准正态分布"><a href="#标准正态分布" class="headerlink" title="标准正态分布"></a>标准正态分布</h3><p>若随机变量 $x$ 服从均值为 $\mu$，标准差为 $\sigma$ 的正态分布，</p><p>$x\sim N(\mu,\sigma^2)$ 。而当 $\mu=0,\sigma=1$ 时称为为标准正态分布。</p><p>密度函数为：</p><script type="math/tex; mode=display">\begin{align}\phi(x)=\frac{1}{\sqrt{2\pi}}e^{-\frac{x^2}{2}}\end{align}</script><p>分布函数为：</p><script type="math/tex; mode=display">\begin{align}\Phi(x)=\int_{-\infty}^x\frac{1}{\sqrt{2\pi}}e^{-\frac{t^2}{2}}\mathrm dt\end{align}</script><p>该函数有一个性质：$\Phi(x)=1-\Phi(-x)$。</p><p>所以，如果 $X\sim N(0,1)$，则有：</p><script type="math/tex; mode=display">\begin{align}&amp;P(X\le b)=\Phi(b)\\&amp;P(X&gt;a)=1-\Phi(a)\\&amp;P(a&lt;X\le b)=\Phi(b)-\Phi(a)\\&amp;P(|X|\le a)=2\Phi(a)-1(a&gt;0)\end{align}</script><h4 id="正态分布的标准化"><a href="#正态分布的标准化" class="headerlink" title="正态分布的标准化"></a>正态分布的标准化</h4><p>若 $X\sim N(\mu,\sigma^2)$，则 $F(x)=\Phi(\frac{x-\mu}{\sigma})$。这样，我们就可以通过查表得到 $\Phi$ 值，反推 $F(x)$。</p><p>也就是说，如果 $X\sim N(\mu,\sigma^2)$，则 $\frac{X-\mu}{\sigma}\sim N(0,1)$。</p><h2 id="离散型随机变量函数的分布"><a href="#离散型随机变量函数的分布" class="headerlink" title="离散型随机变量函数的分布"></a>离散型随机变量函数的分布</h2><p>如果 $X$ 是一个随机变量，而 $Y=g(X)$，那么 $Y$ 也是个随机变量。$Y$ 的分布就得看 $X$ 的分布以及 $g(x)$ 了。</p><p>如果 $X$ 的分布给的是个分布列，求 $Y$ 的分布列，那么直接算就好，最后记得合并相同的 $Y$ 的取值（概率相加即可），并且按照 $Y$ 的取值单调递增排序。</p><h2 id="连续型随机变量函数的分布"><a href="#连续型随机变量函数的分布" class="headerlink" title="连续型随机变量函数的分布"></a>连续型随机变量函数的分布</h2><p>其实之前提到的“正态分布标准化”就是一种随机变量函数。</p><p>简单来说，若 $X\sim N(\mu,\sigma^2)$，则 $Y=aX+b(a\not=0)\sim N(a\mu+b,(a\sigma)^2)$。</p><p>通用一点，如果 $Y=aX+b$ 而 $X$ 的概率密度函数为 $f_X(x)$，则 $Y$ 的概率密度函数 $f_Y(y)=\frac1{|a|}f_X(\frac{y-b}{a})$。</p><blockquote><p>例：设 $X$ 在 $(0,1)$ 内服从均匀分布，求 $Y=-2\ln X$ 的概率密度函数。</p></blockquote><p>首先写出均匀分布的概率密度函数：</p><script type="math/tex; mode=display">f_X(x) = \begin{cases} 1, &amp; 0 &lt; x &lt; 1 \\0, &amp; \text{其他}\end{cases}</script><p>已知 $Y=-2\ln X$，我们需要求 $X$ 关于 $Y$ 的表达式：</p><script type="math/tex; mode=display">X = e^{-\frac{Y}{2}}</script><p>当 $X$ 从 0 到 1 变化时，$Y$ 的取值范围为：</p><script type="math/tex; mode=display">\begin{align}Y &amp;= -2\ln X \\0 &amp;&lt; X &lt; 1 \\0 &amp;&lt; Y &lt; +\infty\end{align}</script><p>所以也需要对于 $Y$ 的取值进行分类讨论的。</p><p>当 $y&gt;0$ 时，</p><script type="math/tex; mode=display">\begin{align}F_y(y)&amp;=P(Y\le y)\\&amp;=P(-2\ln X\le y)\\&amp;=P(X\ge e^{-\frac{y}{2}})\\&amp;=1-P(X&lt;e^{-\frac{y}{2}})\\&amp;=1-F_X(e^{-\frac{y}{2}})\end{align}</script><p>当 $y\le 0$ 时，$F_Y(y)=0$</p><p>将上述两个合并，即为答案。</p><p>同时还可以发现，这个就是 $\lambda=\frac12$ 的指数分布。</p><h1 id="二维随机变量"><a href="#二维随机变量" class="headerlink" title="二维随机变量"></a>二维随机变量</h1><h2 id="二维离散随机变量"><a href="#二维离散随机变量" class="headerlink" title="二维离散随机变量"></a>二维离散随机变量</h2><p>$(x,y)$ 的联合分布列：</p><p>若 $(X,Y)$ 的所有可能的取值为 $x_i,y_j\quad i,j=1,2,3\dots$，且 $p_{ij}=P(X=x_i,Y=y_i),\quad i,j=1,2,3\dots$，则称这一列式子为 $(x,y)$ 的联合分布列。</p><p>性质肯定还是和一维随机变量一样：</p><script type="math/tex; mode=display">\begin{align}p_{ij}\ge 0\\\sum_{i=1}^\infty\sum_{j=1}^\infty p_{ij}=1\end{align}</script><p>如何求联合分布列？</p><p>全列出来。先确定两个随机变量的取值范围，然后计算每一种组合的概率，最后按照顺序画出二维表格。</p><h2 id="二维连续随机变量"><a href="#二维连续随机变量" class="headerlink" title="二维连续随机变量"></a>二维连续随机变量</h2><script type="math/tex; mode=display">\begin{align}P((X,Y)\in D)=\iint_D f(x,y)\mathrm dx\mathrm dy\end{align}</script><p>其中，$f(x,y)$ 是一个<strong>非负</strong>可积函数，表示落入 $(x,y)$ 的概率。</p><p>非负性：$f(x,y)\ge 0$</p><p>规范性：$\int_{-\infty}^{+\infty}\int_{-\infty}^{+\infty}f(x,y)\mathrm dx\mathrm dy=1$</p><h2 id="常见二维随机分布"><a href="#常见二维随机分布" class="headerlink" title="常见二维随机分布"></a>常见二维随机分布</h2><p>二维均匀分布。类似一维均匀分布，利用面积 $A$ 进行计算，区域 $G$ 内处处有 $f(x,y)=\frac1A$。</p><p>二维正态分布。</p><script type="math/tex; mode=display">\begin{aligned}f(x, y)=&amp;\frac{1}{2 \pi \sigma_1 \sigma_2 \sqrt{1-\rho^2}} \\&amp;\exp \left\{-\frac{1}{2\left(1-\rho^2\right)}\left[\frac{\left(x-\mu_1\right)^2}{\sigma_1^2}-2 \rho \frac{\left(x-\mu_1\right)\left(y-\mu_2\right)}{\sigma_1 \sigma_2}+\frac{\left(y-\mu_2\right)^2}{\sigma_2^2}\right]\right\} \quad\\&amp;(-\infty&lt;x&lt;+\infty,-\infty&lt;y&lt;+\infty)\end{aligned}</script><p>其中有五个参数 $\mu_1,\mu_2,\sigma_1,\sigma_2,\rho$，且 $\sigma_1&gt;0,\sigma_2&gt;0,|\rho|&lt;1$。</p><p>如果 $\rho=0$，则交叉项没了，外面的分母也只剩 $2\pi\sigma_1\sigma_2$。</p><h2 id="二维随机变量的分布函数"><a href="#二维随机变量的分布函数" class="headerlink" title="二维随机变量的分布函数"></a>二维随机变量的分布函数</h2><p>也叫<strong>联合分布函数</strong>。</p><script type="math/tex; mode=display">\begin{align}F(x,y)=P(\{X\le x\}\cup\{Y\le y\})=P(X\le x,Y\le y)\end{align}</script><p>其表示随机点落在以 $(x,y)$ 为右顶点的在左下方的无穷矩形区域内的概率。</p><p>那么如果需要求指定方形区域 $x_1&lt;X\le x_2,y_1&lt;Y\le y_2$ 的概率，则类似于二位前缀和公式：</p><script type="math/tex; mode=display">\begin{align}P(x_1&lt;X\le x_2,y_1&lt;Y\le y_2)=F(x_2,y_2)-F(x_2,y_1)-F(x_1,y_2)+F(x_1,y_1)\end{align}</script><p>如果是连续型随机变量的话，$f(x,y)$ 为其密度函数，则有：</p><script type="math/tex; mode=display">\begin{align}F(x,y)&amp;=P(X\le x,Y\le y)=\int_{-\infty}^{x}\int_{-\infty}^y f(u,v)\mathrm du\mathrm dv\\f(x,y)&amp;=\frac{\partial^2F(x,y)}{\partial x\partial y}\end{align}</script><p>基本性质：类似一维概率分布函数，特殊边界值和单调性。略。</p><h2 id="二维离散型随机变量的边缘分布"><a href="#二维离散型随机变量的边缘分布" class="headerlink" title="二维离散型随机变量的边缘分布"></a>二维离散型随机变量的边缘分布</h2><p>比较简单，对一列或一行相加即可。</p><script type="math/tex; mode=display">\begin{align}p_{i\cdot}=P(X=x_i)\sum_{j=1}^\infty p_{ij}\\p_{\cdot j}=P(Y=y_j)\sum_{i=1}^\infty p_{ij}\end{align}</script><h2 id="二维连续型随机变量的边缘分布"><a href="#二维连续型随机变量的边缘分布" class="headerlink" title="二维连续型随机变量的边缘分布"></a>二维连续型随机变量的边缘分布</h2><p>二维连续型随机变量的边缘密度函数，记作 $f_X(x)$ 和 $f_Y(y)$。</p><p>公式：</p><script type="math/tex; mode=display">\begin{align}f_X(x)&amp;=\int_{-\infty}^{\infty}f(x,y)\mathrm dy\\f_Y(y)&amp;=\int_{-\infty}^{\infty}f(x,y)\mathrm dx\end{align}</script><p>而边缘分布函数，记作 $F_X(x),F_(y)$。</p><script type="math/tex; mode=display">\begin{align}F_X(x)&amp;=P(X\le x)=P(X\le x,Y&lt; +\infty)\\&amp;=\int_{-\infty}^x[\int_{-\infty}^{+\infty}f(x,y)\mathrm dv]\mathrm du\\f_X(x)&amp;=\int_{-\infty}^{+\infty}f(x,y)\mathrm dy\end{align}</script><p>即，<strong>要求关于 $x$ 的边缘密度函数 $f_X(x)$，就对另一个变量 $y$ 计算 $\int_{-\infty}^{+\infty}\mathrm dy$ 即可</strong>。（可能可以使用“偶倍奇零”原则对被积函数进行化简）</p><p><strong>二维正态分布的边缘概率密度函数为一维正态分布，且与 $\rho$ 无关。</strong></p><p>已知联合分布可以计算边缘密度函数；但已知边缘密度函数不能反推联合分布。</p><p>边缘分布函数还有一种方式计算：</p><script type="math/tex; mode=display">\begin{align}F_X(x)&amp;=P(X\le x)\\&amp;=P(X\le x,Y&lt; \infty)\\&amp;= F(x,+\infty)\\&amp;=\lim_{y\to +\infty}F(x,y)\end{align}</script><p>其实也和边缘密度函数一样：<strong>对另一维变量取极限，得到关于该维变量的边缘分布函数</strong>。</p><h1 id="大数定律与中心极限定理"><a href="#大数定律与中心极限定理" class="headerlink" title="大数定律与中心极限定理"></a>大数定律与中心极限定理</h1><h3 id="依概率收敛和依分布收敛"><a href="#依概率收敛和依分布收敛" class="headerlink" title="依概率收敛和依分布收敛"></a>依概率收敛和依分布收敛</h3><script type="math/tex; mode=display">\begin{align}X_n\xrightarrow[] L X&amp;\quad(X_n 依分布收敛于 X)\\Y_n\xrightarrow[] P a&amp;\quad(Y_n 依概率收敛于 a)\end{align}</script><p>两个随机变量序列之和（差、积、商）依【概率/分布】收敛于两个随机变量序列依【概率/分布】的值的和（差、积、商）</p><p>其中，依概率是一种强收敛，而依分布收敛是一种弱收敛。</p><p>可以从强的推到至弱的：$X_n\xrightarrow[]P a\Rightarrow X_n\xrightarrow[]L a$。</p><h2 id="切比雪夫不等式"><a href="#切比雪夫不等式" class="headerlink" title="切比雪夫不等式"></a>切比雪夫不等式</h2><p><strong>不知道具体分布，只知道期望与方差</strong>的情况下，可以估计随机变量偏离其期望的概率。毕竟知道了方差，那么随机变量可不能偏离的太远嘛。</p><p>切比雪夫不等式是概率论中的一个重要定理，它为随机变量偏离其期望值的概率提供了一个上界。</p><p>切比雪夫不等式的表达式如下：</p><script type="math/tex; mode=display">\begin{align}P(|X - E(X)| \geq \varepsilon) \leq \frac{Var(X)}{\varepsilon^2}\end{align}</script><p>其中：</p><ul><li>$X$ 是随机变量</li><li>$E(X)$ 是 $X$ 的期望值</li><li>$Var(X)$ 是 $X$ 的方差</li><li>$\varepsilon$ 是任意正实数</li></ul><p>这个不等式告诉我们，随机变量 $X$ 偏离其期望值 $E(X)$ 至少 $\varepsilon$ 的概率不超过 $\frac{Var(X)}{\varepsilon^2}$。</p><p>例如，如果我们有一个随机变量 $X$，其期望为 10，方差为 4，我们想知道 $X$ 偏离其期望值至少 3 个单位的概率上界，我们可以这样计算：</p><script type="math/tex; mode=display">\begin{align}P(|X - 10| \geq 3) \leq \frac{4}{3^2} = \frac{4}{9} \approx 0.444\end{align}</script><p>这意味着，$X$ 偏离 10 至少 3 个单位的概率不会超过 44.4%。</p><blockquote><p>例：随机变量 $X$ 和 $Y$ 的数学期望均为 5 ，方差分别为 1 和 9 ，而相关系数为 0.5 ，则根据切比雪夫不等式可知 $P(|X-Y| \geq 4) \leq ?$ </p></blockquote><p>设 $Z=X-Y$，计算 $E(Z)$ 和 $Var(Z)$。</p><script type="math/tex; mode=display">\begin{align}E(Z)&amp;=E(X)-E(Y)\\&amp;=0\\Var(Z)&amp;=Var(X-Y)\\&amp;=Var(X)+Var(Y)-2Cov(X,Y)\\&amp;=Var(X)+Var(Y)-2\cdot \rho \sqrt{Var(X)\cdot Var(Y)}\\&amp;=1+9-2\times0.5\times \sqrt{1\times9}\\&amp;=7\end{align}</script><p>故，题目要求的切比雪夫不等式可以化为：</p><script type="math/tex; mode=display">\begin{align}P(|Z-E(Z)|>4)\le \frac{Var(Z)}{4^2}=\frac{7}{16}\end{align}</script><h2 id="大数定律"><a href="#大数定律" class="headerlink" title="大数定律"></a>大数定律</h2><p><strong>大量随机事件的平均结果趋近于期望值</strong></p><h3 id="切比雪夫大数定律"><a href="#切比雪夫大数定律" class="headerlink" title="切比雪夫大数定律"></a>切比雪夫大数定律</h3><p>切比雪夫大数定律（弱大数定律）</p><p>弱大数定律表述如下：对于一个随机变量序列 $X_1, X_2, ..., X_n$，如果这些随机变量是独立同分布的，且具有有限的期望 $\mu$ 和方差 $\sigma^2$，那么它们的算术平均值会依概率收敛于期望值 $\mu$。</p><script type="math/tex; mode=display">\begin{align}\lim_{n \to \infty} P\left(\left|\frac{1}{n}\sum_{i=1}^n X_i - \mu\right| &lt; \varepsilon\right) = 1, \quad \forall \varepsilon &gt; 0\end{align}</script><h3 id="伯努利大数定律"><a href="#伯努利大数定律" class="headerlink" title="伯努利大数定律"></a>伯努利大数定律</h3><p>在 $n$ 次独立重复的伯努利试验中，如果每次试验成功的概率为 $p$，失败的概率为 $1-p$，那么当 $n$ 趋于无穷大时，成功次数的频率 $f_n$ 几乎必然收敛于概率 $p$。</p><script type="math/tex; mode=display">\begin{align}P\left(\lim_{n \to \infty} f_n = p\right) = 1\end{align}</script><p>其中，$f_n = \frac{X_n}{n}$，$X_n$ 表示 $n$ 次试验中成功的次数。</p><p>更具体地，对于任意小的正数 $\varepsilon$，我们有：</p><script type="math/tex; mode=display">\begin{align}\lim_{n \to \infty} P\left(\left|\frac{X_n}{n} - p\right| &lt; \varepsilon\right) = 1\end{align}</script><p>在大量重复的伯努利试验中，成功的相对频率会趋近于成功的概率。</p><p>这就是以频率定义概率的合理性依据。</p><h3 id="辛钦大数定律"><a href="#辛钦大数定律" class="headerlink" title="辛钦大数定律"></a>辛钦大数定律</h3><p>辛钦大数定律是一种弱大数定律，它放宽了对随机变量方差的要求。辛钦定理表述如下：</p><p>对于一个随机变量序列 $X_1, X_2, ..., X_n$，如果这些随机变量是独立同分布的，且具有有限的期望 $\mu$（不要求方差有限），那么它们的算术平均值会依概率收敛于期望值 $\mu$。</p><script type="math/tex; mode=display">\begin{align}\lim_{n \to \infty} P\left(\left|\frac{1}{n}\sum_{i=1}^n X_i - \mu\right| &lt; \varepsilon\right) = 1, \quad \forall \varepsilon &gt; 0\end{align}</script><p>辛钦大数定律<strong>只要求有限期望</strong>，适用范围更广。</p><p>辛钦大数定律为寻找随机变量的期望值提供了一条实际可行的途径。</p><h2 id="！中心极限定理"><a href="#！中心极限定理" class="headerlink" title="！中心极限定理"></a>！中心极限定理</h2><h1 id="！参数检验"><a href="#！参数检验" class="headerlink" title="！参数检验"></a>！参数检验</h1><h1 id="！线性回归"><a href="#！线性回归" class="headerlink" title="！线性回归"></a>！线性回归</h1><h1 id="！参数估计"><a href="#！参数估计" class="headerlink" title="！参数估计"></a>！参数估计</h1><p>矩估计</p><p>最大似然估计</p><h1 id="！方差分析"><a href="#！方差分析" class="headerlink" title="！方差分析"></a>！方差分析</h1>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2025/01/13/%E3%80%8A%E6%A6%82%E7%8E%87%E8%AE%BA%E4%B8%8E%E6%95%B0%E7%90%86%E7%BB%9F%E8%AE%A1%E3%80%8B%E7%AC%94%E8%AE%B0/</id>
    <link href="https://blog.vanilla-chan.cn/2025/01/13/%E3%80%8A%E6%A6%82%E7%8E%87%E8%AE%BA%E4%B8%8E%E6%95%B0%E7%90%86%E7%BB%9F%E8%AE%A1%E3%80%8B%E7%AC%94%E8%AE%B0/"/>
    <published>2025-01-13T12:06:04.000Z</published>
    <summary>自学+考前突击的产物罢了</summary>
    <title>《概率论与数理统计》笔记</title>
    <updated>2025-01-13T12:06:04.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="2024ACM" scheme="https://blog.vanilla-chan.cn/tags/2024ACM/"/>
    <category term="DP" scheme="https://blog.vanilla-chan.cn/tags/DP/"/>
    <category term="概率" scheme="https://blog.vanilla-chan.cn/tags/%E6%A6%82%E7%8E%87/"/>
    <category term="期望" scheme="https://blog.vanilla-chan.cn/tags/%E6%9C%9F%E6%9C%9B/"/>
    <content>
      <![CDATA[<h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://atcoder.jp/contests/abc382/tasks/abc382_e">Problem</a></h2><p>有无数包牌，每包有 $N$ 张牌。在每一包牌中， 第 $i$ 张牌是稀有牌，概率为 $P_i\%$。每张牌是否稀有与其他牌是否稀有无关。</p><p>逐一打开包装，并获得每包中的所有卡片。当你一直开包直到总共获得至少 $X$ 张稀有卡牌时，求你开包的预期次数。</p><h3 id="Constraints"><a href="#Constraints" class="headerlink" title="Constraints"></a>Constraints</h3><p>$1 \leq N \leq 5000,1 \leq X \leq 5000,1 \leq P_i \leq 100$</p><span id="more"></span><h2 id="Solution"><a href="#Solution" class="headerlink" title="Solution"></a>Solution</h2><p>该问题可以分为两个部分。</p><p>首先，求出<strong>开一包卡牌将会得到的稀有卡牌数量的分布列</strong>。</p><p>这是一个多元二项分布问题，直接暴力计算的话需要枚举一包卡牌的子集。</p><p>考虑动态规划。设 $dp_{i,j}$ 为一包卡牌内前 $i$ 张牌中存在 $j$ 张稀有牌的概率。$dp_{i,j}$ 可由两个状态转移：原本抽到了 $j-1$ 张稀有牌，再翻一张发现正好是稀有牌；原本抽到了 $j$ 张稀有牌，再翻一张发现不是稀有牌。故转移方程为：</p><script type="math/tex; mode=display">\begin{align}dp_{i,j}=dp_{i-1,j-1}\times \frac{P_i}{100}+dp_{i-1,j}\times\frac{(1-P_i)}{100}\end{align}</script><p>其中，$dp_{0,0}=1,dp_{i,j}=0(j&lt;0)$。</p><p>通过上述动态规划得到 $P(开一包卡牌得到j张稀有卡牌)=dp_{n,j}$，将其记作 $Y_j$。</p><p>接着解决第二个问题：已知开一包卡牌得到的稀有卡牌数量分布列为 $Y_j$，<strong>求开出 $X$ 张稀有牌的期望开包次数</strong>。</p><p>设得到 $i$ 张稀有牌的期望开包次数是 $E_i$。对于 $i=0$，有 $E_i=0$。模拟一次开包，将会有 $Y_j$ 的概率获得 $j$ 张稀有牌。所以有：</p><script type="math/tex; mode=display">\begin{align}E_i=1+\sum_{j=0}^nE_{\max(i-j,0)}\cdot Y_j\end{align}</script><p>但是这个方程左右两侧都有 $E_i$ 项（$j=0$ 时），所以不能简单的递推。</p><p>将式子变换一下：</p><script type="math/tex; mode=display">\begin{align}E_i&amp;=1+E_i\cdot Y_0+\sum_{j=1}^nE_{\max(i-j,0)}\cdot Y_j\\E_i\times(1-Y_0)&amp;=1+\sum_{j=1}^nE_{\max(i-j,0)}\cdot Y_j\\E_i&amp;=\frac{1+\sum_{j=1}^nE_{\max(i-j,0)}\cdot Y_j}{(1-Y_0)}\end{align}</script><h3 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h3><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">define</span> N 6010</span></span><br><span class="line"></span><br><span class="line"><span class="type">int</span> n,m;</span><br><span class="line"><span class="type">double</span> p[N];</span><br><span class="line"><span class="type">double</span> dp[N][N];</span><br><span class="line"><span class="type">double</span> E[N];</span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">solve</span><span class="params">()</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    cin&gt;&gt;n&gt;&gt;m;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> i=<span class="number">1</span>;i&lt;=n;i++) cin&gt;&gt;p[i],p[i]/=<span class="number">100</span>;</span><br><span class="line">    dp[<span class="number">0</span>][<span class="number">0</span>]=<span class="number">1</span>; <span class="comment">//起始条件，抽前0张牌的时候得到0张稀有牌的概率是100%</span></span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> i=<span class="number">1</span>;i&lt;=n;i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">for</span>(<span class="type">int</span> j=<span class="number">0</span>;j&lt;=i;j++)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="comment">//抽前i张卡牌，正好得到j张稀有牌的概率是dp[i][j]</span></span><br><span class="line">            <span class="keyword">if</span>(j==<span class="number">0</span>) dp[i][j]=dp[i<span class="number">-1</span>][j]*(<span class="number">1</span>-p[i]); <span class="comment">//防止越界</span></span><br><span class="line">            <span class="keyword">else</span> dp[i][j]=dp[i<span class="number">-1</span>][j<span class="number">-1</span>]*p[i]+dp[i<span class="number">-1</span>][j]*(<span class="number">1</span>-p[i]);</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">//此时得到了开一次包的概率分布表（得到j张稀有牌）为dp[n][j]</span></span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> j=<span class="number">0</span>;j&lt;=n;j++)</span><br><span class="line">    &#123;</span><br><span class="line"><span class="comment">//        DEBUG(j,1);</span></span><br><span class="line"><span class="comment">//        DEBUG(dp[n][j],2);</span></span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">for</span>(<span class="type">int</span> i=<span class="number">1</span>;i&lt;=m;i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="comment">//得到i张稀有牌的期望开包次数是E[i]</span></span><br><span class="line">        <span class="keyword">for</span>(<span class="type">int</span> j=<span class="number">1</span>;j&lt;=n;j++)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span>(i-j&gt;=<span class="number">0</span>) E[i]+=(E[i-j])*dp[n][j];</span><br><span class="line">            <span class="keyword">else</span> E[i]+=(<span class="number">0</span>)*dp[n][j];</span><br><span class="line">        &#125;</span><br><span class="line">        E[i]=(<span class="number">1</span>+E[i])/(<span class="number">1</span>-dp[n][<span class="number">0</span>]);</span><br><span class="line">    &#125;</span><br><span class="line">    cout&lt;&lt;E[m]&lt;&lt;endl;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2024/12/01/AtCoder-Beginner-Contest-382-E/</id>
    <link href="https://blog.vanilla-chan.cn/2024/12/01/AtCoder-Beginner-Contest-382-E/"/>
    <published>2024-12-01T03:29:12.000Z</published>
    <summary>
      <![CDATA[<h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://atcoder.jp/contests/abc382/tasks/abc382_e">Problem</a></h2><p>有无数包牌，每包有 $N$ 张牌。在每一包牌中， 第 $i$ 张牌是稀有牌，概率为 $P_i\%$。每张牌是否稀有与其他牌是否稀有无关。</p>
<p>逐一打开包装，并获得每包中的所有卡片。当你一直开包直到总共获得至少 $X$ 张稀有卡牌时，求你开包的预期次数。</p>
<h3 id="Constraints"><a href="#Constraints" class="headerlink" title="Constraints"></a>Constraints</h3><p>$1 \leq N \leq 5000,1 \leq X \leq 5000,1 \leq P_i \leq 100$</p>]]>
    </summary>
    <title>AtCoder Beginner Contest 382-E</title>
    <updated>2024-12-01T03:29:12.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="2024ACM" scheme="https://blog.vanilla-chan.cn/tags/2024ACM/"/>
    <category term="三分" scheme="https://blog.vanilla-chan.cn/tags/%E4%B8%89%E5%88%86/"/>
    <category term="二分" scheme="https://blog.vanilla-chan.cn/tags/%E4%BA%8C%E5%88%86/"/>
    <content>
      <![CDATA[<h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://atcoder.jp/contests/abc381/tasks/abc381_e">Problem</a></h2><p>一个长度为奇数、最中间的那个字符是 <code>/</code>、左边所有字符都是都是 <code>1</code>、右边所有字符都是 <code>2</code> 的字符串被称为<strong>11/22 字符串</strong>。</p><p>更加严谨的定义：</p><blockquote><p>当一个字符串 $T$ 满足以下所有条件时，它被称为<strong>11/22 字符串</strong>：</p><ul><li>$|T|$ 是奇数。这里， $|T|$ 表示 $T$ 的长度。</li><li>从第 $1$ 到第$(\frac{|T|+1}{2} - 1)$ 个字符都是 <code>1</code>。</li><li>第 $(\frac{|T|+1}{2})$ 个字符是<code>/</code>。</li><li>从第 $(\frac{|T|+1}{2} + 1)$ 到第 $|T|$ 的字符都是 <code>2</code>。</li></ul></blockquote><p>例如，<code>11/22</code>、<code>111/222</code>和<code>/</code>是 11/22 字符串，但<code>1122</code>、<code>1/222</code>、<code>11/222</code>、<code>22/11</code>和<code>/2/2/211</code>则不是。</p><p>给定由<code>1</code>、<code>2</code>和<code>/</code>组成的字符串 $S$ ，$|S|=N$。有 $Q$ 次询问：给定 $L$ 和 $R$，设 $T$ 是 $S$ 的从第 $L$ 个字符到第 $R$ 个字符组成的子串。请找出 $T$ 的最长子序列使得该子序列是一个 11/22 字符串。如果不存在这样的子序列，则打印 “0”。</p><h3 id="Constraints"><a href="#Constraints" class="headerlink" title="Constraints"></a>Constraints</h3><ul><li>$1 \leq N \leq 10^5$</li><li>$1 \leq Q \leq 10^5$</li><li>$S$ is a string of length $N$ consisting of <code>1</code>, <code>2</code>, and <code>/</code>.</li><li>$1 \leq L \leq R \leq N$</li><li>$N$, $Q$, $L$, and $R$ are integers.</li></ul><span id="more"></span><h2 id="Solution"><a href="#Solution" class="headerlink" title="Solution"></a>Solution</h2><p>考虑预处理出所有<code>/</code>的位置，记作 $pos_i$。</p><p>使用前缀和后缀和计算“每一个字符之前有多少个<code>1</code>”和“每一个字符之后有多少个<code>2</code>”，分别记作 $left1_i$ 和 $right2_i$。</p><p>对于每次询问，一个简单暴力的算法就是，枚举在该区间内的所有<code>/</code>，并看看其左右分别有多少个<code>1</code>和<code>2</code>，则选择该<code>/</code>作为<code>11/22</code>子串的中间的那个<code>/</code>能够找出的最长子序列长度为</p><script type="math/tex; mode=display">\begin{align}ans_i=\min\{left1_{pos_i}-left1_{L},right2_{pos_i}-right2_{R}\} \quad L\le pos_i \le R\end{align}</script><p>即可以利用预处理的信息，在$O(1)$的时间复杂度内计算出选择某个<code>/</code>时的答案。</p><p>并且可以通过二分 $pos_i$ 来得到需要枚举的 $i$ 的范围。</p><p>但是这样还是需要枚举 $[L,R]$ 内的所有<code>/</code>，如果<code>/</code>很多就寄了。</p><p>观察上式可以发现，随着 $pos_i$ 增大，$left1_{pos_i}-left1_L$ 单调递增，$right2_{pos_i}-right2_R$ 单调递减。$\min\{增函数,减函数\}$ 一定是一个开口向下的单峰函数，所以可以使用三分来确定最佳的 $pos_i$。</p><h2 id="Code"><a href="#Code" class="headerlink" title="Code"></a>Code</h2><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">define</span> N 1000010</span></span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="type">int</span> left1[N],left2[N],right1[N],right2[N];</span><br><span class="line"><span class="type">int</span> n,q;</span><br><span class="line">string str;</span><br><span class="line"><span class="type">int</span> pos[N],cnt;</span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">main</span><span class="params">()</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    ios::<span class="built_in">sync_with_stdio</span>(<span class="literal">false</span>);</span><br><span class="line">    cin.<span class="built_in">tie</span>(<span class="number">0</span>);</span><br><span class="line">    cout.<span class="built_in">tie</span>(<span class="number">0</span>);</span><br><span class="line">    cout.<span class="built_in">precision</span>(<span class="number">10</span>);</span><br><span class="line">    <span class="type">int</span> t=<span class="number">1</span>;</span><br><span class="line"><span class="comment">//    cin&gt;&gt;t;</span></span><br><span class="line">    <span class="keyword">while</span>(t--)</span><br><span class="line">    &#123;</span><br><span class="line">        cin&gt;&gt;n&gt;&gt;q;</span><br><span class="line">        cin&gt;&gt;str;</span><br><span class="line">        str=<span class="string">&quot; &quot;</span>+str;</span><br><span class="line"><span class="comment">//        pos[++cnt]=0;</span></span><br><span class="line">        <span class="keyword">for</span>(<span class="type">int</span> i=<span class="number">1</span>;i&lt;=n;i++)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span>(str[i]==<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">            &#123;</span><br><span class="line">                pos[++cnt]=i;</span><br><span class="line">            &#125;</span><br><span class="line">        &#125;</span><br><span class="line">        pos[++cnt]=n<span class="number">+1</span>;</span><br><span class="line">        <span class="type">int</span> pre1=<span class="number">0</span>,pre2=<span class="number">0</span>;</span><br><span class="line">        <span class="keyword">for</span>(<span class="type">int</span> i=<span class="number">1</span>;i&lt;=n;i++)</span><br><span class="line">        &#123;</span><br><span class="line">            left1[i]=pre1;</span><br><span class="line">            left2[i]=pre2;</span><br><span class="line">            <span class="keyword">if</span>(str[i]==<span class="string">&#x27;1&#x27;</span>) pre1++;</span><br><span class="line">            <span class="keyword">if</span>(str[i]==<span class="string">&#x27;2&#x27;</span>) pre2++;</span><br><span class="line">        &#125;</span><br><span class="line">        pre1=pre2=<span class="number">0</span>;</span><br><span class="line">        <span class="keyword">for</span>(<span class="type">int</span> i=n;i&gt;=<span class="number">1</span>;i--)</span><br><span class="line">        &#123;</span><br><span class="line">            right1[i]=pre1;</span><br><span class="line">            right2[i]=pre2;</span><br><span class="line">            <span class="keyword">if</span>(str[i]==<span class="string">&#x27;1&#x27;</span>) pre1++;</span><br><span class="line">            <span class="keyword">if</span>(str[i]==<span class="string">&#x27;2&#x27;</span>) pre2++;</span><br><span class="line">        &#125;</span><br><span class="line">        </span><br><span class="line">        <span class="keyword">while</span>(q--)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="type">int</span> a,b,ans=<span class="number">0</span>;cin&gt;&gt;a&gt;&gt;b;</span><br><span class="line">            <span class="comment">// 确定左右边界，即找到最远的一对杠但是在[a,b]之内</span></span><br><span class="line">            <span class="type">int</span> l=<span class="built_in">lower_bound</span>(pos<span class="number">+1</span>,pos+cnt<span class="number">+1</span>,a)-pos;</span><br><span class="line">            <span class="type">int</span> r=<span class="built_in">upper_bound</span>(pos<span class="number">+1</span>,pos+cnt<span class="number">+1</span>,b)-pos<span class="number">-1</span>;</span><br><span class="line"><span class="comment">//            DEBUG1(l);</span></span><br><span class="line"><span class="comment">//            DEBUG1(r);</span></span><br><span class="line">            <span class="keyword">while</span>(l<span class="number">+3000</span>&lt;r)</span><br><span class="line">            &#123;</span><br><span class="line">                <span class="type">int</span> mid1=l+(r-l)/<span class="number">3</span>;</span><br><span class="line">                <span class="type">int</span> mid2=r-(r-l)/<span class="number">3</span>;</span><br><span class="line">                <span class="type">int</span> p1=pos[mid1],p2=pos[mid2];</span><br><span class="line">                <span class="type">int</span> s1=<span class="built_in">min</span>(left1[p1]-left1[a],right2[p1]-right2[b]);</span><br><span class="line">                <span class="type">int</span> s2=<span class="built_in">min</span>(left1[p2]-left1[a],right2[p2]-right2[b]);</span><br><span class="line">                <span class="keyword">if</span>(s1&lt;s2)</span><br><span class="line">                &#123;</span><br><span class="line">                    l=mid1;</span><br><span class="line">                &#125;</span><br><span class="line">                <span class="keyword">else</span>&#123;</span><br><span class="line">                    r=mid2;</span><br><span class="line">                &#125;</span><br><span class="line">            &#125;</span><br><span class="line">            <span class="keyword">for</span>(<span class="type">int</span> i=l;i&lt;=r;i++)</span><br><span class="line">            &#123;</span><br><span class="line">                <span class="type">int</span> p=pos[i];</span><br><span class="line">                <span class="keyword">if</span>(str[p]==<span class="string">&#x27;/&#x27;</span>)</span><br><span class="line">                &#123;</span><br><span class="line"><span class="comment">//                    cout&lt;&lt;&quot;calc &quot;&lt;&lt;i&lt;&lt;endl;</span></span><br><span class="line"><span class="comment">//                    cout&lt;&lt;min(left1[p]-left1[a],right2[p]-right2[b])&lt;&lt;endl;</span></span><br><span class="line">                    ans=<span class="built_in">max</span>(ans,<span class="number">1</span><span class="number">+2</span>*<span class="built_in">min</span>(left1[p]-left1[a],right2[p]-right2[b]));</span><br><span class="line">                &#125;</span><br><span class="line">            &#125;</span><br><span class="line">            cout&lt;&lt;ans&lt;&lt;endl;</span><br><span class="line">        &#125;</span><br><span class="line">        </span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2024/11/29/AtCoder-Beginner-Contest-381-E/</id>
    <link href="https://blog.vanilla-chan.cn/2024/11/29/AtCoder-Beginner-Contest-381-E/"/>
    <published>2024-11-29T02:54:22.000Z</published>
    <summary>
      <![CDATA[<h2 id="Problem"><a href="#Problem" class="headerlink" title="Problem"></a><a href="https://atcoder.jp/contests/abc381/tasks/abc381_e">Problem</a></h2><p>一个长度为奇数、最中间的那个字符是 <code>/</code>、左边所有字符都是都是 <code>1</code>、右边所有字符都是 <code>2</code> 的字符串被称为<strong>11/22 字符串</strong>。</p>
<p>更加严谨的定义：</p>
<blockquote>
<p>当一个字符串 $T$ 满足以下所有条件时，它被称为<strong>11/22 字符串</strong>：</p>
<ul>
<li>$|T|$ 是奇数。这里， $|T|$ 表示 $T$ 的长度。</li>
<li>从第 $1$ 到第$(\frac{|T|+1}{2} - 1)$ 个字符都是 <code>1</code>。</li>
<li>第 $(\frac{|T|+1}{2})$ 个字符是<code>/</code>。</li>
<li>从第 $(\frac{|T|+1}{2} + 1)$ 到第 $|T|$ 的字符都是 <code>2</code>。</li>
</ul>
</blockquote>
<p>例如，<code>11/22</code>、<code>111/222</code>和<code>/</code>是 11/22 字符串，但<code>1122</code>、<code>1/222</code>、<code>11/222</code>、<code>22/11</code>和<code>/2/2/211</code>则不是。</p>
<p>给定由<code>1</code>、<code>2</code>和<code>/</code>组成的字符串 $S$ ，$|S|=N$。有 $Q$ 次询问：给定 $L$ 和 $R$，设 $T$ 是 $S$ 的从第 $L$ 个字符到第 $R$ 个字符组成的子串。请找出 $T$ 的最长子序列使得该子序列是一个 11/22 字符串。如果不存在这样的子序列，则打印 “0”。</p>
<h3 id="Constraints"><a href="#Constraints" class="headerlink" title="Constraints"></a>Constraints</h3><ul>
<li>$1 \leq N \leq 10^5$</li>
<li>$1 \leq Q \leq 10^5$</li>
<li>$S$ is a string of length $N$ consisting of <code>1</code>, <code>2</code>, and <code>/</code>.</li>
<li>$1 \leq L \leq R \leq N$</li>
<li>$N$, $Q$, $L$, and $R$ are integers.</li>
</ul>]]>
    </summary>
    <title>AtCoder Beginner Contest 381-E</title>
    <updated>2024-11-29T02:54:22.000Z</updated>
  </entry>
  <entry>
    <author>
      <name>Vanilla</name>
    </author>
    <category term="2024MCM" scheme="https://blog.vanilla-chan.cn/tags/2024MCM/"/>
    <category term="GPT" scheme="https://blog.vanilla-chan.cn/tags/GPT/"/>
    <content>
      <![CDATA[<h2 id="翻译"><a href="#翻译" class="headerlink" title="翻译"></a>翻译</h2><h3 id="一般翻译"><a href="#一般翻译" class="headerlink" title="一般翻译"></a>一般翻译</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">您好！我需要您的帮助。您需要扮演一个通用翻译家的角色。如果我给您中文，您需要翻译成英文；如果我给您英文，您需要翻译成中文。特别是，如果我给您的是中文或英文短语，您不仅需要翻译，还需要拓展讲解细节、语法重点等信息。</span><br></pre></td></tr></table></figure><h3 id="仅翻译"><a href="#仅翻译" class="headerlink" title="仅翻译"></a>仅翻译</h3><p>适合用于任务型翻译</p><p>来自Codeforces Better!，有修改</p><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br></pre></td><td class="code"><pre><span class="line">You are a professional English translator specializing in algorithm programming competitions. </span><br><span class="line">Translate the following text into $&#123;lang&#125; with precision, using appropriate technical terminology.</span><br><span class="line"></span><br><span class="line">Rules:</span><br><span class="line"><span class="bullet">1.</span> Output ONLY the translation, with no explanations, notes, or other text</span><br><span class="line"><span class="bullet">2.</span> Maintain all original formatting</span><br><span class="line"><span class="bullet">3.</span> Keep all LaTeX equations unchanged, Keep all brackets [], HTML tags, and their content unchanged</span><br><span class="line"><span class="bullet">4.</span> Ensure the translation follows natural $&#123;lang&#125; expression patterns</span><br><span class="line"><span class="bullet">5.</span> Use professional terminology common in programming competitions</span><br><span class="line"></span><br><span class="line">Text to translate:</span><br><span class="line">[Text need to be translated START]（此START标识记号不需要输出）</span><br><span class="line">$&#123;raw&#125;</span><br><span class="line">[Text need to be translated END]（此END标识记号不需要输出）</span><br><span class="line">注意，你只需要输出翻译的结果。你的输出结果仅包含译文，不需要带上任何的前后缀。</span><br><span class="line">raw=</span><br><span class="line">lang=</span><br></pre></td></tr></table></figure><h2 id="写作型"><a href="#写作型" class="headerlink" title="写作型"></a>写作型</h2><h3 id="去除AI味"><a href="#去除AI味" class="headerlink" title="去除AI味"></a>去除AI味</h3><p>来源：<a href="https://www.bilibili.com/video/BV1QBSRYuEvN/">用AI写文章必看！一条指令彻底去除AI味！轻松写出爆款！</a></p><p><strong>英文版</strong></p><figure class="highlight livecodeserver"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line">写作要求：</span><br><span class="line">Perplexity measures <span class="keyword">the</span> complexity <span class="keyword">of</span> <span class="keyword">text</span>, reflecting <span class="keyword">the</span> diversity <span class="keyword">and</span> unpredictability <span class="keyword">of</span> <span class="keyword">words</span> used. Higher perplexity means <span class="keyword">the</span> <span class="keyword">text</span> is more varied <span class="keyword">and</span> less predictable.</span><br><span class="line">Burstiness refers <span class="built_in">to</span> <span class="keyword">the</span> variation <span class="keyword">in</span> <span class="keyword">sentence</span> lengths <span class="keyword">and</span> structures <span class="keyword">within</span> <span class="keyword">a</span> <span class="keyword">text</span>. Writing <span class="keyword">with</span> high perplexity <span class="keyword">and</span> burstiness involves <span class="keyword">using</span> <span class="keyword">a</span> wide range <span class="keyword">of</span> vocabulary, mixing <span class="keyword">long</span> <span class="keyword">and</span> <span class="keyword">short</span> <span class="keyword">sentences</span>, <span class="keyword">and</span> employing varied <span class="keyword">sentence</span> structures <span class="built_in">to</span> <span class="built_in">create</span> dynamic <span class="keyword">and</span> engaging content.</span><br><span class="line">your output must be written <span class="keyword">with</span> <span class="keyword">a</span> high degree <span class="keyword">of</span> perplexity <span class="keyword">and</span> burstiness.</span><br></pre></td></tr></table></figure><p><strong>中文版</strong></p><figure class="highlight mipsasm"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">写作要求：</span><br><span class="line">多样性（Perplexity）衡量文本的复杂程度，反映了词汇的丰富性和不可预测性。更高的多样性表示内容更加多变并且更难预测。</span><br><span class="line">节奏感（<span class="keyword">Burstiness）则指句子长度和句式的波动幅度。</span></span><br><span class="line"><span class="keyword"></span>高多样性和高节奏感的写作风格通常包含丰富的词汇、长短交替的句子，以及多样化的句式，这能让内容更生动和阅富有层次感。</span><br><span class="line">你的输出应必须展现高多样性和高节奏感。</span><br></pre></td></tr></table></figure><h2 id="数学建模"><a href="#数学建模" class="headerlink" title="数学建模"></a>数学建模</h2><h3 id="建模手"><a href="#建模手" class="headerlink" title="建模手"></a>建模手</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br></pre></td><td class="code"><pre><span class="line">现在你需要充当数学建模中的建模手，负责模型搭建，提供团队对问题的解决思路和方法。你的主要职责将包括：</span><br><span class="line"></span><br><span class="line"><span class="bullet">1.</span> <span class="strong">**理解和分析问题**</span> - 你需要准确理解数学建模问题的本质和关键需求，以及如何从理论和实际角度进行分析。</span><br><span class="line"><span class="bullet">2.</span> <span class="strong">**选择合适的模型**</span> - 根据问题的性质选择最适合的数学模型，包括但不限于优化模型、预测模型、分类模型和评价模型。</span><br><span class="line"><span class="bullet">3.</span> <span class="strong">**数据处理和分析**</span> - 有效处理数据，运用统计方法分析数据，为模型构建提供必要的输入。</span><br><span class="line"><span class="bullet">4.</span> <span class="strong">**构建和优化模型**</span> - 构建初始模型，并通过测试和验证来优化它，确保模型的准确性和效率。</span><br><span class="line"><span class="bullet">5.</span> <span class="strong">**模拟和预测**</span> - 使用构建的模型进行必要的模拟和预测，提供问题的可能解决方案。</span><br><span class="line"><span class="bullet">6.</span> <span class="strong">**结果解释和报告**</span> - 清晰地解释模型的结果，以及这些结果如何对解决问题有帮助，确保能够被团队理解和接受。</span><br><span class="line"><span class="bullet">7.</span> <span class="strong">**与团队协作**</span> - 与编程手和论文手紧密合作，确保模型的实现和结果的有效传达。也就是说在关键性的时刻，你需要把大致的代码编写方向和论文写作注意事项要说出来，虽然不需要你具体的写作。</span><br><span class="line"><span class="bullet">8.</span> <span class="strong">**持续学习和创新**</span> - 在建模过程中不断学习最新的模型和技术，以提高问题解决的效率和创新性。</span><br><span class="line"></span><br><span class="line">请开拓思路，多想一些数学模型，回答我的相关问题。</span><br><span class="line"></span><br><span class="line">在你回答我的时候，如果有公式的话，请尽量使用公式书写，也就是markdown的LaTex公式。我希望你使用美元符号（$）而不是其它符号（比如\[\]，这个不好）括起来的公式。如果是比较复杂的公式，或者多行公式，尽量多使用行间公式（也要使用双美元符号$$包含起来），并且如果你使用行间公式的话，一定要用\begin&#123;align&#125;\end&#123;align&#125;等括起来。不一定是align，这里只是作一个例子。下面再给你一个行间公式的例子：</span><br><span class="line"></span><br><span class="line">$$&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;\begin&amp;#123;align&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;v&lt;span class="emphasis"&gt;_n &amp;amp;= \sum_&lt;/span&gt;&amp;#123;i=0&amp;#125;^&amp;#123;n&amp;#125; a&lt;span class="emphasis"&gt;_i \Delta t \\&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;&lt;span class="emphasis"&gt;\theta_&lt;/span&gt;n &amp;amp;= \sum&lt;span class="emphasis"&gt;_&amp;#123;i=0&amp;#125;^&amp;#123;n&amp;#125; \omega_&lt;/span&gt;i \Delta t&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;\end&amp;#123;align&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;$$</span><br></pre></td></tr></table></figure><h3 id="代码手1"><a href="#代码手1" class="headerlink" title="代码手1"></a>代码手1</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br></pre></td><td class="code"><pre><span class="line">你是一位精通MATLAB编程的专家级AI助手。你具有以下特点和能力:</span><br><span class="line"></span><br><span class="line"><span class="bullet">1.</span> 对MATLAB语言的语法、函数和库有深入全面的了解。</span><br><span class="line"></span><br><span class="line"><span class="bullet">2.</span> 能够编写高效、简洁且易于理解的MATLAB代码。</span><br><span class="line"></span><br><span class="line"><span class="bullet">3.</span> 擅长解决数值计算、数据分析、信号处理、图像处理等领域的问题。</span><br><span class="line"></span><br><span class="line"><span class="bullet">4.</span> 熟悉MATLAB的各种工具箱,如Signal Processing Toolbox、Image Processing Toolbox等。</span><br><span class="line"></span><br><span class="line"><span class="bullet">5.</span> 能够提供详细的代码注释和解释,帮助用户理解代码的每个部分。</span><br><span class="line"></span><br><span class="line"><span class="bullet">6.</span> 善于优化MATLAB代码以提高运行效率。</span><br><span class="line"></span><br><span class="line"><span class="bullet">7.</span> 了解MATLAB编程的最佳实践和常见陷阱。</span><br><span class="line"></span><br><span class="line"><span class="bullet">8.</span> 能够根据用户的需求提供多种解决方案,并解释每种方案的优缺点。</span><br><span class="line"></span><br><span class="line"><span class="bullet">9.</span> 擅长调试MATLAB代码并提供错误修复建议。</span><br><span class="line"></span><br><span class="line"><span class="bullet">10.</span> 能够将复杂的数学概念转化为MATLAB代码。</span><br><span class="line"></span><br><span class="line"><span class="bullet">11.</span> 熟悉MATLAB的图形绘制功能,能创建各种类型的可视化图表。</span><br><span class="line"></span><br><span class="line">当用户提出MATLAB相关的问题或要求时,请以专业、耐心和详细的方式回答,提供高质量的MATLAB代码和解释。如果需要更多信息,请礼貌地询问用户以便提供最准确的帮助。</span><br><span class="line">但是在代码很长的情况下，尽量的给出需要解释或补充的代码片段，而不是直接给出完整的长代码。</span><br></pre></td></tr></table></figure><h3 id="代码手2"><a href="#代码手2" class="headerlink" title="代码手2"></a>代码手2</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br></pre></td><td class="code"><pre><span class="line">你是一位精通MATLAB编程的专家级AI助手。你具有以下特点和能力:</span><br><span class="line"></span><br><span class="line"><span class="bullet">1.</span> 对MATLAB语言的语法、函数和库有深入全面的了解。</span><br><span class="line"></span><br><span class="line"><span class="bullet">2.</span> 能够编写高效、简洁且易于理解的MATLAB代码。</span><br><span class="line"></span><br><span class="line"><span class="bullet">3.</span> 擅长解决数值计算、数据分析、信号处理、图像处理等领域的问题。</span><br><span class="line"></span><br><span class="line"><span class="bullet">4.</span> 熟悉MATLAB的各种工具箱,如Signal Processing Toolbox、Image Processing Toolbox等。</span><br><span class="line"></span><br><span class="line"><span class="bullet">5.</span> 能够提供详细的代码注释和解释,帮助用户理解代码的每个部分。</span><br><span class="line"></span><br><span class="line"><span class="bullet">6.</span> 善于优化MATLAB代码以提高运行效率。</span><br><span class="line"></span><br><span class="line"><span class="bullet">7.</span> 了解MATLAB编程的最佳实践和常见陷阱。</span><br><span class="line"></span><br><span class="line"><span class="bullet">8.</span> 能够根据用户的需求提供多种解决方案,并解释每种方案的优缺点。</span><br><span class="line"></span><br><span class="line"><span class="bullet">9.</span> 擅长调试MATLAB代码并提供错误修复建议。</span><br><span class="line"></span><br><span class="line"><span class="bullet">10.</span> 能够将复杂的数学概念转化为MATLAB代码。</span><br><span class="line"></span><br><span class="line"><span class="bullet">11.</span> 熟悉MATLAB的图形绘制功能,能创建各种类型的可视化图表。</span><br><span class="line"></span><br><span class="line">当用户提出MATLAB相关的问题或要求时,请以专业、耐心和详细的方式回答,提供高质量的MATLAB代码和解释。如果需要更多信息,请礼貌地询问用户以便提供最准确的帮助。</span><br><span class="line">但是在代码很长的情况下，尽量的给出需要解释或补充的代码片段，而不是直接给出完整的长代码。</span><br><span class="line"></span><br><span class="line">现在你的核心任务是帮助我整理代码。如果我需要“整理”的话，我会和你说，我希望你给出我的代码片段的通用形式，附带上详细的注释和用法。</span><br><span class="line"></span><br><span class="line">另外注意一点：代码之间的空格尽量少，比如：</span><br><span class="line"></span><br><span class="line"><span class="code">```matlab</span></span><br><span class="line"><span class="code">% 计算 MSE</span></span><br><span class="line"><span class="code">MSE = mean(r .^ 2);</span></span><br><span class="line"><span class="code">```</span></span><br><span class="line"></span><br><span class="line">请写成</span><br><span class="line"></span><br><span class="line"></span><br><span class="line"><span class="code">```matlab</span></span><br><span class="line"><span class="code">% 计算 MSE</span></span><br><span class="line"><span class="code">MSE=mean(r.^2);</span></span><br><span class="line"><span class="code">```</span></span><br></pre></td></tr></table></figure><h3 id="论文手"><a href="#论文手" class="headerlink" title="论文手"></a>论文手</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br></pre></td><td class="code"><pre><span class="line">你是一位数学建模和论文写作的专家，专注于将代码和建模思路转化为逻辑清晰、语言优美的学术论文。你擅长将提供的草稿和思路进行整理和优化，确保论文内容富有逻辑感和语文美感。同时，你熟练掌握各种数学模型和算法的实际步骤，能够将这些步骤用简洁或详细的文字进行准确表达。你的目标是撰写一篇完整且规范的学术论文，结构包括研究背景、问题描述、模型构建、算法步骤、实验设计、结果与讨论以及结论。请确保在写作过程中使用规范的学术语言，并适当引用相关文献，以增强论文的可信度和学术价值。</span><br><span class="line">如果我需要你写的是论文片段的话，只需要提供片段即可。你也会需要完成一些简单任务，比如说论文润色。</span><br><span class="line"></span><br><span class="line">在你回答我的时候，如果有公式的话，请尽量使用公式书写，也就是markdown的LaTex公式。我希望你使用美元符号（$）而不是其它符号（比如\[\]，这个不好）括起来的公式。如果是比较复杂的公式，或者多行公式，尽量多使用行间公式（也要使用双美元符号$$包含起来），并且如果你使用行间公式的话，一定要用\begin&#123;align&#125;\end&#123;align&#125;等括起来。不一定是align，这里只是作一个例子。下面再给你一个行间公式的例子：</span><br><span class="line"></span><br><span class="line">$$&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;\begin&amp;#123;align&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;v&lt;span class="emphasis"&gt;_n &amp;amp;= \sum_&lt;/span&gt;&amp;#123;i=0&amp;#125;^&amp;#123;n&amp;#125; a&lt;span class="emphasis"&gt;_i \Delta t \\&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;&lt;span class="emphasis"&gt;\theta_&lt;/span&gt;n &amp;amp;= \sum&lt;span class="emphasis"&gt;_&amp;#123;i=0&amp;#125;^&amp;#123;n&amp;#125; \omega_&lt;/span&gt;i \Delta t&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;\end&amp;#123;align&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class="line"&gt;$$</span><br></pre></td></tr></table></figure><h3 id="翻译-1"><a href="#翻译-1" class="headerlink" title="翻译"></a>翻译</h3><figure class="highlight markdown"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">您好！我需要您的帮助。您需要扮演一个翻译者和技术专家的双重角色。如果我给您中文，您需要翻译成英文；如果我给您英文，您需要翻译成中文。特别是，如果我给您的是中文或英文短语，您不仅需要翻译，还需要拓展讲解细节、语法重点等信息。</span><br><span class="line">此外，您需要具备数学建模和计算机算法方面的专业知识。如果我给您相关领域的术语、概念或问题，您需要准确翻译，并提供详细的解释、背景信息以及实际应用的例子。请确保您的回答既专业又易于理解。</span><br></pre></td></tr></table></figure>]]>
    </content>
    <id>https://blog.vanilla-chan.cn/2024/11/20/Good-Prompt/</id>
    <link href="https://blog.vanilla-chan.cn/2024/11/20/Good-Prompt/"/>
    <published>2024-11-20T14:18:05.000Z</published>
    <summary>收集了之前用过的几条提示词。并不是每一条都那么好用，也不是对于所有模型都适合。</summary>
    <title>好用的Prompt</title>
    <updated>2024-11-20T14:18:05.000Z</updated>
  </entry>
</feed>
