Issue includes: Humanitech; Code and Sound; Tweeting Your Way To Hell; Computing and Music Spawn New Opportunities; Where'd All the Girls Go?!; Save the Freshmen.

Issue includes: Four Tips to Triumphing In CS 13XX; Being a Teaching Assistant (TA); Cool As "Ice"; Headfirst Into Research; Layman's Guide to the Curriculum; Resume 101; Barcelona; Cocaesar's Palace; College Football; Charity

In this work, we study a fundamental tradeoff issue in designing dynamic hash table (DHT) in peer-to-peer networks: the size of the routing table v.s. the network diameter. It was observed in Ratnasamy et al. that existing ...

This report presents the results from various barrier implementations on the IHPCL clusters - beetle and danish. It also presents the results from the NAS parallel benchmarks run on these clusters.

Modern databases which manage lazy (or deferred updates) to clients which subscribe to replicated data do so on a client-by-client basis. They ignore any redundant work done during update processing caused by the ...

Given a graph G with its adjacency matrix A, consider the matrix A(x, y) in which the 1s are replaced by the indeter0minate x and 0s (other than the diagonals) are replaced by y. The ℒ-polynomial of G is defined ...

This paper presents provably correct algorithms for computing the outcome of the BGP route-selection process for each router in a network, without simulating the complex details of BGP message passing. The algorithms ...

Many software security solutions—including malware analyzers, information flow tracking systems, auditing utilities, and host-based intrusion detectors—rely on knowledge of standard system call interfaces to reason about ...