<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_52134394的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_52134394</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_52134394]]></copyright><item><title><![CDATA[硅基流动Token]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/162223207</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/162223207</guid><author>qq_52134394</author><pubDate>Tue, 23 Jun 2026 09:36:01 +0800</pubDate><description><![CDATA[薅羊毛福利：注册硅基流动即送2000万Tokens！ 新用户通过专属链接注册硅基流动（SiliconFlow），可免费领取2000万Tokens（约16元余额），适用于DeepSeek V4 Pro、GLM5.2等大模型调用，支持AI对话、文生图、语音合成等功能。注册后还能领取16元代金券，付费模型优先抵扣赠送余额。开发者可使用API，或在Cherry Studio中配置密钥体验多模型服务。 注册地址：https://cloud.siliconflow.cn/i/4OC5j1YP 邀请码：4OC5j1YP]]></description><category></category></item><item><title><![CDATA[算法设计与分析]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/155991862</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/155991862</guid><author>qq_52134394</author><pubDate>Tue, 16 Dec 2025 22:49:21 +0800</pubDate><description><![CDATA[本文摘要：算法设计与分析课程重点讲解了四个核心算法：1)斐波那契数列的递归实现，强调递归方程的建立；2)0-1背包问题的动态规划解法，详细阐述了状态定义、转移方程及填表过程；3)Dijkstra最短路径算法，展示如何计算单源点到其他顶点的最短路径；4)高精度加法的字符串模拟方法。通过具体示例（如背包容量9时的最优解计算）和表格演示，系统讲解了各算法的实现步骤和应用场景。]]></description><category></category></item><item><title><![CDATA[跟康师傅学Java-面向对象（基础）]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/147313782</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/147313782</guid><author>qq_52134394</author><pubDate>Thu, 17 Apr 2025 20:59:41 +0800</pubDate><description><![CDATA[尚硅谷教育-康师傅Java]]></description><category></category></item><item><title><![CDATA[跟康师傅学Java-基础语法]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/147313758</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/147313758</guid><author>qq_52134394</author><pubDate>Thu, 17 Apr 2025 20:58:49 +0800</pubDate><description><![CDATA[尚硅谷-康师傅java笔记]]></description><category></category></item><item><title><![CDATA[Java基本语法]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/145487732</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/145487732</guid><author>qq_52134394</author><pubDate>Fri, 07 Feb 2025 09:37:05 +0800</pubDate><description><![CDATA[java基础语法]]></description><category></category></item><item><title><![CDATA[GPU版本torch使用教程]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/138070287</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/138070287</guid><author>qq_52134394</author><pubDate>Mon, 22 Apr 2024 12:59:23 +0800</pubDate><description><![CDATA[GPU版本torch安装教程]]></description><category></category></item><item><title><![CDATA[Linux 期末复习]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/135462455</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/135462455</guid><author>qq_52134394</author><pubDate>Mon, 08 Jan 2024 17:23:49 +0800</pubDate><description><![CDATA[Linux原理课复习总结]]></description><category></category></item><item><title><![CDATA[Git命令+github仓库克隆]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/135423030</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/135423030</guid><author>qq_52134394</author><pubDate>Sat, 06 Jan 2024 10:45:57 +0800</pubDate><description><![CDATA[git命令]]></description><category></category></item><item><title><![CDATA[自然语言处理学习笔记（通俗白话）]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/129072040</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/129072040</guid><author>qq_52134394</author><pubDate>Fri, 24 Mar 2023 18:05:35 +0800</pubDate><description><![CDATA[激活函数是神经网络非线性的来源，如果不引入，则神经网络的线性模型的复合仍然为线性模型，不能很好的拟合非线性情况下的模型。估计出来的模型是最接近真实情形的(误差=真实值-理论值)。（防止处理的参数过多）常用的池化层有，均值池化层、最大值池化层等。进入解码器时的数据一部分来自编码器，一部分由解码器自己生成。而**（真实-预测）的平方**很好的规避了这两个问题。的问题是：会出现正负相消的情况，从而出现误判。，比如对一张图像而言，关注的可能有纹理，色泽等。直接关注物体更显著的特征，有重点的去提取特征。]]></description><category></category></item><item><title><![CDATA[Anaconda---常用命令总结]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/129307880</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/129307880</guid><author>qq_52134394</author><pubDate>Wed, 08 Mar 2023 15:23:04 +0800</pubDate><description><![CDATA[anaconda 配环境常用命令]]></description><category></category></item><item><title><![CDATA[机器视觉总结]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/127712653</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/127712653</guid><author>qq_52134394</author><pubDate>Sun, 06 Nov 2022 17:42:00 +0800</pubDate><description><![CDATA[机器视觉基础知识总结]]></description><category></category></item><item><title><![CDATA[机器学习与模式识别]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/127629057</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/127629057</guid><author>qq_52134394</author><pubDate>Tue, 01 Nov 2022 10:47:01 +0800</pubDate><description><![CDATA[机器学习与模式识别课程笔记]]></description><category></category></item><item><title><![CDATA[pdf文件如何保存指定页面？]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/125665761</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/125665761</guid><author>qq_52134394</author><pubDate>Thu, 07 Jul 2022 19:44:48 +0800</pubDate><description><![CDATA[pdf保存指定页码]]></description><category></category></item><item><title><![CDATA[CPU设计实战-第四章实践任务三用前递技术解决相关引发的冲突]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/125563098</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/125563098</guid><author>qq_52134394</author><pubDate>Fri, 01 Jul 2022 20:30:46 +0800</pubDate><description><![CDATA[《CPU设计实战》第四章实践任务三用前递技术解决相关引发的冲突]]></description><category></category></item><item><title><![CDATA[CPU设计实战-第四章实践任务二用阻塞技术解决相关引发的冲突]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/125563075</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/125563075</guid><author>qq_52134394</author><pubDate>Fri, 01 Jul 2022 20:19:10 +0800</pubDate><description><![CDATA[《CPU设计实战》第四章实践任务二 用阻塞技术解决相关流水线冲突]]></description><category></category></item><item><title><![CDATA[CPU设计相关笔记]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/125441617</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/125441617</guid><author>qq_52134394</author><pubDate>Fri, 01 Jul 2022 17:32:47 +0800</pubDate><description><![CDATA[CPU设计涉及相关知识笔记]]></description><category></category></item><item><title><![CDATA[CPU设计实战-第四章实践任务一简单CPU参考设计调试]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/125474453</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/125474453</guid><author>qq_52134394</author><pubDate>Mon, 27 Jun 2022 21:53:20 +0800</pubDate><description><![CDATA[CPU设计实战-汪文祥]]></description><category></category></item><item><title><![CDATA[模拟退火算法（AI导论）]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/124667511</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/124667511</guid><author>qq_52134394</author><pubDate>Mon, 09 May 2022 20:33:03 +0800</pubDate><description><![CDATA[模拟退火算法基本原理
个人理解，有错欢迎评论留言！毕竟也不想误人子弟！哈哈哈！
基本原理
概要：
模拟固体加热时的粒子动能大的特定使得粒子的随机性变大，然后慢慢趋于静止的过程。
通过赋予搜索过程一种时变且最终趋于零的概率突跳性，从而可有效避免陷入局部极小并最终趋于全局最优的串行结构的优化算法。

...]]></description><category></category></item><item><title><![CDATA[蚁群算法（AI导论）]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/124259226</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/124259226</guid><author>qq_52134394</author><pubDate>Mon, 09 May 2022 15:21:32 +0800</pubDate><description><![CDATA[蚁群算法基本原理代码实践
个人理解，有错欢迎评论留言！毕竟也不想误人子弟！哈哈哈！
基本原理
概要：
仿照蚂蚁觅食过程中信息素的累计与挥发效应的启发式搜索算法。
详细介绍：
蚂蚁在运动过程中，根据各个路径上的信息素和启发信息按概率决定转移方向。
在 t 时刻蚂蚁 k 选择从元素（城市）x 转移到元素（城市）y 的概率：
Pxyk(t)={[τxy]α[ηxy]β∑yϵallowedk(x)[τxy]α[ηxy]β,ifyϵallowedk(x)0,其他 P_{xy}^k(t)= \begin{cases}
]]></description><category></category></item><item><title><![CDATA[粒子群算法（AI导论）]]></title><link>https://blog.youkuaiyun.com/qq_52134394/article/details/124257886</link><guid>https://blog.youkuaiyun.com/qq_52134394/article/details/124257886</guid><author>qq_52134394</author><pubDate>Mon, 18 Apr 2022 20:31:35 +0800</pubDate><description><![CDATA[粒子群算法基本原理代码实践
基本原理
概要：
借助个体和群体走过的当前最优值进行迭代更新从而得到全局最优解的一种全局优化算法。
必须理解的公式：
vji(k+1)=w(k)vji(k)+φ1rand(0,a1)(pji−xji(k))+φ2rand(0,a2)(pjg−xji(k))v_j^{i}(k+1)=w(k)v_j^{i}(k)+\varphi_1rand(0,a_1)(p_j^{i}-x_j^{i}(k))+\varphi_2rand(0,a_2)(p_j^{g}-x_j^{i}(k))vji​(]]></description><category></category></item></channel></rss>