New Progress in Artificial Intelligence

This report concentrates on progress during the last two years at the M.I.T. Artificial Intelligence Laboratory. Topics covered include the representation of knowledge, understanding English, learning and debugging, understanding vision and productivity technology. It is stressed that these various areas are tied closely together through certain fundamental issues and problems.

Colorimetric and ratiometric fluorescence sensing of fluoride: Tuning selectivity in proton transfer

[GRAPHICS]

Parameter sensitivity in simulations of snowmelt

Essery, RLH & P, Etchevers, (2004). Parameter sensitivity in simulations of snowmelt. Journal of Geophysical Research, 109, doi:10. 1029/2004JD005036.

Feature Selection based on Rough Sets and Particle Swarm Optimization

X. Wang, J. Yang, X. Teng, W. Xia, and R. Jensen. Feature Selection based on Rough Sets and Particle Swarm Optimization. Pattern Recognition Letters, vol. 28, no. 4, pp. 459-471, 2007.

Encouraging Complementary Fuzzy Rules within Iterative Rule Learning

M. Galea, Q. Shen and V. Singh. Encouraging Complementary Fuzzy Rules within Iterative Rule Learning. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 15-22.

Computational Intelligence and Feature Selection : Rough and Fuzzy Approaches

Computational Intelligence and Feature Selection provides a high level audience with both the background and fundamental ideas behind feature selection with an emphasis on those techniques based on rough and fuzzy sets, including their hybridizations. It introduces set theory, fuzzy set theory, rough set theory, and fuzzy-rough set theory, and illustrates the power and efficacy of the feature selections described through the use of real-world applications and worked examples. Program files implementing major algorithms covered, together with the necessary instructions and datasets, are available on the Web.

Spying on Science : Western Intelligence in Divided Germany, 1945-1961

Maddrell, John, Spying on Science: Western Intelligence in Divided Germany, 1945-1961 (Oxford: Oxford University Press, 2006), pp.xi+330 RAE2008

Historical Reflections on the Uses and Limits of Intelligence

Jackson, Peter; Siegel, Jennifer., 'Historical Reflections on the Uses and Limits of Intelligence', In: Intelligence and Statecraft: The Use and Limits of Intelligence in International Society (Westport, CT: Praeger, 2005), pp.11-51 RAE2008

The Study of Intelligence in Theory and Practice

Scott, Len, and Peter Jackson, 'The Study of Intelligence in Theory and Practice', Intelligence and National Security, (2004) 19(2) pp.139-169 RAE2008

Strategic intelligence, Counter-Intelligence and Alliance Diplomacy in Anglo-French relations before the Second World War

Jackson, Peter, and Joe Maiolo, 'Strategic intelligence, Counter-Intelligence and Alliance Diplomacy in Anglo-French relations before the Second World War', Military History (2006) 65(2) pp.417-461 RAE2008

Secret Intelligence, Covert Action and Clandestine Diplomacy

Scott, L. (2004). Secret Intelligence, Covert Action and Clandestine Diplomacy. Intelligence and National Security. 19(2), pp.322-341 RAE2008

O caso do Marco

Dissertação de Mestrado apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Psicologia, especialização em Psicologia Clínica e da Saúde.

Talleres de procesos de auto-reconocimiento y diagnóstico de la cadena de valor.

74 hojas : ilustraciones, fotografías.

Learning Euclidean Embeddings for Indexing and Classification

BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures. Database and query objects are embedded into a Euclidean space, in which similarities can be rapidly measured using a weighted Manhattan distance. The key idea is formulating embedding construction as a machine learning task, where AdaBoost is used to combine simple, 1D embeddings into a multidimensional embedding that preserves a large amount of the proximity structure of the original space. This paper demonstrates that, using the machine learning formulation of BoostMap, we can optimize embeddings for indexing and classification, in ways that are not possible with existing alternatives for constructive embeddings, and without additional costs in retrieval time. First, we show how to construct embeddings that are query-sensitive, in the sense that they yield a different distance measure for different queries, so as to improve nearest neighbor retrieval accuracy for each query. Second, we show how to optimize embeddings for nearest neighbor classification tasks, by tuning them to approximate a parameter space distance measure, instead of the original feature-based distance measure.

Parameter Sensitive Detectors

Object detection can be challenging when the object class exhibits large variations. One commonly-used strategy is to first partition the space of possible object variations and then train separate classifiers for each portion. However, with continuous spaces the partitions tend to be arbitrary since there are no natural boundaries (for example, consider the continuous range of human body poses). In this paper, a new formulation is proposed, where the detectors themselves are associated with continuous parameters, and reside in a parameterized function space. There are two advantages of this strategy. First, a-priori partitioning of the parameter space is not needed; the detectors themselves are in a parameterized space. Second, the underlying parameters for object variations can be learned from training data in an unsupervised manner. In profile face detection experiments, at a fixed false alarm number of 90, our method attains a detection rate of 75% vs. 70% for the method of Viola-Jones. In hand shape detection, at a false positive rate of 0.1%, our method achieves a detection rate of 99.5% vs. 98% for partition based methods. In pedestrian detection, our method reduces the miss detection rate by a factor of three at a false positive rate of 1%, compared with the method of Dalal-Triggs.