tycho77
Knowledge on these subjects is easy to pick up, taking you a few days of study at the most. Knowing this stuff doesn't mean you can program for shit (see: academic coding horror). Best to build a portfolio as dpritchett said, with a few "lessons I learned from experience when working on this project" anecdotes ready to go.
That's just personal experience though, and I competed in the ICPC during my university career so I never worry about the problem solving questions.
I'd like more information on the CPUs and CPU/GPU bus of this FASTRA II. CPUs are really gaining back a lot of their performance relative to GPUs - an M2090 is only about 5-10x faster than the newer Intel Xeons in a properly multithreaded program that pays attention to the NUMA nodes. This is efficient enough that for large simulations which do not fit on one GPU, running portions of the simulation on CPU easily overcomes the CPU/GPU communication overhead in terms of performance.
Even better than a stand-up desk is having a small treadmill. It's not like they go fast - it would be about the same as a slow walk. Suits would be fine, you don't sweat at all.
You then search for those same sample points in the successive frame B, and end up with a collection of vectors that probably represent the motion of each point. Using OpenCV, this is usually done with cvCalcOpticalFlowPyrLK().
Tweening is basically just interpolation.
Not to detract from the story, which by all anecdotal evidence in this thread appears to be valid, but this is a dangerous train to jump on - I would say akin to blaming racial disparity on 'cultural issues'.
http://images2.bingocardcreator.com/blog-images/ad-blending/...
for about thirty seconds and literally did not see the ad, at all. I am now impressed/scared of my mind's ability to completely disregard probably unimportant information.
Every time someone wealthy donates a whole lot of money to a philanthropic cause, people like you pop up in the comment section. "Oh it doesn't matter, it's only X% of his net worth, that's the same as me only donating Y". Seriously, you followed this template almost to the letter.
First, charity isn't a competition over who can sacrifice the most. At the end of the day, that $500,000 helps Wikipedia five thousand times more than your $100. More, probably, because his donation raises the profile and will convince others to donate. Second, people aren't "expected" to give anything, regardless of how much money they have.
I think the thing that annoys me the most is how obvious it is you came in here with preconceived anti-rich notions and then did mental gymnastics to convince yourself that you're "a better person" than this incredibly generous man. If you want to spread that kind of negativity around, go back to Slashdot.
I'm sure someone can articulate this better than I can, but seriously. These sorts of posts just piss me off.
Maybe that makes me selfish for wanting someone else to deal with the problem, but seriously. I don't want to deal with your problems. There are too many awesome people in the world that raise me up to heights to want to attach an anchor to my feet like that.
Here's a good site to get started:
http://www.magnificentbastard.com/
Lots of good advice, I agree with most of it. A more important step is to head to a high-end clothing store, the type that sticks a salesperson on everyone who walks through the door. Yes, the clothing is expensive, but in conjunction with the professional advice it is very much worth it.
I am unfortunately not knowledgeable on the issues that come with enabling https on a website, but that would be a nice feature.
It'll be interesting to see how this sort of activity incentivizing stacks up against more active variants like http://www.habut.com/.
Snoob stands for "same number of one bits". Essentially, if x is an integer whose binary representation contains n one-bits, snoob(x) will return the next smallest integer which is also represented using n one-bits. The obvious application here is iterating through all subsets of a certain size. The function is as follows:
unsigned int snoob(unsigned int x) {
unsigned int smallest, ripple, ones = 0;
smallest = x & -x;
ripple = x + smallest;
ones = x ^ ripple;
ones = (ones >> 2) / smallest;
return ripple | ones;
}Given a set containing N elements, to generate all subsets of size K you initialize a bitmask to (1 << K) - 1 then perform a snoob N Choose K times to get all the bitmasks you need.
(Disclaimer: Although neat, I've never found a use for this outside of programming competitions)