3 resultados para Graph spectra

em Universitätsbibliothek Kassel, Universität Kassel, Germany


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We discuss the possibility of identifying superheavy elements from the observation of their M-shell x-ray spectra, which might occur during the collision of a superheavy element with a heavy target. The same question is discussed for the possible observation of the x-rays from the quasimolecule (quasi-superheavy element) which is formed during such a heavy-ion collision. It is shown that it is very difficult, if not impossible, to determine any information about the interesting quantum electrodynamical effects from the M-shell x-ray spectra of these quasimolecules.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Relativistic Auger rates for the 2p spectra of Mg-like ions have been calculated in the atomic range 13 < Z < 36. We used the multiconfiguration Dirac-Fock method but beyond a simple frozen-orbital approach we include also relaxation for the bound electrons and the interchannel interaction between the continuum states. Both effects may alter the individual transition rates remarkably. This is analysed for a few selected states within the isoelectronic sequence. Weak transitions within the 2p spectra can be changed by an order of magnitude because of the continuum coupling. The influence of both effects for higher-Z ions is reduced but still remain visible.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.