Modular non-computational-connectionist-hybrid neural network approach to robotic systems

Spiking neural networks are usually limited in their applications due to their complex mathematical models and the lack of intuitive learning algorithms. In this paper, a simpler, novel neural network derived from a leaky integrate and fire neuron model, the ‘cavalcade’ neuron, is presented. A simulation for the neural network has been developed and two basic learning algorithms implemented within the environment. These algorithms successfully learn some basic temporal and instantaneous problems. Inspiration for neural network structures from these experiments are then taken and applied to process sensor information so as to successfully control a mobile robot.

Controlling the computational modes of the arbitrarily structured C-grid

The arbitrarily structured C-grid, TRiSK (Thuburn, Ringler, Skamarock and Klemp, 2009, 2010) is being used in the ``Model for Prediction Across Scales'' (MPAS) and is being considered by the UK Met Office for their next dynamical core. However the hexagonal C-grid supports a branch of spurious Rossby modes which lead to erroneous grid-scale oscillations of potential vorticity (PV). It is shown how these modes can be harmlessly controlled by using upwind-biased interpolation schemes for PV. A number of existing advection schemes for PV are tested, including that used in MPAS, and none are found to give adequate results for all grids and all cases. Therefore a new scheme is proposed; continuous, linear-upwind stabilised transport (CLUST), a blend between centred and linear-upwind with the blend dependent on the flow direction with respect to the cell edge. A diagnostic of grid-scale oscillations is proposed which gives further discrimination between schemes than using potential enstrophy alone and indeed some schemes are found to destroy potential enstrophy while grid-scale oscillations grow. CLUST performs well on hexagonal-icosahedral grids and unrotated skipped latitude-longitude grids of the sphere for various shallow water test cases. Despite the computational modes, the hexagonal icosahedral grid performs well since these modes are easy and harmless to filter. As a result TRiSK appears to perform better than a spectral shallow water model.

Bayesian parameter estimation for latent Markov random fields and social networks

Undirected graphical models are widely used in statistics, physics and machine vision. However Bayesian parameter estimation for undirected models is extremely challenging, since evaluation of the posterior typically involves the calculation of an intractable normalising constant. This problem has received much attention, but very little of this has focussed on the important practical case where the data consists of noisy or incomplete observations of the underlying hidden structure. This paper specifically addresses this problem, comparing two alternative methodologies. In the first of these approaches particle Markov chain Monte Carlo (Andrieu et al., 2010) is used to efficiently explore the parameter space, combined with the exchange algorithm (Murray et al., 2006) for avoiding the calculation of the intractable normalising constant (a proof showing that this combination targets the correct distribution in found in a supplementary appendix online). This approach is compared with approximate Bayesian computation (Pritchard et al., 1999). Applications to estimating the parameters of Ising models and exponential random graphs from noisy data are presented. Each algorithm used in the paper targets an approximation to the true posterior due to the use of MCMC to simulate from the latent graphical model, in lieu of being able to do this exactly in general. The supplementary appendix also describes the nature of the resulting approximation.

Solvent-dependent modulation of metal–metal electronic interactions in a dinuclear cyanoruthenate complex: a detailed electrochemical, spectroscopic and computational study

The dinuclear complex [{Ru(CN)4}2(μ-bppz)]4− shows a strongly solvent-dependent metal–metal electronic interaction which allows the mixed-valence state to be switched from class 2 to class 3 by changing solvent from water to CH2Cl2. In CH2Cl2 the separation between the successive Ru(II)/Ru(III) redox couples is 350 mVand the IVCT band (from the UV/Vis/NIR spectroelectrochemistry) is characteristic of a borderline class II/III or class III mixed valence state. In water, the redox separation is only 110 mVand the much broader IVCT transition is characteristic of a class II mixed-valence state. This is consistent with the observation that raising and lowering the energy of the d(π) orbitals in CH2Cl2 or water, respectively, will decrease or increase the energy gap to the LUMO of the bppz bridging ligand, which provides the delocalisation pathway via electron-transfer. IR spectroelectrochemistry could only be carried out successfully in CH2Cl2 and revealed class III mixed-valence behaviour on the fast IR timescale. In contrast to this, time-resolved IR spectroscopy showed that the MLCTexcited state, which is formulated as RuIII(bppz˙−)RuII and can therefore be considered as a mixed-valence Ru(II)/Ru(III) complex with an intermediate bridging radical anion ligand, is localised on the IR timescale with spectroscopically distinct Ru(II) and Ru(III) termini. This is because the necessary electron-transfer via the bppz ligand is more difficult because of the additional electron on bppz˙− which raises the orbital through which electron exchange occurs in energy. DFT calculations reproduce the electronic spectra of the complex in all three Ru(II)/Ru(II), Ru(II)/Ru(III) and Ru(III)/Ru(III) calculations in both water and CH2Cl2 well as long as an explicit allowance is made for the presence of water molecules hydrogen-bonded to the cyanides in the model used. They also reproduce the excited-state IR spectra of both [Ru(CN)4(μ-bppz)]2– and [{Ru(CN)4}2(μ-bppz)]4− very well in both solvents. The reorganization of the water solvent shell indicates a possible dynamical reason for the longer life time of the triplet state in water compared to CH2Cl2.

P-Prism: a computationally efficient approach to scaling up classification rule induction

Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unseen data. Alternative algorithms have been developed such as the Prism algorithm. Prism constructs modular rules which produce qualitatively better rules than rules induced by TDIDT. However, along with the increasing size of databases, many existing rule learning algorithms have proved to be computational expensive on large datasets. To tackle the problem of scalability, parallel classification rule induction algorithms have been introduced. As TDIDT is the most popular classifier, even though there are strongly competitive alternative algorithms, most parallel approaches to inducing classification rules are based on TDIDT. In this paper we describe work on a distributed classifier that induces classification rules in a parallel manner based on Prism.

Towards a computationally efficient approach to modular classification rule induction

Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision Trees (TDIDT) approach. However, alternative approaches have been developed such as the Prism algorithm for inducing modular rules. Prism often produces qualitatively better rules than TDIDT but suffers from higher computational requirements. We investigate approaches that have been developed to minimize the computational requirements of TDIDT, in order to find analogous approaches that could reduce the computational requirements of Prism.