Filters








11,191 Hits in 6.8 sec

Gray codes over certain run-length sequences for local rank modulation

Xiang Wang, Fang-Wei Fu
2018 Science China Information Sciences  
Unlike previous studies on the LRM scheme, we present Gray codes over certain run-length sequences in the (1, 2, n)-LRM scheme.  ...  In this paper, we present a study on Gray codes over certain run-length sequences for the (1, 2, n)-LRM scheme to simulate virtual multilevel flash memory cells while maintaining the advantages of LRM.  ...  Conclusion For the (1, 2, n)-LRM scheme, we studied Gray codes over certain run-length sequences such that each code word is exactly realized by the bounded number of distinct charge levels.  ... 
doi:10.1007/s11432-018-9509-y fatcat:onmgaanefvdn3jnlniztvg5ioa

Special focus on distributed storage coding

Xiaohu Tang, Shu-Tao Xia, Chao Tian, Qin Huang, Xiang-Gen Xia
2018 Science China Information Sciences  
The paper "Gray codes over certain run-length sequences for local rank modulation" presents Gray codes over certain run-length sequences in the local rank-modulation scheme that can overcome the drawback  ...  The rank-modulation scheme can efficiently represent data in flash memory.  ...  Finally, we would like to express our sincere appreciation to all the authors for their High-quality manuscripts, as well as all the reviewers for the timely constructive comments. We must thank Dr.  ... 
doi:10.1007/s11432-018-9550-y fatcat:5d3y7vrkqbai5bkhjap6o6af3i

Long Range Arena: A Benchmark for Efficient Transformers [article]

Yi Tay, Mostafa Dehghani, Samira Abnar, Yikang Shen, Dara Bahri, Philip Pham, Jinfeng Rao, Liu Yang, Sebastian Ruder, Donald Metzler
2020 arXiv   pre-print
Transformers do not scale very well to long sequence lengths largely because of quadratic self-attention complexity.  ...  Our benchmark code will be released at https://github.com/google-research/long-range-arena.  ...  David Dohan and Manzil Zaheer for help on the BigBird implementation. Anselm Levskaya for some useful reference code for Reformers. Orhan Firat for helpful pointers.  ... 
arXiv:2011.04006v1 fatcat:fluopa56nreabkolp7p5ydrgve

StatSym: Vulnerable Path Discovery through Statistics-Guided Symbolic Execution

Fan Yao, Yongbo Li, Yurong Chen, Hongfa Xue, Tian Lan, Guru Venkataramani
2017 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)  
Results show that StatSym is able to assist the symbolic executor, KLEE, in identifying the vulnerable paths for all of the four cases, whereas pure symbolic execution fails in three out of four applications  ...  Global variables, function parameters, return values, and occasionally, certain local variables are components of such program states.  ...  Such runs are provided to StatSym by the users, which are then used by the statistical sampling module.  ... 
doi:10.1109/dsn.2017.57 dblp:conf/dsn/YaoLCXLV17 fatcat:cqqlrhon2vbdhbhejsnhvnvuqy

The impact of lossless image compression to radiographs

Thomas M. Lehmann, Jürgen Abel, Claudia Weiss, Steven C. Horii, Osman M. Ratib
2006 Medical Imaging 2006: PACS and Imaging Informatics  
The effect of lossy image compression is frequently analyzed with respect to images from a certain modality supporting a certain diagnosis.  ...  Over all, the BWCA is slightly but significantly more effective than JPEG 2000. Both compression schemes reduce the required bits per pixel (bpp) below 3.  ...  It replaces runs of repeated symbols by the symbol of the run and the length of the run. However, if the sequence length is only 1, the RLE scheme increases the required storage space for this pixel.  ... 
doi:10.1117/12.651697 fatcat:bxc7fmjjtrhl3oo2efllc6gcei

Flexible utilization of spatial- and motor-based codes for the storage of visuo-spatial information [article]

Margaret M. Henderson, Rosanne L. Rademaker, John T. Serences
2021 bioRxiv   pre-print
For example, remembered visual information might be stored in sensory areas for easier comparison to future sensory inputs (i.e. a retrospective code) or might be remapped into a more abstract, output-oriented  ...  format and stored in motor areas (i.e. a prospective code).  ...  The total run length was 313 seconds.  ... 
doi:10.1101/2021.07.08.451663 fatcat:p2gyq3unbjdsbjn6xyepxv5wzi

POLYSHIFT Communications Software for the Connection Machine System CM-200

William George, Ralph G. Brickner, S. Lennart Johnsson
1994 Scientific Programming  
We describe the use and implementation of a polyshift function PSHIFT for circular shifts and end-offs shifts.  ...  Polyshift is useful in many scientific codes using regular grids, such as finite difference codes in several dimensions, and multigrid codes, molecular dynamics computations, and in lattice gauge physics  ...  We thank the Advanced Computing Laboratory of Los Alamos National Laboratory for access to the CM{200 located there. Valuable assistance and advice was given by a  ... 
doi:10.1155/1994/987498 fatcat:zedkqcuyqvbz7lxmgvr7p2e7ou

Systematic identification of long noncoding RNAs expressed during zebrafish embryogenesis

A. Pauli, E. Valen, M. F. Lin, M. Garber, N. L. Vastenhouw, J. Z. Levin, L. Fan, A. Sandelin, J. L. Rinn, A. Regev, A. F. Schier
2011 Genome Research  
the Broad Sequencing Platform for all sequencing work; Sara Chauvin for Project Management at the Broad Institute; Dongkeun Jang, Michael Reich, and Jill Mesirov (Broad Institute) for help in creating  ...  Acknowledgments We thank Cole Trapnell for helpful advice and continuous support with Cufflinks; Geo Pertea for help with Cuffcompare; UCSC and Ann Zweig for providing the teleost sequence alignments;  ...  The complete branch length (CBL) score refers to the alignment quality over the entire length of the transcript (right).  ... 
doi:10.1101/gr.133009.111 pmid:22110045 pmcid:PMC3290793 fatcat:m5agzpp7t5hqzc7gag6azuqipi

P-value-based regulatory motif discovery using positional weight matrices

H. Hartmann, E. W. Guthohrlein, M. Siebert, S. Luehr, J. Soding
2012 Genome Research  
The approach can naturally combine P-values for motif enrichment, conservation, and localization.  ...  The first describe binding motifs by sequence patterns and search the patterns with highest statistical significance for enrichment.  ...  Acknowledgments We thank Mark Schroeder for providing us with the set of segmentation modules, insightful discussions, and for testing XXmotif.  ... 
doi:10.1101/gr.139881.112 pmid:22990209 pmcid:PMC3530678 fatcat:nqh45pooybghpecf4sp2vfdpc4

On the source-identification method

William M. Hartmann, Brad Rakerd, Joseph B. Gaalaas
1998 Journal of the Acoustical Society of America  
Acknowledgments We thank Mark Schroeder for providing us with the set of segmentation modules, insightful discussions, and for testing XXmotif.  ...  Many thanks to Claudia Gugenmus for testing initial versions of XXmotif and Anja Kiesel and Mark Heron for help with the human core promoter analysis.  ...  Therefore, finding binding motifs for regulatory factors that are expected to be enriched in certain sequences is of central importance in the analysis of most of these types of experiments.  ... 
doi:10.1121/1.423936 pmid:9857513 fatcat:ovyks4s2rrg5dffkxl7ktpck2y

Mutation Based Feature Localization

Jan Malburg, Emmanuelle Encrenaz-Tiphene, Gorschwin Fey
2014 2014 15th International Microprocessor Test and Verification Workshop  
In this paper we present a technique for automatically localizing the parts of the code which are relevant for a feature.  ...  The presented approach uses mutants changing the code of the design at a certain location.  ...  File ranking All three approaches for feature localization allow to rank the files of the design with respect to the likelihood whether they contain code relevant for a feature.  ... 
doi:10.1109/mtv.2014.14 dblp:conf/mtv/MalburgEF14 fatcat:yhknpkti2vathgpaughughkjja

Index transformation algorithms in a linear algebra framework

A. Edelman, S. Heller, S. Lennart Johnsson
1994 IEEE Transactions on Parallel and Distributed Systems  
We present a linear algebraic formulation for a class of index transformations such as Gray code encoding and decoding, matrix transpose, bit reversal, vector reversal, shu es, and other index or dimension  ...  We show how all the widely known properties of Gray codes, and some not so well-known properties as well, can be derived using this framework.  ...  Finally, we would like to thank Emily Stone for her excellent assistance in editing.  ... 
doi:10.1109/71.334903 fatcat:y5i7pj553bgo7fdlfjvkq772le

Texture Analysis in Magnetic Resonance Imaging: Review and Considerations for Future Applications [chapter]

Andrés Larroza, Vicente Bodí, David Moratal
2016 Assessment of Cellular and Organ Function and Dysfunction using Direct and Derived MRI Methodologies  
Texture analysis is a technique used for the quantification of image texture.  ...  The number of runs for each gray-level is allocated in the run-length matrix (c). For example, there are two runs of size two for the gray-level of three (circled values).  ...  Run-length matrix Run-length matrices consider higher-order statistical information in comparison with cooccurrence matrices. Runs of a specific gray-level are counted for a chosen direction.  ... 
doi:10.5772/64641 fatcat:sw7nodso7rfpfjohaopmrt2zta

Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutions [article]

Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot
2022 arXiv   pre-print
It can also be enriched to encode the generalized rank invariant as a ℤ-linear combination of generalized rank invariants in fixed classes of interval modules.  ...  Like its unsigned counterpart in one-parameter persistence, the signed barcode encodes the rank invariant as a ℤ-linear combination of rank invariants of indicator modules supported on segments in the  ...  Moreover, the running time of computing the minimal rank decomposition is dominated by the running time of pre-computing the usual rank invariant, for which there is room for improvement.  ... 
arXiv:2107.06800v2 fatcat:nndqy6c5krgwxfwox7csl4uzqq

Repulsive parallel MCMC algorithm for discovering diverse motifs from large sequence sets

Hisaki Ikebata, Ryo Yoshida, John Hancock
2015 Bioinformatics  
Motivation: The motif discovery problem consists of finding recurring patterns of short strings in a set of nucleotide sequences.  ...  Availability and implementation: A Cþþ implementation of RPMCMC and discovered cofactor motifs for the 228 ENCODE ChIP-seq datasets are available from  ...  Acknowledgment We thank the ENCODE project consortium for making its data publicly available, specifically to the groups who provided the SYDH TFBS ChIP-seq datasets.  ... 
doi:10.1093/bioinformatics/btv017 pmid:25583120 pmcid:PMC4426842 fatcat:jos5eyyzhba6hkkvtkswu4de64
« Previous Showing results 1 — 15 out of 11,191 results