Berkeley CSUA MOTD:Entry 22103
Berkeley CSUA MOTD
 
WIKI | FAQ | Tech FAQ
http://csua.com/feed/
2025/05/24 [General] UID:1000 Activity:popular
5/24    

2001/8/13-14 [Computer/SW/Languages, Computer/SW/WWW/Browsers, Computer/SW/Virus] UID:22103 Activity:high Edit_by:auto 50%like:22116
8/13    What are some of nweaver's cool hidden links under
        http://www.cs.berkeley.edu/~nweaver  ???
        \_ http://www.cs.berkeley.edu/~nweaver/girlz
           \_ Goddamn!  The boy has exceptionally good taste!
           \_ "UCB CS: File not Found"
                \_ Sorry, the department made me take down the
                   HOT WET NEKKED BABES OF CS PAGE.  -nweaver
                   \_ Man, Yelick must've been pissed when she found out you
                      had that shot of her....
                   \_ do you have any of Jane Yen or Allison Coates?
        \_ "let us assume that 1 million machines are vulnerable a particular"
                                                             \_ ^to
        \_ Where's the "Computer Scientists are Artisans, Industry SUX"
           link and the "We're vulnerable to computer virus" link?
Cache (2004 bytes)
www.cs.berkeley.edu/~nweaver -> www.cs.berkeley.edu/~nweaver/
This paper: "The SFRA: A Corner Turn FPGA Architecture", while my whole thesis is 10 here. My JobTalk #1/semitar talk on FPGAs: 11 The SFRA: A Fixed Frequency FPGA Architecture. Abstract: Conventional FPGAs utilize design dependant clocking, where a design is mapped and routed before the clock rate is determined. The alternate, a fixed-frequency architecture, utilizes a fixed clock rate where all designs are automatically remapped to the target array, running at the target clock. Thus, for throughput bound tasks the resulting design is guaranteed to run at the target frequency. Unlike previous architectures, it is largely placement and tool compatible with a conventional FPGA architecture, enabling high performance, pipeline operation while maintaining a large degree of compatibility. It also becomes possible to directly compare the new interconnect topology with a conventional FPGA on a series of representitive benchmark designs. My JobTalk #2/seminar talk on Worms: 12 How Many Ways to 0wn the Internet. Abstract: Computer worms, autonomous programs which can spread through a computer network, represent a substantial threat to our computing infrastructure. With the release of Sapphire/Slammer, very fast computer worms are now a real, not theoretical threat. Any robust defense will require automatic detection, analysis, and response mechanisms. To create these defenses, we first must understand the strategies attackers could employ. Fortunately, there seem to be only a few mechanisms which worms can use to find new targets: random selection, external, pregenerated, and internal target lists, and passive techniques. Some of these techniques have been used before, while others represent novel strategies. Understanding these techniques, it becomes possible to construct detectors, analysis tools, and response mechanisms. We then discuss in detail one of our proposed detector/analysis system, wormholes and a honeyfarm. This detector would be highly sensitive to worm activity.
Cache (110 bytes)
www.cs.berkeley.edu/~nweaver/girlz
Your Name : *Your Email Address : The problem URL : The referring URL : *Message : Send 22 Questions/Comments?