Skill assessment of multiple hypoxia models in Chesapeake Bay and implications for management decisions

The Chesapeake Bay Program (CBP) has used their coupled watershed-water quality modeling system to develop a set of Total Maximum Daily Loads (TMDLs) for nutrients and sediment in an effort to reduce eutrophication impacts which include decreasing the seasonal occurrence of hypoxia within the Bay. The CBP is now considering the use of a multiple model approach to enhance the confidence in their model projections and to better define uncertainty. This study statistically compares the CBP regulatory model with multiple implementations of the Regional Ocean Modeling System (ROMS) in terms of skill in reproducing monthly profiles of hydrodynamics, nutrients, chlorophyll and dissolved oxygen at ~30 stations throughout the Bay. Preliminary results show that although all the models substantially underestimate stratification throughout the Bay, they all have significant skill in reproducing the mean and seasonal variability of bottom dissolved oxygen. This study demonstrates that multiple community models can be used together to provide independent confidence bounds for management decisions based on CBP model results

Metastability-Containing Circuits

Communication across unsynchronized clock domains is inherently vulnerable to metastable upsets; no digital circuit can deterministically avoid, resolve, or detect metastability (Marino, 1981). Traditionally, a possibly metastable input is stored in synchronizers, decreasing the odds of maintained metastability over time. This approach costs time, and does not guarantee success. We propose a fundamentally different approach: It is possible to \emph{contain} metastability by logical masking, so that it cannot infect the entire circuit. This technique guarantees a limited degree of metastability in---and uncertainty about---the output. We present a synchronizer-free, fault-tolerant clock synchronization algorithm as application, synchronizing clock domains and thus enabling metastability-free communication. At the heart of our approach lies a model for metastability in synchronous clocked digital circuits. Metastability is propagated in a worst-case fashion, allowing to derive deterministic guarantees, without and unlike synchronizers. The proposed model permits positive results while at the same time reproducing established impossibility results regarding avoidance, resolution, and detection of metastability. Furthermore, we fully classify which functions can be computed by synchronous circuits with standard registers, and show that masking registers are computationally strictly more powerful

Analyzing Laminated Structures from Fibre-Reinforced Composite Material: An Assessment

In the open literature there is available a tremendous number of models and methods for analyzing laminated structures. With respect to the assumptions across the laminate thickness, theories with Cz1-continuous functions are to be distinguished from layer-wise approaches, where for the latter the functional degrees of freedom can be dependent or independent of the number of layers. Transverse shear and normal stresses are more accurate when obtained by locally evaluating the equilibrium conditions. Guidelines are needed as to which model is suitable for what task. Especially for layer-wise models a fair judgment is missing. To ease up this deficiency two simple layer-wise models are evaluated and compared with models based on Cz1-continuous functions. It turns out that for standard application the FSDT with improved transverse shear stiffness is a good choice with respect to efficiency

The Continuous 1.5{D} Terrain Guarding Problem: {D}iscretization, Optimal Solutions, and {PTAS}

In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in the plain (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$. We construct guard candidate and witness sets $G, W \subset T$ of polynomial size, such that any feasible (optimal) guard cover $G' \subseteq G$ for $W$ is also feasible (optimal) for the continuous TGP. This discretization allows us to: (1) settle NP-completeness for the continuous TGP; (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the existing PTAS for the discrete TGP by Gibson et al.; (3) formulate the continuous TGP as an Integer Linear Program (IP). Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to 1000000 vertices within minutes on a standard desktop computer