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
Filter
  • Articles: DFG German National Licenses  (2)
  • 25.70.Pq  (1)
  • Point location  (1)
  • 1
    ISSN: 1434-601X
    Keywords: 25.70.Gh ; 25.70.Jj ; 25.70.Pq
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract In a multidetector experiment on 26 or 30 AMeV32S+58Ni, up to four coincident heavier or intermediate-mass fragments were observed. One of these occasionally has the characteristics of a projectile-like fragment, up to three may be attributed to the decay of the heavy reaction product. Taking the velocity of the fragments as a measure of the heavy-product excitation energy, one finds evaporation, fission and multifragmentation to follow one another with rising excitation. Model simulations of sequential decay with up to two binary fissions and, alternatively, of simultaneous statistical multifragmentation were performed for comparison with experimental distributions of mass, velocity and (for events with three slow intermediate-mass fragments) relative azimuthal angle. Though in the three-fragment events indications of simultaneous multifragmentation are present, the sequential binary decay predominates. Evaporated protons and α particles detected in coincidence have a mean multiplicity growing with excitation energy, while the temperature governing the spectra has a plateau with a value of about 5.5 MeV.
    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
    Algorithmica 12 (1994), S. 18-29 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Closest pair ; Point location ; Centroid ; Amortization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give an algorithm that computes the closest pair in a set ofn points ink-dimensional space on-line, inO(n logn) time. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision ofk-space into hyperrectangles, which is stored in a binary tree. Centroids are used to maintain a balanced decomposition of this tree.
    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...