Differential recognition of Staphylococcus aureus quorum-sensing signals depends on both extracellular loops 1 and 2 of the transmembrane sensor AgrC.

Virulence in Staphylococcus aureus is regulated via agr-dependent quorum sensing in which an autoinducing peptide (AIP) activates AgrC, a histidine protein kinase. AIPs are usually thiolactones containing seven to nine amino acid residues in which the thiol of the central cysteine is linked to the alpha-carboxyl of the C-terminal amino acid residue. The staphylococcal agr locus has diverged such that the AIPs of the four different S. aureus agr groups self-activate but cross-inhibit. Consequently, although the agr system is conserved among the staphylococci, it has undergone significant evolutionary divergence whereby to retain functionality, any changes in the AIP-encoding gene (agrD) that modifies AIP structure must be accompanied by corresponding changes in the AgrC receptor. Since AIP-1 and AIP-4 only differ by a single amino acid, we compared the transmembrane topology of AgrC1 and AgrC4 to identify amino acid residues involved in AIP recognition. As only two of the three predicted extracellular loops exhibited amino acid differences, site-specific mutagenesis was used to exchange the key AgrC1 and AgrC4 amino acid residues in each loop either singly or in combination. A novel lux-based agrP3 reporter gene fusion was constructed to evaluate the response of the mutated AgrC receptors. The data obtained revealed that while differential recognition of AIP-1 and AIP-4 depends primarily on three amino acid residues in loop 2, loop 1 is essential for receptor activation by the cognate AIP. Furthermore, a single mutation in the AgrC1 loop 2 resulted in conversion of (Ala5)AIP-1 from a potent antagonist to an activator, essentially resulting in the forced evolution of a new AIP group. Taken together, our data indicate that loop 2 constitutes the predicted hydrophobic pocket that binds the AIP thiolactone ring while the exocyclic amino acid tail interacts with loop 1 to facilitate receptor activation.

Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.

Object detecting artificial retina

This paper describes the novel use of agent and cellular neural Hopfield network techniques in the design of a self-contained, object detecting retina. The agents, which are used to detect features within an image, are trained using the Hebbian method which has been modified for the cellular architecture. The success of each agent is communicated with adjacent agents in order to verify the detection of an object. Initial work used the method to process bipolar images. This has now been extended to handle grey scale images. Simulations have demonstrated the success of the method and further work is planned in which the device is to be implemented in hardware.

Weightless neural nets for face recognition: a comparison

This paper considers the application of weightless neural networks (WNNs) to the problem of face recognition and compares the results with those provided using a more complicated multiple neural network approach. WNNs have significant advantages over the more common forms of neural networks, in particular in term of speed of operation and learning. A major difficulty when applying neural networks to face recognition problems is the high degree of variability in expression, pose and facial details: the generalisation properties of a WNN can be crucial. In the light of this problem a software simulator of a WNN has been built and the results of some initial tests are presented and compared with other techniques

Optimising memory usage in n-tuple neural networks

The use of n-tuple or weightless neural networks as pattern recognition devices is well known (Aleksander and Stonham, 1979). They have some significant advantages over the more common and biologically plausible networks, such as multi-layer perceptrons; for example, n-tuple networks have been used for a variety of tasks, the most popular being real-time pattern recognition, and they can be implemented easily in hardware as they use standard random access memories. In operation, a series of images of an object are shown to the network, each being processed suitably and effectively stored in a memory called a discriminator. Then, when another image is shown to the system, it is processed in a similar manner and the system reports whether it recognises the image; is the image sufficiently similar to one already taught? If the system is to be able to recognise and discriminate between m-objects, then it must contain m-discriminators. This can require a great deal of memory. This paper describes various ways in which memory requirements can be reduced, including a novel method for multiple discriminator n-tuple networks used for pattern recognition. By using this method, the memory normally required to handle m-objects can be used to recognise and discriminate between 2^m — 2 objects.

On-line handwritten segmentation in linear drawings

This paper addresses the problem of tracking line segments corresponding to on-line handwritten obtained through a digitizer tablet. The approach is based on Kalman filtering to model linear portions of on-line handwritten, particularly, handwritten numerals, and to detect abrupt changes in handwritten direction underlying a model change. This approach uses a Kalman filter framework constrained by a normalized line equation, where quadratic terms are linearized through a first-order Taylor expansion. The modeling is then carried out under the assumption that the state is deterministic and time-invariant, while the detection relies on double thresholding mechanism which tests for a violation of this assumption. The first threshold is based on an approach of layout kinetics. The second one takes into account the jump in angle between the past observed direction of layout and its current direction. The method proposed enables real-time processing. To illustrate the methodology proposed, some results obtained from handwritten numerals are presented.

Object-based three-dimensional X-ray imaging

A form of three-dimensional X-ray imaging, called Object 3-D, is introduced, where the relevant subject material is represented as discrete ‘objects’. The surface of each such object is derived accurately from the projections of its outline, and of its other discontinuities, in about ten conventional X-ray views, distributed in solid angle. This technique is suitable for many applications, and permits dramatic savings in radiation exposure and in data acquisition and manipulation. It is well matched to user-friendly interactive displays.