Trade-off associated with selection for increased ability to resist parasitoid attack in Drosophila melanogaster

Costs of resistance are widely assumed to be important in the evolution of parasite and pathogen defence in animals, but they have been demonstrated experimentally on very few occasions. Endoparasitoids are insects whose larvae develop inside the bodies of other insects where they defend themselves from attack by their hosts' immune systems (especially cellular encapsulation). Working with Drosophila melanogaster and its endoparasitoid Leptopilina boulardi, we selected for increased resistance in four replicate populations of flies. The percentage of flies surviving attack increased from about 0.5% to between 40% and 50% in five generations, revealing substantial additive genetic variation in resistance in the field population from which our culture was established. In comparison with four control lines, flies from selected lines suffered from lower larval survival under conditions of moderate to severe intraspecific competition.

Cross-resistance following artificial selection for increased defense against parasitoids in Drosophila melanogaster

An increase in resistance to one natural enemy may result in no correlated change, a positive correlated change, or a negative correlated change in the ability of the host or prey to resist other natural enemies. The type of specificity is important in understanding the evolutionary response to natural enemies and was studied here in a Drosaphila-parasitoid system. Drosophila melanogaster lines selected for increased larval resistance to the endoparasitoid wasps Asobara tabida or Leptopilina boulardi were exposed to attack by A. tabida, L. boulardi and Leptopilina heterotama at 15 degrees C, 20 degrees C, and 25 degrees C. In general, encapsulation ability increased with temperature, with the exception of the lines selected against L. boulardi, which showed the opposite trend. Lines selected against L, boulardi showed large increases in resistance against all three parasitoid species, and showed similar levels of defense against A. tabida to the lines selected against that parasitoid. In contrast, lines selected against A. tabida showed a large increase in resistance to A. tabida and generally to L. heterotoma, but displayed only a small change in their ability to survive attack by L. boulardi. Such asymmetries in correlated responses to selection for increased resistance to natural enemies may influence host-parasitoid community structure.

Sparse kernel density estimation technique based on zero-norm constraint

A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. The classical Parzen window estimate is adopted as the desired response for density estimation, and an approximate function of the zero-norm is used for achieving mathemtical tractability and algorithmic efficiency. Under the mild condition of the positive definite design matrix, the kernel weights of the proposed density estimator based on the zero-norm approximation can be obtained using the multiplicative nonnegative quadratic programming algorithm. Using the -optimality based selection algorithm as the preprocessing to select a small significant subset design matrix, the proposed zero-norm based approach offers an effective means for constructing very sparse kernel density estimates with excellent generalisation performance.

Regression based D-optimality experimental design for sparse kernel density estimation

This paper derives an efficient algorithm for constructing sparse kernel density (SKD) estimates. The algorithm first selects a very small subset of significant kernels using an orthogonal forward regression (OFR) procedure based on the D-optimality experimental design criterion. The weights of the resulting sparse kernel model are then calculated using a modified multiplicative nonnegative quadratic programming algorithm. Unlike most of the SKD estimators, the proposed D-optimality regression approach is an unsupervised construction algorithm and it does not require an empirical desired response for the kernel selection task. The strength of the D-optimality OFR is owing to the fact that the algorithm automatically selects a small subset of the most significant kernels related to the largest eigenvalues of the kernel design matrix, which counts for the most energy of the kernel training data, and this also guarantees the most accurate kernel weight estimate. The proposed method is also computationally attractive, in comparison with many existing SKD construction algorithms. Extensive numerical investigation demonstrates the ability of this regression-based approach to efficiently construct a very sparse kernel density estimate with excellent test accuracy, and our results show that the proposed method compares favourably with other existing sparse methods, in terms of test accuracy, model sparsity and complexity, for constructing kernel density estimates.

Non-testability of equal weights spatial dependence

We show that any invariant test for spatial autocorrelation in a spatial error or spatial lag model with equal weights matrix has power equal to size. This result holds under the assumption of an elliptical distribution. Under Gaussianity, we also show that any test whose power is larger than its size for at least one point in the parameter space must be biased.

To 'be', and not to 'have': auxiliary selection in unaccusative verbs in Italian

This paper investigates the characteristics of unaccusative verbs in Italian with respect to the consistency with which these verbs select the auxiliaries ‘be’ (essere) and ‘have’ (avere) in compound tense forms. The study builds on the gradient approach to split intransitivity (Sorace 2000) by exploring the behaviour of 29 intransitive Italian verbs with respect to their core-peripheral features: auxiliary selection acceptability ratings and associated variance measures. Although there is clear support for the gradient approach in relation to the general order of semantic categories along the unaccusativity gradient, the results reveal that the ordering of subclasses within the Change group conflict with that currently proposed in the literature. In addition, the findings demonstrate the aspectual and lexical semantic characteristics of internally-caused change-of-state verbs in Italian require further investigation before their auxiliary selection behaviour can be properly understood. Furthermore, contrary to the gradient account, Existence verbs, the most stative and therefore the most peripheral subclass in the unaccusativity hierarchy, exhibit behaviour more characteristic of core unaccusative verbs. This study examines a wider range of semantic subclasses of unaccusative verbs than has hitherto been reported and identifies the core-peripheral boundary for Italian.1

Mean-tracking clustering algorithm for radial basis function centre selection

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Selection of funding schemes by a borrowing decision model: a Hong Kong case study

In financial decision-making, a number of mathematical models have been developed for financial management in construction. However, optimizing both qualitative and quantitative factors and the semi-structured nature of construction finance optimization problems are key challenges in solving construction finance decisions. The selection of funding schemes by a modified construction loan acquisition model is solved by an adaptive genetic algorithm (AGA) approach. The basic objectives of the model are to optimize the loan and to minimize the interest payments for all projects. Multiple projects being undertaken by a medium-size construction firm in Hong Kong were used as a real case study to demonstrate the application of the model to the borrowing decision problems. A compromise monthly borrowing schedule was finally achieved. The results indicate that Small and Medium Enterprise (SME) Loan Guarantee Scheme (SGS) was first identified as the source of external financing. Selection of sources of funding can then be made to avoid the possibility of financial problems in the firm by classifying qualitative factors into external, interactive and internal types and taking additional qualitative factors including sovereignty, credit ability and networking into consideration. Thus a more accurate, objective and reliable borrowing decision can be provided for the decision-maker to analyse the financial options.

Variable selection algorithm for the construction of MIMO operating point dependent neurofuzzy networks

An input variable selection procedure is introduced for the identification and construction of multi-input multi-output (MIMO) neurofuzzy operating point dependent models. The algorithm is an extension of a forward modified Gram-Schmidt orthogonal least squares procedure for a linear model structure which is modified to accommodate nonlinear system modeling by incorporating piecewise locally linear model fitting. The proposed input nodes selection procedure effectively tackles the problem of the curse of dimensionality associated with lattice-based modeling algorithms such as radial basis function neurofuzzy networks, enabling the resulting neurofuzzy operating point dependent model to be widely applied in control and estimation. Some numerical examples are given to demonstrate the effectiveness of the proposed construction algorithm.

Dual-orthogonal radial basis function networks for nonlinear time series prediction

A new structure of Radial Basis Function (RBF) neural network called the Dual-orthogonal RBF Network (DRBF) is introduced for nonlinear time series prediction. The hidden nodes of a conventional RBF network compare the Euclidean distance between the network input vector and the centres, and the node responses are radially symmetrical. But in time series prediction where the system input vectors are lagged system outputs, which are usually highly correlated, the Euclidean distance measure may not be appropriate. The DRBF network modifies the distance metric by introducing a classification function which is based on the estimation data set. Training the DRBF networks consists of two stages. Learning the classification related basis functions and the important input nodes, followed by selecting the regressors and learning the weights of the hidden nodes. In both cases, a forward Orthogonal Least Squares (OLS) selection procedure is applied, initially to select the important input nodes and then to select the important centres. Simulation results of single-step and multi-step ahead predictions over a test data set are included to demonstrate the effectiveness of the new approach.