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
  • 25.70.-Z  (2)
  • 25.70.−z  (2)
  • Cluster-Analyse  (2)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 19 (1997), S. 47-53 
    ISSN: 1436-6304
    Keywords: Information systems architecture ; business Systems planning ; cluster analysis ; genetic algorithms ; Architektur von Informationssystemen ; Business Systems Planning ; Cluster-Analyse ; Genetische Algorithmen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Zur Entwicklung von Architekturen von Informationssystemen (ISA) wird vielfach das Business-Systems-Planning-(BSP)-Konzept vorgeschlagen. Ein Teilproblem dieses Planungskonzepts besteht darin, unter Berücksichtigung von Optimalitätskriterien Unternehmensprozesse und Datenbestände zu möglichst voneinander unabhängigen Teilsystemen zusammenzufassen. Da die Leistungsgrenzen von exakten Optimierungsverfahren für dieses Problem rasch erreicht werden, interessiert der Einsatz von heuristischen Verfahren. Zunächst werden das BSP-Problem und die Vorgehensweise genetischer Algorithmen kurz erläutert. Danach wird die Anwendung eines einfachen genetischen Algorithmus auf das BSP-Problem beschrieben. Ein Vergleich mit Ergebnissen exakter Verfahren bildet einen weiteren wichtigen Bestandteil der Untersuchung.
    Notes: Abstract While determining information systems architectures (ISA), business systems planning (BSP) is a well-known method to join processes and data classes to subsystems. BSP matrices have generally been rearranged without describing the underlying methods. Meanwhile, various techniques have been developed for solving the ISA problem. Since exact optimization methods often fail to provide results for large ISA problems, different heuristics have been applied. A new heuristic for solving the ISA problem is the application of genetic algorithms (GA). This paper examines the application of a simple GA to the ISA problem and compares the results of applying the GA with those obtained by exact methods.
    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
    OR spectrum 19 (1997), S. 47-53 
    ISSN: 1436-6304
    Keywords: Key words: Information systems architecture ; business systems planning ; cluster analysis ; genetic algorithms ; Schlüsselwörter: Architektur von Informationssystemen ; Business Systems Planning ; Cluster-Analyse ; Genetische Algorithmen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung. Zur Entwicklung von Architekturen von Informationssystemen (ISA) wird vielfach das Business-Systems-Planning-(BSP)-Konzept vorgeschlagen. Ein Teilproblem dieses Planungskonzepts besteht darin, unter Berücksichtigung von Optimalitätskriterien Unternehmensprozesse und Datenbestände zu möglichst voneinander unabhängigen Teilsystemen zusammenzufassen. Da die Leistungsgrenzen von exakten Optimierungsverfahren für dieses Problem rasch erreicht werden, interessiert der Einsatz von heuristischen Verfahren. Zunächst werden das BSP-Problem und die Vorgehensweise genetischer Algorithmen kurz erläutert. Danach wird die Anwendung eines einfachen genetischen Algorithmus auf das BSP-Problem beschrieben. Ein Vergleich mit Ergebnissen exakter Verfahren bildet einen weiteren wichtigen Bestandteil der Untersuchung.
    Notes: Abstract. While determining information systems architectures (ISA), business systems planning (BSP) is a well-known method to join processes and data classes to subsystems. BSP matrices have generally been rearranged without describing the underlying methods. Meanwhile, various techniques have been developed for solving the ISA problem. Since exact optimization methods often fail to provide results for large ISA problems, different heuristics have been applied. A new heuristic for solving the ISA problem is the application of genetic algorithms (GA). This paper examines the application of a simple GA to the ISA problem and compares the results of applying the GA with those obtained by exact methods.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1434-601X
    Keywords: 21.10.Ky ; 25.70.−z ; 29.30−h
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract The well established phenomenon of heavy ion beam induced attenuations of transient magnetic fields (TF) was studied by measuring the in-beam magnetization of bombarded Fe foils employing the magneto-optical Kerr-effect. Whereas the macroscopic magnetization did not show any deterioration, the simultaneously measured TF of recoiling108Pd(2+) ions was found to be substantially attenuated.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1434-601X
    Keywords: 29.30.-h ; 25.70.-Z ; 21.10.Ky
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract Transient field precessions have been measured with the first excited 2 1 + -state as probe for ions of28Si traversing Fe at vion−1v0 and 13v0(v0=c/137) and62Ni being stopped in Fe. The degree of polarization deduced for the Si ions, p1s=0.19(6), is consistent with low-velocity data. There is clear evidence that the field strength is attenuated by heavy ion beams. For the62Ni(2 1 + ) state at 1.173 MeV a g-factor value of g=0.34(7) was obtained in good agreement with a previous result.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    ISSN: 1434-601X
    Keywords: 21.10.Ky ; 25.70.−z ; 27.40.+z
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract Relative to the wellknowng-factor of56Fe(2 1 + ) at 0.847 MeV, theg-factor of the54Fe(2 1 + ) state at 1.408 MeV has been remeasured employing the technique of transient magnetic fields (TF) with the ions slowed down in ferromagnetic Gd host at initial velocities of 2.5 ν0. Coulomb excitation on beams of54,56Fe was accomplished with a Si target. The value obtained,g=1.05(17), is in excellent agreement with two previous results but disagrees with the value from a TF measurement where the ions passed through ferromagnetic Fe.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1434-6079
    Keywords: 25.70.-Z ; 34.00 ; 34.80.Nz
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract Ion-beam induced attenuations of transient magnetic fields have been further studied in measurements on high-velocity24Mg- and28Si-ions as well as low-velocity48Ti-ions using energetic beams of Ti- and Br-ions. Further evidence for the stopping power dependence of the attenuations is found; more data in the threshold region of Fe-host support earlier observations. In Gd-host the attenuations are again weaker pronounced than in Fe in accordance with previous data.
    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...