<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[三叶的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Clarehehe</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Clarehehe]]></copyright><item><title><![CDATA[【论文笔记】Skip Connections Matter: On the Transferability of Adversarial Examples Generated with ResNet]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/108209706</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/108209706</guid><author>Clarehehe</author><pubDate>Tue, 25 Aug 2020 01:43:52 +0800</pubDate><description><![CDATA[0.摘要

  这篇论文提出了一种利用最先进的 ResNet 和 DenseNet 中 Skip connection 结构的对抗样本生成方法，称为 ‘SGM’，这种生成方法能与之前的对抗样本生成技术结合，提高生成的对抗样本的黑盒攻击转移率。





1.背景

1.1 关于Skip connection结构





   ResNet即残差网络，与普通神经网络模型的最大区别是引入了skip connection结构。最基本的公式如上所示，表示将某一层的输入数据跳跃若干层作用到更深...]]></description><category></category></item><item><title><![CDATA[【线性代数】简要证明矩阵的秩等于行秩（列秩同理）]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/107993695</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/107993695</guid><author>Clarehehe</author><pubDate>Thu, 13 Aug 2020 23:10:43 +0800</pubDate><description><![CDATA[首先，此证明等价于证明：’存在行列式不为0的k阶子式‘ 与 ‘存在k个不相关的列向量’ 等价

从左到右：考虑对应的列向量建立的方程组Ax = 0，化阶梯形解得x1,x2......xk 必为0，所以此k个列向量线性无关

从右到左：若k个列向量不相关，将此k个向量拼成矩阵 [a1,a2......ak] ，此矩阵的秩必为k，化阶梯后留下的前k行对应的原行即为我们选择的行，选择的k行k列行列式不为0


...]]></description><category></category></item><item><title><![CDATA[【线性代数】A为方阵,当存在B使得 AB=E ，证明BA=E]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/107993548</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/107993548</guid><author>Clarehehe</author><pubDate>Thu, 13 Aug 2020 22:51:38 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[【论文阅读笔记】Deep neural networks are easily fooled- High confidence predictions for unrecognizable image]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/107901048</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/107901048</guid><author>Clarehehe</author><pubDate>Sun, 09 Aug 2020 22:47:26 +0800</pubDate><description><![CDATA[与之前提出的添加微小扰动来造成DNN的误判不同，本文提出的是生成一系列人类无法识别，但是却可以被DNN以99.99%的置信度分类的图片。具体而言提出了两种基于进化算法的以及一种利用梯度上升的生成算法。

  基于进化算法的主要参考以下流程：























  其中第一种EA：保留每个（或单个，如果是针对一个类别来生成）类别的最优生成样本，每次随机选择样本来变异。采用直接...]]></description><category></category></item><item><title><![CDATA[【论文阅读笔记】Explaining And Harnessing Adversarial Examples]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/107801194</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/107801194</guid><author>Clarehehe</author><pubDate>Wed, 05 Aug 2020 01:30:56 +0800</pubDate><description><![CDATA[0.论文摘要

  本文提出了对于对抗样本存在原因的新解释——于神经网络的线性特性，并提出了快速有效生成对抗样本的方法以及

基于对抗的模型训练方式。





1.对抗样本的线性解释

 



  考虑如上公式，其中代表一个生成的对抗样本，代表权重参数，代表在正常样本基础上添加的扰动，

其中扰动向量中每一元素的数值绝对值大小都不超过。

 当我们取，对计算结果造成的最大影响大小为，其中表示向量的维数...]]></description><category></category></item><item><title><![CDATA[hdu 2544 最短路裸题 SPFA]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/53208561</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/53208561</guid><author>Clarehehe</author><pubDate>Thu, 17 Nov 2016 23:49:41 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100010
#define INF 0x3f3f3f3f

int n,m,q;
struct Edge{
    int next,to,value;
}edge[N];
int head[N]]></description><category></category></item><item><title><![CDATA[Vijos 1034 家族      ( 并查集 )]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/53193689</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/53193689</guid><author>Clarehehe</author><pubDate>Thu, 17 Nov 2016 00:46:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100010

int n,m,Q;
int fa[N];

inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch]]></description><category></category></item><item><title><![CDATA[hdu 1512 Monkey King]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50651204</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50651204</guid><author>Clarehehe</author><pubDate>Thu, 11 Feb 2016 13:07:32 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100010

int n,m;
int fa[N];
struct Node{
    int l,r,dist,value;
}t[N];

inline int read()
{
    i]]></description><category></category></item><item><title><![CDATA[bzoj 2324 营救皮卡丘]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50646689</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50646689</guid><author>Clarehehe</author><pubDate>Tue, 09 Feb 2016 13:39:19 +0800</pubDate><description><![CDATA[floyd预处理 ＋ 费用流
/**************************************************************
    Problem: 2324
    User: Clare
    Language: C++
    Result: Accepted
    Time:300 ms
    Memory:5408 kb
************]]></description><category></category></item><item><title><![CDATA[bzoj 2055 80人环游地球(上下界费用流)]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50644806</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50644806</guid><author>Clarehehe</author><pubDate>Mon, 08 Feb 2016 17:35:10 +0800</pubDate><description><![CDATA[/**************************************************************
    Problem: 2055
    User: Clare
    Language: C++
    Result: Accepted
    Time:560 ms
    Memory:2140 kb
****************************]]></description><category></category></item><item><title><![CDATA[bzoj 1857 传送带]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50630636</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50630636</guid><author>Clarehehe</author><pubDate>Wed, 03 Feb 2016 17:51:08 +0800</pubDate><description><![CDATA[三分一个AB离开位置，三分一个CD进入位置
精度问题要开fabs
/**************************************************************
    Problem: 1857
    User: Clare
    Language: C++
    Result: Accepted
    Time:20 ms
    Memory:12]]></description><category></category></item><item><title><![CDATA[HDU 2438 Turn the corner]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50628845</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50628845</guid><author>Clarehehe</author><pubDate>Wed, 03 Feb 2016 12:10:33 +0800</pubDate><description><![CDATA[题解在此：点击打开链接
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define eps 1e-5
const double pi=acos(-1.0);

double x,y,l,w;

double Cal(double k)
{
    retur]]></description><category></category></item><item><title><![CDATA[HDU 4355 Party All the Time]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50628624</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50628624</guid><author>Clarehehe</author><pubDate>Wed, 03 Feb 2016 11:27:53 +0800</pubDate><description><![CDATA[又是快读写错了。。。。。
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 50010
#define INF 0x3f3f3f3f
#define eps 1e-4

int T,n,m,tot;
double Min,Max,Ans;
do]]></description><category></category></item><item><title><![CDATA[bzoj 3160万径人踪灭]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50625822</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50625822</guid><author>Clarehehe</author><pubDate>Tue, 02 Feb 2016 21:46:22 +0800</pubDate><description><![CDATA[我真是哭晕在厕所。。。。Manacher i打成1看了1个多小时，交了无数遍才找到
/**************************************************************
    Problem: 3160
    User: Clare
    Language: C++
    Result: Accepted
    Time:2092 ms]]></description><category></category></item><item><title><![CDATA[bzoj 2194快速傅立叶之二]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50624113</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50624113</guid><author>Clarehehe</author><pubDate>Tue, 02 Feb 2016 15:32:46 +0800</pubDate><description><![CDATA[/**************************************************************
    Problem: 2194
    User: Edward2173
    Language: C++
    Result: Accepted
    Time:1564 ms
    Memory:11820 kb
*********************]]></description><category></category></item><item><title><![CDATA[2016 NOI冬令营]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50582081</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50582081</guid><author>Clarehehe</author><pubDate>Tue, 26 Jan 2016 23:00:34 +0800</pubDate><description><![CDATA[Day 0         2016.1.25
早上没吃早餐就5点多钟去了机场，吃了碗方便面然后匆忙的上机了。。。。。
经过一系列转车中午1点多钟到了南山中学了，我们学校4个人一个寝室还是比较好的，不爽的是不能出去，而且没网（最要命的一点！）
吓得我下午打了下单机csgo，看了看水番。]]></description><category></category></item><item><title><![CDATA[poj 2187 Beauty Contest]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50573466</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50573466</guid><author>Clarehehe</author><pubDate>Sun, 24 Jan 2016 13:14:10 +0800</pubDate><description><![CDATA[凸包旋转卡壳
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 50010
#define epx 1e-8

inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(c]]></description><category></category></item><item><title><![CDATA[bzoj 1670 Building the Moat]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50572970</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50572970</guid><author>Clarehehe</author><pubDate>Sun, 24 Jan 2016 10:48:15 +0800</pubDate><description><![CDATA[凸包裸题。。。之前我从来没涉及过计算几何，现在觉得还是要学一学，至少可以写个暴力23333
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 5010
#define epx 1e-8
const double pi=atan(1.0)*4;]]></description><category></category></item><item><title><![CDATA[数论学习]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50539642</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50539642</guid><author>Clarehehe</author><pubDate>Sat, 23 Jan 2016 21:33:53 +0800</pubDate><description><![CDATA[1⃣️扩展欧几里得算法

sgu 141 扩展欧几里德＋枚举大法，不过sgu好像崩了。。。。


poj 2891
合并模方程式
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100010
typedef long long l]]></description><category></category></item><item><title><![CDATA[ZOJ 2314 Reactor Cooling]]></title><link>https://blog.youkuaiyun.com/Clarehehe/article/details/50532988</link><guid>https://blog.youkuaiyun.com/Clarehehe/article/details/50532988</guid><author>Clarehehe</author><pubDate>Sun, 17 Jan 2016 18:33:40 +0800</pubDate><description><![CDATA[无源无汇上下界网络流裸题
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 210
#define INF 1000000000

int n,m,S,T,Ans;
struct Edge{
    int to,next;
    int v]]></description><category></category></item></channel></rss>