Grey-box radial basis function modelling: the art of incorporating prior knowledge

A basic principle in data modelling is to incorporate available a priori information regarding the underlying data generating mechanism into the modelling process. We adopt this principle and consider grey-box radial basis function (RBF) modelling capable of incorporating prior knowledge. Specifically, we show how to explicitly incorporate the two types of prior knowledge: the underlying data generating mechanism exhibits known symmetric property and the underlying process obeys a set of given boundary value constraints. The class of orthogonal least squares regression algorithms can readily be applied to construct parsimonious grey-box RBF models with enhanced generalisation capability.

A-optimality orthogonal forward regression algorithm using branch and bound

In this brief, we propose an orthogonal forward regression (OFR) algorithm based on the principles of the branch and bound (BB) and A-optimality experimental design. At each forward regression step, each candidate from a pool of candidate regressors, referred to as S, is evaluated in turn with three possible decisions: 1) one of these is selected and included into the model; 2) some of these remain in S for evaluation in the next forward regression step; and 3) the rest are permanently eliminated from S. Based on the BB principle in combination with an A-optimality composite cost function for model structure determination, a simple adaptive diagnostics test is proposed to determine the decision boundary between 2) and 3). As such the proposed algorithm can significantly reduce the computational cost in the A-optimality OFR algorithm. Numerical examples are used to demonstrate the effectiveness of the proposed algorithm.

Backward elimination model construction for regression and classification using leave-one-out criteria

A fundamental principle in practical nonlinear data modeling is the parsimonious principle of constructing the minimal model that explains the training data well. Leave-one-out (LOO) cross validation is often used to estimate generalization errors by choosing amongst different network architectures (M. Stone, "Cross validatory choice and assessment of statistical predictions", J. R. Stast. Soc., Ser. B, 36, pp. 117-147, 1974). Based upon the minimization of LOO criteria of either the mean squares of LOO errors or the LOO misclassification rate respectively, we present two backward elimination algorithms as model post-processing procedures for regression and classification problems. The proposed backward elimination procedures exploit an orthogonalization procedure to enable the orthogonality between the subspace as spanned by the pruned model and the deleted regressor. Subsequently, it is shown that the LOO criteria used in both algorithms can be calculated via some analytic recursive formula, as derived in this contribution, without actually splitting the estimation data set so as to reduce computational expense. Compared to most other model construction methods, the proposed algorithms are advantageous in several aspects; (i) There are no tuning parameters to be optimized through an extra validation data set; (ii) The procedure is fully automatic without an additional stopping criteria; and (iii) The model structure selection is directly based on model generalization performance. The illustrative examples on regression and classification are used to demonstrate that the proposed algorithms are viable post-processing methods to prune a model to gain extra sparsity and improved generalization.

Grey-box radial basis function modelling

A fundamental principle in data modelling is to incorporate available a priori information regarding the underlying data generating mechanism into the modelling process. We adopt this principle and consider grey-box radial basis function (RBF) modelling capable of incorporating prior knowledge. Specifically, we show how to explicitly incorporate the two types of prior knowledge: (i) the underlying data generating mechanism exhibits known symmetric property, and (ii) the underlying process obeys a set of given boundary value constraints. The class of efficient orthogonal least squares regression algorithms can readily be applied without any modification to construct parsimonious grey-box RBF models with enhanced generalisation capability.

Land, rights and the gift: the Countryside and Rights of Way Act 2000 and the negotiation of citizenship

The Countryside and Rights of Way Act came into force at the end of 2000 with,as part of its content, new provisions relating to public access to the English and Welsh countryside. In this paper we review the main elements of the Act and assess its meaning in relation to citizenship, territoriality and the place of land in English law and society. We invoke Mauss’s (1954)concept of Gift to explain the process of brokerage being made over access and rights in the countryside. In conclusion we reflect on the Act as being indicative of a wider move towards Bromley’s (1998)post-feudal scenario for land and its governance.

Future issues with robots and cyborgs

In this article, four different practical experiments in robotics and human/machine merger are firstly described and then considered with regard to their ethical implications. Results from the experiments are discussed in terms of their meaning and application possibilities. The article is written from the perspective of scientific experimentation, opening up realistic possibilities to be faced in the future rather than giving conclusive comments on the technologies employed. Human implantation and the merger of biology and technology are key elements.

Effect of architecture on the phase behavior of AB-type block copolymer melts

Equilibrium phase diagrams are calculated for a selection of two-component block copolymer architectures using self-consistent field theory (SCFT). The topology of the phase diagrams is relatively unaffected by differences in architecture, but the phase boundaries shift significantly in composition. The shifts are consistent with the decomposition of architectures into constituent units as proposed by Gido and coworkers, but there are significant quantitative deviations from this principle in the intermediate-segregation regime. Although the complex phase windows continue to be dominated by the gyroid (G) phase, the regions of the newly discovered Fddd (O^70) phase become appreciable for certain architectures and the perforated-lamellar (PL) phase becomes stable when the complex phase windows shift towards high compositional asymmetry.