The spaces of knowledge: Contributions towards a historical geography of science

Reprinted in Trevor Barnes and Derek Gregory (eds), Reading Human Geography: The Poetics and Politics of Inquiry, (London: Arnold, 1997), pp. 27-48

Perceiving and acting upon spaces in a VR rugby task: Expertise effects in affordance detection and task achievement

This study used a virtual simulated 3vs3 rugby task to investigate whether gaps opening in particular running channels promote different actions by the ball-carrier player and whether an effect of rugby expertise is verified. We manipulated emergent gaps in three different locations: gap1 in the participant’s own running channel, gap 2 in the 1st receiver's running channel, and gap3 in the 2nd receiver's running channel. Recreational, intermediate, professional and non-rugby players performed the task. They could i) run with the ball, ii) make a short pass, or iii) make a long pass. All actions were digitally recorded. Results revealed that the emergence of gaps in the defensive line with respect to the participant’s own position significantly influenced action selection. Namely, ‘run’ was most often the action performed in gap 1, ‘short pass’ in gap 2, and ‘long pass’ in gap 3 trials. Furthermore, a strong positive relationship between expertise and task achievement was found.

“Voices, Spaces and Processes in Constitutionalism - Editorial"

(With C. Harvey, J. Shaw .)

AdaBoost Multiple Feature Selection and Combination for Face Recognition

Gabor features have been recognized as one of the most successful face representations. Encouraged by the results given by this approach, other kind of facial representations based on Steerable Gaussian first order kernels and Harris corner detector are proposed in this paper. In order to reduce the high dimensional feature space, PCA and LDA techniques are employed. Once the features have been extracted, AdaBoost learning algorithm is used to select and combine the most representative features. The experimental results on XM2VTS database show an encouraging recognition rate, showing an important improvement with respect to face descriptors only based on Gabor filters.

Max separation clustering for feature extraction from Optical Emission Spectroscopy Data

This paper proposes max separation clustering (MSC), a new non-hierarchical clustering method used for feature extraction from optical emission spectroscopy (OES) data for plasma etch process control applications. OES data is high dimensional and inherently highly redundant with the result that it is difficult if not impossible to recognize useful features and key variables by direct visualization. MSC is developed for clustering variables with distinctive patterns and providing effective pattern representation by a small number of representative variables. The relationship between signal-to-noise ratio (SNR) and clustering performance is highlighted, leading to a requirement that low SNR signals be removed before applying MSC. Experimental results on industrial OES data show that MSC with low SNR signal removal produces effective summarization of the dominant patterns in the data.

SVM Training Phase Reduction Using Dataset Feature Filtering for Malware Detection

N-gram analysis is an approach that investigates the structure of a program using bytes, characters, or text strings. A key issue with N-gram analysis is feature selection amidst the explosion of features that occurs when N is increased. The experiments within this paper represent programs as operational code (opcode) density histograms gained through dynamic analysis. A support vector machine is used to create a reference model, which is used to evaluate two methods of feature reduction, which are 'area of intersect' and 'subspace analysis using eigenvectors.' The findings show that the relationships between features are complex and simple statistics filtering approaches do not provide a viable approach. However, eigenvector subspace analysis produces a suitable filter.

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.