ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Call number: S 90.0081(440)
    In: Reports of the Department of Geodetic Science and Surveying
    Type of Medium: Series available for loan
    Pages: IX, 61 S.
    Series Statement: Report / Department of Geodetic Science and Surveying, the Ohio State University 440
    Language: English
    Location: Lower compact magazine
    Branch Library: GFZ Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
  • 3
    Publication Date: 1989-01-01
    Print ISSN: 0045-6535
    Electronic ISSN: 1879-1298
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 1988-01-01
    Print ISSN: 0045-6535
    Electronic ISSN: 1879-1298
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Journal of agricultural and food chemistry 30 (1982), S. 724-727 
    ISSN: 1520-5118
    Source: ACS Legacy Archives
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition , Process Engineering, Biotechnology, Nutrition Technology
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 20 (1998), S. 389-402 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Given a set of points S={p 1 ,. . ., p n } in Euclidean d -dimensional space, we address the problem of computing the d -dimensional annulus of smallest width containing the set. We give a complete characterization of the centers of annuli which are locally minimal in arbitrary dimension and we show that, for d=2 , a locally minimal annulus has two points on the inner circle and two points on the outer circle that interlace anglewise as seen from the center of the annulus. Using this characterization, we show that, given a circular order of the points, there is at most one locally minimal annulus consistent with that order and it can be computed in time O(n log n) using a simple algorithm. Furthermore, when points are in convex position, the problem can be solved in optimal Θ(n) time.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    ISSN: 1432-0541
    Keywords: Key words. Stereolithography, Gravity casting, 3-Axis NC-machine, Computer-aided design, Computer-aided manufacturing, Robotics, Manufacturing, Geographic information systems, Grasping, Polyhedral terrains, Polyhedra, Polygon, Computational geometry, Algorithms.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We study the feasibility of design for a layer-deposition manufacturing process called stereolithography which works by controlling a vertical laser beam which when targeted on a photocurable liquid causes the liquid to harden. In order to understand the power as well as the limitations of this manufacturing process better, we define a mathematical model of stereolithography (referred to as vertical stereolithography ) and analyze the class of objects that can be constructed under the assumptions of the model. Given an object (modeled as a polygon or a polyhedron), we give algorithms that decide in O(n) time (where n is the number of vertices in the polygon or polyhedron) whether or not the object can be constructed by vertical stereolithography. If the answer is in the affirmative, the algorithm reports a description of all the orientations in which the object can be made. We also show that the objects built with vertical stereolithography are precisely those that can be made with a 3-axis NC machine. We then define a more flexible model that more accurately reflects the actual capabilities of stereolithography (referred to as variable-angle stereolithography ) and again study the class of feasible objects for this model. We give an O(n)-time algorithm for polygons and $O(n\log n)$ - as well as O(n)-time algorithms for polyhedra. We show that objects formed with variable-angle stereolithography can also be constructed using another manufacturing process known as gravity casting. Furthermore, we show that the polyhedral objects formed by vertical stereolithography are closely related to polyhedral terrains which are important structures in geographic information systems (GIS) and computational geometry. In fact, an object built with variable-angle stereolithography resembles a terrain with overhangs, thus initiating the study of more realistic terrains than the standard ones considered in geographic information systems. Finally, we relate our results to the area of grasping in robotics by showing that the polygonal and polyhedral objects that can be built by vertical stereolithography can be clamped by parallel jaw grippers with any positive-sized gripper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 28 (2000), S. 307-322 
    ISSN: 1432-0541
    Keywords: Key words. Computational geometry, Planar subdivision, Shortest path, Ray shooting, Curved polygon, Splinegon, Curved triangulation, Circular visibility, Conic visibility.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. {In this paper we present linear time algorithms for computing the shortest path tree from a point and the weak visibility polygon of an arc inside a triangulated curved polygon. We also present a linear time algorithm for computing the planar subdivision (in the parametric space) of the set of rays emanating from a fixed arc, such that each face of the subdivision corresponds to rays hitting the same arc of the polygon. Although these results, which involve nontrivial generalizations of known results for rectilinear polygons, may have some interest in its own right, the main result of this paper is a linear time algorithm for computing the conic (circular, elliptic, parabolic, and hyperbolic) visibility polygon of a point inside a simple polygon. The main advantage of our technique over previous results on circular visibility is that it provides a simple, unified approach to conic visibility. Finally, we present a linear time algorithm for computing the planar subdivision, in the parametric space, of two-parametric families of conic rays emanating from a fixed point, such that each face of the subdivision corresponds to conic rays hitting the same edge of the polygon. All these algorithms are asymptotically optimal.}
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Manuscripta mathematica 97 (1998), S. 45-58 
    ISSN: 1432-1785
    Keywords: Mathematics Subject Classification (1991):Primary 11L07; Secondary 14B05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract: We give upper bounds for the absolute value of exponential sums in several variables attached to certain polynomials with coefficients in a finite field. This bounds are given in terms of invariants of the singularities of the projective hypersurface defined by its highest degree form. For exponential sums attached to the reduction modulo a power of a large prime of a polynomial f with integer coefficients and veryfying a certain condition on the singularities of its highest degree form, we give a bound in terms of the dimension of the Jacobian quotient .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 0948-5023
    Keywords: γ-turn ; Peptidomimetics ; Similarity indices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Abstract The ability of a series of structures to mimic the geometric and electronic properties of an ideal γ–turn has been studied. Initially, an exhaustive conformational analysis was carried out using the molecular dynamics technique at high temperature followed by minimization. Additionally, each minimum was optimized with the semi–ab initio molecular orbital method SAM1. Then, the unique minima found have been superimposed with ideal γ–turns, classic and inverse, using the SEAL program which takes into account steric and electronic parameters for the superpositions and finally, three molecular similarity indices were determined for each superposition. These indices consider the general steric and electronic characteristics of the structures, as well as, the position of the carbon atoms that correspond to the Cαi and Cαi+2 in the peptide chain.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...