Span programs and quantum algorithms for st-connectivity and claw detection

We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T as a minor, we give O(n)-query quantum algorithms for detecting T either a triangle or a subdivision of a star. All these algorithms can be implemented time efficiently and, except for the triangle-detection algorithm, in logarithmic space. One of the main techniques is to modify the st-connectivity span program to drop along the way "breadcrumbs," which must be retrieved before the path from s is allowed to enter t.Comment: 18 pages, 4 figure

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

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

Superflux chlorophyll-a analysis: An assessment of variability in results introduced prior to fluorometric analysis

Several experiments were undertaken to identify variability in results that came from procedural differences in the processing of chlorophyll samples prior to fluorometric analysis. T-tests on group means indicated that significant differences (alpha = 0.05) in phaeopigment a concentrations did result in samples not initially screened, but not in the chlorophyll a concentrations. Highly significant differences (alpha = 0.001) in group means were found in samples which were held in acetone after filtering as compared to unfiltered seawater samples held for the same period. No difference in results was found between the 24-hour extraction and samples which were processed immediately

A multi-data source surveillance system to detect a bioterrorism attack during the G8 summit in Scotland

In 18 weeks, Health Protection Scotland (HPS) deployed a syndromic surveillance system to early-detect natural or intentional disease outbreaks during the G8 Summit 2005 at Gleneagles, Scotland. The system integrated clinical and non-clinical datasets. Clinical datasets included Accident and Emergency (A and E) syndromes, and General Practice (GPs) codes grouped into syndromes. Non-clinical data included telephone calls to a nurse helpline, laboratory test orders, and hotel staff absenteeism. A cumulative sum-based detection algorithm and a log-linear regression model identified signals in the data. The system had a fax-based track for real-time identification of unusual presentations. Ninety-five signals were triggered by the detection algorithms and four forms were faxed to HPS. Thirteen signals were investigated. The system successfully complemented a traditional surveillance system in identifying a small cluster of gastroenteritis among the police force and triggered interventions to prevent further cases

Contraction Bidimensionality: the Accurate Picture

We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we unify and significantly simplify contraction bidimensionality theory -- the meta algorithmic framework to design efficient parameterized and approximation algorithms for contraction closed parameters

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

Can requirements be creative? Experiences with an enhanced air space management system

Requirements engineering is a creative process in which stakeholders work together to create ideas for new software systems that are eventually expressed as requirements. This paper reports a workshop that integrated creativity techniques with different types of use case and system context modeling to discover stakeholder requirements for EASM, a future air space management software system to enable the more effective, longer-term planning of UK and European airspace use. The workshop was successful in that it provided a range of outputs that were later assessed for their novelty and usefulness in the final specification of the EASM software. The paper describes the workshop structure, gives examples of outputs from it, and uses these results to answer 2 research questions about the utility of creativity techniques and workshops that had not been answered in previous research

Anisotropy beta functions

The flow of couplings under anisotropic scaling of momenta is computed in $\phi^3$ theory in 6 dimensions. It is shown that the coupling decreases as momenta of two of the particles become large, keeping the third momentum fixed, but at a slower rate than the decrease of the coupling if all three momenta become large simultaneously. This effect serves as a simple test of effective theories of high energy scattering, since such theories should reproduce these deviations from the usual logarithmic scale dependence.Comment: uuencoded ps file, 6 page

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I', either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are max independent set, max k-colorable subgraph and max split subgraph under vertex insertions and deletion