Methodological considerations in reserve system selection: a case study of Malagasy Lemurs.

Although data quality and weighting decisions impact the outputs of reserve selection algorithms, these factors have not been closely studied. We examine these methodological issues in the use of reserve selection algorithms by comparing: (1) quality of input data and (2) use of different weighting methods for prioritizing among species. In 2003, the government of Madagascar, a global biodiversity hotspot, committed to tripling the size of its protected area network to protect 10% of the country’s total land area. We apply the Zonation reserve selection algorithm to distribution data for 52 lemur species to identify priority areas for the expansion of Madagascar’s reserve network. We assess the similarity of the areas selected, as well as the proportions of lemur ranges protected in the resulting areas when different forms of input data were used: extent of occurrence versus refined extent of occurrence. Low overlap between the areas selected suggests that refined extent of occurrence data are highly desirable, and to best protect lemur species, we recommend refining extent of occurrence ranges using habitat and altitude limitations. Reserve areas were also selected for protection based on three different species weighting schemes, resulting in marked variation in proportional representation of species among the IUCN Red List of Threatened Species extinction risk categories. This result demonstrates that assignment of species weights influences whether a reserve network prioritizes maximizing overall species protection or maximizing protection of the most threatened species.

Robust face recognition with partial occlusion, illumination variation and limited training data by optimal feature selection

This study investigates face recognition with partial occlusion, illumination variation and their combination, assuming no prior information about the mismatch, and limited training data for each person. The authors extend their previous posterior union model (PUM) to give a new method capable of dealing with all these problems. PUM is an approach for selecting the optimal local image features for recognition to improve robustness to partial occlusion. The extension is in two stages. First, authors extend PUM from a probability-based formulation to a similarity-based formulation, so that it operates with as little as one single training sample to offer robustness to partial occlusion. Second, they extend this new formulation to make it robust to illumination variation, and to combined illumination variation and partial occlusion, by a novel combination of multicondition relighting and optimal feature selection. To evaluate the new methods, a number of databases with various simulated and realistic occlusion/illumination mismatches have been used. The results have demonstrated the improved robustness of the new methods.

Selection for cuticular melanism reveals immune function and life-history trade-offs in Spodoptera littoralis

Several insect species show an increase in cuticular melanism in response to high densities. In some species, there is evidence that this melanism is correlated with an up-regulation of certain immune system components, particularly phenoloxidase (PO) activity, and with the down-regulation of lysozyme activity, suggesting a trade-off between the two traits. As melanism has a genetic component, we selected both melanic and nonmelanic lines of the phase-polyphenic lepidopteran, Spodoptera littoralis, in order to test for a causative genetic link between melanism, PO activity and lysozyme activity, and to establish if there are any life-history costs associated with the melanic response. We found that, in fact, melanic lines had lower PO activity and higher lysozyme activity than nonmelanic lines, confirming a genetic trade-off between the two immune responses, but also indicating a genetic trade-off between melanism and PO activity. In addition, we found that lines with high PO activity had slower development rates suggesting that investment in PO, rather than in melanism, is costly.

Locally regularised two-stage learning algorithm for RBF network centre selection

Nonlinear models constructed from radial basis function (RBF) networks can easily be over-fitted due to the noise on the data. While information criteria, such as the final prediction error (FPE), can provide a trade-off between training error and network complexity, the tunable parameters that penalise a large size of network model are hard to determine and are usually network dependent. This article introduces a new locally regularised, two-stage stepwise construction algorithm for RBF networks. The main objective is to produce a parsomous network that generalises well over unseen data. This is achieved by utilising Bayesian learning within a two-stage stepwise construction procedure to penalise centres that are mainly interpreted by the noise.

Safe Therapeutic Economic Pharmaceutical Selection (STEPS): development, introduction and use in Northern Ireland

A number of medicine selection methods have been used worldwide for formulary purposes. In Northern Ireland, integrated medicines management is being developed, and related projects have been carried out. This paper deals with the description of the STEPS (Safe Therapeutic Economic Pharmaceutical Selection) programme. The paper outlines the development of STEPS and its application as an element of a cost-effective medicines-management process in Northern Ireland.

An efficient feature selection method for mobile devices with application to activity recognition

This paper presents a feature selection method for data classification, which combines a model-based variable selection technique and a fast two-stage subset selection algorithm. The relationship between a specified (and complete) set of candidate features and the class label is modelled using a non-linear full regression model which is linear-in-the-parameters. The performance of a sub-model measured by the sum of the squared-errors (SSE) is used to score the informativeness of the subset of features involved in the sub-model. The two-stage subset selection algorithm approaches a solution sub-model with the SSE being locally minimized. The features involved in the solution sub-model are selected as inputs to support vector machines (SVMs) for classification. The memory requirement of this algorithm is independent of the number of training patterns. This property makes this method suitable for applications executed in mobile devices where physical RAM memory is very limited. An application was developed for activity recognition, which implements the proposed feature selection algorithm and an SVM training procedure. Experiments are carried out with the application running on a PDA for human activity recognition using accelerometer data. A comparison with an information gain based feature selection method demonstrates the effectiveness and efficiency of the proposed algorithm.