Scheduling over Scenarios on Two Machines

We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all scenarios are given explicitly. The two objectives that we consider are minimizing the maximum makespan over all scenarios and minimizing the sum of the makespans of all scenarios. For both versions, we give several approximation algorithms and lower bounds on their approximability. With this research into optimization problems over scenarios, we have opened a new and rich field of interesting problems.Comment: To appear in COCOON 2014. The final publication is available at link.springer.co

A Hypergraph Dictatorship Test with Perfect Completeness

A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan and serves as a key component in their unique games based \PCP construction. Such a test has oracle access to a collection of functions and determines whether all the functions are the same dictatorship, or all their low degree influences are $o(1).$ Their test makes $q\geq3$ queries and has amortized query complexity $1+O(\frac{\log q}{q})$ but has an inherent loss of perfect completeness. In this paper we give an adaptive hypergraph dictatorship test that achieves both perfect completeness and amortized query complexity $1+O(\frac{\log q}{q})$.Comment: Some minor correction

Variable rate spraying in varied micro-meteorological conditions

This study evaluated effects of crosswind on the variable rate sprayer application treatments spray coverage and deposition on different citrus canopy sizes.  The axial-fan airblast sprayer retrofitted with variable liquid- and air-assist rates was field-tested with different crosswind conditions on small (about 2 m tall and < 1.5 m wide) and medium-sized (about 3 m tall and < 2.5 m wide) canopies.  Crosswinds of 1.3, 2.7, and 4.0 ms-1 on the canopies being sprayed were generated using the stationary conical air shaker as the air blower unit.  Water sensitive papers (WSPs) were used to collect droplet deposits and image processing software was used to analyze the WSPs scanned at 600 dpi.  Percent spray coverage on the WSPs was found to be one of the most suited parameters to evaluate the effectiveness of spray application treatments.  Overall, the variable rate spray application treatments had comparable spray coverage on respective canopies (front, middle, and across WSP locations in the canopy) during all crosswind conditions.  For both types of canopies, spray coverage was higher on the canopy front and decreased as the spray penetrated inside (i.e. canopy middle) and across.  Due to coalescing, larger droplets (Dv,0.5 [volume median diameter] = 838 to 2,624 µm) were formed on the WSPs located on canopy front, whereas coalescing reduced as the spray penetrated inside (Dv,0.5 = 391 to 1,625 µm on canopy middle) and across the canopy (Dv,0.5 = 307 to 508 µm).    Keywords: airblast sprayer, adjustable air-assistance, crosswind, spray coverage, citru

A provisional database for the silicon content of foods in the United Kingdom

Si may play an important role in bone formation and connective tissue metabolism. Although biological interest in this element has recently increased, limited literature exists on the Si content of foods. To further our knowledge and understanding of the relationship between dietary Si and human health, a reliable food composition database, relevant for the UK population, is required. A total of 207 foods and beverages, commonly consumed in the UK, were analysed for Si content. Composite samples were analysed using inductively coupled plasma&ndash;optical emission spectrometry following microwave-assisted digestion with nitric acid and H2O2. The highest concentrations of Si were found in cereals and cereal products, especially less refined cereals and oat-based products. Fruit and vegetables were highly variable sources of Si with substantial amounts present in Kenyan beans, French beans, runner beans, spinach, dried fruit, bananas and red lentils, but undetectable amounts in tomatoes, oranges and onions. Of the beverages, beer, a macerated whole-grain cereal product, contained the greatest level of Si, whilst drinking water was a variable source with some mineral waters relatively high in Si. The present study provides a provisional database for the Si content of UK foods, which will allow the estimation of dietary intakes of Si in the UK population and investigation into the role of dietary Si in human health.<br /

Comparison of quantitative real time PCR with Sequencing and ribosomal RNA-FISH for the identification of fungi in Formalin fixed, paraffin-embedded tissue specimens

Background: Identification of the causative agents of invasive fungal infections (IFI) is critical for guiding antifungal therapy. Cultures remain negative in a substantial number of IFI cases. Accordingly, species identification from formalin fixed, paraffin embedded (FFPE) tissue specimens by molecular methods such as fluorescence in situ hybridisation (FISH) and PCR provides an appealing approach to improve management of patients. Methods: We designed FISH probes targeting the 28S rRNA of Aspergillus and Candida and evaluated them with type strains. Fluorescence microscopy (FM), using FISH probes and quantitative broadrange fungal PCR targeting the rRNA gene were applied to FFPE tissue specimens from patients with proven IFI in order to explore benefits and limitations of each approach. Results: PCR followed by sequencing identified a broad spectrum of pathogenic fungi in 28 of 40 evaluable samples (70%). Hybridisation of FISH probes to fungal rRNA was documented in 19 of 40 tissue samples (47.5%), including 3 PCR negative samples with low fungal burden. The use of FISH was highly sensitive in invasive yeast infections, but less sensitive for moulds. In samples with hyphal elements, the evaluation of hybridisation was impaired due to autofluorescence of hyphae and necrotic tissue background. Conclusions: While PCR appears to be more sensitive in identifying the causative agents of IFI, some PCR negative and FISH positive samples suggest that FISH has some potential in the rapid identification of fungi from FFPE tissue samples

A MIQE-Compliant Real-Time PCR Assay for Aspergillus Detection

PMCID: PMC3393739This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices (and thus O((k')^2) edges) with k' <= k. Using the terminology of parameterized complexity we say that k-Vertex Cover has a kernel with 2k vertices. There is complexity-theoretic evidence that both 2k vertices and Theta(k^2) edges are optimal for the kernel size. In this paper we consider the Vertex Cover problem with a different parameter, the size fvs(G) of a minimum feedback vertex set for G. This refined parameter is structurally smaller than the parameter k associated to the vertex covering number vc(G) since fvs(G) <= vc(G) and the difference can be arbitrarily large. We give a kernel for Vertex Cover with a number of vertices that is cubic in fvs(G): an instance (G,X,k) of Vertex Cover, where X is a feedback vertex set for G, can be transformed in polynomial time into an equivalent instance (G',X',k') such that |V(G')| <= 2k and |V(G')| <= O(|X'|^3). A similar result holds when the feedback vertex set X is not given along with the input. In sharp contrast we show that the Weighted Vertex Cover problem does not have a polynomial kernel when parameterized by the cardinality of a given vertex cover of the graph unless NP is in coNP/poly and the polynomial hierarchy collapses to the third level.Comment: Published in "Theory of Computing Systems" as an Open Access publicatio