From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Handbook of Applied Cryptography

ROUGE stands for Recall-Oriented Understudy for Gisting Evaluation. It includes measures to automatically determine the quality of a summary by comparing it to other (ideal) summaries created by humans. The measures count the number of overlapping units such as n-gram, word sequences, and word pairs between the computer-generated summary to be evaluated and the ideal summaries created by humans. This paper introduces four different ROUGE measures: ROUGE-N, ROUGE-L, ROUGE-W, and ROUGE-S included in the ROUGE summarization evaluation package and their evaluations. Three of them have been used in the Document Understanding Conference (DUC) 2004, a large-scale summarization evaluation sponsored by NIST.

/pdf/rouge-a-package-for-automatic-evaluation-of-summaries-2tymbd14i8.pdf

ROUGE: A Package for Automatic Evaluation of Summaries

The proliferation of mobile computing devices and local-area wireless networks has fostered a growing interest in location-aware systems and services. In this paper we present RADAR, a radio-frequency (RF)-based system for locating and tracking users inside buildings. RADAR operates by recording and processing signal strength information at multiple base stations positioned to provide overlapping coverage in the area of interest. It combines empirical measurements with signal propagation modeling to determine user location and thereby enable location-aware services and applications. We present experimental results that demonstrate the ability of RADAR to estimate user location with a high degree of accuracy.

/pdf/radar-an-in-building-rf-based-user-location-and-tracking-ow0on2sogt.pdf

RADAR: an in-building RF-based user location and tracking system

We describe a new computer program, SnpEff, for rapidly categorizing the effects of variants in genome sequences. Once a genome is sequenced, SnpEff annotates variants based on their genomic locations and predicts coding effects. Annotated genomic locations include intronic, untranslated region, upstream, downstream, splice site, or intergenic regions. Coding effects such as synonymous or non-synonymous amino acid replacement, start codon gains or losses, stop codon gains or losses, or frame shifts can be predicted. Here the use of SnpEff is illustrated by annotating ~356,660 candidate SNPs in ~117 Mb unique sequences, representing a substitution rate of ~1/305 nucleotides, between the Drosophila melanogaster w1118; iso-2; iso-3 strain and the reference y1; cn1 bw1 sp1 strain. We show that ~15,842 SNPs are synonymous and ~4,467 SNPs are non-synonymous (N/S ~0.28). The remaining SNPs are in other categories, such as stop codon gains (38 SNPs), stop codon losses (8 SNPs), and start codon gains (297 SNPs) in...

A program for annotating and predicting the effects of single nucleotide polymorphisms, SnpEff: SNPs in the genome of Drosophila melanogaster strain w1118; iso-2; iso-3

http://www.ai.mit.edu/courses/6.891-f00/text/DHSAppendix.pdf

Pattern Classification (2nd ed.)

This paper describes the functionalin of ViC*, a compiler for a variant of rhe dura-parallel language C* wirh supporr for uur-ofcore dara. The compiler translates C* programs with shapes declared outofcore. which describe parallel data srored on disk. The compiler output is a SPMD-snle program in standard C wirh I/O and library calls added ro eflcientlj access out-of-core parallel dara. The ViC* compiler also applies several program transformations ro improve our-ofcore dara access.

http://ieeexplore.ieee.org/iel4/5401/14599/00665140.pdf

ViC*: A Compiler for Virtual-Memory C* (Extended Abstract)

The FG programming framework allows users to develop external-memory programs that mitigate high latency operations, such as disk accesses and interprocessor communication. Previous research culminated in FG 1.4, which structures programs as software pipelines that operate on large buffers, where each stage of the pipeline runs in its own thread. FG was originally developed with only linear pipeline structures in mind, but later versions, up to 1.4, expanded the original concept to include various nonlinear structures. When we reviewed the codebase for FG 1.4, we found that as FG picked up more features, the code became increasingly convoluted. Consequently, we decided to fully redesign and reimplement FG from a clean slate, producing FG 2.0. The underlying paradigm changes from a pipeline to a network of stages. With the network paradigm, several constructs that required special support in FG 1.4 come for free. Early experiences with FG 2.0 indicate that programs that use it are significantly smaller than they were with FG 1.4 and that they run faster.

Networks beat pipelines: the design of FG 2.0

The standard binary reflected Gray code produces a permutation of the sequence of integers (0, 1,…, n − 1), where n is a power of 2, such that the binary representation of each integer in the permuted sequence differs from the binary representation of the preceding integer in exactly one bit. In an earlier paper, we presented two methods to compute binary dense Gray codes, which extend the possible values of n to the set of all positive integers while preserving both the Gray-code property — only one bit changes between each pair of consecutive integers — and the denseness property — the sequence contains exactly the n integers 0 to n − 1. This paper generalizes our method for binary dense Gray codes to arbitrary radices that may be either a single fixed radix for all digits or mixed radices, so that each digit may have a different radix. That is, we show how to produce a permutation of (0, 1, …, n−1) represented in any set of radices, such that the representation of each number differs from the representation of the preceding number in exactly one digit, and the values of these digits differ by exactly 1. We provide a simple formula for this permuation, which we can use to quickly compute a Hamiltonian path for a dynamic array of n nodes, where the nodes are added and deleted in order along the k dimensions of a grid network.

/pdf/dense-gray-codes-in-mixed-radices-5bnrrs8euy.pdf

Dense gray codes in mixed radices

As a class project, we implemented a version of CVL, the C Vector Library, on a DECmpp 12000/Sx 2000, which is equivalent to the MasPar MP-2 massively parallel computer. We compare our implementation, DartCVL, to the University of North Carolina implementation, UnCvl. DartCVL was designed for the MP-2 architecture and UnCvl was designed for the MP-1. Because the MasPar MP-1 and MP-2 are functionally equivalent, both DartCVL and UnCvl will run on either. Differences in the designs of the two machines, however, may lead to different software design decisions. DartCVL differs from UnCvl in two key ways. First, DartCVL uses hierarchical virtualization, whereas UnCvl uses cut-and-stack. Second, DartCVL runs as much serial code as possible on the console, whereas UnCvl runs all serial code on the Array Control Unit (ACU). The console (a DECstation 5000/240 at Dartmouth) has a significantly faster serial processor than the ACU. DartCVL is optimized for the MP-2, and our timing results indicate that it usually runs faster than UnCvl on the 2048-processor machine at Dartmouth.

/pdf/dartcvl-the-dartmouth-c-vector-library-1oy54c896u.pdf

Thomas H. Cormen

Papers

ViC: A Compiler for Virtual-Memory C (Extended Abstract)

Networks beat pipelines: the design of FG 2.0

Dense gray codes in mixed radices

DartCVL: The Dartmouth C Vector Library

Enhancing Asynchronous Parallel Computing