We propose a new approach for analyzing price fluctuations in their strongly correlated regime ranging from minutes to months. This is done by employing a self-similarity assumption for the magnitude of coarse-grained price fluctuation or volatility. The existence of a Cramér function, the characteristic function for self-similarity, is confirmed by analyzing real price data from a stock market...

Thermal infrared (TIR) imagery is normally acquired at coarser pixel resolution than that of shortwave sensors on the same satellite platform. TIR resolution is often not suitable for monitoring crop conditions of fragmented farming lands, e.g., the accurate estimates of evapotranspiration (ET) based on surface energy balance from remote sensing for irrigation water management. Consequently, th...

A number of document similarity metrics have been used to measure the degree of web page changes. When a web page changes, the metrics often represent the change differently. In this paper, we first define criteria for evaluating the effectiveness of the metrics in terms of six important types of web page changes. The criteria satisfy ISO/IED 15408 (CC). Second, we propose a new document simila...

Similarities between different protein structures have led to the identification of protein families based upon some measure of structural similarity. Using these similarities one can classify proteins into structural families and higher-order groupings from which inferred function can be transferred. When taken for a large number of proteins, these schemes point to evolutionary relationships b...

The present study is a cross-cultural comparison of typical dreams of “being chased” between Tibetan and Han Chinese dreamers. The research is based on 208 interviews combined with responses to a Dream Questionnaire. In total 569 subjects were involved in the research project: 278 Tibetan and 291 Han undergraduate college students. Results show an overall occurrence of a being-chased dream in 9...

We present a new family of linear time algorithms for string comparison with mismatches under the string kernels framework. Based on sufficient statistics, our algorithms improve theoretical complexity bounds of existing approaches while scaling well in sequence alphabet size, the number of allowed mismatches and the size of the dataset. In particular, on large alphabets and under loose mismatc...