IIRC, patents today last 20 years from the initial application; in the past they lasted 17 years from when the patent was granted; it usually took 3 years to process the patent, but some people deliberately slow up the process so that the patent would last longer. So patents have really grown shorter.
Wrong; to be in NP, it is only necessary that the solution can be verified in polynomial time; every problem in P is also in NP. You may have been thinking of NP-complete.
Unfortunately, one assumption at the beginning, that the cascading model is best-case performance for BitTorrent, is completely wrong. It's actually worst-case performance.
A scattered model gives BT as taking O(log(number of people)/(number of chunks) + 1) time for everyone to download the whole file instead of O(sqrt(number people)) as claimed in the article.
If a page has a single line which is wider than the browser windows, then every line on that page will expand to that width, which forces the reader to scroll horizontally and back every single line, which is very annoying.
Slashdot avoids this by simply adding a space every N characters. This could be better done by having it add a space if there are N consecutive nonspace characters, but it is done for good reason.
<in Java, a method is virtual unless declared non-virtual>>
That's not necessarily true in Java; I've heard the HotSpot VM has some tricks so that a method is non-virtual unless it is overridden by a class which has been loaded.
According to the article, compilers will pad out the size of structs to be a multiple of the word size. When that's done, copying one padded struct to another will cause the compiler to put in code for uninitialized reads into the end product.
Mononoke Hime is their sole Miyazaki- nary a Totoro even.
Considering that Netflix only handles DVDs, and there is a notable shortage of Miyazaki on region 1 DVD (IIRC, MH, Castle of Cagliostro, and Sherlock Hound), this shouldn't be too surprising. And they do carry CoC.
In the case of letterbox movies, the black bars are there because there was nothing there in the original film.
In the case of TNN's showings, it appears from other comments (I've never watched that channel myself) that it covers up picture that was in the original broadcast.
Because symmetric encryption is much faster than asymmetric encryption, when public keys are used, the method generally goes like this:
1) Randomly generate a key (called the session key) for a private-key algorithm. 2) Encrypt the session key with the public key algorithm and send that. 3) Send everything else encrypted with the private key.
So increasing the size of the public key message doesn't matter much.
What about #defines and // comments?
IIRC, patents today last 20 years from the initial application; in the past they lasted 17 years from when the patent was granted; it usually took 3 years to process the patent, but some people deliberately slow up the process so that the patent would last longer. So patents have really grown shorter.
I think referrer filtering would block that attack.
<>
Wrong; to be in NP, it is only necessary that the solution can be verified in polynomial time; every problem in P is also in NP. You may have been thinking of NP-complete.
Galeon has this behavior.
slashdot puts in occasional spaces to prevent people from adding overwide lines to pages.
Unfortunately, one assumption at the beginning, that the cascading model is best-case performance for BitTorrent, is completely wrong. It's actually worst-case performance.
A scattered model gives BT as taking O(log(number of people)/(number of chunks) + 1) time for everyone to download the whole file instead of O(sqrt(number people)) as claimed in the article.
What, don't you remember Tuxissa?
I believe the reason for that bug is as follows:
If a page has a single line which is wider than the browser windows, then every line on that page will expand to that width, which forces the reader to scroll horizontally and back every single line, which is very annoying.
Slashdot avoids this by simply adding a space every N characters. This could be better done by having it add a space if there are N consecutive nonspace characters, but it is done for good reason.
The script for the second Buckaroo Bonzai movie was later worked into _Big Trouble in Little China_.
<in Java, a method is virtual unless declared non-virtual>>
That's not necessarily true in Java; I've heard the HotSpot VM has some tricks so that a method is non-virtual unless it is overridden by a class which has been loaded.
<>
Spammers flock to your ISP. SPEWS adds your ISP to its blacklist. Large numbers of your emails are dropped. Your clients flee.
There was a British TV series called _Danger UXB_ (unexploded bomb) which shows quite a bit of the techniques & technologies used by the defusers.
On a single CPU computer, yes. What about on an SMP computer?
According to the article, compilers will pad out the size of structs to be a multiple of the word size. When that's done, copying one padded struct to another will cause the compiler to put in code for uninitialized reads into the end product.
Gee... I'm using Galeon (which I believe is mozilla based) on a P200 without problem.
Supply is based partly on production cost, so production cost does affect price.
Mononoke Hime is their sole Miyazaki- nary a Totoro even.
Considering that Netflix only handles DVDs, and there is a notable shortage of Miyazaki on region 1 DVD (IIRC, MH, Castle of Cagliostro, and Sherlock Hound), this shouldn't be too surprising. And they do carry CoC.
The difference is simple:
In the case of letterbox movies, the black bars are there because there was nothing there in the original film.
In the case of TNN's showings, it appears from other comments (I've never watched that channel myself) that it covers up picture that was in the original broadcast.
<>
He was mentioned by the cloners as the one who hired Jango Fett.
How about...
The camera will be pointed towards the outside of the vehicle, so the sender has to stand out in the rain while transmitting.
Remember divx?
I think Voltron involved joining two unrelated series (Go-Lion and Dairugger XV, IIRC).
No, there are languages which are sub-Turing complete. Bloop (described in GEB) is the first one to come to mind.
Because symmetric encryption is much faster than asymmetric encryption, when public keys are used, the method generally goes like this:
1) Randomly generate a key (called the session key) for a private-key algorithm.
2) Encrypt the session key with the public key algorithm and send that.
3) Send everything else encrypted with the private key.
So increasing the size of the public key message doesn't matter much.
In addition to your point, I believe that abandoned property legally belongs to anyone who claims it.