We classify, up to some notoriously hard cases, the rank 3 graphs which fail meet either Delsarte or Hoffman bound. As a consequence, we resolve question of separation for corresponding primitive groups and give new examples synchronising, but not QI, affine type.

A new heuristic algorithm is presented for mapping probes to locations along the genome, given noisy pairwise distance data as input. The model considered is quite general: The input consists of a collection of probe pairs and a confidence interval for the genomic distance separating each pair. Because the distance intervals are only known with some confidence level, some may be erroneous and m...

This paper presents an approach to capturing and representing the uncertainty inherent in any attempt to classify continuously varying geographical phenomena into discrete categories. This uncertainty is captured during a visual photo-interpretation and a computerised image classiŽ cation process and encoded as a series of fuzzy surfaces. These store the fuzzy membership values (FMVs) of each l...

– We analyze the asymptotic states in the partially ordered phase of a system of globally coupled logistic maps. We confirm that, regardless of initial conditions, these states consist of a few clusters, and they properly belong in the ordered phase of these systems. The transient times necessary to reach the asymptotic states can be very long, especially very near the transition line separatin...