4,114 research outputs found

    Charge Ordering and Spin Dynamics in NaV2O5

    Full text link
    We report high-resolution neutron inelastic scattering experiments on the spin excitations of NaV2O5. Below Tc, two branches associated with distinct energy gaps are identified. From the dispersion and intensity of the spin excitation modes, we deduce the precise zig-zag charge distribution on the ladder rungs and the corresponding charge order (about 0.6). We argue that the spin gaps observed in the low-T phase of this compound are primarily due to the charge transfer.Comment: 4 pages, 5 figures, to appear in Phys. Rev. Let

    Amp\`ere-Class Pulsed Field Emission from Carbon-Nanotube Cathodes in a Radiofrequency Resonator

    Get PDF
    Pulsed field emission from cold carbon-nanotube cathodes placed in a radiofrequency resonant cavity was observed. The cathodes were located on the backplate of a conventional 1+121+\frac{1}{2}-cell resonant cavity operating at 1.3-GHz and resulted in the production of bunch train with maximum average current close to 0.7 Amp\`ere. The measured Fowler-Nordheim characteristic, transverse emittance, and pulse duration are presented and, when possible, compared to numerical simulations. The implications of our results to high-average-current electron sources are briefly discussed.Comment: 5 pages, 6 figures; submitted to Applied Physics Letter

    Matching Reads to Many Genomes with the r-Index

    Get PDF
    The r-index is a tool for compressed indexing of genomic databases for exact pattern matching, which can be used to completely align reads that perfectly match some part of a genome in the database or to find seeds for reads that do not. This article shows how to download and install the programs ri-buildfasta and ri-align; how to call ri-buildfasta on an FASTA file to build an r-index for that file; and how to query that index with ri-align

    Efficient Construction of a Complete Index for Pan-Genomics Read Alignment

    Get PDF
    While short read aligners, which predominantly use the FM-index, are able to easily index one or a few human genomes, they do not scale well to indexing databases containing thousands of genomes. To understand why, it helps to examine the main components of the FM-index in more detail, which is a rank data structure over the Burrows-Wheeler Transform () of the string that will allow us to find the interval in the string\u2019s suffix array () containing pointers to starting positions of occurrences of a given pattern; second, a sample of the that\u2014when used with the rank data structure\u2014allows us access to the . The rank data structure can be kept small even for large genomic databases, by run-length compressing the , but until recently there was no means known to keep the sample small without greatly slowing down access to the . Now that Gagie et al. (SODA 2018) have defined an sample that takes about the same space as the run-length compressed \u2014we have the design for efficient FM-indexes of genomic databases but are faced with the problem of building them. In 2018 we showed how to build the of large genomic databases efficiently (WABI 2018) but the problem of building Gagie et al.\u2019s sample efficiently was left open. We compare our approach to state-of-the-art methods for constructing the sample, and demonstrate that it is the fastest and most space-efficient method on highly repetitive genomic databases. Lastly, we apply our method for indexing partial and whole human genomes and show that it improves over Bowtie with respect to both memory and time

    Exact steady-state velocity of ratchets driven by random sequential adsorption

    Full text link
    We solve the problem of discrete translocation of a polymer through a pore, driven by the irreversible, random sequential adsorption of particles on one side of the pore. Although the kinetics of the wall motion and the deposition are coupled, we find the exact steady-state distribution for the gap between the wall and the nearest deposited particle. This result enables us to construct the mean translocation velocity demonstrating that translocation is faster when the adsorbing particles are smaller. Monte-Carlo simulations also show that smaller particles gives less dispersion in the ratcheted motion. We also define and compare the relative efficiencies of ratcheting by deposition of particles with different sizes and we describe an associated "zone-refinement" process.Comment: 11 pages, 4 figures New asymptotic result for low chaperone density added. Exact translocation velocity is proportional to (chaperone density)^(1/3

    Prefix-free parsing for building big BWTs

    Get PDF
    High-throughput sequencing technologies have led to explosive growth of genomic databases; one of which will soon reach hundreds of terabytes. For many applications we want to build and store indexes of these databases but constructing such indexes is a challenge. Fortunately, many of these genomic databases are highly-repetitive - a characteristic that can be exploited to ease the computation of the Burrows-Wheeler Transform (BWT), which underlies many popular indexes. In this paper, we introduce a preprocessing algorithm, referred to as prefix-free parsing, that takes a text T as input, and in one-pass generates a dictionary D and a parse P of T with the property that the BWT of T can be constructed from D and P using workspace proportional to their total size and O(|T|)-time. Our experiments show that D and P are significantly smaller than T in practice, and thus, can fit in a reasonable internal memory even when T is very large. In particular, we show that with prefix-free parsing we can build an 131-MB run-length compressed FM-index (restricted to support only counting and not locating) for 1000 copies of human chromosome 19 in 2 h using 21 GB of memory, suggesting that we can build a 6.73 GB index for 1000 complete human-genome haplotypes in approximately 102 h using about 1 TB of memory

    Asynchronous Training of Word Embeddings for Large Text Corpora

    Full text link
    Word embeddings are a powerful approach for analyzing language and have been widely popular in numerous tasks in information retrieval and text mining. Training embeddings over huge corpora is computationally expensive because the input is typically sequentially processed and parameters are synchronously updated. Distributed architectures for asynchronous training that have been proposed either focus on scaling vocabulary sizes and dimensionality or suffer from expensive synchronization latencies. In this paper, we propose a scalable approach to train word embeddings by partitioning the input space instead in order to scale to massive text corpora while not sacrificing the performance of the embeddings. Our training procedure does not involve any parameter synchronization except a final sub-model merge phase that typically executes in a few minutes. Our distributed training scales seamlessly to large corpus sizes and we get comparable and sometimes even up to 45% performance improvement in a variety of NLP benchmarks using models trained by our distributed procedure which requires 1/101/10 of the time taken by the baseline approach. Finally we also show that we are robust to missing words in sub-models and are able to effectively reconstruct word representations.Comment: This paper contains 9 pages and has been accepted in the WSDM201

    A Cosmological No-Hair Theorem

    Full text link
    A generalisation of Price's theorem is given for application to Inflationary Cosmologies. Namely, we show that on a Schwarzschild--de Sitter background there are no static solutions to the wave or gravitational perturbation equations for modes with angular momentum greater than their intrinsic spin.Comment: 9 pages, NCL94 -TP4, (Revtex

    On the dynamics of coupled S=1/2 antiferromagnetic zig-zag chains

    Full text link
    We investigate the elementary excitations of quasi one-dimensional S=1/2 systems built up from zig-zag chains with general isotropic exchange constants, using exact (Lanczos) diagonalization for 24 spins and series expansions starting from the decoupled dimer limit. For the ideal one-dimensional zig-zag chain we discuss the systematic variation of the basic (magnon) triplet excitation with general exchange parameters and in particular the presence of practically flat dispersions in certain regions of phase space. We extend the dimer expansion in order to include the effects of 3D interactions on the spectra of weakly interacting zig-zag chains. In an application to KCuCl_3 we show that this approach allows to determine the exchange interactions between individual pairs of spins from the spectra as determined in recent neutron scattering experiments.Comment: 8 pages, 9 figures; some changes, figure added; final versio
    corecore