<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fighting_xr1的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fighting_xr1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fighting_xr1]]></copyright><item><title><![CDATA[python中制表位‘\t‘的使用]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142591619</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142591619</guid><author>fighting_xr1</author><pubDate>Fri, 27 Sep 2024 13:50:10 +0800</pubDate><description><![CDATA[通过验证发现，当’\t'前的位数小于4n时，会从'\t‘开始以空格形式留出4n的位置。]]></description><category></category></item><item><title><![CDATA[扩展欧几里得算法求多项式的乘法逆元]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142521926</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142521926</guid><author>fighting_xr1</author><pubDate>Wed, 25 Sep 2024 14:20:52 +0800</pubDate><description><![CDATA[因此我们只需要输入多项式a,b，然后利用循环求得q,r,v,w就可以，可以看到计算过程需要用到模运算的多项式加减、乘、除、取余运算，实现步骤如下。另外补充一下，多项式求最大公因数可能有点难度，也是利用了辗转相除法实现。当r=0时，w即为多项式的乘法逆元。]]></description><category></category></item><item><title><![CDATA[python字符串实现GF(2^8)中的多项式乘法]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142453671</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142453671</guid><author>fighting_xr1</author><pubDate>Mon, 23 Sep 2024 11:16:30 +0800</pubDate><description><![CDATA[密码学，数论知识]]></description><category></category></item><item><title><![CDATA[高效服务于工作的编程工具——VS Code]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142438807</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142438807</guid><author>fighting_xr1</author><pubDate>Sun, 22 Sep 2024 16:19:59 +0800</pubDate><description><![CDATA[Visual Studio Code 是我目前最常用的编程工具之一，它极大地提升了我的工作效率。VS Code 作为一款轻量级但功能强大的代码编辑器，支持几乎所有主流编程语言的语法高亮、智能代码补全、代码片段、代码重构等功能。其独特的插件市场（Extensions Marketplace）更是提供了数以万计的扩展，涵盖从代码格式化、调试、版本控制到特定框架和语言的支持，几乎可以满足所有开发需求。功能特点智能代码补全。]]></description><category></category></item><item><title><![CDATA[实现Playfair密码，C语言]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142413870</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142413870</guid><author>fighting_xr1</author><pubDate>Sat, 21 Sep 2024 11:33:05 +0800</pubDate><description><![CDATA[【代码】实现Playfair密码，C语言。]]></description><category></category></item><item><title><![CDATA[简单神将网络的搭建-实现简单对分类]]></title><link>https://blog.youkuaiyun.com/fighting_xr1/article/details/142259488</link><guid>https://blog.youkuaiyun.com/fighting_xr1/article/details/142259488</guid><author>fighting_xr1</author><pubDate>Sat, 14 Sep 2024 15:37:58 +0800</pubDate><description><![CDATA[self.fc1=nn.Linear(3,4)#全连接full connection。self.fc2=nn.Linear(4,2)#输入三个神经元，输出四个神经元。loss_fn=torch.nn.CrossEntropyLoss()#交叉熵损失。def forward(self,x):        #前向传播函数。x=torch.tanh(x)#对x进行激活函数对处理。y=torch.tensor(y)#变量变成了torch的tensor。loss.backward()#损失的反向传播。]]></description><category></category></item></channel></rss>