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
    Anaesthesia 46 (1991), S. 0 
    ISSN: 1365-2044
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Journal of Nuclear Materials 209 (1994), S. 169-173 
    ISSN: 0022-3115
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Physics
    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 12 (1994), S. 30-53 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Ray shooting ; Multilevel data structures ; Hidden surface removal ; Output-sensitive
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we study the ray-shooting problem for three special classes of polyhedral objects in space: axis-parallel polyhedra, curtains (unbounded polygons with three edges, two of which are parallel to thez-axis and extend downward to minus infinity), and fat horizontal triangles (triangles parallel to thexy-plane whose angles are greater than some given constant). For all three problems structures are presented usingO(n 2+ɛ) preprocessing, for any fixedɛ 〉 0, withO(logn) query time. We also study the general ray-shooting problem in an arbitrary set of triangles. Here we present a structure that usesOn 4+ɛ) preprocessing and has a query time ofO(logn). We use the ray-shooting structure for curtains to obtain an algorithm for computing the view of a set of nonintersecting prolyhedra. For any ɛ 〉 0, we can obtain an algorithm with running time $$O(n^{1 + \varepsilon } \sqrt k )$$ , wheren is the total number of vertices of the polyhedra andk is the size of the output. This is the first output-sensitive algorithm for this problem that does not need a depth order on the faces of the polyhedra.
    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 26 (2000), S. 577-601 
    ISSN: 1432-0541
    Keywords: Key words. Assembly planning, Assembly sequencing, Motion space, Nondirectional blocking graph, Manufacturing.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Assembly planning is the problem of finding a sequence of motions to assemble a product from its parts. We present a general framework for finding assembly motions based on the concept of motion space . Assembly motions are parameterized such that each point in motion space represents a mating motion that is independent of the moving part set. For each motion we derive blocking relations that explicitly state which parts collide with other parts; each subassembly (rigid subset of parts) that does not collide with the rest of the assembly can easily be derived from the blocking relations. Motion space is partitioned into an arrangement of cells such that the blocking relations are fixed within each cell. We apply the approach to assembly motions of several useful types, including one-step translations, multistep translations, and infinitesimal rigid motions. Several efficiency improvements are described, as well as methods to include additional assembly constraints into the framework. The resulting algorithms have been implemented and tested extensively on complex assemblies. We conclude by describing some remaining open problems.
    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
    Discrete & computational geometry 25 (2001), S. 203-220 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Let \C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. If the boundaries of two sets in \C cross exactly twice, then their intersection points are called regular vertices of the arrangement \A(\C) . Let R(\C) denote the set of regular vertices on the boundary of the union of \C . We present several bounds on |R(\C)| , depending on the type of the sets of \C . (i) If each set of \C is convex, then |R(\C)|=O(n 1.5+\eps ) for any \eps〉0 . (ii) If no further assumptions are made on the sets of \C , then we show that there is a positive integer r that depends only on s such that |R(\C)|=O(n 2-1/r ) . (iii) If \C consists of two collections \C 1 and \C 2 where \C 1 is a collection of m convex pseudo-disks in the plane (closed Jordan regions with the property that the boundaries of any two of them intersect at most twice), and \C 2 is a collection of polygons with a total of n sides, then |R(\C)|=O(m 2/3 n 2/3 +m +n) , and this bound is tight in the worst case.
    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
    Discrete & computational geometry 22 (1999), S. 269-285 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce different partitionings of the vertices of P . We derive an algebraic characterization of area bisectors. We then show that there are simple polygons with n vertices that have Ω(n 2 ) combinatorially distinct area bisectors (matching the obvious upper bound), and present an output-sensitive algorithm for computing an explicit representation of all the bisectors of a given polygon.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    ISSN: 1432-1076
    Keywords: Erythropoietin ; Anaemia of prematurity ; Erythropoiesis ; Infants ; Transfusions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Recombinant human erythropoietin (rHuEPO) was administered subcutaneously three times a week to 18i infants with the anaemia of prematurity at doses of 75, 150, 300, or 600 units/kg per week for 4 weeks, starting at 3–4 weeks of postnatal age. A significant and dose-dependent increase in reticulocyte count was observed from a mean baseline value of 71×109/l to 200×109/l after 3 weeks of therapy, compared with a change from 69 to 97×109/l in 66 historical controls. The haematocrit value remained unchanged during rHuEPO treatment, whereas it steadily declined until 9 weeks of postnatal age in the controls. These effects were accompanined by a marked reduction in serum iron concentration and transferrin saturation in patients receiving standard-dose iron supplements, but not in those given larger doses. Only 3 of 18 patients required a red blood cell transfusion. These infants were among the most anaemic at entry into the study and 2 of them were unable to complete rHuEPO therapy, while the third developed iron deficiency anaemia. These data indicate that rHuEPO with appropriate iron supplementation may accelerate the recovery from anaemia of prematurity. Larger scale placebo-controiled studies are now needed to confirm these findings and verify their impact on transfusion requirements of premature infants.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1420-911X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Description / Table of Contents: Zusammenfassung In einer prospektiven Untersuchung wurde bei 630 Frauen zwischen der 14. und der 20. Schwangerschaftswoche die Serum GGT dosiert, um einen Zusammenhang zwischen den Werten eines biologischen Markers der Alkoholisation und dem klinischen Status des Neugeborenen zu prüfen. In 7 % der Fälle wurde ein anormaler Wert beobachtet, wohingegen die Anamnäse nur in 1 % der Fälle einen Alkoholkonsun bestätigte. Die vorläufigen statistischen Analysen, die sich auf die Prüfung von 308 Neugeboren im Doppelblindversuch beziehen, zeigen eine Korrelation zwischen dem mütterlichen GGT-Werten und dem Geburtsgewicht, sowie den pre- und perinatalen Komplikationen. Jedoch ist die Empfindlichkeit dieses Tests schwach.
    Notes: Summary In order to investigate prospectively in pregnant women a correlation between serum levels of a biological marker of alcohol and the clinical status of the newborn, we measured the gamma-glutamyltransferase (GGT) in 630 women between 14 and 20 weeks of pregnancy. In 7 % of the cases, an elevated value was observed while history confirmed alcohol consumption in only 1 %. Preliminary statistical analysis established upon the blind examination of 308 newborns show a correlation between maternal GGT levels and birthweight as well as the pre-and perinatal complications. However, the sensitivity of this test is weak.
    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...