In the news recently are rumors that Carter, Anderson and Duchovny will reunite for new X-Files episodes. Fox has sorta confirmed this.

I own all the DVDs, a couple years ago I rewatched them. I may come off as a rabid fan at times but the background music was atrociously horrid. Also the story arc plot became overly convoluted and impossible to explain at times. That said, one of the most convoluted characters (Krycek) was my favorite. Aside from several minor valid criticisms like that, I really think it's a great platform for modern storytelling.

I do have to ask myself, at times, if there is some level of insane conspiracy theory today that we owe at least in part to those people watching X-Files when younger. I have to admit that the 9/11 inside job truthers movement claims could have been ripped from the pages of an X-Files script.

My biggest concern, of course, is whether or not it could still be fresh. With recent high quality additions to television canon, we'd have to be prepared for Chris Carter coming back at us with a 90's angle when episodes like Home really aren't as shocking anymore. The bar has been raised (thankfully).

Right now, The X-Files is going to occupy a contextual place in television history like The Twilight Zone. A revival could very well tarnish that. On the other hand, I've never felt like I really received closure on the whole story arc ...

Thanks! Will brush up in that more. Looks similar to what we avoid with operator+=, passing by reference, etc.

Repeatedly allocating and deallocating can give a huge performance hit, so I tend to do all my allocations before the main loop. Not entirely sure why the penalty is so big, but it seems to be - these are allocations of hundreds of MB or even a few GB, so the cost of operations done on the arrays should dwarf the cost of the allocation.

It's a hardware thing -- the memory bus and memory read/write speeds are still a limiting factors, particularly as CPU cores get faster and more efficient. In any code, memory operations (allocations, copies, and deallocations) are performance killers and best avoided wherever possible (e.g., pre-allocating memory as you are, using temp variables that don't get deallocated, overloading operator+= operations to avoid hidden allocation and copy operations, etc.) The general rule:

[Disk access] is much slower than [memory access] is much slower than [CPU operations] (esp. those in the cache)

FWIW, I'm writing big finite volume codes in C++ (preparing for an open source release), and we deal with these very same issues. Our biggest performance gains (outside of choosing stable algorithms without time step restrictions and using OpenMP) are from avoiding memory allocations and copies, working on vectors of variables rather than individual variables, overloading things like operator+= on std::vector, and using BLAS (particularly axpy). Also identifying any operations that can be pre-computed (like certain steps in Thomas solvers) is helpful. :-)

I see what you did there!

Exactly!

1) Clearly bad passwords will be the most popular. Some people will blow off security and will pick a bad password.
2) There are no data in the article regarding how frequently these passwords are used.
3) There is no representation of what these passwords are protecting. Maybe these are passwords to something harmless like accounts in some children's game. In which case, who cares?