<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[纯黑老白的专栏]]></title><description><![CDATA[10000小时定律---加油AC]]></description><link>https://blog.youkuaiyun.com/mathson</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mathson]]></copyright><item><title><![CDATA[poj题目分类 [转载于=小媛在努力原创]]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45414637</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45414637</guid><author>mathson</author><pubDate>Fri, 01 May 2015 03:53:14 +0800</pubDate><description><![CDATA[poj题目分类 小媛在努力原创标签（空格分隔）： oapoj题目分类 小媛在努力原创
初期
一基本算法
1枚举 poj1753poj2965
2贪心poj1328poj2109poj2586
3递归和分治法
4递推
5构造法poj3295
6模拟法poj1068poj2632poj1573poj2993poj2996
二图算法
1图的深度优先遍历和广度优先遍历
2最短路径算法dijkstrabell]]></description><category></category></item><item><title><![CDATA[转载于[671coder的专栏]]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45413439</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45413439</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:44:01 +0800</pubDate><description><![CDATA[ACM题集以及各种总结大全标签（空格分隔）： Algorithm
  虽然退役了，但是整理一下，供小弟小妹们以后切题方便一些，但由于近来考试太多，顾退役总结延迟一段时间再写！先写一下各种分类和题集，欢迎各位大牛路过指正。 
  * 转载于671coder的专栏
ACM入门
杭州电子科技大学(hdu)ACM题目
关于acm的帮助
北京大学(poj)题目
浙江大学(zoj)题目
uva题目
青理工大学a]]></description><category></category></item><item><title><![CDATA[leetcode中学习recursion]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45413405</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45413405</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:42:32 +0800</pubDate><description><![CDATA[leetcode中学习recursion标签（空格分隔）： leetcodeleetcode中学习recursion
recursion的种类
简单的按照结构分的有
1个rec 以及简单三明治关系
1个rec 但是在for loop里面的话 会更有意思
1个recursion 这次是在for each 括号里面 更有意思啦
2个连续rec call 有param 有return
在triangle]]></description><category></category></item><item><title><![CDATA[Leetcode Freq 4,5]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45413381</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45413381</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:41:58 +0800</pubDate><description><![CDATA[Leetcode Freq 4标签（空格分隔）： leetcode目录Leetcode Freq 4
标签空格分隔 leetcode
目录
20141105
word ladder
20141103
BFS
Word Ladder
20141102
set Matrix Zeros
Merge sorted arraylist
20141101
Powxn
Validate BST
kd-Tree]]></description><category></category></item><item><title><![CDATA[Leetcode中学习DP]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45413427</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45413427</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:41:57 +0800</pubDate><description><![CDATA[Leetcode中学习DP标签（空格分隔）： leetcodeLeetcode中学习DP
学习
CLRS
Stanford
ACM 资料
最简单的DP Unique Path
2D DP经典 distinct subsequences
2D DP优化为1D DP的经典 Distinct SubsequencesCoin changes
分析来自优快云
2D DP经典 LCS
Naive recur]]></description><category></category></item><item><title><![CDATA[Leetcode Freq 3]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45413351</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45413351</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:41:20 +0800</pubDate><description><![CDATA[Leetcode freq 3标签（空格分隔）： leetcodeFrequency 3题解Leetcode freq 3
Frequency 3题解
20141218
20141217
20141208
20141206
20141205
20141129
20141118
20141115
20141112
题目
20141218
Combination - N00t 
标准的recursion]]></description><category></category></item><item><title><![CDATA[Leetcode Freq 2]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45412905</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45412905</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:35:01 +0800</pubDate><description><![CDATA[Leetcode Freq 2标签（空格分隔）： leetcodeLeetcode Freq 2
20141228
20141226
20141225
20141223
题目
20141228
Populating Next Right Pointers in Each Node II
Binary Tree Maximum Path Sum
Next Permutation
First Missi]]></description><category></category></item><item><title><![CDATA[Leetcode高频题频率表(转载)]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45412831</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45412831</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:32:28 +0800</pubDate><description><![CDATA[Leetcode Questions
  
  
  
  
  ID
  QUESTION
  DIFFICULTY
  FREQENCY
  DATA STRUCTURES
  58
  Length of Last Word
  1
  1
  string
  100
  Same Tree
  1
  1
  tree
  104
  Maximum Depth of Binary Tre]]></description><category></category></item><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/45411909</link><guid>https://blog.youkuaiyun.com/mathson/article/details/45411909</guid><author>mathson</author><pubDate>Fri, 01 May 2015 02:23:02 +0800</pubDate><description><![CDATA[欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来，用它写博客，将会带来全新的体验哦：
Markdown和扩展Markdown简洁的语法
代码块高亮
图片链接和图片上传
LaTex数学公式
UML序列图和流程图
离线写博客
导入导出Markdown文件
丰富的快捷键
快捷键
加粗    Ctrl + B 
斜体    Ctrl + I 
引用    Ctrl]]></description><category></category></item><item><title><![CDATA[Real-time programming applied to the FreeRTOS operating system]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/37686541</link><guid>https://blog.youkuaiyun.com/mathson/article/details/37686541</guid><author>mathson</author><pubDate>Fri, 11 Jul 2014 04:49:14 +0800</pubDate><description><![CDATA[http://www.ac6-training.com/cours.php/cat_FSCA/ref_RT3/print_true.xphp


Objectifs

Get an overview on Cortex-M4 architectureDiscover the concepts of real time multitaskingUnderstand Real Time co]]></description><category></category></item><item><title><![CDATA[实现硬件hardware prefectcher]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/26443203</link><guid>https://blog.youkuaiyun.com/mathson/article/details/26443203</guid><author>mathson</author><pubDate>Wed, 21 May 2014 14:34:59 +0800</pubDate><description><![CDATA[reference：
1. http://www.binarytides.com/data-type-u_int8_t-u_int16_t-u_int32_t-on-windows/
2.]]></description><category></category></item><item><title><![CDATA[FreeRTOS 复习]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/25876355</link><guid>https://blog.youkuaiyun.com/mathson/article/details/25876355</guid><author>mathson</author><pubDate>Thu, 15 May 2014 10:50:44 +0800</pubDate><description><![CDATA[1. FreeRTOS一共9K的代码，分成3部分：
a. 50%: task]]></description><category></category></item><item><title><![CDATA[复习recursion]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/25546265</link><guid>https://blog.youkuaiyun.com/mathson/article/details/25546265</guid><author>mathson</author><pubDate>Sun, 11 May 2014 15:07:37 +0800</pubDate><description><![CDATA[1. 如果这样
private void lop(int x, int size, double[] jerry){
		if(x==size-1){
			jerry[x] = -1;
			return;
		}
		if(jerry[x+1]==0){
			jerry[x+1] = jerry[x]- 1;  //if so,
			lop(x+1, size, jerry);
		}
]]></description><category></category></item><item><title><![CDATA[复习一下dfs和bfs 用java]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/24749629</link><guid>https://blog.youkuaiyun.com/mathson/article/details/24749629</guid><author>mathson</author><pubDate>Wed, 30 Apr 2014 01:24:15 +0800</pubDate><description><![CDATA[dfs 和 bfs都是用来找从source 到 target的path的算法。
dfs用的是recursion，bfs则用queue]]></description><category></category></item><item><title><![CDATA[段公子 Facebook]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/24335817</link><guid>https://blog.youkuaiyun.com/mathson/article/details/24335817</guid><author>mathson</author><pubDate>Wed, 23 Apr 2014 00:44:34 +0800</pubDate><description><![CDATA[----------------------一些背景情况---------------------------

昨天Facebook的hr说进了committee，今天中午来了电话confirm了，随后就来了正式的
electronic offer letter。的确是很开心，但我也很淡定，一方面是因为还有点不敢
相信，另一方面自己也想过，毕竟只是个打工的机会，还是要戒骄戒躁。特别是要反]]></description><category></category></item><item><title><![CDATA[HPP_UIUC_MP2: basic matrix multiplication-----BlockDIM!]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/23463849</link><guid>https://blog.youkuaiyun.com/mathson/article/details/23463849</guid><author>mathson</author><pubDate>Fri, 11 Apr 2014 17:52:26 +0800</pubDate><description><![CDATA[这次作业有个地方搞的我输出的C矩阵一直都是全000000.


然后fa'xi]]></description><category></category></item><item><title><![CDATA[NN之---weight 反馈回路]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/23243533</link><guid>https://blog.youkuaiyun.com/mathson/article/details/23243533</guid><author>mathson</author><pubDate>Wed, 09 Apr 2014 08:30:04 +0800</pubDate><description><![CDATA[NN的一个重要部分就是要back propagation，因为这样在若干epoch]]></description><category></category></item><item><title><![CDATA[HPP_UIUC_MP1: vector addition]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/23157571</link><guid>https://blog.youkuaiyun.com/mathson/article/details/23157571</guid><author>mathson</author><pubDate>Tue, 08 Apr 2014 07:56:43 +0800</pubDate><description><![CDATA[按照tutorial来在cmd里面输入：input output 文件名和type即可。
data set在webgpu的]]></description><category></category></item><item><title><![CDATA[HPP_UIUC_MP0结果：local GPU]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/23155367</link><guid>https://blog.youkuaiyun.com/mathson/article/details/23155367</guid><author>mathson</author><pubDate>Tue, 08 Apr 2014 06:48:55 +0800</pubDate><description><![CDATA[因为webgpu总是宕机，所以只好用我笔记本上的3100来跑。]]></description><category></category></item><item><title><![CDATA[SystemVerilog/Verilog的实数输入输出和常数：Cordic或者直接unsynthesizable的C表达]]></title><link>https://blog.youkuaiyun.com/mathson/article/details/23148389</link><guid>https://blog.youkuaiyun.com/mathson/article/details/23148389</guid><author>mathson</author><pubDate>Tue, 08 Apr 2014 02:42:51 +0800</pubDate><description><![CDATA[因为在图像处理的时候需要用到很多filter，其中gaussian filter是一个是exponential function，所以要用到ed]]></description><category></category></item></channel></rss>