<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[每天进步一点点]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/weixin_44022810</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; weixin_44022810]]></copyright><item><title><![CDATA[知识蒸馏（Knowledge Distillation）]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/127533192</link><guid>https://blog.csdn.net/weixin_44022810/article/details/127533192</guid><author>weixin_44022810</author><pubDate>Wed, 26 Oct 2022 22:31:40 +0800</pubDate><description><![CDATA[快乐学习]]></description><category></category></item><item><title><![CDATA[深入理解注意力机制]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/127477454</link><guid>https://blog.csdn.net/weixin_44022810/article/details/127477454</guid><author>weixin_44022810</author><pubDate>Tue, 25 Oct 2022 15:18:12 +0800</pubDate><description><![CDATA[理解注意力机制]]></description><category></category></item><item><title><![CDATA[AI插画师：生成对抗网络]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/114440304</link><guid>https://blog.csdn.net/weixin_44022810/article/details/114440304</guid><author>weixin_44022810</author><pubDate>Sat, 06 Mar 2021 15:12:44 +0800</pubDate><description><![CDATA[AI插画师：生成对抗网络
本文基于《深度学习框架PyTorch入门与实践》，将书中的代码进行了修改并补充了大量的注释。
本文用GAN实现一个生成动漫人物头像的例子

首先看本实验的代码结构：

model.py文件实现模型定义，config.py文件对模型的参数进行配置，main.py文件实现训练和生成
接着看model.py中定义的生成器及判别器
(这里对生成器的数据进行归一化处理时采用的是LayerNorm()，书中采用的的是BatchNorm()，二者的具体区别可参考官方文档）

import tor]]></description><category></category></item><item><title><![CDATA[Hash的应用]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106826593</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106826593</guid><author>weixin_44022810</author><pubDate>Thu, 18 Jun 2020 11:28:48 +0800</pubDate><description><![CDATA[这类问题有一个共同点：输入的分数种类是有限的。此例中输入的数据只有101种可能，只要为这101中可能分别计数，就可以在输入结束的时候知道每一种分数的重复情况。
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;string&gt;
#include &lt;string.h&gt;
#include &lt;stdio.h&gt;
#include &lt;math.h&gt;
#include &lt;cmath&gt;..]]></description><category></category></item><item><title><![CDATA[日期类问题]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106823428</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106823428</guid><author>weixin_44022810</author><pubDate>Thu, 18 Jun 2020 10:57:24 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;string&gt;
#include &lt;string.h&gt;
#include &lt;stdio.h&gt;
#include &lt;math.h&gt;
using namespace std;
//判断是否为闰年
int isLeapYear(int year)
{
    if((year%4==0&amp;&amp;year%100!=0||year..]]></description><category></category></item><item><title><![CDATA[字符串内排序（九度教程第5题）]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106822680</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106822680</guid><author>weixin_44022810</author><pubDate>Thu, 18 Jun 2020 08:28:35 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;string&gt;
#include &lt;string.h&gt;
#include &lt;stdio.h&gt;
using namespace std;
int main()
{
    char a[101];
    while(gets(a))
    {
        int len=strlen(a);
        if(len==0)
     .]]></description><category></category></item><item><title><![CDATA[EXCEL排序（九度教程第4题）]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106822601</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106822601</guid><author>weixin_44022810</author><pubDate>Thu, 18 Jun 2020 08:18:56 +0800</pubDate><description><![CDATA[样例输入：
3 1
000007 James 85
000010 Amy 90
000001 Zoe 60
4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98
4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90
0 0
样例输出：
Case 1:
000001 Zoe 60
000007 James 85
000010 Amy 90
Case 2:
000.]]></description><category></category></item><item><title><![CDATA[成绩排序]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106812928</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106812928</guid><author>weixin_44022810</author><pubDate>Wed, 17 Jun 2020 16:55:45 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;string.h&gt;
using namespace std;
struct E
{
    char name[101];
    int age;
    int score;
}a[1000];
bool cmp(E a,E b)
{
    if(a.score!=b.score)
        return a.score&lt;b.score;//分数不同分.]]></description><category></category></item><item><title><![CDATA[排序]]></title><link>https://blog.csdn.net/weixin_44022810/article/details/106803802</link><guid>https://blog.csdn.net/weixin_44022810/article/details/106803802</guid><author>weixin_44022810</author><pubDate>Wed, 17 Jun 2020 11:45:39 +0800</pubDate><description><![CDATA[冒泡排序做法：
#include &lt;iostream&gt;
using namespace std;
int main()
{
    int n;
    cin&gt;&gt;n;
    int a[100];
    for(int i=0;i&lt;n;i++)
    {
        cin&gt;&gt;a[i];
    }
    for(int i=0;i&lt;n;i++)
    {
        for(int j=0;j&lt;n-i-1;j++)
       .]]></description><category></category></item></channel></rss>