Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Clinical & experimental allergy 20 (1990), S. 0 
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    s.l. ; Stafa-Zurich, Switzerland
    Key engineering materials Vol. 144 (Sept. 1997), p. 203-216 
    ISSN: 1013-9826
    Source: Scientific.Net: Materials Science & Technology / Trans Tech Publications Archiv 1984-2008
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 26 (2000), S. 172-195 
    ISSN: 1432-0541
    Keywords: Key words. Minimum capacity cuts, Experimental performance evaluation, Computational comparisons, Literate programming, Algorithm engineering.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. In the late eighties and early nineties, three major exciting new developments (and some ramifications) in the computation of minimum capacity cuts occurred and these developments motivated us to evaluate the old and new methods experimentally. We provide a brief overview of the most important algorithms for the minimum capacity cut problem and compare these methods both with problem instances from the literature and with problem instances originating from the solution of the traveling salesman problem by branch-and-cut.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1572-9613
    Keywords: Branch and cut ; Ising spin glasses ; exact ground states
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract In this paper we study two-dimensional Ising spin glasses on a grid with nearest neighbor and periodic boundary interactions, based on a Gaussian bond distribution, and an exterior magnetic field. We show how using a technique called branch and cut, the exact ground states of grids of sizes up to 100×100 can be determined in a moderate amount of computation time, and we report on extensive computational tests. With our method we produce results based on more than 20,000 experiments on the properties of spin glasses whose errors depend only on the assumptions on the model and not on the computational process. This feature is a clear advantage of the method over other, more popular ways to compute the ground state, like Monte Carlo simulation including simulated annealing, evolutionary, and genetic algorithms, that provide only approximate ground states with a degree of accuracy that cannot be determineda priori. Our ground-state energy estimation at zero field is −1.317.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of statistical physics 84 (1996), S. 1363-1371 
    ISSN: 1572-9613
    Keywords: Branch and cut ; Ising spin glasses ; exact ground states
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract In this paper we study the problem of finding an exact ground state of a two-dimensional ±J Ising spin glass on a square lattice with nearest neighbor interactions and periodic boundary conditions when there is a concentrationp of negative bonds, withp ranging between 0.1 and 0.9. With our exact algorithm we can determine ground states of grids of sizes up to 50×50 in a moderate amount of computation time (up to 1 hr each) for several values ofp. For the ground-state energy of an infinite spin-glass system withp=0.5 we estimateE 0.5 ∞ =−1.4015±0.0008. We report on extensive computational tests based on more than 22,000 experiments.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 47 (1990), S. 19-36 
    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.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...