BACKGROUND Multiple sensitization is frequent among pollen-allergic patients. The goal of this study was to determine the diagnostic accuracy of the ImmunoCAP ISAC 112 (ISAC112) microarray in allergy to pollen from several taxa and its clinical utility in a Spanish population. METHODS Specific IgE was determined in 390 pollen-allergic patients using the ISAC112 microarray. Diagnostic accuracy...

Given a set L of non-parallel lines in the plane and a nonempty subset L′ ⊆ L, a guarding tree for L′ is a tree contained in the union of the lines in L such that if a mobile guard (agent) runs on the edges of the tree, all lines in L′ are visited by the guard. Similarly, given a connected arrangement S of line segments in the plane and a nonempty subset S ′ ⊆ S, we define a guarding tree for S...

Spectral shade ratios, defined as the ratios of the spectral irradiances on horizontal and sun normal planes in the tree shade to those on a horizontal plane in sunlight, were calculated. These planes were in the shade of an isolated medium canopy density tree and a sparse canopy density tree at the tree shade sites of the centre, edge and trunk. The sun normal plane was employed as there are s...

The spectral shade ratios defined as the ratios of the spectral irradiances on horizontal and sun normal planes in the tree shade to those on a horizontal plane in sunlight were calculated. These planes were in the shade of an isolated medium canopy density tree and a sparse canopy density tree at the tree shade sites of the centre, edge and trunk. The sun normal plane was employed as there are...

In this paper we have proposed three and two stage still gray scale image compressor based on BTC. In our schemes, we have employed a combination of four techniques to reduce the bit rate. They are quad tree segmentation, bit plane omission, bit plane coding using 32 visual patterns and interpolative bit plane coding. The experimental results show that the proposed schemes achieve an average bi...

A Halin graph is a simple plane graph consisting of a tree without degree 2 vertices and a cycle induced by the leaves of the tree. In 1975, Lovász and Plummer conjectured that every 4-connected plane triangulation has a spanning Halin subgraph. In this paper, we construct an infinite family of counterexamples to the conjecture.

We study the query complexity of cake cutting and give lower bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. These lower bounds are tight for three players in the case of envy-free allocations and for two players in the case of perfect and equitable allocations. We also formalize moving knife procedures and show that a large subc...