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.

Linkage disequilibrium assessment via log-linear modeling of SNP haplotype frequencies

Analyses of high-density single-nucleotide polymorphism (SNP) data, such as genetic mapping and linkage disequilibrium (LD) studies, require phase-known haplotypes to allow for the correlation between tightly linked loci. However, current SNP genotyping technology cannot determine phase, which must be inferred statistically. In this paper, we present a new Bayesian Markov chain Monte Carlo (MCMC) algorithm for population haplotype frequency estimation, particulary in the context of LD assessment. The novel feature of the method is the incorporation of a log-linear prior model for population haplotype frequencies. We present simulations to suggest that 1) the log-linear prior model is more appropriate than the standard coalescent process in the presence of recombination (>0.02cM between adjacent loci), and 2) there is substantial inflation in measures of LD obtained by a "two-stage" approach to the analysis by treating the "best" haplotype configuration as correct, without regard to uncertainty in the recombination process. Genet Epidemiol 25:106-114, 2003. (C) 2003 Wiley-Liss, Inc.

In vitro fermentation of mixed linkage glucooligosaccharides produced by Gluconobacter oxydans NCIMB 4943 by the human colonic microflora

The aim of this study was to develop selectively fermented (prebiotic) carbohydrate molecules which would also result in the generation of butyric acid. Glucooligosaccharides produced by Gluconobacter oxydans NCIMB 4943 from various types of maltodextrins were evaluated for their fermentation by mixed cultures of human colonic microflora. The selectivity of growth of desirable bacteria (bifidobacteria, lactobacilli) was studied in stirred pH-controlled (6.8) batch cultures. Bacterial populations were enumerated using fluorescent in situ hybridization (FISH). Gluco-oligosaccharides resulted in significantly (P<0.05) increased numbers of bifidobacteria and lactobacilli within 24 hours. Bacteroides, clostridial and eubacterial populations were slightly decreased at 48 h. There was very little difference in selectivity between the maltodextrin substrates and the products, although maltodextrin displayed a slightly less selective fermentation than the gluco-oligosaccharide products, also stimulating the growth of bacteroides, clostridia and eubacteria. Gluco-oligosaccharides, produced from G19 maltodextrin, resulted in the best prebiotic effect with the highest prebiotic index (PI) of 5.90 at 48 hours. Acetate, propionate and butyrate were all produced from glucooligosaccharides, derived from G19 maltodextrin, at 48 hours but no lactate or formate were detected.

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.

Effect of molecule branching and glycosidic linkage on the degradation of polydextrose by gut microbiota.

Polydextrose is a randomly linked complex glucose oligomer that is widely used as a sugar replacer, bulking agent, dietary fiber and prebiotic. Polydextrose is poorly utilized by the host and, during gastrointestinal transit, it is slowly degraded by intestinal microbes, although it is not known which parts of the complex molecule are preferred by the microbes. The microbial degradation of polydextrose was assessed by using a simulated model of colonic fermentation. The degradation products and their glycosidic linkages were measured by combined gas chromatography and mass spectrometry, and compared to those of intact polydextrose. Fermentation resulted in an increase in the relative abundance of non-branched molecules with a concomitant decrease in single-branched glucose molecules and a reduced total number of branching points. A detailed analysis showed a preponderance of 1,6 pyranose linkages. The results of this study demonstrate how intestinal microbes selectively degrade polydextrose, and provide an insight into the preferences of gut microbiota in the presence of different glycosidic linkages.

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.

Modelling niches of arbitrary shape in genetic algorithms using Niche Linkage in the Dynamic Niche Clustering framework

We present some additions to a fuzzy variable radius niche technique called Dynamic Niche Clustering (DNC) (Gan and Warwick, 1999; 2000; 2001) that enable the identification and creation of niches of arbitrary shape through a mechanism called Niche Linkage. We show that by using this mechanism it is possible to attain better feature extraction from the underlying population.