The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.     

Linking air quality and watershed models for environmental assessments: Analysis of the effects of model-specific precipitation estimates on calculated water flux

Directly linking air quality and watershed models could provide an effective method for estimating spatially-explicit inputs of atmospheric contaminants to watershed biogeochemical models. However, to adequately link air and watershed models for wet deposition estimates, each model’s temporal and spatial representation of precipitation needs to be consistent. We explore how precipitation implemented within the Community Multi-Scale Air Quality Model (CMAQ) model algorithms, and multiple spatially-explicit precipitation datasets that could be used to improve the CMAQ model deposition estimates, links with the standard precipitation sources used to calibrate watershed models (i.e., rain gage data) via modeled water fluxes. Simulations are run using a grid-based watershed mercury model (GBMM) in two watersheds. Modeled monthly runoff suggests that multiple resolution Parameter-elevations Regressions on Independent Slopes Model (PRISM) and National Multi-sensor Precipitation Analysis Stage IV (NPA) data generate similar monthly runoff estimates, with comparable or greater accuracy when evaluated against stream gage data than that produced by the base rain gage data. However, across longer time periods, simulated water balances using 36 km Pennsylvania State University/National Center for Atmospheric Research mesoscale model (MM5) data are similar to that of base data. The investigation also examines the implications our results, providing suggestions for linking air quality and watershed fate and transport models.     

Comparing measures of model selection for penalized splines in Cox models

This article presents an application and a simulation study of model fit criteria for selecting the optimal degree of smoothness for penalized splines in Cox models. The criteria considered were the Akaike information criterion, the corrected AIC, two formulations of the Bayesian information criterion, and a generalized cross-validation method. The estimated curves selected by the five methods were compared to each other in a study of rectal cancer mortality in autoworkers. In the stimulation study, we estimated the fit of the penalized spline models in six exposure-response scenarios, using the five model fit criteria. The methods were compared on the basis of a mean squared error score and the power and size of hypothesis tests for any effect and for detecting nonlinearity. All comparisons were made across a range in the total sample size and number of cases.     

alt.metadata.health: Ontological Context for Data Use and Integration

Increasingly powerful computers and increased emphasis on evidence based decision making are creating a demand for merging and integrating data from different sources into a single data set. The demand for data is outstripping our ability to ensure data integrity, and sometimes analysis is performed on data that are not appropriate for the purposes they are used for. Here we describe problems that arise when data from different sources are merged, and we suggest that one way to add context to data so that users can make informed decisions about their ontological context is through ontology-based metadata. Examples of the problem are taken from health data with emphasis on difficulties in standardizing Emergency Room wait times. We describe eight fields that can be used to capture contextual metadata. These fields are captured using ethnographic methods from users and database stewards who frequently understand precisely how context and institutional usage have shaped interpretation of semantic fields. We argue that attaching a portable archive of ontological context to travel with data—based on information from users and developers—is a means of ensuring that data are integrated and compared in multiple contexts with greater integrity and more robust results.

Universal constructions that ensure disjoint-access parallelism and wait-freedom

A universal construction is a general mechanism for obtaining a concurrent implementation of an object from its sequential code. We show that there is no universal construction that is both disjoint-access parallel (guaranteeing the processes operating on different parts of an implemented object do not interfere with one another) and wait-free (guaranteeing progress for each nonfaulty process when accessing an object). In contrast, we present a universal construction which results in disjoint-access parallel, wait-free implementations of any object provided there is a bound on the number of data items accessed by each operation supported by the object.     

Test-retest reliability of Purdue Pegboard performance in thermoneutral and cold ambient conditions

In the cold, Purdue Pegboard (PP) performance declines. The purpose of this study was to determine if this cold-induced impairment is consistent across days (i.e. test-retest reliability) in 5°C. In thermoneutral air (25°C), 14 men were familiarised to the dominant hand (PPa) and bimanual (PPb) PP tasks. They then experienced two 90-min cold exposures (Day 1, Day 2) while wearing ～1 clo. Bare hands were maintained throughout. Performance on both tasks showed high reliability from day to day (intraclass correlations >0.700) in both thermoneutral and cold conditions. However for both tasks, room temperature performance did not predict performance in the cold (intraclass correlations <0.450). When screening applicants for manual labour in the cold, one must consider that room temperature dexterity does not correlate with dexterity in the cold. It is recommended that a 60-min period of cold exposure be employed to assess manual dexterity in these workers. STATEMENT OF RELEVANCE: This study shows that PP performance in room temperature does not predict performance in the cold but performance in the cold is consistent from day to day. When screening applicants for manual labour in the cold, it is recommended that dexterity tests be conducted in the same ambient conditions.     

Optimization of Geoscience Laser Altimeter System waveform metrics to support vegetation measurements

The Geoscience Laser Altimeter System (GLAS) has collected over 250 million measurements of vegetation height over forests globally. Accurate vegetation heights can be determined using waveform metrics that include vertical extent and extent of the waveform's trailing and leading edges. All three indices are highly dependent upon the signal strength, background noise and signal-to-noise ratio of the waveform, as the background noise contribution to the waveforms has to be removed before their calculation. Over the last six years, GLAS has collected data during thirteen observation periods using illumination from three different lasers. The power levels of these lasers have changed over time, resulting in variable signal power and noise characteristics. Atmospheric conditions vary continuously, also influencing signal power and noise.To minimize these effects, we optimized a noise coefficient which could be constant or vary according to observation period or noise metric. This parameter is used with the mean and standard deviation of the background noise to determine a noise level threshold that is removed from each waveform. An optimization analysis was used with a global dataset of waveforms that are near-coincident with waveforms from other observation periods; the goal of the optimization was to minimize the difference in vertical extent between spatially overlapping GLAS observations. Optimizations based on absolute difference in height led to situations in which the total extent was minimized as well; further optimizations reduced a normalized difference in height extent. The simplest optimizations were based on a constant value to be applied to all observations; noise coefficients of 2.7, 3.2, 3.4 and 4.0 were determined for datasets consisting of global forests, global vegetation, forest in the legal Amazon basin and boreal forests respectively. Optimizations based on the power level or the signal-to-noise ratio of waveforms best minimized differences in waveform extent, decreasing the percent root mean squared height difference by 25-54% over the constant value approach. Further development of methods to ensure temporal consistency of waveform indices will be necessary to support long-term satellite lidar missions and will result in more accurate and precise estimates of canopy height.     

Fully-adaptive algorithms for long-lived renaming

Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations. The first algorithm is asynchronous, uses LL/SC objects, and has step complexity that is linear in the number of processes, c, currently getting or releasing a name. The second is synchronous, uses registers and counters, and has step complexity that is polylogarithmic in c. Both tolerate any number of process crashes.