Interactions of decay-accelerating factor (DAF) with haemagglutinating human enteroviruses: utilizing variation in primate DAF to map virus binding sites

A cellular receptor for the haemagglutinating enteroviruses (HEV), and the protein that mediates haemagglutination, is the membrane complement regulatory protein decay accelerating factor (DAF; CD55). Although primate DAF is highly conserved, significant differences exist to enable cell lines derived from primates to be utilized for the characterization of the DAF binding phenotype of human enteroviruses. Thus, several distinct DAF-binding phenotypes of a selection of HEVs (viz. coxsackievirus A21 and echoviruses 6, 7, 11-13, 29) were identified from binding and infection assays using a panel of primate cells derived from human, orang-utan, African Green monkey and baboon tissues. These studies complement our recent determination of the crystal structure of SCR(34) of human DAF [Williams, P., Chaudhry, Y., Goodfellow, I. G., Billington, J., Powell, R., Spiller, O. B., Evans, D. J. & Lea, S. (2003). J Biol Chem 278, 10691-10696] and have enabled us to better map the regions of DAF with which enteroviruses interact and, in certain cases, predict specific virus-receptor contacts.

Semi-automatic annotation and retrieval of visual content using the topic map technology

There are still major challenges in the area of automatic indexing and retrieval of multimedia content data for very large multimedia content corpora. Current indexing and retrieval applications still use keywords to index multimedia content and those keywords usually do not provide any knowledge about the semantic content of the data. With the increasing amount of multimedia content, it is inefficient to continue with this approach. In this paper, we describe the project DREAM, which addresses such challenges by proposing a new framework for semi-automatic annotation and retrieval of multimedia based on the semantic content. The framework uses the Topic Map Technology, as a tool to model the knowledge automatically extracted from the multimedia content using an Automatic Labelling Engine. We describe how we acquire knowledge from the content and represent this knowledge using the support of NLP to automatically generate Topic Maps. The framework is described in the context of film post-production.

Evolving features-algorithms knowledge map to support NIDS data intelligence and learning loop architecting – a generalised approach to NIDS pattern feature space knowledge processing

This paper describes a proposed new approach to the Computer Network Security Intrusion Detection Systems (NIDS) application domain knowledge processing focused on a topic map technology-enabled representation of features of the threat pattern space as well as the knowledge of situated efficacy of alternative candidate algorithms for pattern recognition within the NIDS domain. Thus an integrative knowledge representation framework for virtualisation, data intelligence and learning loop architecting in the NIDS domain is described together with specific aspects of its deployment.

Evaluation of probabilistic occupancy map people detection for surveillance systems

In this paper, we evaluate the Probabilistic Occupancy Map (POM) pedestrian detection algorithm on the PETS 2009 benchmark dataset. POM is a multi-camera generative detection method, which estimates ground plane occupancy from multiple background subtraction views. Occupancy probabilities are iteratively estimated by fitting a synthetic model of the background subtraction to the binary foreground motion. Furthermore, we test the integration of this algorithm into a larger framework designed for understanding human activities in real environments. We demonstrate accurate detection and localization on the PETS dataset, despite suboptimal calibration and foreground motion segmentation input.

Generalised Dirichelt-to-Neumann map in time dependent domains

We study the heat, linear Schrodinger and linear KdV equations in the domain l(t) < x < ∞, 0 < t < T, with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.

The plastic self organising map

A novel extension to Kohonen's self-organising map, called the plastic self organising map (PSOM), is presented. PSOM is unlike any other network because it only has one phase of operation. The PSOM does not go through a training cycle before testing, like the SOM does and its variants. Each pattern is thus treated identically for all time. The algorithm uses a graph structure to represent data and can add or remove neurons to learn dynamic nonstationary pattern sets. The network is tested on a real world radar application and an artificial nonstationary problem.

Reduction of invasive tests in chagasic patients with a modified self-organizing map

The applicability of AI methods to the Chagas' disease diagnosis is carried out by the use of Kohonen's self-organizing feature maps. Electrodiagnosis indicators calculated from ECG records are used as features in input vectors to train the network. Cross-validation results are used to modify the maps, providing an outstanding improvement to the interpretation of the resulting output. As a result, the map might be used to reduce the need for invasive explorations in chronic Chagas' disease.

The Dirichlet-to-Neumann map for the elliptic sine Gordon

We analyse the Dirichlet problem for the elliptic sine Gordon equation in the upper half plane. We express the solution $q(x,y)$ in terms of a Riemann-Hilbert problem whose jump matrix is uniquely defined by a certain function $b(\la)$, $\la\in\R$, explicitly expressed in terms of the given Dirichlet data $g_0(x)=q(x,0)$ and the unknown Neumann boundary value $g_1(x)=q_y(x,0)$, where $g_0(x)$ and $g_1(x)$ are related via the global relation $\{b(\la)=0$, $\la\geq 0\}$. Furthermore, we show that the latter relation can be used to characterise the Dirichlet to Neumann map, i.e. to express $g_1(x)$ in terms of $g_0(x)$. It appears that this provides the first case that such a map is explicitly characterised for a nonlinear integrable {\em elliptic} PDE, as opposed to an {\em evolution} PDE.

A genetic linkage map of an apple rootstock progeny anchored to the Malus genome sequence

An apple rootstock progeny raised from the cross between the very dwarfing ‘M.27’ and the more vigorous ‘M.116’ (‘M.M.106’ × ‘M.27’) was used for the construction of a linkage map comprising a total of 324 loci: 252 previously mapped SSRs, 71 newly characterised or previously unmapped SSR loci (including 36 amplified by 33 out of the 35 novel markers reported here), and the self-incompatibility locus. The map spanned the 17 linkage groups (LG) expected for apple covering a genetic distance of 1,229.5 cM, an estimated 91% of the Malus genome. Linkage groups were well populated and, although marker density ranged from 2.3 to 6.2 cM/SSR, just 15 gaps of more than 15 cM were observed. Moreover, only 17.5% of markers displayed segregation distortion and, unsurprisingly in a semi-compatible backcross, distortion was particularly pronounced surrounding the self-incompatibility locus (S) at the bottom of LG17. DNA sequences of 273 SSR markers and the S locus, representing a total of 314 loci in this investigation, were used to anchor to the ‘Golden Delicious’ genome sequence. More than 260 of these loci were located on the expected pseudo-chromosome on the ‘Golden Delicious’ genome or on its homeologous pseudo-chromosome. In total, 282.4 Mbp of sequence from 142 genome sequence scaffolds of the Malus genome were anchored to the ‘M.27’ × ‘M.116’ map, providing an interface between the marker data and the underlying genome sequence. This will be exploited for the identification of genes responsible for traits of agronomic importance such as dwarfing and water use efficiency.

Development of a dense SNP-based linkage map of an apple rootstock progeny using the Malus Infinium whole genome genotyping array

Background A whole-genome genotyping array has previously been developed for Malus using SNP data from 28 Malus genotypes. This array offers the prospect of high throughput genotyping and linkage map development for any given Malus progeny. To test the applicability of the array for mapping in diverse Malus genotypes, we applied the array to the construction of a SNPbased linkage map of an apple rootstock progeny. Results Of the 7,867 Malus SNP markers on the array, 1,823 (23.2 %) were heterozygous in one of the two parents of the progeny, 1,007 (12.8 %) were heterozygous in both parental genotypes, whilst just 2.8 % of the 921 Pyrus SNPs were heterozygous. A linkage map spanning 1,282.2 cM was produced comprising 2,272 SNP markers, 306 SSR markers and the S-locus. The length of the M432 linkage map was increased by 52.7 cM with the addition of the SNP markers, whilst marker density increased from 3.8 cM/marker to 0.5 cM/marker. Just three regions in excess of 10 cM remain where no markers were mapped. We compared the positions of the mapped SNP markers on the M432 map with their predicted positions on the ‘Golden Delicious’ genome sequence. A total of 311 markers (13.7 % of all mapped markers) mapped to positions that conflicted with their predicted positions on the ‘Golden Delicious’ pseudo-chromosomes, indicating the presence of paralogous genomic regions or misassignments of genome sequence contigs during the assembly and anchoring of the genome sequence. Conclusions We incorporated data for the 2,272 SNP markers onto the map of the M432 progeny and have presented the most complete and saturated map of the full 17 linkage groups of M. pumila to date. The data were generated rapidly in a high-throughput semi-automated pipeline, permitting significant savings in time and cost over linkage map construction using microsatellites. The application of the array will permit linkage maps to be developed for QTL analyses in a cost-effective manner, and the identification of SNPs that have been assigned erroneous positions on the ‘Golden Delicious’ reference sequence will assist in the continued improvement of the genome sequence assembly for that variety.