The Web offers a corpus of over 100 million tables [6], but the meaning of each table is rarely explicit from the table itself. Header rows exist in few cases and even when they do, the attribute names are typically useless. We describe a system that attempts to recover the semantics of tables by enriching the table with additional annotations. Our annotations facilitate operations such as searching for tables and finding related tables. To recover semantics of tables, we leverage a database of class labels and relationships automatically extracted from the Web. The database of classes and relationships has very wide coverage, but is also noisy. We attach a class label to a column if a sufficient number of the values in the column are identified with that label in the database of class labels, and analogously for binary relationships. We describe a formal model for reasoning about when we have seen sufficient evidence for a label, and show that it performs substantially better than a simple majority scheme. We describe a set of experiments that illustrate the utility of the recovered semantics for table search and show that it performs substantially better than previous approaches. In addition, we characterize what fraction of tables on the Web can be annotated using our approach.

Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many similar but different queries over common data. Since executing each query separately can lead to significant scalability and performance problems, it is vital to share resources by exploiting similarities in the queries. In this paper we present ways to efficiently share streaming aggregate queries with differing periodic windows and arbitrary selection predicates. A major contribution is our sharing technique that does not require any up-front multiple query optimization. This is a significant departure from existing techniques that rely on complex static analyses of fixed query workloads. Our approach is particularly vital in streaming systems where queries can join and leave the system at any point. We present a detailed performance study that evaluates our strategies with an implementation and real data. In these experiments, our approach gives us as much as an order of magnitude performance improvement over the state of the art.

A fast self-adapting algorithm to remove broadband noise in the cepstral domain is presented. Noise removal is accomplished by cepstral subtraction in a manner which allows subtraction factors to be derived adaptively, based on the local signal-to-noise ratio (SNR) of each signal frame. Finite averaging noise estimates are used to minimize the adaptation time. The algorithm yields good speech quality with little spectral distortion. The algorithm has proven to be a useful and efficient tool for speech processing in the fast-changing F-15/F-16 aircraft cockpit environment.>

The authors present the results of a study designed to investigate the effects of subtractive-type noise reduction algorithms on LPC-based spectral parameter estimation as related to the performance of speech processors operating with input SNRs of 15 dB and below. Subtractive noise preprocessing greatly improves the SNR, but system performance improvement is not commensurate. LPC spectral estimation is affected by the character of the residual noise which exhibits greater variance and spectral granularity than the original broadband noise. The study shows that removing less than the full amount of noise and whitening it improves spectral estimation and speech device performance. Techniques and performance results are presented.>