7,526 research outputs found

    Search for long lived charged massive particles in pp collisions at s-hat = 1.8TeV

    Get PDF
    We report a search for the production of long-lived charged massive particles in a data sample of 90   pb-1 of √s=1.8   TeV pp̅ collisions recorded by the Collider Detector at Fermilab. The search uses the muonlike penetration and anomalously high ionization energy loss signature expected for such a particle to discriminate it from backgrounds. The data are found to agree with background expectations, and cross section limits of O(1) pb are derived using two reference models, a stable quark and a stable scalar lepton

    Beyond the hybrid library : libraries in a Web 2.0 world

    Get PDF
    Considers the development of social networking and the concept of Web 2.0. Looks at the implications for libraries and how traditional competences remain relevant. Explores what libraries are doing and must do to remain relevan

    Electrostatics in wind-blown sand

    Full text link
    Wind-blown sand, or "saltation," is an important geological process, and the primary source of atmospheric dust aerosols. Significant discrepancies exist between classical saltation theory and measurements. We show here that these discrepancies can be resolved by the inclusion of sand electrification in a physically based saltation model. Indeed, we find that electric forces enhance the concentration of saltating particles and cause them to travel closer to the surface, in agreement with measurements. Our results thus indicate that sand electrification plays an important role in saltation.Comment: 4 journal pages, 5 figures, and supplementary material. Article is in press at PR

    Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice

    Full text link
    A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows exponentially, but with a growth factor \lambda < \protect{\sqrt[8]{2}}, which is much smaller than the growth factor \lambda = \protect{\sqrt[4]{2}} of the previous best algorithm. For bond (site) percolation on the directed square lattice the series has been extended to order 171 (158). Analysis of the series yields sharper estimates of the critical points and exponents.Comment: 20 pages, 8 figures (3 of them > 1Mb

    Dichotomous Hamiltonians with Unbounded Entries and Solutions of Riccati Equations

    Full text link
    An operator Riccati equation from systems theory is considered in the case that all entries of the associated Hamiltonian are unbounded. Using a certain dichotomy property of the Hamiltonian and its symmetry with respect to two different indefinite inner products, we prove the existence of nonnegative and nonpositive solutions of the Riccati equation. Moreover, conditions for the boundedness and uniqueness of these solutions are established.Comment: 31 pages, 3 figures; proof of uniqueness of solutions added; to appear in Journal of Evolution Equation

    Economical (k,m)-threshold controlled quantum teleportation

    Full text link
    We study a (k,m)-threshold controlling scheme for controlled quantum teleportation. A standard polynomial coding over GF(p) with prime p > m-1 needs to distribute a d-dimensional qudit with d >= p to each controller for this purpose. We propose a scheme using m qubits (two-dimensional qudits) for the controllers' portion, following a discussion on the benefit of a quantum control in comparison to a classical control of a quantum teleportation.Comment: 11 pages, 2 figures, v2: minor revision, discussions improved, an equation corrected in procedure (A) of section 4.3, v3: major revision, protocols extended, citations added, v4: minor grammatical revision, v5: minor revision, discussions extende

    Automatic paraphrasing tools: an unexpected consequence of addressing student plagiarism and the impact of COVID in distance education settings

    Get PDF
    Text matching tools employed to detect plagiarism are widely used in universities, but their availability may have pushed students to find ways to evade detection. One such method is the use of automatic paraphrasing software, where assignments can be rewritten with little effort required by students. This paper uses the search engine analytics methodology with data from SEMrush and Google Trends to estimate the level of interest in online automatic paraphrasing tools, focusing on the period 2016 to 2020 and the four countries: the USA, UK, Canada and Australia. The results show a concerning trend, with the number of searches for such tools growing during the period, especially during COVID-19, and notable increases observed during the months where assessment periods take place in universities. The method employed in this study opens up a new avenue of analysis to enrich and supplement the existing knowledge in the field of academic integrity research. The data obtained demonstrates that faculty should be alert for student use of automatic paraphrasing tools and that academic integrity interventions need to be in place across the sector to address this problem
    corecore