Auto Revenue: $7.611B
Automotive Gross Margin: 27.7%
Total Revenue: $8.771B
Total GAAP Gross Margin: 23.5%
Net Income GAAP: $331m (non-GAAP $874m)
EPS (GAAP): $0.27 (Non-GAAP $0.76)367 karma · joined July 9, 2013
Auto Revenue: $7.611B
Automotive Gross Margin: 27.7%
Total Revenue: $8.771B
Total GAAP Gross Margin: 23.5%
Net Income GAAP: $331m (non-GAAP $874m)
EPS (GAAP): $0.27 (Non-GAAP $0.76)- debt worldwide hits 86k per person [ref: https://news.ycombinator.com/item?id=18683923]
- people buying cars using financial products they don't understand [ref: https://news.ycombinator.com/item?id=14476381]
- rollback of federal oversight [ref: https://www.nytimes.com/2018/05/22/business/congress-passes-...]
- wage stagnation [ref: https://news.ycombinator.com/item?id=19253364]
- how consumers and lenders pursue consumer debt [ref: https://www.propublica.org/series/unforgiven]
[0] https://people.inf.ethz.ch/omutlu/pub/Google-consumer-worklo...
There is a lot of potential for such reductions to happen in urban areas. Shameless plug - the potential for pooling using Uber data is shown in Figure 8 (https://arxiv.org/abs/1701.06635)
[0]https://www.epa.gov/sites/production/files/2015-09/ucmr-3-oc...
Also check the diagram(s) for a better understanding.
[0]http://crew.org/sites/default/files/cascadia_subduction_scen...
Publication - http://dl.acm.org/citation.cfm?id=2661744
[0] https://blog.twitter.com/2014/introducing-twitter-data-grant...
[1] https://blog.twitter.com/2014/twitter-datagrants-selections
In retrospect, this approach made us to think about edge cases which now I'll think about much later in the coding process. The overall grade was based on the correctness and also on the number of alterations in logic made in the final running code.
edit: by school, I refer to senior high school as in US [0]
[0] https://en.wikipedia.org/wiki/Senior_high_school#United_Stat...
[0] https://docs.google.com/spreadsheet/ccc?key=0AqAxkyS3N9_wdHc...
[0] https://www.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/re...
- take the two sorted arrays A & B (assume both are of size n) and make partitions of size log n in one of them, let's say A
- Now considering there are n/logn processors, assign each partition to a processor. On each partition take the last element (l) and do a binary search to find a cut point in the other array B such that all elements in B are <= l. Cut points of two such partitions in A correspond to a partition in B which can then be sequentially merged by the processor.
Span is O(log n); Work is O(n); so parallelism is O(n/logn) Detailed information here [1]
[0] https://github.com/BonzaiThePenguin/WikiSort/blob/master/Cha...
[1] http://electures.informatik.uni-freiburg.de/portal/download/...
=======
I first entered industry as a software engineer after my Master's from a good university in the US. I felt the job to be very structured. By `structured` I mean - goals were well defined; best practices of SE were applied; at times there was confusion of what exactly the requirement meant but we all had it sorted since meetings with managers and product managers were regular. Research there meant to dive into existing code and/or ask experienced developers around. After having spent ~10 months, I decided to apply for a PhD program. The reason I gave to a lot of my friends at the time of leaving industry was, `I didn't have enough meat to chew`. IMO the company's structure hampered my ability to learn deeper concepts of Math-CS, and made me lethargic (probably due to the compensation). Of course, had I stayed there long enough, I could have probably defined the structure, but at that time I thought there were more interesting things to study.
I was fortunate to get accepted for a PhD program. Having an average Math background, I struggled in my first year studying mathematical models behind CS, for instance queuing theory. Everyone around me had a better intuition to such things and I felt really awkward. I survived the first semester, and in the second managed to handle more than a course.
I am currently in my second year. Most of my classes are theory based and not at all intuitive to me. However, I spend hours to understand the proofs. There are some amazing theoretical work which goes in developing algorithms[1] and concepts like these this keeps me going. Of the some I understand, I feel excited. Of the ones I don't, I hope to get my head around them some day. I meet people who are great researchers. Class projects are a great way to sow seeds of research ideas and challenging since I have to compete, in some cases, with a few classmates who have a lot more knowledge in the subject. With all classes till now, I am able to do mediocre research which aligns with the research grant given to my advisor. However, in the future, I hope to do much concrete research. My advisor knows that my current focus is on courses and he's fine with me investing more time in them as opposed to research.
Till now, all this has been challenging, and exciting. I don't know whether I'll end up in the steady state[2] of research as OP pointed out or may be I am already there :)
[0] https://en.wikipedia.org/wiki/Philomathean_Society
Recognize your romantic partner using FB network[0]
Ideas from a related project[1] like de-centralization, self-management of small servers (as opposed to server farms) distributed around the globe could be leveraged in cryptosphere? Diagram explaining interactions in Elijah[2]
[0] http://tonyarcieri.com/the-cloud-isnt-dead-it-just-needs-to-...
[2] https://github.com/cmusatyalab/elijah-cloudlet/blob/master/d...
IMO something similar to SSH security policies like allowing logging in from a set of IPs and/or without password i.e. using public key, may be a good idea.