223,433 research outputs found

    Simulations of the Interaction Region in a Photon-Photon Collider

    Get PDF
    The status and initial performance of a simulation program CAIN for interaction region of linear colliders is described. The program is developed to be applicable for e+e-, e-e-, e-gamma and gamma-gamma linear colliders. As an example of an application, simulation of a gamma-gamma collider option of NLC is reported.Comment: 16 pages, 6 eps figures, use epsf.st

    Electron and phonon correlations in systems of one-dimensional electrons coupled to phonons

    Full text link
    Electron and phonon correlations in systems of one-dimensional electrons coupled to phonons are studied at low temperatures by emphasizing on the effect of electron-phonon backward scattering. It is found that the 2kF2k_F-wave components of the electron density and phonon displacement field share the same correlations. Both correlations are quasi-long-ranged for a single conducting chain coupled to one-dimensional or three-dimensional phonons, and they are long-ranged for repulsive electron-electron interactions for a three-dimensional array of parallel one-dimensional conducting chains coupled to three-dimensional phonons

    Enhanced collimated GeV monoenergetic ion acceleration from a shaped foil target irradiated by a circularly polarized laser pulse

    Full text link
    Using multi-dimensional particle-in-cell (PIC) simulations we study ion acceleration from a foil irradiated by a circularly polarized laser pulse at 1022W/cm^2 intensity. When the foil is shaped initially in the transverse direction to match the laser intensity profile, the center part of the target can be uniformly accelerated for a longer time compared to a usual flat target. Target deformation and undesirable plasma heating are effectively suppressed. The final energy spectrum of the accelerated ion beam is improved dramatically. Collimated GeV quasi-mono-energetic ion beams carrying as much as 18% of the laser energy are observed in multi-dimensional simulations. Radiation damping effects are also checked in the simulations.Comment: 4 pages, 4 figure

    Surface Roughness Dominated Pinning Mechanism of Magnetic Vortices in Soft Ferromagnetic Films

    Full text link
    Although pinning of domain walls in ferromagnets is ubiquitous, the absence of an appropriate characterization tool has limited the ability to correlate the physical and magnetic microstructures of ferromagnetic films with specific pinning mechanisms. Here, we show that the pinning of a magnetic vortex, the simplest possible domain structure in soft ferromagnets, is strongly correlated with surface roughness, and we make a quantitative comparison of the pinning energy and spatial range in films of various thickness. The results demonstrate that thickness fluctuations on the lateral length scale of the vortex core diameter, i.e. an effective roughness at a specific length scale, provides the dominant pinning mechanism. We argue that this mechanism will be important in virtually any soft ferromagnetic film.Comment: 4 figure

    Constraint Satisfaction with Counting Quantifiers

    Full text link
    We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly between exists^1:=exists and exists^n:=forall (the domain being of size n) already affords the maximal possible complexity of QCSPs (which have both exists and forall), being Pspace-complete for a suitably chosen template. Next, we focus on the complexity of subsets of counting quantifiers on clique and cycle templates. For cycles we give a full trichotomy -- all such problems are in L, NP-complete or Pspace-complete. For cliques we come close to a similar trichotomy, but one case remains outstanding. Afterwards, we consider the generalisation of CSPs in which we augment the extant quantifier exists^1:=exists with the quantifier exists^j (j not 1). Such a CSP is already NP-hard on non-bipartite graph templates. We explore the situation of this generalised CSP on bipartite templates, giving various conditions for both tractability and hardness -- culminating in a classification theorem for general graphs. Finally, we use counting quantifiers to solve the complexity of a concrete QCSP whose complexity was previously open
    • …
    corecore