<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[_zidaoziyan的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/acm_fighting</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; acm_fighting]]></copyright><item><title><![CDATA[概率论]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/80968887</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/80968887</guid><author>acm_fighting</author><pubDate>Mon, 09 Jul 2018 20:47:27 +0800</pubDate><description><![CDATA[随机试验 
在相同的条件下重复进行。

试验的全部结果提前知道

不能预言出现的结果

事件 
随机试验的可能结果。

必然事件

不可能事件

基本事件：最小的单位事件。(抛硬币，正反)

复合事件：若干个基本事件的组合。

样本空间：{样本点}，每个样本点对应基本事件。

样本点：无限多或有限多-&amp;amp;amp;gt;样本空间：有限或者无限。

Venn图(文氏图)

A∩B=ABA∩B=AB	A\cap ...]]></description><category></category></item><item><title><![CDATA[LeNet-5网络结构解析]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/62044082</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/62044082</guid><author>acm_fighting</author><pubDate>Tue, 14 Mar 2017 15:38:31 +0800</pubDate><description><![CDATA[参考文章: 
文章1 
文章2 
文章3特殊性
神经元间的连接是非全连接的
同一层中某些神经元之间的连接的权重是共享的（即相同的）
权值共享 
使用同一个Kernel池化 
转:http://blog.youkuaiyun.com/geekmanong/article/details/50605340CNN的池化(图像下采样)方法很多：Mean pooling(均值采样)、Max pooling(最大值采样)、]]></description><category></category></item><item><title><![CDATA[svm]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/61429047</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/61429047</guid><author>acm_fighting</author><pubDate>Sun, 12 Mar 2017 21:29:22 +0800</pubDate><description><![CDATA[优点:泛化错误率低，计算开销不大，结果易解释
缺点:对参数调节和核函数的选择敏感，原始分类器不加修改仅适用于处理二类问题。
适用数据类型：数值型和标称型数据。
拉格朗日乘子法求在约束条件gj(x1,x2,...,xn)=0g_{j}(x1,x2,...,xn)=0的条件下,求f(x1,x2,...,xn)的极值f(x1,x2,...,xn)的极值引进拉格朗日乘子aa;建立方程 
L(x1,x2,..]]></description><category></category></item><item><title><![CDATA[caffe mnist训练]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/60965746</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/60965746</guid><author>acm_fighting</author><pubDate>Thu, 09 Mar 2017 19:22:42 +0800</pubDate><description><![CDATA[1.数据集的准备在caffe根目录下运行./data/mnist/get_mnist.sh   #获得mnist数据训练的四个数据包
./examples/siamese/create_mnist_siamese.sh  #将mnist date转化为可用的lmdb格式的文件,并将新生成的2个文件mnist-train-lmdb 和 mnist-test-lmdb放于create_mnist.sh同]]></description><category></category></item><item><title><![CDATA[svm]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/55002371</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/55002371</guid><author>acm_fighting</author><pubDate>Sun, 12 Feb 2017 16:59:23 +0800</pubDate><description><![CDATA[train_test_split功能是从样本中随机的按比例选取train data和test data。
  **X_train, X_test, y_train, y_test = 
  cross_validation.train_test_split(train_data,train_target, test_size=0.4, random_state=0)**
test_size是样本占比]]></description><category></category></item><item><title><![CDATA[python PIL使用]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/54773163</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/54773163</guid><author>acm_fighting</author><pubDate>Sun, 29 Jan 2017 13:59:38 +0800</pubDate><description><![CDATA[问题000: 
将你的 QQ 头像（或者微博头像）右上角加上红色的数字，类似于微信未读信息数量那种提示效果。]]></description><category></category></item><item><title><![CDATA[python训练]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/54772825</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/54772825</guid><author>acm_fighting</author><pubDate>Sun, 29 Jan 2017 13:09:28 +0800</pubDate><description><![CDATA[1001. A+B Formatformat的巧妙运用a,b = input().split()
print('{:,}'.format(int(a)+int(b)))1002. A+B for Polynomials总结:字典的排序 
sorted(iterable,key=None,reverse=False)sorted(iterable, key=None, reverse=False)]]></description><category></category></item><item><title><![CDATA[python学习笔记]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/54601447</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/54601447</guid><author>acm_fighting</author><pubDate>Wed, 18 Jan 2017 16:14:24 +0800</pubDate><description><![CDATA[if name == ‘main‘: 
name 是当前模块名，当模块被直接运行时模块名为 main 。这句话的意思就是，当模块被直接运行时，以下代码块将被运行，当模块是被导入时，代码块不被运行。
  字典
类似map,形成key-value(key可以是字符串，元组等，不能为可变的)创建方式:
{key1:value1,…,keyn:valuen}
利用dict函数
字典无序存储两个列表组成字典:]]></description><category></category></item><item><title><![CDATA[python错误记录]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/54586577</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/54586577</guid><author>acm_fighting</author><pubDate>Tue, 17 Jan 2017 20:32:18 +0800</pubDate><description><![CDATA[错误:import urllib 
  r = urllib.urlopen(‘http://z.cn/‘) 
  html = r.read() 
  print(html) 
  提示信息:AttributeError: module ‘urllib’ has no attribute ‘urlopen’  解决方法: 
  用具体的urllib.request模块来调用它 
  import]]></description><category></category></item><item><title><![CDATA[编译原理总结]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53693697</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53693697</guid><author>acm_fighting</author><pubDate>Fri, 16 Dec 2016 15:28:38 +0800</pubDate><description><![CDATA[程序语言的基本知识符号串集合的运算A+B(A∪B)={w|w∈A,or w∈B} A+B(A  \cup B)  = \{w | w ∈ A , or  \      w ∈ B  \} A∗B(AB)={xy|x∈A and y∈B} A*B(AB)  = \{xy | x ∈ A  \ and  \  y∈ B  \}A0={ε},An=An−1A A^{0}=\{ \varepsilon \}]]></description><category></category></item><item><title><![CDATA[BestCoder Round #82 (div.2)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53509608</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53509608</guid><author>acm_fighting</author><pubDate>Wed, 07 Dec 2016 19:05:25 +0800</pubDate><description><![CDATA[A. 
ztr喜欢研究数学，一天，他在思考直角三角形方程组的Lower版，即n=x^2-y^2,，他想知道，对于给出的n，是否会有正整数解。 
有T组数据,(T<=10^6),n<=10^18
  思路: 
  n=x^2-y^2=(x+y)(x-y),假设x+y=a,x-y=b,如果a+b的和可以凑成偶数而且a < b,那么一定能因式分解, 
  所以如果当n为奇数时,除了1之外,一定能凑成a=n]]></description><category></category></item><item><title><![CDATA[python词频统计]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53354619</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53354619</guid><author>acm_fighting</author><pubDate>Sat, 26 Nov 2016 20:23:15 +0800</pubDate><description><![CDATA[参考:http://my.youkuaiyun.com/spynao]]></description><category></category></item><item><title><![CDATA[Codeforces Round #362 (Div. 2)  F. Legen...(AC自动机+矩阵快速幂)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53101906</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53101906</guid><author>acm_fighting</author><pubDate>Wed, 09 Nov 2016 16:57:08 +0800</pubDate><description><![CDATA[题意: 
  我们有n（200）个特殊单词，总长度不超过200。 
  我们要构造一个长度为l（1e14）的字符串。 
  如果字符串每包含一个给定单词i（可重叠匹配），则我们的权值计数+a[i] 
  问你最大可以得到的权值  思路: 
  对自动机上的状态,我们可以建立状态之间的转移可以获得的权值 
  ->对建立好之后的矩阵跑快速幂
#include<cstdio>
#include<algo]]></description><category></category></item><item><title><![CDATA[sgu 390 购票(上下界数位dp)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53084345</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53084345</guid><author>acm_fighting</author><pubDate>Tue, 08 Nov 2016 17:05:08 +0800</pubDate><description><![CDATA[有一位售票员给乘客售票。对于每位乘客，他会卖出多张连续的票，直到已卖出的票的编号的数位之和不小于给定的正数K。然后他会按照相同的规则给下一位乘客售票。 
  初始时，售票员持有的票的编号是从L到R的连续整数。请你求出，售票员可以售票给多少位乘客。 
  数据规模：1 ≤ L ≤ R ≤ 10^18，1 ≤ K ≤ 1000。  思路: 
  此题需要上下界进行数位dp,且需要从小的开始放 
  dp]]></description><category></category></item><item><title><![CDATA[Hdu 5803 Zhu’s Math Problem(非记忆化数位dp)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53072172</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53072172</guid><author>acm_fighting</author><pubDate>Mon, 07 Nov 2016 21:40:31 +0800</pubDate><description><![CDATA[思路: 
  数位dp,我们对每个数都拆分为二进制,对于数的每一位都进行考虑,可以发现 
  如果a+c-b-d<=-2则一定不满足,a+c-b-d有用的值肯定小于等于2,对另外一个不等式也是如此考虑
  
  需要注意的一点的本题采用非记忆化搜索,因为有四个上界,四个都不为上界的情况会比较少
#include<bits/stdc++.h>
using namespace std;
const in]]></description><category></category></item><item><title><![CDATA[Hdu 5921 Binary Indexed Tree(长春数位dp)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53070438</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53070438</guid><author>acm_fighting</author><pubDate>Mon, 07 Nov 2016 20:30:19 +0800</pubDate><description><![CDATA[题意：用树状数组维护一个序列,在给区间[l,r]加上一个t的时候,要给[1,r]加上t,给[1,l−1]减去t,两次操作后值真正发生变化的节点个数就是这一次区间修改的代价，现在要修改每一个[1,n]的子区间,求总代价 
  对10^​9+7取模后的结果。
#include<bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int dig]]></description><category></category></item><item><title><![CDATA[ural 1057 Amount of Degrees(数位统计)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53065778</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53065778</guid><author>acm_fighting</author><pubDate>Mon, 07 Nov 2016 14:03:29 +0800</pubDate><description><![CDATA[求给定区间[X,Y]中满足下列条件的整数个数:这个数恰好等于 K 个互不相等的 B 的整数次幂之和。(1<=X<=Y<=2^31-1,1<=K<=20,1<=B<=10)  思路: 
  ans=Count(Y)-Count(X-1) 
  若一个数中有一个B进制的系数大于1->将这之后的系数均置为1
#include<cstdio>
#include<cstring>
#include<iostr]]></description><category></category></item><item><title><![CDATA[BZOJ 1833: [ZJOI2010]count 数字计数(在[a,b]中的所有整数中，每个数码(digit)各出现了多少次)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53048139</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53048139</guid><author>acm_fighting</author><pubDate>Sat, 05 Nov 2016 21:47:41 +0800</pubDate><description><![CDATA[题意: 
  给定两个正整数a和b，求在[a,b]中的所有整数中，每个数码(digit)各出现了多少次。  思路: 
  一维数位dp,需保留之后的数的总方案数,以及每个digit的,注意前导0的特判
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int dig[]]></description><category></category></item><item><title><![CDATA[HDU 5069 Harry And Biological Teacher(fail树+线段树优化)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53038817</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53038817</guid><author>acm_fighting</author><pubDate>Fri, 04 Nov 2016 20:27:47 +0800</pubDate><description><![CDATA[题意: 
  有n个字符串(n<=100000),总长度小于等于1e5,有m次查询,X,Y,问第X个的后缀和第Y个的前缀的最长公共子串  思路一: 
  总体思路 
  构造fail树,dfs序 
  按Y排序 
  X最后一个对应在字典树中的位置
  
  首先，我们可以找到a在自动机上所对应的节点，考虑ac自动机的fail指针，那么从这个节点，往上一直到根的链上， 
  所有的节点所包含的子串，]]></description><category></category></item><item><title><![CDATA[BZOJ 2434: [Noi2011]阿狸的打字机(fail树+树状数组)]]></title><link>https://blog.youkuaiyun.com/acm_fighting/article/details/53038771</link><guid>https://blog.youkuaiyun.com/acm_fighting/article/details/53038771</guid><author>acm_fighting</author><pubDate>Fri, 04 Nov 2016 20:22:03 +0800</pubDate><description><![CDATA[题目大意：初始字串为空，首先给定一系列操作序列，有三种操作： 
  1.在结尾加一个字符 
  2.在结尾删除一个字符 
  3.打印当前字串 
  然后多次询问第x个打印的字串在第y个打印的字串中出现了几次  思路: 
  构造出fail树,dfs序标号,查询按y排序,树状数组单点修改区间查询
#include<cstring>
#include<algorithm>
#include<cstri]]></description><category></category></item></channel></rss>