ZIB

Hits per page

hits 1 - 2 | 2 hits

Sorting

Electronic Resource

Symptoms of respiratory allergies are worse in subjects with coexisting food sensitization (1990)

FIORINI, G. ; RINALDI, G. ; BIGI, G. ; [et al.]

Oxford, UK : Blackwell Publishing Ltd

Clinical & experimental allergy 20 (1990), S. 0

add to mindlist on the mindlist

Details

ISSN: 1365-2222

Source: Blackwell Publishing Journal Backfiles 1879-2005

Topics: Medicine

Notes: Food sensitization was evaluated in 78 subjects with respiratory allergies, both by skin tests with commercial and fresh allergens, and by specific IgE determination. On the basis of the presence or absence of the latter the population was divided into two groups. The group with food-specific IgE showed more severe features of respiratory allergy, including a greater number of positive skin tests and specific IgE. determinations, more class 3 and 4 reactions, and more symptoms. The hypothesis that early food sensitization can predispose to severe inhalant allergy is discussed.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1111/j.1365-2222.1990.tb02709.x

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

Electronic Resource

An efficient algorithm for the minimum capacity cut problem (1990)

Padberg, M. ; Rinaldi, G.

Springer

Mathematical programming 47 (1990), S. 19-36

add to mindlist on the mindlist

Details

ISSN: 1436-4646

Keywords: Minimum weighted cuts ; networks ; polynomial-time algorithms ; computation

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract Given a finite undirected graph with nonnegative edge capacities the minimum capacity cut problem consists of partitioning the graph into two nonempty sets such that the sum of the capacities of edges connecting the two parts is minimum among all possible partitionings. The standard algorithm to calculate a minimum capacity cut, due to Gomory and Hu (1961), runs in O(n 4) time and is difficult to implement. We present an alternative algorithm with the same worst-case bound which is easier to implement and which was found empirically to be far superior to the standard algorithm. We report computational results for graphs with up to 2000 nodes.