<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[uuuranuu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/uuuranuu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; uuuranuu]]></copyright><item><title><![CDATA[复现CLIP(对比语言图像预训练)]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/149783128</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/149783128</guid><author>uuuranuu</author><pubDate>Wed, 30 Jul 2025 18:58:28 +0800</pubDate><description><![CDATA[CLIP（对比语言-图像预训练）是一个基于多种（图像，文本）对进行训练的神经网络。它可以通过自然语言指令，根据给定图像预测最相关的文本片段，而无需直接针对任务进行优化，类似于 GPT-2 和 GPT-3 的零样本能力。我们发现，CLIP 在 ImageNet 数据集上的表现与原始 ResNet50 的“零样本”结果相当，且无需使用任何原始的 128 万个带标签样本，从而克服了计算机视觉领域的几大挑战。这张图展示了基于对比预训练的零样本图像分类流程。]]></description><category></category></item><item><title><![CDATA[Hugging Face-环境配置]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/149713691</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/149713691</guid><author>uuuranuu</author><pubDate>Mon, 28 Jul 2025 18:43:06 +0800</pubDate><description><![CDATA[找到pytorch下的python.exe。打开anaconda prompt。]]></description><category></category></item><item><title><![CDATA[机试题汇总]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146483013</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146483013</guid><author>uuuranuu</author><pubDate>Mon, 24 Mar 2025 20:37:06 +0800</pubDate><description><![CDATA[1.3.5.7.8.10.12  -- 31天闰年判断：= 0）]]></description><category></category></item><item><title><![CDATA[平方因子（k）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146447005</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146447005</guid><author>uuuranuu</author><pubDate>Sat, 22 Mar 2025 21:40:00 +0800</pubDate><description><![CDATA[【代码】平方因子（k）]]></description><category></category></item><item><title><![CDATA[排列与二进制]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146446511</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146446511</guid><author>uuuranuu</author><pubDate>Sat, 22 Mar 2025 21:10:42 +0800</pubDate><description><![CDATA[【代码】排列与二进制。]]></description><category></category></item><item><title><![CDATA[连通图（并查集）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146446028</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146446028</guid><author>uuuranuu</author><pubDate>Sat, 22 Mar 2025 20:43:17 +0800</pubDate><description><![CDATA[【代码】连通图（并查集）]]></description><category></category></item><item><title><![CDATA[怪异的洗牌（数组逆置加左移）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146445698</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146445698</guid><author>uuuranuu</author><pubDate>Sat, 22 Mar 2025 20:19:47 +0800</pubDate><description><![CDATA[【代码】怪异的洗牌（数组逆置加左移）]]></description><category></category></item><item><title><![CDATA[矩阵幂（矩阵k次幂）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146303096</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146303096</guid><author>uuuranuu</author><pubDate>Sun, 16 Mar 2025 22:37:35 +0800</pubDate><description><![CDATA[【代码】矩阵幂（矩阵k次幂）]]></description><category></category></item><item><title><![CDATA[计算两个矩阵的乘积]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146302582</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146302582</guid><author>uuuranuu</author><pubDate>Sun, 16 Mar 2025 22:07:13 +0800</pubDate><description><![CDATA[【代码】计算两个矩阵的乘积。]]></description><category></category></item><item><title><![CDATA[质因数的个数]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146302397</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146302397</guid><author>uuuranuu</author><pubDate>Sun, 16 Mar 2025 21:55:41 +0800</pubDate><description><![CDATA[【代码】质因数的个数。]]></description><category></category></item><item><title><![CDATA[最大公约数+最小公倍数]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146300855</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146300855</guid><author>uuuranuu</author><pubDate>Sun, 16 Mar 2025 20:34:13 +0800</pubDate><description><![CDATA[【代码】最大公约数+最小公倍数。]]></description><category></category></item><item><title><![CDATA[各进制转换]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146286746</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146286746</guid><author>uuuranuu</author><pubDate>Sat, 15 Mar 2025 22:26:20 +0800</pubDate><description><![CDATA[【代码】二进制数（十进制转二进制）]]></description><category></category></item><item><title><![CDATA[约瑟夫环（1+2）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146285366</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146285366</guid><author>uuuranuu</author><pubDate>Sat, 15 Mar 2025 21:29:51 +0800</pubDate><description><![CDATA[n 个小孩围坐成一圈，并按顺时针编号为1,2,…,n，从编号为 p 的小孩顺时针依次报数，由1报到m ，当报到 m 时，该小孩从圈中出去，然后下一个再从1报数，当报到 m 时再出去。如此反复，直至所有的小孩都从圈中出去。请按出去的先后顺序输出小孩的编号。每行是用空格分开的三个整数，第一个是n,第二个是p,第三个是m (0 < m,n < 300)。编号为 1 到 n 的 n 个人围成一圈。从编号为 1 的人开始报数，报到 m 的人离开。n-1 轮结束以后，只剩下一个人，问最后留下的这个人编号是多少？]]></description><category></category></item><item><title><![CDATA[统计字符（字符串）（gets与fgets的区别）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146268616</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146268616</guid><author>uuuranuu</author><pubDate>Fri, 14 Mar 2025 22:31:30 +0800</pubDate><description><![CDATA[函数从标准输入（stdin）读取一行字符，直到遇到换行符或EOF（文件结束符）。它会丢弃换行符，并在字符串末尾添加一个空字符（'\0'）函数从指定的文件流中读取最多n-1个字符，或者直到遇到换行符或EOF。会保留换行符，并在字符串末尾添加一个空字符（'\0'）]]></description><category></category></item><item><title><![CDATA[ 成绩排序（结构体排序）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146266593</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146266593</guid><author>uuuranuu</author><pubDate>Fri, 14 Mar 2025 20:23:00 +0800</pubDate><description><![CDATA[【代码】 成绩排序（结构体排序）]]></description><category></category></item><item><title><![CDATA[操作系统知识点整理]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146256473</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146256473</guid><author>uuuranuu</author><pubDate>Fri, 14 Mar 2025 17:30:22 +0800</pubDate><description><![CDATA[进程：是具有一定的程序关于一个的一次，是。线程：又叫轻进程，是进程内的一个相对独立的，是cpu的单位。]]></description><category></category></item><item><title><![CDATA[计算机网络知识点整理]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146248008</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146248008</guid><author>uuuranuu</author><pubDate>Fri, 14 Mar 2025 12:04:48 +0800</pubDate><description><![CDATA[又称报文摘要。是通过单向散列函数对报文进行运算，得到一个固定长度的字符串。可以用来验证报文的完整性，不同的报文经过哈希运算得到的摘要几乎不同，且无法通过摘要还原出原始报文。计算机网络是由多台计算机通过通信线路和通信设备互联起来的系统，实现交换信息和共享资源的目的。]]></description><category></category></item><item><title><![CDATA[手机键盘（提前）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146243145</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146243145</guid><author>uuuranuu</author><pubDate>Thu, 13 Mar 2025 21:45:43 +0800</pubDate><description><![CDATA[【代码】手机键盘（提前）]]></description><category></category></item><item><title><![CDATA[日期累加（注意点）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146241011</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146241011</guid><author>uuuranuu</author><pubDate>Thu, 13 Mar 2025 20:08:35 +0800</pubDate><description><![CDATA[注意点：①月可能超过12月  ②新年需要重新判断闰年。]]></description><category></category></item><item><title><![CDATA[打印日期（%02d）]]></title><link>https://blog.youkuaiyun.com/uuuranuu/article/details/146240401</link><guid>https://blog.youkuaiyun.com/uuuranuu/article/details/146240401</guid><author>uuuranuu</author><pubDate>Thu, 13 Mar 2025 19:37:10 +0800</pubDate><description><![CDATA[【代码】打印日期（%02d）]]></description><category></category></item></channel></rss>