Total plankton respiration in the Chesapeake Bay plume

Total plankton respiration (TPR) was measured at 17 stations within the Chesapeake Bay plume off the Virginia coast during March, June, and October 1980. Elevated rates of TPR, as well as higher concentrations of chlorophyll a and phaeopigment a, were found to be associated with the Bay plume during each survey. The TPR rates within the Bay plume were close to those found associated with the Hudson River plume for comparable times of the year. The data examined indicate that the Chesapeake Bay plume stimulates biological activity and is a source of organic loading to the contiguous shelf ecosystem

Are there any good digraph width measures?

Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all \MS1-definable problems on digraphs of bounded width. And, second, having nice \emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) \MS1 seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the edge/arc relation on the vertex set.The latter property is a necessary condition for a width measure to be characterizable by some version of the cops-and-robber game characterizing the ordinary treewidth. Our main result is that \emph{any reasonable} algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph. Moreover, we introduce \emph{directed topological minors} and argue that they are the weakest useful notion of minors for digraphs

Synchronizing Sequencing Software to a Live Drummer

Copyright 2013 Massachusetts Institute of Technology. MIT allows authors to archive published versions of their articles after an embargo period. The article is available at

Passive and active seismic isolation for gravitational radiation detectors and other instruments

Some new passive and active methods for reducing the effects of seismic disturbances on suspended masses are described, with special reference to gravitational radiation detectors in which differential horizontal motions of two or more suspended test masses are monitored. In these methods it is important to be able to determine horizontal seismic accelerations independent of tilts of the ground. Measurement of changes in inclination of the suspension wire of a test mass, relative to a direction defined by a reference arm of long period of oscillation, makes it possible to carry this out over the frequency range of interest for earth-based gravitational radiation detectors. The signal obtained can then be used to compensate for the effects of seismic disturbances on the test mass if necessary. Alternatively the signal corresponding to horizontal acceleration can be used to move the point from which the test mass is suspended in such a way as to reduce the effect of the seismic disturbance and also damp pendulum motions of the suspended test mass. Experimental work with an active anti-seismic system of this type is described

Scotin, a novel p53-inducible proapoptotic protein located in the ER and the nuclear membrane

p53 is a transcription factor that induces growth arrest or apoptosis in response to cellular stress. To identify new p53-inducible proapoptotic genes, we compared, by differential display, the expression of genes in spleen or thymus of normal and p53 nullizygote mice after γ-irradiation of whole animals. We report the identification and characterization of human and mouse Scotin homologues, a novel gene directly transactivated by p53. The Scotin protein is localized to the ER and the nuclear membrane. Scotin can induce apoptosis in a caspase-dependent manner. Inhibition of endogenous Scotin expression increases resistance to p53-dependent apoptosis induced by DNA damage, suggesting that Scotin plays a role in p53-dependent apoptosis. The discovery of Scotin brings to light a role of the ER in p53-dependent apoptosis

Tenascin-C fragments are endogenous inducers of cartilage matrix degradation

Cartilage destruction is a hallmark of osteoarthritis (OA) and is characterized by increased protease activity resulting in the degradation of critical extracellular matrix (ECM) proteins essential for maintaining cartilage integrity. Tenascin-C (TN-C) is an ECM glycoprotein, and its expression is upregulated in OA cartilage. We aimed to investigate the presence of TN-C fragments in arthritic cartilage and establish whether they promote cartilage degradation. Expression of TN-C and its fragments was evaluated in cartilage from subjects undergoing joint replacement surgery for OA and RA compared with normal subjects by western blotting. The localization of TN-C in arthritic cartilage was also established by immunohistochemistry. Recombinant TN-C fragments were then tested to evaluate which regions of TN-C are responsible for cartilage-degrading activity in an ex vivo cartilage explant assay measuring glycosaminoglycan (GAG) release, aggrecanase and matrix metalloproteinase (MMP) activity. We found that specific TN-C fragments are highly upregulated in arthritic cartilage. Recombinant TN-C fragments containing the same regions as those identified from OA cartilage mediate cartilage degradation by the induction of aggrecanase activity. TN-C fragments mapping to the EGF-L and FN type III domains 3-8 of TN-C had the highest levels of aggrecan-degrading ability that was not observed either with full-length TN-C or with other domains of TN-C. TN-C fragments represent a novel mechanism for cartilage degradation in arthritis and may present new therapeutic targets for the inhibition of cartilage degradation

Constant-degree graph expansions that preserve the treewidth

Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertices to simplify theoretical arguments or address practical concerns. Such degree reduction can be performed through a sequence of splittings of vertices, resulting in an _expansion_ of the original graph. We observe that the treewidth of a graph may increase dramatically if the splittings are not performed carefully. In this context we address the following natural question: is it possible to reduce the maximum degree to a constant without substantially increasing the treewidth? Our work answers the above question affirmatively. We prove that any simple undirected graph G=(V, E) admits an expansion G'=(V', E') with the maximum degree <= 3 and treewidth(G') <= treewidth(G)+1. Furthermore, such an expansion will have no more than 2|E|+|V| vertices and 3|E| edges; it can be computed efficiently from a tree-decomposition of G. We also construct a family of examples for which the increase by 1 in treewidth cannot be avoided.Comment: 12 pages, 6 figures, the main result used by quant-ph/051107

An FPT 2-Approximation for Tree-Cut Decomposition

The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input $n$-vertex graph $G$ and an integer $w$, our algorithm either confirms that the tree-cut width of $G$ is more than $w$ or returns a tree-cut decomposition of $G$ certifying that its tree-cut width is at most $2w$, in time $2^{O(w^2\log w)} \cdot n^2$. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known.Comment: 17 pages, 3 figure

Economic evaluation of a community based exercise programme to prevent falls

OBJECTIVE: To assess the incremental costs and cost effectiveness of implementing a home based muscle strengthening and balance retraining programme that reduced falls and injuries in older women. DESIGN: An economic evaluation carried out within a randomised controlled trial with two years of follow up. Participants were individually prescribed an exercise programme (exercise group, n=116) or received usual care and social visits (control group, n=117). SETTING: 17 general practices in Dunedin, New Zealand. PARTICIPANTS: Women aged 80 years and older living in the community and invited by their general practitioner to take part. MAIN OUTCOME MEASURES: Number of falls and injuries related to falls, costs of implementing the intervention, healthcare service costs resulting from falls and total healthcare service costs during the trial. Cost effectiveness was measured as the incremental cost of implementing the exercise programme per fall event prevented. MAIN RESULTS: 27% of total hospital costs during the trial were related to falls. However, there were no significant differences in health service costs between the two groups. Implementing the exercise programme for one and two years respectively cost $314 and$265 (1995 New Zealand dollars) per fall prevented, and $457 and$426 per fall resulting in a moderate or serious injury prevented. CONCLUSIONS: The costs resulting from falls make up a substantial proportion of the hospital costs for older people. Despite a reduction in falls as a result of this home exercise programme there was no significant reduction in healthcare costs. However, the results reported will provide information on the cost effectiveness of the programme for those making decisions on falls prevention strategies

Maximum Edge-Disjoint Paths in kk-sums of Graphs

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be $\Omega(\sqrt{n})$ even for planar graphs due to a simple topological obstruction and a major focus, following earlier work, has been understanding the gap if some constant congestion is allowed. In this context, it is natural to ask for which classes of graphs does a constant-factor constant-congestion property hold. It is easy to deduce that for given constant bounds on the approximation and congestion, the class of "nice" graphs is nor-closed. Is the converse true? Does every proper minor-closed family of graphs exhibit a constant factor, constant congestion bound relative to the LP relaxation? We conjecture that the answer is yes. One stumbling block has been that such bounds were not known for bounded treewidth graphs (or even treewidth 3). In this paper we give a polytime algorithm which takes a fractional routing solution in a graph of bounded treewidth and is able to integrally route a constant fraction of the LP solution's value. Note that we do not incur any edge congestion. Previously this was not known even for series parallel graphs which have treewidth 2. The algorithm is based on a more general argument that applies to $k$-sums of graphs in some graph family, as long as the graph family has a constant factor, constant congestion bound. We then use this to show that such bounds hold for the class of $k$-sums of bounded genus graphs