Cancer mortality in IBM endicott plant workers, 1969-2001: An update on a NY production plant

BACKGROUND: In response to concerns expressed by workers at a public meeting, we analyzed the mortality experience of workers who were employed at the IBM plant in Endicott, New York and died between 1969-2001. An epidemiologic feasibility assessment indicated potential worker exposure to several known and suspected carcinogens at this plant. METHODS: We used the mortality and work history files produced under a court order and used in a previous mortality analysis. Using publicly available data for the state of New York as a standard of comparison, we conducted proportional cancer mortality (PCMR) analysis. RESULTS: The results showed significantly increased mortality due to melanoma (PCMR = 367; 95% CI: 119, 856) and lymphoma (PCMR = 220; 95% CI: 101, 419) in males and modestly increased mortality due to kidney cancer (PCMR = 165; 95% CI: 45, 421) and brain cancer (PCMR = 190; 95% CI: 52, 485) in males and breast cancer (PCMR = 126; 95% CI: 34, 321) in females. CONCLUSION: These results are similar to results from a previous IBM mortality study and support the need for a full cohort mortality analysis such as the one being planned by the National Institute for Occupational Safety and Health.

Participant experiences in a breastmilk biomonitoring study: A qualitative assessment.

BACKGROUND: Biomonitoring studies can provide information about individual and population-wide exposure. However they must be designed in a way that protects the rights and welfare of participants. This descriptive qualitative study was conducted as a follow-up to a breastmilk biomonitoring study. The primary objectives were to assess participants' experiences in the study, including the report-back of individual body burden results, and to determine if participation in the study negatively affected breastfeeding rates or duration. METHODS: Participants of the Greater Boston PBDE Breastmilk Biomonitoring Study were contacted and asked about their experiences in the study: the impact of study recruitment materials on attitudes towards breastfeeding; if participants had wanted individual biomonitoring results; if the protocol by which individual results were distributed met participants' needs; and the impact of individual results on attitudes towards breastfeeding. RESULTS: No participants reported reducing the duration of breastfeeding because of the biomonitoring study, but some responses suggested that breastmilk biomonitoring studies have the potential to raise anxieties about breastfeeding. Almost all participants wished to obtain individual results. Although several reported some concern about individual body burden, none reported reducing the duration of breastfeeding because of biomonitoring results. The study literature and report-back method were found to mitigate potential negative impacts. CONCLUSION: Biomonitoring study design, including clear communication about the benefits of breastfeeding and the manner in which individual results are distributed, can prevent negative impacts of biomonitoring on breastfeeding. Adoption of more specific standards for biomonitoring studies and continued study of risk communication issues related to biomonitoring will help protect participants from harm.

A General Theory of Semi-Unification

Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general case of semi-unification where substitutions are allowed on non-regular terms, and we prove the equivalence of this general case to a well-known undecidable data base dependency problem, thus establishing the undecidability of general semi-unification. We present a unified way of looking at the various problems of semi-unification. We give some properties that are common to all the cases of semi-unification. We also the principality property and the solution set for those problems. We prove that semi-unification on general terms has the principality property. Finally, we present a recursive inseparability result between semi-unification on regular terms and semi-unification on general terms.

On trip planning queries in spatial databases

In this paper we discuss a new type of query in Spatial Databases, called Trip Planning Query (TPQ). Given a set of points P in space, where each point belongs to a category, and given two points s and e, TPQ asks for the best trip that starts at s, passes through exactly one point from each category, and ends at e. An example of a TPQ is when a user wants to visit a set of different places and at the same time minimize the total travelling cost, e.g. what is the shortest travelling plan for me to visit an automobile shop, a CVS pharmacy outlet, and a Best Buy shop along my trip from A to B? The trip planning query is an extension of the well-known TSP problem and therefore is NP-hard. The difficulty of this query lies in the existence of multiple choices for each category. In this paper, we first study fast approximation algorithms for the trip planning query in a metric space, assuming that the data set fits in main memory, and give the theory analysis of their approximation bounds. Then, the trip planning query is examined for data sets that do not fit in main memory and must be stored on disk. For the disk-resident data, we consider two cases. In one case, we assume that the points are located in Euclidean space and indexed with an Rtree. In the other case, we consider the problem of points that lie on the edges of a spatial network (e.g. road network) and the distance between two points is defined using the shortest distance over the network. Finally, we give an experimental evaluation of the proposed algorithms using synthetic data sets generated on real road networks.