Forgot your password?

typodupeerror

Comment: Re:Not Much You Can Do About That (Score 1) 197

by AndOne (#39973591) Attached to: 'Social Jetlag' May Be Making You Fat
I have the same issue. Sleep study confirmed and everything. I was working with a clinical behavioral psychologist to improve some, but life went crazy and my sleep is back to pretty much being shit.

Light therapy did help some though. I need to get back on trying that.

People are basically assclowns about it though.

Comment: Re:I call bullshit (Score 1) 233

by AndOne (#39602207) Attached to: Majority of Landmark Cancer Studies Cannot Be Replicated

No you don't. You just need to read the published paper and attempt to reproduce what the paper reports. (A good scientific paper includes enough information to make the work it reports on reproducible.)

That's the ideal and idyllic world. In many areas there's a ton of hidden parameters and secret sauce that doesn't get reported. I found this to be especially true in robotics and machine vision and other computer science papers.

Comment: Re:Absolute power corrupts absolutely. (Score 2) 233

by AndOne (#39602165) Attached to: Majority of Landmark Cancer Studies Cannot Be Replicated
I spent a year and a half working on trying to replicate results from one paper. Total failure. A few years later I was talking to one of the researchers and sure enough, the results only worked in that one case for that one data set and pretty much had no real chance of working any other way. That's pretty much the straw that broke my brain. The entire time it was my fault the results weren't being reproduced....

Comment: Re:What ISN'T NP-Hard? (Score 1) 212

by AndOne (#39149561) Attached to: Physics Is (NP-)Hard
I'd love to know what you consider the most basic algorithms. There are entire classes of problems which are polynomial and are not "basic". I also think you don't understand what it even means to be NP-Hard (which is just the numerical version of being NP-Complete.) Also to show that something is NP-Hard is equivalent to showing something is NP-Complete, which means you show there is a Polynomial time reduction to another problem in the appropriate class. Seriously, how did this get modded insightful.

Honestly, I don't think you even begin to understand complexity spaces or how they work.

http://en.wikipedia.org/wiki/Complexity_class

Comment: Re:Memory? (Score 1) 452

by AndOne (#37536450) Attached to: Mozilla Foundation Releases Firefox 7
I had firefox 6 clock in at just under 4GB of ram with about 60 to 90 tabs open before the stuttering got so bad I started closing things. It went down to 2.2 GB after I closed about half the tabs. It's common for me to have even more tabs open across multiple windows given the way I use the browser, but I must say that was the first time I've seen it stutter at 4GB like that. Usually it would sit around 2GB of ram with anywhere from 100 to 200 tabs open.

So with 39 tabs open I'm happy to see just 390MB of usage right now on FF7. Usually we'd be approaching 700MB already.

Old programmers never die, they just branch to a new address.

Working...