Refine
Year of publication
- 1997 (30) (remove)
Document Type
- Preprint (30) (remove)
Has Fulltext
- yes (30)
Is part of the Bibliography
- no (30)
Keywords
- Kollisionen schwerer Ionen (11)
- equation of state (7)
- Quark-Gluon-Plasma (5)
- Zustandsgleichung (5)
- heavy ion colliders (4)
- SPS (3)
- Zustandsgleichungen (3)
- heavy ion collisions (3)
- heavy-ion collisions (3)
- quark-gluon plasma (3)
Institute
- Physik (25)
- Informatik (2)
- Mathematik (2)
- Extern (1)
- Wirtschaftswissenschaften (1)
A self-consistent relativistic integral-di erential equation of the Boltzmann- Uehling-Uhlenbeck-type for the N*(1440) resonance is developed based on an effective Lagrangian of baryons interacting through mesons. The closed time-path Green s function technique and semi-classical, quasi-particle and Born approxima- tions are employed in the derivation. The non-equilibrium RBUU-type equation for the N*(1440) is consistent with that of nucleon s and delta s which we derived before. Thus, we obtain a set of coupled equations for the N,Delta and N*(1440) distribution functions. All the N (1440)-relevant in-medium two-body scattering cross sections within the N,Delta and N*(1440) system are derived from the same effective Lagrangian in addition to the mean field and presented analytically, which can be directly used in the study of relativistic heavy-ion collisions. The theoreticalprediction of the free pp - pp* (1440) cross section is in good agreement with the experimental data. We calculate the in-medium N+N - N+N* , N* +N - N+N and N*+N - N* +N cross sections in cold nuclear matter up to twice the nuclear matter density. The influence of different choices of the N* N* coupling strengths, which can not be obtained through fitting certain experimental data, are discussed. The results show that the density dependence of predicted in-medium cross sections are sensitive to the N* N* coupling strengths used. An evident density dependence will appear when a large scalar coupling strength of g^(sigma) N*N* is assumed. PACS number(s): 24.10.Cn; 25.70.-z; 21.65.+f
Symmetrie
(1997)
A lot of interest has recently been paid to constraint-based definitions and extensions of Tree Adjoining Grammars (TAG). Examples are the so-called quasi-trees, D-Tree Grammars and Tree Description Grammars. The latter are grammars consisting of a set of formulars denoting trees. TDGs are derivation based where in each derivation step a conjunction is built of the old formular, a formular of the grammar and additional equivalences between node names of the two formulars. This formalism is more powerfull than TAGs. TDGs offer the advantages of MC-TAG and D-Tree Grammars for natural languages and they allow underspecification. However the problem is that TDGs might be unnecessarily powerfull for natural languages. To solve this problem, in this paper, I will propose a local TDGs, a restricted version of TDGs. Local TDGs still have the advantages of TDGs but they are semilinear and therefore more appropriate for natural languages. First, the notion of the semilinearity is defined. Then local TDGs are introduced, and, finally, semilinearity of local Tree Description Languages is proven.
Basic problems of the semiclassical microscopic modelling of strongly interacting systems are discussed within the framework of Quantum Molecular Dynamics (QMD). This model allows to study the influence of several types of nucleonic interactions on a large variety of observables and phenomena occur- ring in heavy ion collisions at relativistic energies. It is shown that the same predictions can be obtained with several numerically completely di erent and independently written programs as far as the same model parameters are employed and the same basic approximations are made. Many observ- ables are robust against variations of the details of the model assumptions used. Some of the physical results, however, depend also on rather technical parameters like the preparation of the initial configuration in phase space. This crucial problem is connected with the description of the ground state of single nuclei, which di ers among the various approaches. An outlook to an improved molecular dynamics scheme for heavy ion collisions is given.
Preliminary experimental data for particle number ratios in the collisions of Au+Au at the BNL AGS (11A GeV/c) and Pb+Pb at the CERN SPS (160A GeV/c) are analyzed in a thermodynamically consistent hadron gas model with excluded volume. Large values of temperature, T = 140 185 MeV, and baryonic chemical potential, µb = 590 270 MeV, close to the boundary of the quark-gluon plasma phase are found from fitting the data. This seems to indicate that the energy density at the chemical freezeout is tremendous which would be indeed the case for the point-like hadrons. However, a self-consistent treatment of the van der Waals excluded volume reveals much smaller energy densities which are very far below a lowest limit estimate of the quark-gluon plasma energy density. PACS number(s): 25.75.-q, 24.10.Pa
The pion multiplicity per participating nucleon in central nucleus-nucleus collisions at the energies 2-15 A GeV is significantly smaller than in nucleon-nucleon interactions at the same collision energy. This effect of pion suppression is argued to appear due to the evolution of the system produced at the early stage of heavy-ion collisions towards a local thermodynamic equilibrium and further isentropic expansion.
We introduce the relationship between incremental cryptography and memory checkers. We present an incremental message authentication scheme based on the XOR MACs which supports insertion, deletion and other single block operations. Our scheme takes only a constant number of pseudorandom function evaluations for each update step and produces smaller authentication codes than the tree scheme presented in [BGG95]. Furthermore, it is secure against message substitution attacks, where the adversary is allowed to tamper messages before update steps, making it applicable to virus protection. From this scheme we derive memory checkers for data structures based on lists. Conversely, we use a lower bound for memory checkers to show that so-called message substitution detecting schemes produce signatures or authentication codes with size proportional to the message length.
We show lower bounds for the signature size of incremental schemes which are secure against substitution attacks and support single block replacement. We prove that for documents of n blocks such schemes produce signatures of \Omega(n^(1/(2+c))) bits for any constant c>0. For schemes accessing only a single block resp. a constant number of blocks for each replacement this bound can be raised to \Omega(n) resp. \Omega(sqrt(n)). Additionally, we show that our technique yields a new lower bound for memory checkers.