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 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.

Infant Attachment Security and the Timing of Puberty: Testing an Evolutionary Hypothesis

Life-history theories of the early programming of human reproductive strategy stipulate that early rearing experience, including that reflected in infant-parent attachment security, regulates psychological, behavioral, and reproductive development. We tested the hypothesis that infant attachment insecurity, compared with infant attachment security, at the age of 15 months predicts earlier pubertal maturation. Focusing on 373 White females enrolled in the National Institute of Child Health and Human Development Study of Early Child Care and Youth Development, we gathered data from annual physical exams from the ages of 9½ years to 15½ years and from self-reported age of menarche. Results revealed that individuals who had been insecure infants initiated and completed pubertal development earlier and had an earlier age of menarche compared with individuals who had been secure infants, even after accounting for age of menarche in the infants’ mothers. These results support a conditional-adaptational view of individual differences in attachment security and raise questions about the biological mechanisms responsible for the attachment effects we discerned.

Parameter estimation based on stacked regression and evolutionary algorithms

A new parameter-estimation algorithm, which minimises the cross-validated prediction error for linear-in-the-parameter models, is proposed, based on stacked regression and an evolutionary algorithm. It is initially shown that cross-validation is very important for prediction in linear-in-the-parameter models using a criterion called the mean dispersion error (MDE). Stacked regression, which can be regarded as a sophisticated type of cross-validation, is then introduced based on an evolutionary algorithm, to produce a new parameter-estimation algorithm, which preserves the parsimony of a concise model structure that is determined using the forward orthogonal least-squares (OLS) algorithm. The PRESS prediction errors are used for cross-validation, and the sunspot and Canadian lynx time series are used to demonstrate the new algorithms.

A cluster computing implementation of a Monte Carlo simulation of a particle growth mechanism

Clusters of computers can be used together to provide a powerful computing resource. Large Monte Carlo simulations, such as those used to model particle growth, are computationally intensive and take considerable time to execute on conventional workstations. By spreading the work of the simulation across a cluster of computers, the elapsed execution time can be greatly reduced. Thus a user has apparently the performance of a supercomputer by using the spare cycles on other workstations.

Evolutionary analysis of novel serine proteases in the venom gland transcriptome of Bitis gabonica rhinoceros

Background: Serine proteases are major components of viper venom and target various stages of the blood coagulation system in victims and prey. A better understanding of the diversity of serine proteases and other enzymes present in snake venom will help to understand how the complexity of snake venom has evolved and will aid the development of novel therapeutics for treating snake bites. Methodology and Principal Findings: Four serine protease-encoding genes from the venom gland transcriptome of Bitis gabonica rhinoceros were amplified and sequenced. Mass spectrometry suggests the four enzymes corresponding to these genes are present in the venom of B. g. rhinoceros. Two of the enzymes, rhinocerases 2 and 3 have substitutions to two of the serine protease catalytic triad residues and are thus unlikely to be catalytically active, though they may have evolved other toxic functions. The other two enzymes, rhinocerases 4 and 5, have classical serine protease catalytic triad residues and thus are likely to be catalytically active, however they have glycine rather than the more typical aspartic acid at the base of the primary specificity pocket (position 189). Based on a detailed analysis of these sequences we suggest that alternative splicing together with individual amino acid mutations may have been involved in their evolution. Changes within amino acid segments which were previously proposed to undergo accelerated change in venom serine proteases have also been observed. Conclusions and Significance: Our study provides further insight into the diversity of serine protease isoforms present within snake venom and discusses their possible functions and how they may have evolved. These multiple serine protease isoforms with different substrate specificities may enhance the envenomation effects and help the snake to adapt to new habitats and diets. Our findings have potential for helping the future development of improved therapeutics for snake bites.

The chaos machine: analogue computing rediscovered (1)

Analogue computers provide actual rather than virtual representations of model systems. They are powerful and engaging computing machines that are cheap and simple to build. This two-part Retronics article helps you build (and understand!) your own analogue computer to simulate the Lorenz butterfly that's become iconic for Chaos theory.

Evolutionary genomics of the Fox genes: origin of gene families and the ancestry of gene clusters

Over the past decade genomic approaches have begun to revolutionise the study of animal diversity. In particular, genome sequencing programmes have spread beyond the traditional model species to encompass an increasing diversity of animals from many different phyla, as well as unicellular eukaryotes that are closely related to the animals. Whole genome sequences allow researchers to establish, with reasonable confidence, the full complement of any particular family of genes in a genome. Comparison of gene complements from appropriate genomes can reveal the evolutionary history of gene families, indicating when both gene diversification and gene loss have occurred. More than that, however, assembled genomes allow the genomic environment in which individual genes are found to be analysed and compared between species. This can reveal how gene diversification occurred. Here, we focus on the Fox genes, drawing from multiple animal genomes to develop an evolutionary framework explaining the timing and mechanism of origin of the diversity of animal Fox genes. Ancient linkages between genes are a prominent feature of the Fox genes, depicting a history of gene clusters, some of which may be relevant to understanding Fox gene function.