Protecting File Systems with Transient Authentication

Laptops are vulnerable to theft, greatly increasing the likelihood of exposing sensitive files. Unfortunately, storing data in a cryptographic file system does not fully address this problem. Such systems ask the user to imbue them with long-term authority for decryption, but that authority can be used by anyone who physically possesses the machine. Forcing the user to frequently reestablish his identity is intrusive, encouraging him to disable encryption.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41362/1/11276_2004_Article_5384743.pd

Emergence of a Small-World Functional Network in Cultured Neurons

The functional networks of cultured neurons exhibit complex network properties similar to those found in vivo. Starting from random seeding, cultures undergo significant reorganization during the initial period in vitro, yet despite providing an ideal platform for observing developmental changes in neuronal connectivity, little is known about how a complex functional network evolves from isolated neurons. In the present study, evolution of functional connectivity was estimated from correlations of spontaneous activity. Network properties were quantified using complex measures from graph theory and used to compare cultures at different stages of development during the first 5 weeks in vitro. Networks obtained from young cultures (14 days in vitro) exhibited a random topology, which evolved to a small-world topology during maturation. The topology change was accompanied by an increased presence of highly connected areas (hubs) and network efficiency increased with age. The small-world topology balances integration of network areas with segregation of specialized processing units. The emergence of such network structure in cultured neurons, despite a lack of external input, points to complex intrinsic biological mechanisms. Moreover, the functional network of cultures at mature ages is efficient and highly suited to complex processing tasks

RADVAN: a randomised phase 2 trial of WBRT plus vandetanib for melanoma brain metastases - results and lessons learnt

BACKGROUND: Brain metastases occur in up to 75% of patients with advanced melanoma. Most are treated with whole-brain radiotherapy (WBRT), with limited effectiveness. Vandetanib, an inhibitor of vascular endothelial growth factor receptor, epidermal growth factor receptor and rearranged during transfection tyrosine kinases, is a potent radiosensitiser in xenograft models. We compared WBRT with WBRT plus vandetanib in the treatment of patients with melanoma brain metastases. METHODS: In this double-blind, multi-centre, phase 2 trial patients with melanoma brain metastases were randomised to receive WBRT (30 Gy in 10 fractions) plus 3 weeks of concurrent vandetanib 100 mg once daily or placebo. The primary endpoint was progression-free survival in brain (PFS brain). The main study was preceded by a safety run-in phase to confirm tolerability of the combination. A post-hoc analysis and literature review considered barriers to recruiting patients with melanoma brain metastases to clinical trials. RESULTS: Twenty-four patients were recruited, six to the safety phase and 18 to the randomised phase. The study closed early due to poor recruitment. Median PFS brain was 3.3 months (90% confidence interval (CI): 1.6-5.6) in the vandetanib group and 2.5 months (90% CI: 0.2-4.8) in the placebo group (P=0.34). Median overall survival (OS) was 4.6 months (90% CI: 1.6-6.3) and 2.5 months (90% CI: 0.2-7.2), respectively (P=0.54). The most frequent adverse events were fatigue, alopecia, confusion and nausea. The most common barrier to study recruitment was availability of alternative treatments. CONCLUSIONS: The combination of WBRT plus vandetanib was well tolerated. Compared with WBRT alone, there was no significant improvement in PFS brain or OS, although we are unable to provide a definitive result due to poor accrual. A review of barriers to trial accrual identified several factors that affect study recruitment in this difficult disease area

The Case for Transient Authentication

How does a machine know who is using it? Currently, systems assume that the user typing now is the same person who supplied a password days ago. Such persistent authentication is inappropriate for mobile and ubiquitous systems, because associations between people and devices are fleeting. To address this, we propose transient authentication. In this model, a user wears a small hardware token that authenticates the user to other devices over a short-range, wireless link. This paper presents the four principles of transient authentication, our experience applying the model to a cryptographic file system, and our plans for extending the model to other services and applications

Zero-Interaction Authentication

Laptops are vulnerable to theft, greatly increasing the likelihood of exposing sensitive files. Unfortunately, storing data in a cryptographic file system does not fully address this problem. Such systems ask the user to imbue them with long-term authority for decryption, but that authority can be used by anyone who physically possesses the machine. Forcing the user to frequently reestablish his identity is intrusive, encouraging him to disable encryption

Flux: A Language for Programming High-Performance Servers

Programming high-performance server applications is challenging: it is both complicated and error-prone to write the concurrent code required to deliver high performance and scalability. Server performance bottlenecks are difficult to identify and correct. Finally, it is difficult to predict server performance prior to deployment. This paper presents Flux, a language that dramatically simplifies the construction of scalable high-performance server applications. Flux lets programmers compose offthe- shelf, sequential C or C++ functions into concurrent servers. Flux programs are type-checked and guaranteed to be deadlock-free. We have built a number of servers in Flux, including a web server with PHP support, an image-rendering server, a BitTorrent peer, and a game server. These Flux servers match or exceed the performance of their counterparts written entirely in C. By tracking hot paths through a running server, Flux simplifies the identification of performance bottlenecks. The Flux compiler also automatically generates discrete event simulators that accurately predict actual server performance under load and with different hardware resources