<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Sun.StriKE()的博客]]></title><description><![CDATA[https://github.com/sunstrikes  talk is cheap, show me the code]]></description><link>https://blog.youkuaiyun.com/SunStrike</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SunStrike]]></copyright><item><title><![CDATA[torch-1 tensor & optim]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/81008656</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/81008656</guid><author>SunStrike</author><pubDate>Wed, 11 Jul 2018 23:37:25 +0800</pubDate><description><![CDATA[开个新坑, pytorch源码阅读..从python代码开始读起.

torch/



1.tensor.py

继承自torch._C._TensorBase , 包括各种操作,TODO:随后看cpp代码


__abs__, __iter__之类的内建方法
requires_grad属性是否需要求导
backward(self, gradient=None, retain_graph=Non...]]></description><category></category></item><item><title><![CDATA[Andrew Ng 机器学习&深度学习课程 代码作业解答 集合]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/80511324</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/80511324</guid><author>SunStrike</author><pubDate>Wed, 30 May 2018 15:53:52 +0800</pubDate><description><![CDATA[写在最前

​   2018年是对自己来说是崭新的一年，在过去的3个多月里，从最基础的lr， 学到现在的LSTM, GAN..感觉第一次追上了计算机科学飞速发展的浪潮。虽然很多地方都仍是一知半解，但时间还长，还是可以学到更多前沿的技术。算是给自己鼓励吧。

Ng的入门课程Machine Learning与Deep Learning很赞，从小白一个个练习做了过来感觉受益良多。下面是自己完成的练习，作...]]></description><category></category></item><item><title><![CDATA[LSTM推导]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/80510391</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/80510391</guid><author>SunStrike</author><pubDate>Wed, 30 May 2018 15:09:07 +0800</pubDate><description><![CDATA[LSTM推导



forward propagation





def lstm_cell_forward(xt, a_prev, c_prev, parameters):
    &quot;&quot;&quot;
    Implement a single forward step of the LSTM-cell as described in Figure (4)

    Arguments:
    xt...]]></description><category></category></item><item><title><![CDATA[brpc internal]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/80510342</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/80510342</guid><author>SunStrike</author><pubDate>Wed, 30 May 2018 15:06:26 +0800</pubDate><description><![CDATA[brpc  内部实现



thread model

pthread 1:1atomic cache同步降低性能

fiber n:1 -&amp;amp;amp;gt; nginx  多核难以扩展, 用户不能做阻塞操作.

context  存储contextualStack

bthread_make_fcontext (boost::context)手动切换线程上下文-&amp;amp;amp;gt;函数栈, 寄存器

bthread_...]]></description><category></category></item><item><title><![CDATA[2D KD-Tree实现]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/54292477</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/54292477</guid><author>SunStrike</author><pubDate>Mon, 09 Jan 2017 20:19:49 +0800</pubDate><description><![CDATA[KD-tree 如何算一个点到一段折线的最近距离~折线的折点可能有上千个, 而需要检索的点可能出现上万的数据量, 的确是个值得思考的问题~2.暴力解法有个比较直观的方法: 计算点到折线的每段的距离, 然后暴力找出最短的那段~得到解..不过这种O(n)的复杂度方法显然遇到大数据量的时候会严重拖累服务器的性能.3.K临近算法-数据结构]]></description><category></category></item><item><title><![CDATA[hihocoder 1290 DP]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51223520</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51223520</guid><author>SunStrike</author><pubDate>Fri, 22 Apr 2016 21:52:39 +0800</pubDate><description><![CDATA[题目利用DP思想，dp[i][j][k]表示robot跑到i行j列目前移动方向为k时，所需要的最小的flip。其中0 ，0 ，k = right/downdp[i][j][right] 可由dp[i][j-1][right]右移和dp[i-1][j][down]下移两种情况得到： 1. dp[i][j-1][right]右移一步，到dp[i][j][right]，若maze[i][j] == 'b]]></description><category></category></item><item><title><![CDATA[初级线段树 POJ3264]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51106531</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51106531</guid><author>SunStrike</author><pubDate>Sat, 09 Apr 2016 18:10:12 +0800</pubDate><description><![CDATA[初级线段树]]></description><category></category></item><item><title><![CDATA[HDU 1171 0-1背包]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51105309</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51105309</guid><author>SunStrike</author><pubDate>Sat, 09 Apr 2016 15:14:47 +0800</pubDate><description><![CDATA[HDU 1171 0-1背包]]></description><category></category></item><item><title><![CDATA[HDU 1114 完全背包]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51105232</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51105232</guid><author>SunStrike</author><pubDate>Sat, 09 Apr 2016 15:02:53 +0800</pubDate><description><![CDATA[完全背包问题 HDU1114]]></description><category></category></item><item><title><![CDATA[树状数组复习 leetcode 307]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51020693</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51020693</guid><author>SunStrike</author><pubDate>Thu, 31 Mar 2016 00:17:54 +0800</pubDate><description><![CDATA[树状数组]]></description><category></category></item><item><title><![CDATA[Netease研发实习生一面]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/51007884</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/51007884</guid><author>SunStrike</author><pubDate>Tue, 29 Mar 2016 17:43:06 +0800</pubDate><description><![CDATA[2017网易游戏实习电面]]></description><category></category></item><item><title><![CDATA[hihocoder offer收割赛。。#1284]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/50993568</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/50993568</guid><author>SunStrike</author><pubDate>Sun, 27 Mar 2016 20:34:05 +0800</pubDate><description><![CDATA[好久没刷题，水一水，反正排不上名次。。这道题记下
我想着蛋疼的做了质因数分解，然后再算的因子个数。。慢的一比，结果导致超时，还不如直接一个for循环搞定。。也是醉了
最后其实就是算两个数的gcd，然后gcd的因子个数除两个数的因子个数乘积就是最后结果，再约分一下就行。



#1284 : 机会渺茫




时间限制:5000ms
单点时限:1000ms
内存限制:256]]></description><category></category></item><item><title><![CDATA[百度实习生二面]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/50991577</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/50991577</guid><author>SunStrike</author><pubDate>Sun, 27 Mar 2016 14:16:40 +0800</pubDate><description><![CDATA[今天中午就2面来袭,猝不及防..百度的前辈人都非常nice
以前对工作的态度总是听逃避的,现在已经转变成了向往,可能意味着,我已经准备好了.
总结下问题:
1.c++多重继承,虚继承,析构,虚函数表
2.项目..倒排索引的删除,更新问题
3.linux shell 命令
4.c++ 11
5.c++ python java 比较
6.多线程是否了解

今天感觉还行,前辈说基础不]]></description><category></category></item><item><title><![CDATA[百度实习生 一面]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/50991534</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/50991534</guid><author>SunStrike</author><pubDate>Sun, 27 Mar 2016 14:10:10 +0800</pubDate><description><![CDATA[简历写的太差，被各种问linux 问题，被虐的好惨。。
不会的问题汇总：
~查内存，端口号的命令 vmstat -s、、 free -m 。。netstat –apn
~makefile 的原理

make命令执行时，需要一个 Makefile 文件，以告诉make命令需要怎么样的去编译和链接程序。

首先，我们用一个示例来说明Makefile的书写规则。以便给大家一个感兴认识。这个]]></description><category></category></item><item><title><![CDATA[HDU 1071 The Area]]></title><link>https://blog.youkuaiyun.com/SunStrike/article/details/47058025</link><guid>https://blog.youkuaiyun.com/SunStrike/article/details/47058025</guid><author>SunStrike</author><pubDate>Sat, 25 Jul 2015 16:57:22 +0800</pubDate><description><![CDATA[HDU 1071 The Area]]></description><category></category></item></channel></rss>