Search

Abstract: Sreedhar et al. [V.C. Sreedhar, G.R. Gao, Y.-F. Lee, A new framework for elimination-based data flow analysis using DJ graphs, ACM Trans. Program. Lang. Syst. 20 (2) (1998) 388–435; V.C. Sreedhar, Efficient program analysis using DJ graphs, PhD thesis, School of Computer Science, McGill University, Montréal, Québec, Canada, 1995] have presented an elimination-based algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case performance is at least quadratic in the number of nodes of the underlying graph. In contrast, Sreedhar reports a linear time behavior based on some practical applications. In this paper we prove that for goto-free programs, the average case behavior is indeed linear. As a byproduct our result also applies to the average size of the so-called dominance frontier. A thorough average case analysis based on a graph grammar is performed by studying properties of the j-edges in DJ graphs. It appears that this is the first time that a graph grammar is used in order to analyze an algorithm. The average linear time of the algorithm is obtained by classic techniques in the analysis of algorithms and data structures such as singularity analysis of generating functions and transfer lemmas. [Copyright &y& Elsevier]

To deal with the large volume of data produced by hyperspectral sensors, the Canadian Space Agency (CSA) has developed and patented two near lossless data compression algorithms for use onboard a hyperspectral satellite: successive approximation multi-stage vector quantization (SAMVQ) and hierarchical self-organizing cluster vector quantization (HSOCVQ). This paper describes the two compression algorithms and demonstrates their near lossless feature. The compression error introduced by the two compression algorithms was compared with the intrinsic noise of the original data that is caused by the instrument noise and other noise sources such as calibration and atmospheric correction errors. The experimental results showed that the compression error was not larger than the intrinsic noise of the original data when a test data set was compressed at a compression ratio of 20:1. The overall noise in the reconstructed data that contains both the intrinsic noise and the compression error is even smaller than the intrinsic noise when the data is compressed using SAMVQ. A multi-disciplinary user acceptability study has been carried out in order to evaluate the impact of the two compression algorithms on hyperspectral data applications. This paper briefly summarizes the evaluation results of the user acceptability study. A prototype hardware compressor that implements the two compression algorithms has been built using field programmable gate arrays (FPGAs) and benchmarked. The compression ratio and fidelity achieved by the hardware compressor are similar to those obtained by software simulation. [ABSTRACT FROM AUTHOR]