The historical surface temperature dataset HadCRUT provides a record of surface temperature trends and variability since 1850. A new version of this dataset, HadCRUT3, has been produced; benefiting from recent improvements to the sea-surface temperature dataset which forms its marine component

to elicit comments and to further debate. Strengthening fiscal frameworks, in particular fiscal rules, has emerged as a key response to the fiscal legacy of the crisis. This paper takes stock of fiscal rules in use around the world, compiles a dataset—covering national and supranational fiscal rules, in 81

to the machine learning community. There are in the literature some indications that very simple rules may achieve surprisingly high accuracy on many datasets. For example, Rendell occasionally remarks that many real world datasets have "few peaks (often just one) " and so are &

A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several types of queries, including the `Query By Example' type (which translates to a range query); the `all pairs' query (which translates to a spatial join [8]); the nearest-neighbor or best-match query, etc. However, designing feature extraction functions can be hard. It is relatively easier for a domain expert to assess the similarity/distance of two objects. Given only the distance information though, it is not obvious how to map objects into points. This is exactly the topic of this paper. We describe a fast algorithm to map objects into points in some k-dimensional space (k is user-defined), such that the dis-similarities are preserved. There are two benefits from this mapping: (a) efficient ret...

In an increasing number of scientific disciplines, large data collections are emerging as important community resources. In this paper, we introduce design principles for a data management architecture called the Data Grid. We describe two basic services that we believe are fundamental to the design of a data grid, namely, storage systems and metadata management. Next, we explain how these services can be used to develop higher-level services for replica management and replica selection. We conclude by describing our initial implementation of data grid functionality.

pressure, sunshine, cloud cover, ground frost frequency, and wind speed. The climate surfaces have been constructed from a new dataset of station 1961–90 climatological normals, numbering between 19 800 (precipitation) and 3615 (wind speed). The station data were interpolated as a function of latitude

In an earlier paper, we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced

The increasing amount of genomic and molecular information is the basis for understanding higherorder biological systems, such as the cell and the 15 organism, and their interactions with the environment, as well as for medical, industrial and other practical applications. The KEGG resource

quantitative comparison of state-of-the-art multi-view stereo reconstruction algorithms on six bench-mark datasets. The datasets, evaluation details, and in-structions for submitting new models are available online at

Variable and feature selection have become the focus of much research in areas of application for which datasets with tens or hundreds of thousands of variables are available.