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
    s.l. : American Chemical Society
    Journal of the American Chemical Society 104 (1982), S. 6449-6450 
    ISSN: 1520-5126
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 3 (1988), S. 323-328 
    ISSN: 1432-2315
    Keywords: Union of Spheres ; Volumes ; Laguerre Voronoid diagram ; Power diagram
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract OnO(n 2) exact algorithm is given for computing the volume of a set ofn spheres in space. The algorithm employs the Laguerre Voronoi (power) diagram and a method for computing the volume of the intersection of a simplex and a sphere exactly. We give a new proof of a special case of a conjecture, popularized by Klee, concerning the change in volume as the centres of the spheres become further apart.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1546-1718
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Medicine
    Notes: [Auszug] Observations of rapid shifts in mitochondrial DNA (mtDNA) variants between generations prompted the creation of the bottleneck theory. A prevalent hypothesis is that a massive reduction in mtDNA content during early oogenesis leads to the bottleneck. To test this, we estimated the mtDNA copy number ...
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 4 (1989), S. 77-96 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Modified pruning technique ; LinearL 1 approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we present a linear-time algorithm for approximating a set ofn points by a linear function, or a line, that minimizes theL 1 norm. The algorithmic complexity of this problem appears not to have been investigated, although anO(n 3) naive algorithm can be easily obtained based on some simple characteristics of an optimumL 1 solution. Our linear-time algorithm is optimal within a constant factor and enables us to use linearL 1 approximation of many points in practice. The complexity ofL 1 linear approximation of a piecewise linear function is also touched upon.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    [s.l.] : Macmillian Magazines Ltd.
    Nature 417 (2002), S. 829-831 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] Evolved stars of about one solar mass are in general spherically symmetric, yet the planetary nebulae that they produce in the next phase of their evolution tend not to exhibit such symmetry. Collimated ‘jets’ and outflows of material have been observed up to ∼0.3 parsec ...
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    [s.l.] : Nature Publishing Group
    Nature 440 (2006), S. 58-60 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] Planetary nebulae often have asymmetric shapes, even though their progenitor stars were symmetric; this structure could be the result of collimated jets from the evolved stars before they enter the planetary nebula phase. Theoretical models have shown that magnetic fields could be the dominant ...
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 1 (1986), S. 49-63 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Computer graphics ; Robotics ; Visibility ; Hidden-line Elimination ; Visibility graph ; Shortest path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider a collection of disjoint polygons in the plane containing a total ofn edges. We show how to build, inO(n 2) time and space, a data structure from which inO(n) time we can compute the visibility polygon of a given point with respect to the polygon collection. As an application of this structure, the visibility graph of the given polygons can be constructed inO(n 2) time and space. This implies that the shortest path that connects two points in the plane and avoids the polygons in our collection can be computed inO(n 2) time, improving earlierO(n 2 logn) results.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 1 (1986), S. 455-482 
    ISSN: 1432-0541
    Keywords: Linear programming ; Interior method ; Barrier function ; Newton method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A simple Newton-like descent algorithm for linear programming is proposed together with results of preliminary computational experiments on small- and medium-size problems. The proposed algorithm gives local superlinear convergence to the optimum and, experimentally, shows global linear convergence. It is similar to Karmarkar's algorithm in that it is an interior feasible direction method and self-correcting, while it is quite different from Karmarkar's in that it gives superlinear convergence and that no artificial extra constraint is introduced nor is protective geometry needed, but only affine geometry suffices.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 5 (1990), S. 289-304 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We address the problem of connecting line segments to form the boundary of a simple polygon—a simple circuit. However, not every set of segments can be so connected. We present anO(n logn)-time algorithm to determine whether a set of segments, constrained so that each segment has at least one endpoint on the boundary of the convex hull of the segments, admits a simple circuit. Furthermore, this technique can also be used to compute a simple circuit of minimum perimeter, or a simple circuit that bounds the minimum area, with no increase in computational complexity.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 26 (1984), S. 702-713 
    ISSN: 0006-3592
    Keywords: Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: This study was performed to evaluate the effects of the air sparge rate, working liquid volume, liquid feed rate onto the disk, and disk diameter on the foam-breaking performance of foam-breaking apparatus with a rotating disk (FARD) installed in the bubble column. Experimental results showed that the smaller the air sparge rate and working liquid volume were, and the larger the liquid feed rate and disk diameter, the lower the critical disk rotational speed required for reduced foam-breaking. The presence of the effective ranges of the disk diameter and liquid feed rate for foam breaking was also confirmed. Furthermore, the quantitative predictions of the upper limits of the liquid feed rate, foam-breaking regions, and the required foam-breaking power were carried out, based on the results obtained above. Comparison of the FARD with two conventional mechanical foam-breaking spray-type apparati also demonstrated the highest level of the FARD in respect not only to foam-breaking performance but also to power requirements.
    Additional Material: 21 Ill.
    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...