Table of Contents

Abstract: The European Space Agency (ESA) successfully launched the Soil Moisture and Ocean Salinity (SMOS) mission in November 2, 2009. SMOS uses a new type of instrument, a synthetic aperture radiometer named MIRAS that provides full-polarimetric multi-angular L-band brightness temperatures, from which regular and global maps of Sea Surface Salinity (SSS) and Soil Moisture (SM) are generated. Although SMOS operates in a restricted band (1400–1427 MHz), radio-frequency interference (RFI) appears in SMOS imagery in many areas of the world, and it is an important issue to be addressed for quality SSS and SM retrievals. The impact on SMOS imagery of a sinusoidal RFI source is reviewed, and the problem is illustrated with actual RFI encountered by SMOS. Two RFI detection and mitigation algorithms are developed (dual-polarization and full-polarimetric modes), the performance of the second one has been quantitatively evaluated in terms of probability of detection and false alarm (using a synthetic test scene), and results presented using real dual-polarization and full-polarimetric SMOS imagery. Finally, a statistical analysis of more than 13,000 L1b snap-shots is presented and discussed.

Abstract: We present a survey of results concerning Lempel–Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. Storer’s extension for image compression is also discussed.

Abstract: In an asynchronous data stream, the data items may be out of order with respect to their original timestamps. This paper studies the space complexity required by a data structure to maintain such a data stream so that it can approximate the set of frequent items over a sliding time window with sufficient accuracy. Prior to our work, the best solution is given by Cormode et al. [1], who gave an O (1/ε log W log (εB/ log W) min {log W, 1/ε} log |U|)- space data structure that can approximate the frequent items within an ε error bound, where W and B are parameters of the sliding window, and U is the set of all possible item names. We gave a more space-efficient data structure that only requires O (1/ε log W log (εB/ logW) log log W) space.