Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel: DFG Deutsche Nationallizenzen  (2)
  • 25.70.Pq  (1)
  • Amortization  (1)
Datenquelle
  • Artikel: DFG Deutsche Nationallizenzen  (2)
Materialart
Erscheinungszeitraum
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    The European physical journal 350 (1995), S. 327-341 
    ISSN: 1434-601X
    Schlagwort(e): 25.70.Gh ; 25.70.Jj ; 25.70.Pq
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Physik
    Notizen: 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.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Algorithmica 12 (1994), S. 18-29 
    ISSN: 1432-0541
    Schlagwort(e): Computational geometry ; Closest pair ; Point location ; Centroid ; Amortization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: 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.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...