This report describes a suite of program extractors which we developed by adopting and extending existing program parsing and extraction techniques or tools. This suite is called CX because it is mainly targeted at extracting facts from C and C++ programs. This suite is currently composed of four extractors: CPPX, BFX, LDX and CTSX. The main goal of creating CX is to provide a convenient set of...

We present POLYGLOTIE, a web-based tool for developing extractors that perform Information Extraction (IE) over multilingual data. Our tool has two core features: First, it allows users to develop extractors against a unified abstraction that is shared across a large set of natural languages. This means that an extractor needs only be created once for one language, but will then run on multilin...

We describe a method of cryptographically-secure key extraction from a noisy biometric source. The computational security of our method can be clearly argued through hardness of Learning Parity With Noise (LPN). We use a fuzzy commitment scheme so the extracted key is chosen by definition to have uniformly random bits. The biometric source is used as the noise term in the LPN problem. A key ide...

Randomness is used in many places in our daily lives. Some examples are gambling, statistics, algorithms, cryptography etc. For such applications one typically assumes a supply of completely unbiased and independent randim bits. This raises the problem of where to get these assumed random bits from. We could try and use natural sources of randomness such as sun spots, the stock market or the we...

Our main contribution in this paper is a new reduction from explicit two-source extractors for polynomially-small entropy rate and negligible error to explicit t-non-malleable extractors with seed-length that has a good dependence on t. Our reduction is based on the Chattopadhyay and Zuckerman framework [CZ16], and surprisingly we dispense with the use of resilient functions which appeared to b...

We introduce the notion of a super-strong extractor. Given two independent weak random sources X,Y , such extractor EXT(·, ·) has the property that EXT(X,Y ) is statistically random even if one is given Y . Namely, 〈Y, EXT(X,Y )〉 ≈ 〈Y,R〉. Super-strong extractors generalize the notion of strong extractors [16], which assume that Y is truly random, and extractors from two weak random sources [26,...

Discovering knowledge from textual sources and subsequently expanding the coverage of knowledge bases like DBPedia or Freebase currently requires either extensive manual work or carefully designed information extractors. Information extractors capture triples from textual sentences. Each triple consists of a subject, a predicate/property, and an object. Triples can be mediated via verbs, nouns,...

This article describes a method of classifying webpages using features extracted from the design. Design features are language independent and correspond well to a user’s first impression of a page. A number of new feature extractors were developed, capable of extracting human-readable features. These features are based on guidelines for use of color and composition in web design. The compositi...

With the increasing number of personal albums and photos in them, users have more and more problems with their organization [4]. This is due to lack of descriptive data, however, their amount only depends on the abilities and will of the image owners. Tools for metadata creation are available – the main problem is with the user motivation: because tagging and annotating of photos is usually a b...