As part of implementing the many products and services offered by Google, we have built a collection of systems and tools that simplify the storing and processing of large-scale data sets, and the construction of heavily-used public services based on these data sets. These systems are intended to work well in Google's computational environment, which consists of large numbers of commodity machines connected by commodity networking hardware. Our systems handle issues like storage reliability and availability in the face of machine failures, and our processing tools make it relatively easy to write robust computations that run reliably and efficiently on thousands of machines. In this talk I'll highlight some of the systems we have built, and discuss some challenges and future directions for new systems.
Vortragsabend der GI/ACM-Regionalgruppe Karlsruhe
The experience of the Lawrence Berkeley Laboratory in tracking an intruder suggests that any operating system is insecure when obvious security rules are ignored. How a site should respond to an intrusion, whether it is possible to trace an intruder trying to evade detection, what can be learned from tracking an intruder, what methods the intruder used, and the responsiveness of the law-enforcement community are also discussed.
I cannot link directly because their html ist totally broken.
"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. PDF reprint of: CACM 21/2, pp. 120-126 » . The original paper on RSA (and the birth of Alice and Bob).
LaTeX reprint of: CACM 3/4, pp. 184-195 » . It is the original paper on Lisp. (BTW: Part II was never published.)
Reprinted from: The Bell System Technical Journal 57 no. 6, part 2 (July-August 1978), which is a revised version of: CACM 17/7, pp. 365-375 » .
the acm student magazine.
Reprinted from: CACM 27/8, pp. 761-763 » .
