Learning and natal host influence host preference, handling time and sex allocation behaviour in a pupal parasitoid

The host choice and sex allocation decisions of a foraging female parasitoid will have an enormous influence on the life-history characteristics of her offspring. The pteromalid Pachycrepoideus vindemiae is a generalist idiobiont pupal parasitoid of many species of cyclorrhaphous Diptera. Wasps reared in Musca domestica were larger, had higher attack rates and greater male mating success than those reared in Drosophila melanogaster. In no-choice situations, naive female R vindemiae took significantly less time to accept hosts conspecific with their natal host. Parasitoids that emerged from M. domestica pupae spent similar amounts of time ovipositing in both D. melanogaster and M. domestica. Those parasitoids that had emerged from D. melanogaster spent significantly longer attacking M. domestica pupae. The host choice behaviour of female P. vindemiae was influenced by an interaction between natal host and experience. Female R vindemiae reared in M. domestica only showed a preference among hosts when allowed to gain experience attacking M. domestica, preferentially attacking that species. Similarly, female parasitoids reared on D. melanogaster only showed a preference among hosts when allowed to gain experience attacking D. melanogaster, again preferentially attacking that species. Wasp natal host also influenced sex allocation behaviour. While wasps from both hosts oviposited more females in the larger host, M. domestica, wasps that emerged from M. domestica had significantly more male-biased offspring sex ratios. These results indicate the importance of learning and natal host size in determining R vindemiae attack rates. mating success, host preference and sex allocation behaviour, all critical components of parasitoid fitness.

Nocturnal ranging behaviour of urban hedgehogs, Erinaceus europaeus, in relation to risk and reward

Urban areas have both positive and negative influences on wildlife. For terrestrial mammals, one of the principle problems is the risk associated with moving through the environment whilst foraging. In this study, we examined nocturnal patterns of movement of urban-dwelling hedgehogs (Erinaceus europaeus) in relation to (i) the risks posed by predators and motor vehicles and (ii) nightly weather patterns. Hedgehogs preferentially utilised the gardens of semi-detached and terraced houses. However, females, but not males, avoided the larger back gardens of detached houses, which contain more of the habitat features selected by badgers. This difference in the avoidance of predation risk is probably associated with sex differences in breeding behaviour. Differences in nightly movement patterns were consistent with strategies associated with mating behaviour and the accumulation of fat reserves for hibernation. Hedgehogs also exhibited differences in behaviour associated with the risks posed by humans; they avoided actively foraging near roads and road verges, but did not avoid crossing roads per se. They were, however, significantly more active after midnight when there was a marked reduction in vehicle and foot traffic. In particular, responses to increased temperature, which is associated with increased abundance of invertebrate prey, were only observed after midnight. This variation in the timing of bouts of activity would reduce the risks associated with human activities. There were also profound differences in both area ranged and activity with chronological year which warrant further investigation.

Particle swarm optimization aided orthogonal forward regression for unified data modeling

We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density function estimation. A particle swarm optimization (PSO) aided orthogonal forward regression (OFR) algorithm based on leave-one-out (LOO) criteria is developed to construct parsimonious radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines the center vector and diagonal covariance matrix of one RBF node by minimizing the LOO statistics. For regression applications, the LOO criterion is chosen to be the LOO mean square error, while the LOO misclassification rate is adopted in two-class classification applications. By adopting the Parzen window estimate as the desired response, the unsupervised density estimation problem is transformed into a constrained regression problem. This PSO aided OFR algorithm for tunable-node RBF networks is capable of constructing very parsimonious RBF models that generalize well, and our analysis and experimental results demonstrate that the algorithm is computationally even simpler than the efficient regularization assisted orthogonal least square algorithm based on LOO criteria for selecting fixed-node RBF models. Another significant advantage of the proposed learning procedure is that it does not have learning hyperparameters that have to be tuned using costly cross validation. The effectiveness of the proposed PSO aided OFR construction procedure is illustrated using several examples taken from regression and classification, as well as density estimation applications.

Radial basis function classifier construction using particle swarm optimisation aided orthogonal forward regression

We develop a particle swarm optimisation (PSO) aided orthogonal forward regression (OFR) approach for constructing radial basis function (RBF) classifiers with tunable nodes. At each stage of the OFR construction process, the centre vector and diagonal covariance matrix of one RBF node is determined efficiently by minimising the leave-one-out (LOO) misclassification rate (MR) using a PSO algorithm. Compared with the state-of-the-art regularisation assisted orthogonal least square algorithm based on the LOO MR for selecting fixednode RBF classifiers, the proposed PSO aided OFR algorithm for constructing tunable-node RBF classifiers offers significant advantages in terms of better generalisation performance and smaller model size as well as imposes lower computational complexity in classifier construction process. Moreover, the proposed algorithm does not have any hyperparameter that requires costly tuning based on cross validation.

Prediction of Parkinson’s Disease tremor onset using a radial basis function neural network based on particle swarm optimization

Deep Brain Stimulation (DBS) has been successfully used throughout the world for the treatment of Parkinson's disease symptoms. To control abnormal spontaneous electrical activity in target brain areas DBS utilizes a continuous stimulation signal. This continuous power draw means that its implanted battery power source needs to be replaced every 18–24 months. To prolong the life span of the battery, a technique to accurately recognize and predict the onset of the Parkinson's disease tremors in human subjects and thus implement an on-demand stimulator is discussed here. The approach is to use a radial basis function neural network (RBFNN) based on particle swarm optimization (PSO) and principal component analysis (PCA) with Local Field Potential (LFP) data recorded via the stimulation electrodes to predict activity related to tremor onset. To test this approach, LFPs from the subthalamic nucleus (STN) obtained through deep brain electrodes implanted in a Parkinson patient are used to train the network. To validate the network's performance, electromyographic (EMG) signals from the patient's forearm are recorded in parallel with the LFPs to accurately determine occurrences of tremor, and these are compared to the performance of the network. It has been found that detection accuracies of up to 89% are possible. Performance comparisons have also been made between a conventional RBFNN and an RBFNN based on PSO which show a marginal decrease in performance but with notable reduction in computational overhead.

Exploring carrier agents in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried onto a computing core by carrier agents that can seamlessly transfer between processing cores in the event of a predicted failure. The cognitive capabilities of the carrier agents on a parallel processing core serves in achieving the self-ware objectives of autonomic computing, hence applying autonomic computing concepts for the benefit of parallel computing systems. The feasibility of the proposed approach is validated by simulation studies using a multi-agent simulator on an FPGA (Field-Programmable Gate Array) and experimental studies using MPI (Message Passing Interface) on a computer cluster. Preliminary results confirm that applying autonomic computing principles to parallel computing systems is beneficial.

A mathematical model, implementation and study of a swarm system

The work reported in this paper is motivated towards the development of a mathematical model for swarm systems based on macroscopic primitives. A pattern formation and transformation model is proposed. The pattern transformation model comprises two general methods for pattern transformation, namely a macroscopic transformation method and a mathematical transformation method. The problem of transformation is formally expressed and four special cases of transformation are considered. Simulations to confirm the feasibility of the proposed models and transformation methods are presented. Comparison between the two transformation methods is also reported.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Adaptive modelling with tunable RBF network using multi-innovation RLS algorithm assisted by swarm intelligence

In this paper, we propose a new on-line learning algorithm for the non-linear system identification: the swarm intelligence aided multi-innovation recursive least squares (SI-MRLS) algorithm. The SI-MRLS algorithm applies the particle swarm optimization (PSO) to construct a flexible radial basis function (RBF) model so that both the model structure and output weights can be adapted. By replacing an insignificant RBF node with a new one based on the increment of error variance criterion at every iteration, the model remains at a limited size. The multi-innovation RLS algorithm is used to update the RBF output weights which are known to have better accuracy than the classic RLS. The proposed method can produces a parsimonious model with good performance. Simulation result are also shown to verify the SI-MRLS algorithm.