Plasmon excitation by charged particles interacting with metal surfaces

Recent experiments (R. A. Baragiola and C. A. Dukes, Phys. Rev. Lett. {\bf 76}, 2547 (1996)) with slow ions incident at grazing angle on metal surfaces have shown that bulk plasmons are excited under conditions where the ions do not penetrate the surface, contrary to the usual statement that probes exterior to an electron gas do not couple to the bulk plasmon. We here use the quantized hydrodynamic model of the bounded electron gas to derive an explicit expression for the probability of bulk plasmon excitation by external charged particles moving parallel to the surface. Our results indicate that for each ${\bf q}$ (the surface plasmon wave vector) there exists a continuum of bulk plasmon excitations, which we also observe within the semi-classical infinite-barrier (SCIB) model of the surface.Comment: 4 pages, 3 figures, o appear in Phys. Lett.

Evaluating the collaborative strategic reading intervention: An overview of randomized controlled trial options

When attempting to determine if an intervention has a causal impact, the ‘gold standard’ of program evaluation.is the randomized controlled trial (RCT). In education studies random assignment is rarely feasible at the.student level, making RCTs harder to conduct. School-level assignment is more common but this often.requires considerable resources compared to designs where classrooms can be assigned within a school. This.article describes the costs and benefits of testing the effects of a classroom based instructional intervention.using the multi-site cluster RCT. Topics covered include a discussion of various design options, statistical.power, contamination, prior evidence, generalizability of results, ease of recruitment and need for data.collection. The purpose of the article is to inform practice by providing program evaluators with an in-depth.look at various RCT design options that were considered when searching for a way to efficiently evaluate a.school-based intervention. Accessed 15,611 times on https://pareonline.net from January 28, 2009 to December 31, 2019. For downloads from January 1, 2020 forward, please click on the PlumX Metrics link to the right

On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an algorithm that, given an arbitrary finite presentation of an automatic group $\Gamma$, will construct explicit finite models for the skeleta of $K(\Gamma,1)$ and hence compute the integral homology and cohomology of $\Gamma$.Comment: 21 pages, 4 figure