Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!

 



Forgot your password?
typodupeerror
×

Comment Re:Did MY Tax Dollars Pay for This? (Score 1) 426

I believe such monuments are usually funded by subscription by private organizations; and I find evidence that such is the case for this Memorial. So, NO, your tax dollars did not pay for this, though it is on public land; I do not know if the Federal government maintains the site or a private organization does so (as is the case with e.g. Monticello).

Comment Data Structures, Algorithms, and Design Patterns (Score 1) 293

Savitch's book is superb as a textbook. You won't find many other books that are that good. The two things I'd suggest learning about are data structures/algorithms and design patterns. For the former, there are a lot of text books, but the good ones are advanced and expensive (for instance, Cormen, Leiserson & Rivest, *Introduction to Algorithms*), and the inexpensive ones are poorly written. You might try the O'Reilly book "Algorithms in a Nutshell*. For the latter, there are a number of books - a good intro book is *Head First Design Patterns*; the book of books is the so-called Gang of Four book that introduced the idea, *Design Patterns* by Gamma, Helm, Johnson, and Vlissides.

Comment Re:Regime Change Now (Score 1) 436

Yes, but it needs to happen without our "help." you can't force democracy down someone's throat at the point of a gun (Germany and Japan are exceptions, as the occupations of those countries were justified in the minds of their citizens by the nature of the conflict). Read @oxfordgirl on Twitter to get some idea of how pro-Western, secularist Iranian Greens feel about our "help."

Comment Re:Can someone explain this to me? (Score 1) 192

RSA uses semiprimes - numbers with only two prime factors. If you know the factors p and q, you can derive the private key from the public key through multiplication mod (p-1)(q-1). There are much faster ways to factorize numbers than brute force - the best is the general number field sieve. It is Diffie-Hellman which uses discrete logs. There are better attacks against discrete logs than brute force, too. Once we have sufficiently powerful quantum computers, both the factorization problem and the discrete log problem will be made trivial by Schor's algorithm.

Slashdot Top Deals

He has not acquired a fortune; the fortune has acquired him. -- Bion

Working...