Abstract This study applied the Model of Acidification

of Groundwater in Catchments (MAGIC) to estimate the sensitivity of 66 watersheds in the Southern Blue Ridge Province of the Southern Appalachian Mountains, United States, to changes in atmospheric sulfur (S) deposition. MAGIC predicted that stream acid neutralizing capacity (ANC) values were above 20 μeq/L in all modeled watersheds in 1860. Hindcast simulations suggested that the media

Modular termination verification for non-blocking concurrency

© Springer-Verlag Berlin Heidelberg 2016.We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: that such programs both terminate and produce the correct result. With Total-TaDA, we can specify constraints on a thread’s concurrent environment that are necessary to guarantee termination. This allows us to verify total correctness for nonblocking algorithms, e.g. a counter and a stack. Our specifications can express lock- and wait-freedom. More generally, they can express that one operation cannot impede the progress of another, a new non-blocking property we call non-impedance. Moreover, our approach is modular. We can verify the operations of a module independently, and build up modules on top of each other

Scalable Manufacture of Built-to-Order Nanomedicine: Spray-Assisted Layer-by-Layer Functionalization of PRINT Nanoparticles

Scalable methods, PRINT particle fabrication, and spray-assisted Layer-by-Layer deposition are combined to generate uniform and functional nanotechnologies with precise control over composition, size, shape, and surface functionality. A modular and tunable approach towards design of built-to-order nanoparticle systems, spray coating on PRINT particles is demonstrated to achieve technologies capable of targeted interactions with cancer cells for applications in drug delivery.National Cancer Institute (U.S.) (Center for Cancer Nanotechnology Excellence Grant 5 U54 CA151884-02)National Science Foundation (U.S.). Graduate Research FellowshipNatural Sciences and Engineering Research Council of Canada (Postdoctoral Fellowship

Faster linearizability checking via PP-compositionality

Linearizability is a well-established consistency and correctness criterion for concurrent data types. An important feature of linearizability is Herlihy and Wing's locality principle, which says that a concurrent system is linearizable if and only if all of its constituent parts (so-called objects) are linearizable. This paper presents $P$-compositionality, which generalizes the idea behind the locality principle to operations on the same concurrent data type. We implement $P$-compositionality in a novel linearizability checker. Our experiments with over nine implementations of concurrent sets, including Intel's TBB library, show that our linearizability checker is one order of magnitude faster and/or more space efficient than the state-of-the-art algorithm.Comment: 15 pages, 2 figure

Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs

Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multi-core computing in the context of deadlock resolution

Constraining Absolute Plate Motions Since the Triassic

The absolute motion of tectonic plates since Pangea can be derived from observations of hotspot trails, paleomagnetism, or seismic tomography. However, fitting observations is typically carried out in isolation without consideration for the fit to unused data or whether the resulting plate motions are geodynamically plausible. Through the joint evaluation of global hotspot track observations (for times <80 Ma), first‐order estimates of net lithospheric rotation (NLR), and parameter estimation for paleo–trench migration (TM), we present a suite of geodynamically consistent, data‐optimized global absolute reference frames from 220 Ma to the present. Each absolute plate motion (APM) model was evaluated against six published APM models, together incorporating the full range of primary data constraints. Model performance for published and new models was quantified through a standard statistical analyses using three key diagnostic global metrics: root‐mean square plate velocities, NLR characteristics, and TM behavior. Additionally, models were assessed for consistency with published global paleomagnetic data and for ages <80 Ma for predicted relative hotspot motion, track geometry, and time dependence. Optimized APM models demonstrated significantly improved global fit with geological and geophysical observations while performing consistently with geodynamic constraints. Critically, APM models derived by limiting average rates of NLR to ~0.05°/Myr and absolute TM velocities to ~27‐mm/year fit geological observations including hotspot tracks. This suggests that this range of NLR and TM estimates may be appropriate for Earth over the last 220 Myr, providing a key step toward the practical integration of numerical geodynamics into plate tectonic reconstructions

Target loads of atmospheric sulfur and nitrogen deposition for protection of acid sensitive aquatic resources in the Adirondack Mountains, New York

The dynamic watershed acid-base chemistry model of acidification of groundwater in catchments (MAGIC) was used to calculate target loads (TLs) of atmospheric sulfur and nitrogen deposition expected to be protective of aquatic health in lakes in the Adirondack ecoregion of New York. The TLs were calculated for two future dates (2050 and 2100) and three levels of protection against lake acidification (acid neutralizing capacity (ANC) of 0, 20, and 50 μeq L⁻¹). Regional sulfur and nitrogen deposition estimates were combined with TLs to calculate exceedances. Target load results, and associated exceedances, were extrapolated to the regional population of Adirondack lakes. About 30% of Adirondack lakes had simulated TL of sulfur deposition less than 50 meq m⁻² yr to protect lake ANC to 50 μeq L⁻¹. About 600 Adirondack lakes receive ambient sulfur deposition that is above this TL, in some cases by more than a factor of 2. Some critical criteria threshold values were simulated to be unobtainable in some lakes even if sulfur deposition was to be decreased to zero and held at zero until the specified endpoint year. We also summarize important lessons for the use of target loads in the management of acid-impacted aquatic ecosystems, such as those in North America, Europe, and Asia