<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[When you go away]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bit_Line</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bit_Line]]></copyright><item><title><![CDATA[2016计算机网络期末复习]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/51760601</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/51760601</guid><author>bit_Line</author><pubDate>Sat, 25 Jun 2016 22:56:00 +0800</pubDate><description><![CDATA[2016计算机网络复习

⇒⇒\Rightarrow\,  PDF版下载






  Author
  E-Mail



  Qyetfu
  zhengdongjian@tju.edu.cn





更新日志





  编号
  时间
  说明



  #0
  201606241913
  初始化文章结构


  #1
  201606252121
  更新前4章内容


  #...]]></description><category></category></item><item><title><![CDATA[《数值分析》总结]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/51676127</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/51676127</guid><author>bit_Line</author><pubDate>Wed, 15 Jun 2016 00:47:49 +0800</pubDate><description><![CDATA[《数值分析》总结

标签：数值分析




  Me
  [LOL]



  Qyetfu
  zhengdongjian@tju.edu.cn






第一章 误差


绝对误差 e∗=x∗−xe∗=x∗−xe^{*} = x^{*} - x
相对误差 e∗r=e∗xer∗=e∗xe^{*}_{r} = \frac{e^{*}}{x}，常取 e∗r=e∗x∗er∗=e∗x∗e^{*}_{r...]]></description><category></category></item><item><title><![CDATA[【小结】AC自动机]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/47663727</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/47663727</guid><author>bit_Line</author><pubDate>Fri, 10 Jun 2016 16:31:08 +0800</pubDate><description><![CDATA[参考资料：http://blog.youkuaiyun.com/niushuai666/article/details/7002823
留个板子
/* **********************************************  File Name: ac_automata.cpp  Auther: zhengdongjian@tju.edu.cn  Created Time: 2015年08]]></description><category></category></item><item><title><![CDATA[《并行计算》期末总结]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/51591266</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/51591266</guid><author>bit_Line</author><pubDate>Sun, 05 Jun 2016 20:38:47 +0800</pubDate><description><![CDATA[《并行计算》总结标签: 并行计算一、并行介绍域分解
针对的分解对象：数据
首先确定数据如何划分到各处理器
然后确定各处理器要做的事情
示例：求最大值
任务(功能)分解
针对的分解对象：任务(功能)
首先将任务划分到各处理器
然后确定各处理器要处理的数据
二、并行硬件性能Flynn弗林分类
SISD: Single Instruction stream Single Data stream
SIMD]]></description><category></category></item><item><title><![CDATA[ALOHA]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/51536810</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/51536810</guid><author>bit_Line</author><pubDate>Mon, 30 May 2016 11:44:57 +0800</pubDate><description><![CDATA[都是土]]></description><category></category></item><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/51286647</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/51286647</guid><author>bit_Line</author><pubDate>Sat, 30 Apr 2016 15:28:15 +0800</pubDate><description><![CDATA[(1)  2π√∫10e−xdx(1)\ \ {2\over {\sqrt\pi}} \int_{0}^{1} {\text{e}^{-x}}\text{d}x]]></description><category></category></item><item><title><![CDATA[antlr配置]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/50845516</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/50845516</guid><author>bit_Line</author><pubDate>Thu, 10 Mar 2016 12:19:37 +0800</pubDate><description><![CDATA[antlr4环境配置基本认识高级语言的编译过程可以分为词法分析，语法分析，语义分析等几步。编译的第一步就是词法分析，而antlr4便是一个可用于生成词法分析器的工具。支持Java, Python等语言平台，这里选用Java。词法分析的目的是由源程序(字符流)生成对应的记号流(tokens)，也就是 
源程序⟹词法分析器记号流源程序\stackrel{词法分析器}\Longrightarrow{记号流]]></description><category></category></item><item><title><![CDATA[博客图库]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/50488329</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/50488329</guid><author>bit_Line</author><pubDate>Sat, 09 Jan 2016 16:10:10 +0800</pubDate><description><![CDATA[数据库授权图习题10.1.2 
 
 多值依赖示意图 优先图 osmaozedong 图像处理 
 
 编译技术 
 
 
 
 
 
 
 
 Javascript之Ajax应用 others 
 
 
当前： img26]]></description><category></category></item><item><title><![CDATA[控制作业①]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/50447642</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/50447642</guid><author>bit_Line</author><pubDate>Sat, 02 Jan 2016 09:59:40 +0800</pubDate><description><![CDATA[测试：g∗(t)=∑∞k=0[1(kT)−e−10t]z−kg^{*}(t)=\sum_{k=0}^{\infty}[1(kT)-e^{-10t}]z^{-k}
Problem 1Problem\ 1
(a)(a). 令f(t)={0,tT,t<0t≥0f(t) = \begin{cases} 0, & t < 0 \\ {t\over T}, & t \ge 0\end{cases}则原函数可表达]]></description><category></category></item><item><title><![CDATA[【tmp】LR(0)]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/50189473</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/50189473</guid><author>bit_Line</author><pubDate>Sat, 05 Dec 2015 21:34:53 +0800</pubDate><description><![CDATA[stack = []
push ($) //$: end of file
push (1) // 1: initial state
while (true)
{
    token t = nextToken()
    state s = stack[top]
    if (ACTION[s, t] == 'si')
    {
        push (t); push(i);
    }]]></description><category></category></item><item><title><![CDATA[【tmp】引论]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/50166861</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/50166861</guid><author>bit_Line</author><pubDate>Thu, 03 Dec 2015 21:54:11 +0800</pubDate><description><![CDATA[词法分析也叫线性分析和扫描
词法分析也叫层次分析，把源程序的记号进一步分组，产生被编译器用于生成代码的语法短语
编译前端的流程
源程序⟹词法分析器记号流⟹语法分析器抽象语法数(AST)⟹语义分析器中间表示源程序\stackrel{词法分析器}\Longrightarrow记号流\stackrel{语法分析器}\Longrightarrow抽象语法数(AST)\stackrel{语义分析器}\Long]]></description><category></category></item><item><title><![CDATA[【python在git bash下的中文显示】 UnicodeEncodeError: 'ascii' codec can't encode characters in position ...]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/49891907</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/49891907</guid><author>bit_Line</author><pubDate>Tue, 17 Nov 2015 19:17:03 +0800</pubDate><description><![CDATA[看这里哈哈哈]]></description><category></category></item><item><title><![CDATA[【一种基于亮度映射的HDR算法】论文Adaptive Logarithmic Mapping For Displaying High Contrast Scenes]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/49871819</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/49871819</guid><author>bit_Line</author><pubDate>Mon, 16 Nov 2015 21:10:19 +0800</pubDate><description><![CDATA[这是一个改善图像显示的算法？
简单总结一下几个公式及算法过程
公式1：Ld=log(Lw+1)log(Lmax+1){L_d}={{log\left(L_w+1\right)}\over{log\left(L_{max}+1\right)}}其中，LdL_d是每个像素的显示亮度，LwL_w表示原图像亮度，LmaxL_{max}是原图像亮度的最大值
公式2：logbase(x)=log(x)log(b]]></description><category></category></item><item><title><![CDATA[【套题】2015ACM/ICPC亚洲区长春站 HDU5532 5533 5534 5536 5538]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/49703957</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/49703957</guid><author>bit_Line</author><pubDate>Sat, 07 Nov 2015 17:55:38 +0800</pubDate><description><![CDATA[水几个题，熟悉一下键盘。。。
HDU5532 Almost Sorted ArrayHDU5532\ Almost\ Sorted\ Array
题意：ASAASA定义为，仅去掉一个(One and Only OneOne\ and\ Only\ One)元素后数组是非降序或者非升序。
题解：很明显，判断一个序列是否有序可以通过判断其Longest NonDecreasing SubsquenceL]]></description><category></category></item><item><title><![CDATA[【QT】QT4.8.6静态编译]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48986001</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48986001</guid><author>bit_Line</author><pubDate>Fri, 09 Oct 2015 01:20:28 +0800</pubDate><description><![CDATA[本文转自cogizh的专栏 
QT里部署程序有两种方法：一种是动态编译，一种的静态编译 
动态编译需要发布.exe程序的同时，附上dll文件，想Qt里的Qtguid4.dll一个就有160M之巨，对于一般的小程序来说，可能只有小小的几M，所以有很多我们根本用不到的东西在里面，最好是将其给消除掉 
静态编译时生成唯一一个.exe，在发布程序的时候，只需要这一个程序就可以让用户使用，简单方便。 
安装Q]]></description><category></category></item><item><title><![CDATA[【QT5学习历程】]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48845839</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48845839</guid><author>bit_Line</author><pubDate>Thu, 01 Oct 2015 13:11:14 +0800</pubDate><description><![CDATA[软件版本：Ubuntu15.04下的qt-opensource-linux-x64-5.5.0-2.run，以及Windows10下对应版本。参考书籍《C++ GUI Qt4 编程(第二版)》，当当网39元入。
关于本文：记录从第一次配置QTQT开始的each stepeach\ step。希望能够引导读者培养自己解决问题的能力
1. QT1.\ QT开发环境的配置
官网下载对应的软件包，安装即可。]]></description><category></category></item><item><title><![CDATA[【状压BFS】hihocoder1233（2015 Beijing Regional Online Problem G）]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48782099</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48782099</guid><author>bit_Line</author><pubDate>Mon, 28 Sep 2015 10:55:50 +0800</pubDate><description><![CDATA[给几个大小不同的箱子，移来移去移成每个位置只有一个，并且箱子从小到大排好的样纸。
状态显然可以压缩，并且只要我们保证在同一位置的所有箱子都满足题意，也就是上面小下面大，那么对于任何一个箱子，我们只要知道它所在位置即可。
比赛时非常傻逼地用7个整数表示一个状态，并且用setset判重，复杂度直接多了一个loglog，跑得极慢，于是又想打表，大概半小时后发现一个bugbug。。。于是改掉又重新打。。。当]]></description><category></category></item><item><title><![CDATA[【RMQ-ST算法】hihocoder1068]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48738555</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48738555</guid><author>bit_Line</author><pubDate>Fri, 25 Sep 2015 21:49:15 +0800</pubDate><description><![CDATA[dp[i][j]dp[i][j]表示区间[i,i+2j)[i, i + 2^j)的最小值
dp[i][j]=min(dp[i][j−1],dp[i+2j−1][j−1]dp[i][j]=min(dp[i][j-1], dp[i + 2^{j-1}][j-1]
对于询问[le,ri][le,ri]，令len=ri−le+1len=ri-le+1，再令2lb≤len<2lb+12^{lb}\le len]]></description><category></category></item><item><title><![CDATA[【套题】Codeforces#321 div2]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48720383</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48720383</guid><author>bit_Line</author><pubDate>Thu, 24 Sep 2015 22:54:04 +0800</pubDate><description><![CDATA[A - Kefa and First Steps
简单dpdp
/* **********************************************    File Name: a.cpp    Auther: zhengdongjian@tju.edu.cn    Created Time: 2015/9/23 星期三 上午 12:31:29*********************]]></description><category></category></item><item><title><![CDATA[【套题】2015年百度之星程序设计大赛 - 初赛(1)]]></title><link>https://blog.youkuaiyun.com/bit_Line/article/details/48719979</link><guid>https://blog.youkuaiyun.com/bit_Line/article/details/48719979</guid><author>bit_Line</author><pubDate>Thu, 24 Sep 2015 22:25:17 +0800</pubDate><description><![CDATA[HDU5246 超级赛亚ACMerHDU5246\ 超级赛亚ACMer 
- 贪心，每次在当前可以打败的所有人中选择最大的一个与之战斗，维护当前的“实力”和可以提升的数值kk即可。/* **********************************************  File Name: 5246.cpp  Auther: zhengdongjian@tju.edu.cn  Creat]]></description><category></category></item></channel></rss>