Skip to main content

关于startup一篇非常好的文章

三件东西缺一不可:点子,创始人和启动资金。文章里详细阐述了它们。

点子不是很难,因为现实中的很多东西sucks,但人们因为没有更好的选择而被迫接受。点子最终是为了让人用的,不是给人看的。有时候一个人不需要考虑用户也想出很好的点子,很有可能是因为自己就是典型的用户。点子要随情况而变。

创 始人一个肯定不够,七八个太多,两个到四个最好。如果是技术型的公司,创始人必须懂技术,即使职位不是技术的。不了解技术就没办法作决定,因为他不知道 选择是什么。Hacker有人也叫软件工程师,让Hacker和客户交谈并不难。创始人的因素比点子重要。不好的点子可以被好的创始人修改,但不好的创始人必然毁掉好的点子。学校是个找合作者的 好地方,好的合作者是不能通过面试找到的。

启动资金最好不好自己准备,除非你是大款。一开始不要太在乎股票,对公司生存发展有利的东西是最重要的,必要时完全可以用股票去换。

文章里还有其它方面的很多精辟的总结

Comments

Popular posts from this blog

Spring, Angular and other reasons I like and hate Bazel at the same time

For several weeks I've been trying to put together an Angular application served Java Spring MVC web server in Bazel. I've seen the Java, Angular combination works well in Google, and given the popularity of Java, I want get it to work with open source. How hard can it be to run arguably the best JS framework on a server in probably the most popular server-side language with  the mono-repo of planet-scale ? The rest of this post walks through the headaches and nightmares I had to get things to work but if you are just here to look for a working example, github/jiaqi/angular-on-java is all you need. https://github.com/jiaqi/angular-on-java Java web application with Appengine rule Surprisingly there isn't an official way of building Java web application in Bazel, the closest thing is the Appengine rule  and Spring MVC seems to work well with it. 3 Java classes, a JSP and an appengine.xml was all I need. At this point, the server starts well but I got "No

Wreck-it Ralph is from Chicago?

Hotel Felix in Chicago   The building of Fix-it Felix Jr.  

Project Euler problem 220 - Heighway Dragon

This document goes through a Java solution for Project Euler problem 220 . If you want to achieve the pleasure of solving the unfamiliarity and you don't have a solution yet, PLEASE STOP READING UNTIL YOU FIND A SOLUTION. Problem 220 is to tell the coordinate after a given large number of steps in a Dragon Curve . The first thing came to my mind, is to DFS traverse a 50 level tree by 10^12 steps, during which it keeps track of a direction and a coordinate. Roughly estimate, this solution takes a 50 level recursion, which isn't horrible, and 10^12 switch/case calls. Written by a lazy and irresponsible Java engineer, this solution vaguely looks like: Traveler traveler = new Traveler(new Coordinate(0, 0), Direction.UP); void main() { try { traverse("Fa", 0); } catch (TerminationSignal signal) { print signal; } } void traverse(String plan, int level) { foreach(char c:plan) { switch(c) { case 'F': traveler.stepForward(); break; ca