Music tag words that describe music audio by text have different levels of abstraction. Taking this issue into account, we propose a music classification approach that aggregates multilevel and multi-scale features using pre-trained feature extractors. In particular, the feature extractors are trained in sample-level deep convolutional neural networks using raw waveforms. We show that this appr...

I will survey some of the recent exciting progress on explicit constructions of randomness extractors for independent sources. Many of the new constructions rely on explicit constructions of newly introduced pseudorandom primitives, and there remains scope of finding better explicit constructions of these primitives. I will also discuss some possible approaches for constructing optimal Ramsey g...

This paper presents and evaluates two linear feature extractors based on mutual information. These feature extractors consider general dependencies between features and class labels, as opposed to statistical techniques such as PCA which does not consider class labels and LDA, which uses only simple rst order dependencies. As evidenced by several simulations on high dimensional data sets, the p...

Protecting our environment and natural resources is a major global challenge. “Protectors” (law enforcement agencies) try to protect these natural resources, while “extractors” (criminals) seek to exploit them. In many domains, such as illegal fishing, the extractors know more about the distribution and richness of the resources than the protectors, making it extremely difficult for the protect...

In this paper, we take the concept of benchmarking as used extensively in computing and apply it to evaluating C++ fact extractors. We demonstrated the efficacy of this approach by developing a prototype benchmark, CppETS 1.0 (C++ Extractor Test Suite, pronounced see-pets) and collecting feedback in a workshop setting. The CppETS benchmark characterises C++ extractors along two dimensions: Accu...

A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...

We prove (mostly tight) space lower bounds for “streaming” (or “on-line”) computations of four fundamental combinatorial objects: error-correcting codes, universal hash functions, extractors, and dispersers. Streaming computations for these objects are motivated algorithmically by massive data set applications and complexity-theoretically by pseudorandomness and derandomization for spacebounded...

The paper presents a novel approach to the classification of binary image pixels which is based on mathematical morphology. The proposed method makes use of new operators of class extractors to extract from the original image pixels belonging to pre-defined classes. Classes consist of pixels characterized by particular morphological properties. In the paper, a general scheme of morphological cl...

Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite directio...

Fuller et al. (Asiacrypt 2013) studied on computational fuzzy extractors, and showed, as a negative result, that the existence of a computational “secure sketch” implies the existence of an information-theoretically secure sketch with slightly weaker parameters. In this work, we show a similar negative result such that, under some computational assumption, the existence of a computational fuzzy...