Effective hadronic Lagrangian for charm mesons

An effective hadronic Lagrangian including the charm mesons is introduced to study their interactions in hadronic matter. Using coupling constants that are determined either empirically or by the SU(4) symmetry, we have evaluated the absorption cross sections of $J/\psi$ and the scattering cross sections of $D$ and $D^*$ by $\pi$ and $\rho$ mesons.Comment: 5 pages, 4 eps figures, presented at Strangeness 2000, Berkeley. Uses iopart.cl

Particle simulation of lower hybrid waves in tokamak plasmas

Global particle simulations of the lower hybrid waves have been carried out using fully kinetic ions and drift kinetic electrons with a realistic electron-to-ion mass ratio. The lower hybrid wave frequency, mode structure, and electron Landau damping from the electrostatic simulations agree very well with the analytic theory. Linear simulation of the propagation of a lower hybrid wave-packet in the toroidal geometry shows that the wave propagates faster in the high field side than the low field side, in agreement with a ray tracing calculation. Electromagnetic benchmarks of lower hybrid wave dispersion relation are also carried out. Electromagnetic mode conversion are observed in toroidal geometry, slow waves are launched at the plasma boundary and converts to fast waves at the mode conversion layer, which is consistent with linear theory.Comment: 8 pages, 11 figure

Average distance in a hierarchical scale-free network: an exact solution

Various real systems simultaneously exhibit scale-free and hierarchical structure. In this paper, we study analytically average distance in a deterministic scale-free network with hierarchical organization. Using a recursive method based on the network construction, we determine explicitly the average distance, obtaining an exact expression for it, which is confirmed by extensive numerical calculations. The obtained rigorous solution shows that the average distance grows logarithmically with the network order (number of nodes in the network). We exhibit the similarity and dissimilarity in average distance between the network under consideration and some previously studied networks, including random networks and other deterministic networks. On the basis of the comparison, we argue that the logarithmic scaling of average distance with network order could be a generic feature of deterministic scale-free networks.Comment: Definitive version published in Journal of Statistical Mechanic