We consider the problem of retrieving the k documents from a collection of strings where a given pattern P appears least often. This has potential applications in data mining, bioinformatics, security, and big data. We show that adapting the classical linear-space solutions for this problem is trivial, but the compressed-space solutions are not easy to extend. We design a new solution for this ...

About twenty years ago, many experts were still pessimistic about the possibility for making qualitative significant advancements in resolution improvement of the electron microscope. The basis for their scepticism was the Scherzer Theorem [1], which states that axially symmetric electromagnetic lenses have large intrinsic spherical and chromatic aberrations, limiting the resolution of an elect...

This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...

An annual investment of $92 billion for highways and bridges, between 2004 and 2009, is necessary to maintain the physical condition and performance characteristics of the system. An annual investment of $125.6 billion for highways and bridges is necessary to improve the physical condition and performance characteristics of the system over 20 years. An annual capital investment of $19 billion i...

We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not necessary. Instead, all provably termina...

Title of Document: BOTTOM-UP MULTIFERROIC NANOSTRUCTURES. Shenqiang Ren, Doctor of Philosophy, 2009 Directed By: Professor Manfred Wuttig Department of Materials Science and Engineering Multiferroic and especially magnetoelectric (ME) nanocomposites have received extensive attention due to their potential applications in spintronics, information storage and logic devices. The extrinsic ME coupl...

In this paper, we present a new method for propositionalization that works in a bottom-up, data-driven manner. It is tailored for biochemical databases, where the examples are 2-D descriptions of chemical compounds. The method generates all frequent fragments (i.e., linearly connected atoms) up to a user-specified length. A preliminary experiment in the domain of carcinogenicity prediction show...

In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a compound statement are computed from the Hoare tr...

While numerous extensions of Cardelli and Wegner's calculus of polymorphism and subtyping, Kernel Fun, have been studied during the past decade, one quite simple one has received little attention: the addition of a minimal type Bot, dual to the familiar maximal type Top. We develop basic meta-theory for this extension. Although most of the usual properties of Kernel Fun (existence of meets and ...