UI/UX
- “好的”设计
The Design of Everyday Things by Donald Norman- 用户画像
About Face 3 by Alan Cooper- 用户调研
Observing the User Experience: A practitioner’s guide to user research
Contextual Inquiry
Learning from Strangers The Art and Method of Qualitative Interview Studies- 体验经济
The Experience Economy by James Gilmore- 设计思考
The Design of Business: Why Design Thinking is the Next Competitive Advantage byRoger Martin
Innovator’s Dilemma
Reframing Business: When the Map Changes the Landscape
Tipping Point: How little Things Can Make a Big Difference
The Art of the Long View
Diffusion of Innovations
UX设计师自我修养资源指南 Episode 1
UX设计师自我修养资源指南 Episode 2
这个网页好棒:http://shtick.be
资源:
http://www.jianshu.com/p/e289e949641d
http://www.jianshu.com/p/4ef4afef54e1
网站:
http://getrefe.tumblr.com/
http://www.gratisography.com/
http://isorepublic.com/
http://jaymantri.com/
http://www.lifeofpix.com/
http://littlevisuals.co/
http://lockandstockphotos.com/
http://www.pexels.com/
http://picography.co/
http://publicdomainarchive.com/
http://www.raumrot.com/10/
http://www.resplashed.com/
http://snapographic.com/
http://snapwiresnaps.tumblr.com/
http://superfamous.com/
http://thestocks.im/
https://tookapic.com/photos?list=free
码农必备|十大编程算法
链接
1. 快排
2. 堆排序
3. 归并
4. 二分查找
5. BFPRT(线性查找
算法步骤:
1. 将n个元素每5个一组,分成n/5(上界)组。
2. 取出每一组的中位数,任意排序方法,比如插入排序。
3. 递归的调用selection算法查找上一步中所有中位数的中位数,设为x,偶数个中位数的情况下设定为选取中间小的一个。
4. 用x来分割数组,设小于等于x的个数为k,大于x的个数即为n-k。
5. 若i==k,返回x;若i < k,在小于x的元素中递归查找第i小的元素;若i>k,在大于x的元素中递归查找第i-k小的元素。
终止条件:n=1时,返回的即是i小元素。
6. DFS(深度优先
7. BFS(广度优先
8. Dijkstra算法
9. 动态规划
10. 朴素贝叶斯分类
干货 | ECCV 2016 全部视频+PDF汇总
Ian Goodfellow 根据NIPS 2016讲座整理的GAN介绍性论文
来自“将门创投”(thejiangmen)微信公众号