Urinary naphthalene and phenanthrene as biomarkers of occupational exposure to polycyclic aromatic hydrocarbons.

OBJECTIVES: The study investigated the utility of unmetabolised naphthalene (Nap) and phenanthrene (Phe) in urine as surrogates for exposures to mixtures of polycyclic aromatic hydrocarbons (PAHs). METHODS: The report included workers exposed to diesel exhausts (low PAH exposure level, n = 39) as well as those exposed to emissions from asphalt (medium PAH exposure level, n = 26) and coke ovens (high PAH exposure level, n = 28). Levels of Nap and Phe were measured in urine from each subject using head space-solid phase microextraction and gas chromatography-mass spectrometry. Published levels of airborne Nap, Phe and other PAHs in the coke-producing and aluminium industries were also investigated. RESULTS: In post-shift urine, the highest estimated geometric mean concentrations of Nap and Phe were observed in coke-oven workers (Nap: 2490 ng/l; Phe: 975 ng/l), followed by asphalt workers (Nap: 71.5 ng/l; Phe: 54.3 ng/l), and by diesel-exposed workers (Nap: 17.7 ng/l; Phe: 3.60 ng/l). After subtracting logged background levels of Nap and Phe from the logged post-shift levels of these PAHs in urine, the resulting values (referred to as ln(adjNap) and ln(adjPhe), respectively) were significantly correlated in each group of workers (0.71 < or = Pearson r < or = 0.89), suggesting a common exposure source in each case. Surprisingly, multiple linear regression analysis of ln(adjNap) on ln(adjPhe) showed no significant effect of the source of exposure (coke ovens, asphalt and diesel exhaust) and further suggested that the ratio of urinary Nap/Phe (in natural scale) decreased with increasing exposure levels. These results were corroborated with published data for airborne Nap and Phe in the coke-producing and aluminium industries. The published air measurements also indicated that Nap and Phe levels were proportional to the levels of all combined PAHs in those industries. CONCLUSION: Levels of Nap and Phe in urine reflect airborne exposures to these compounds and are promising surrogates for occupational exposures to PAH mixtures.

Factorization in the Cloud: Integer Factorization Using F# and Windows Azure

Implementations are presented of two common algorithms for integer factorization, Pollard’s “p – 1” method and the SQUFOF method. The algorithms are implemented in the F# language, a functional programming language developed by Microsoft and officially released for the first time in 2010. The algorithms are thoroughly tested on a set of large integers (up to 64 bits in size), running both on a physical machine and a Windows Azure machine instance. Analysis of the relative performance between the two environments indicates comparable performance when taking into account the difference in computing power. Further analysis reveals that the relative performance of the Azure implementation tends to improve as the magnitudes of the integers increase, indicating that such an approach may be suitable for larger, more complex factorization tasks. Finally, several questions are presented for future research, including the performance of F# and related languages for more efficient, parallelizable algorithms, and the relative cost and performance of factorization algorithms in various environments, including physical hardware and commercial cloud computing offerings from the various vendors in the industry.

Changes in Web Client Access Patterns: Characteristics and Caching Implications

Understanding the nature of the workloads and system demands created by users of the World Wide Web is crucial to properly designing and provisioning Web services. Previous measurements of Web client workloads have been shown to exhibit a number of characteristic features; however, it is not clear how those features may be changing with time. In this study we compare two measurements of Web client workloads separated in time by three years, both captured from the same computing facility at Boston University. The older dataset, obtained in 1995, is well-known in the research literature and has been the basis for a wide variety of studies. The newer dataset was captured in 1998 and is comparable in size to the older dataset. The new dataset has the drawback that the collection of users measured may no longer be representative of general Web users; however using it has the advantage that many comparisons can be drawn more clearly than would be possible using a new, different source of measurement. Our results fall into two categories. First we compare the statistical and distributional properties of Web requests across the two datasets. This serves to reinforce and deepen our understanding of the characteristic statistical properties of Web client requests. We find that the kinds of distributions that best describe document sizes have not changed between 1995 and 1998, although specific values of the distributional parameters are different. Second, we explore the question of how the observed differences in the properties of Web client requests, particularly the popularity and temporal locality properties, affect the potential for Web file caching in the network. We find that for the computing facility represented by our traces between 1995 and 1998, (1) the benefits of using size-based caching policies have diminished; and (2) the potential for caching requested files in the network has declined.

Load Balancing a Cluster of Web Servers using Distributed Packet Rewriting

In this paper, we propose and evaluate an implementation of a prototype scalable web server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP addresses are advertised using the Round Robin DNS technique, allowing any host to receive requests from any client. Once a client attempts to establish a TCP connection with one of the hosts, a decision is made as to whether or not the connection should be redirected to a different host---namely, the host with the lowest number of established connections. We use the low-overhead Distributed Packet Rewriting (DPR) technique to redirect TCP connections. In our prototype, each host keeps information about connections in hash tables and linked lists. Every time a packet arrives, it is examined to see if it has to be redirected or not. Load information is maintained using periodic broadcasts amongst the cluster hosts.

BU Computer Science 1998 Proxy Trace: Release Notes

In a recent paper (Changes in Web Client Access Patterns: Characteristics and Caching Implications by Barford, Bestavros, Bradley, and Crovella) we performed a variety of analyses upon user traces collected in the Boston University Computer Science department in 1995 and 1998. A sanitized version of the 1995 trace has been publicly available for some time; the 1998 trace has now been sanitized, and is available from: http://www.cs.bu.edu/techreports/1999-011-usertrace-98.gz ftp://ftp.cs.bu.edu/techreports/1999-011-usertrace-98.gz This memo discusses the format of this public version of the log, and includes additional discussion of how the data was collected, how the log was sanitized, what this log is and is not useful for, and areas of potential future research interest.