Andrea Lincoln

Learn More
OBJECTIVE To determine whether narrative text in safety reports contains sufficient information regarding contributing factors and precipitating mechanisms to prioritize occupational back injury prevention strategies.Design, setting, subjects, and MAIN OUTCOME MEASURES Nine essential data elements were identified in narratives and coded sections of safety(More)
Given a set of numbers, the k-SUM problem asks for a subset of k numbers that sums to zero. When the numbers are integers, the time and space complexity of k-SUM is generally studied in the word-RAM model; when the numbers are reals, the complexity is studied in the real-RAM model, and space is measured by the number of reals held in memory at any point. We(More)
Objective: To determine whether narrative text in safety reports contains sufficient information regarding contributing factors and precipitating mechanisms to prioritize occupational back injury prevention strategies. Design, setting, subjects, and main outcome measures: Nine essential data elements were identified in narratives and coded sections of(More)
Memory efficiency and locality have substantial impact on the performance of programs, particularly when operating on large data sets. Thus, memory- or I/O-efficient algorithms have received significant attention both in theory and practice. The widespread deployment of multicore machines, however, brings new challenges. Specifically, since the memory (RAM)(More)
Using 20.7 pb(-1) of e(+)e(-) annihilation data taken at sq.rt(r) = 3.671 GeV with the CLEO-c detector, precision measurements of the electromagnetic form factors of the charged pion, charged kaon, and proton have been made for timelike momentum transfer of |Q(2)| = 13.48 GeV(2) by the reaction e(+)e(-) --> h(+)h(-). The measurements are the first ever with(More)
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast(More)
In this paper we show how linear network coding can reduce the number of queries needed to retrieve one specific message among k distinct ones replicated across a large number of randomly accessed nodes storing one message each. Without network coding, this would require k queries on average. After proving that no scheme can perform better than a(More)