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
    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 ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 40 (1988), S. 29-32 
    ISSN: 1436-4646
    Keywords: Potential function ; multiplicative penalty function ; convexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Karmarkar's potential function is quasi-convex, but not convex. This note investigates the multiplicative version of the potential function, and shows that it is not necessarily convex in general, but is strictly convex when the corresponding feasible region is bounded. This implies that the multiplicative version of the potential function in Karmarkar's algorithm is convex, since it works on a simplex.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 56 (1997), S. 689-696 
    ISSN: 0006-3592
    Keywords: citric acid ; Aspergillus niger ; rotating disk contactor ; simulation ; biofilm ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: A simple model was presented to describe the time courses of citric acid production by a rotating disc contactor (RDC) using Aspergillus niger. The model is expressed by Monod-type cell growth, Luedeking-Piret-type citric acid production rate equations, and the diffusion equation for oxygen in the biofilm. The model contains five parameters which were determined by the nonlinear least squares method by fitting the numerical solution to the experimental data. In solving the equations, the cell density of the biofilm was estimated from the value of cellular mass per unit of biofilm area using an empirical equation. The experimental time courses in citric acid production period were well simulated with this model. The relation between the specific biofilm surface area and the rate of citric acid production was also explained by the simulation using the average values of five parameters of twelve runs. © 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 56: 689-696, 1997.
    Additional Material: 9 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...