Identification and mapping of amplified fragment length polymorphism markers linked to shell color in bay scallop, Argopecten irradians irradians (Lamarck, 1819)

Amplified fragment length polymorphisms (AFLP) were used to study the inheritance of shell color in Argopecten irradians. Two scallops, one with orange and the other with white shells, were used as parents to produce four F-1 families by selfing and outcrossing. Eighty-eight progeny, 37 orange and 51 white, were randomly selected from one of the families for segregation and mapping analysis with AFLP and microsatellite markers. Twenty-five AFLP primer pairs were screened, yielding 1138 fragments, among which 148 (13.0%) were polymorphic in two parents and segregated in progeny. Six AFLP markers showed significant (P < 0.05) association with shell color. All six loci were mapped to one linkage group. One of the markers, F1f335, is completely linked to the gene for orange shell, which we designated as Orange1, without any recombination in the progeny we sampled. The marker was amplified in the orange parent and all orange progeny, but absent in the white parent and all the white progeny. The close linkage between F1f335 and Orange1 was validated using bulk segregation analysis in two natural populations, and all our data indicate that F1f335 is specific for the shell color gene, Orange1. The genomic mapping of a shell color gene in bay scallop improves our understanding of shell color inheritance and may contribute to the breeding of molluscs with desired shell colors.

Assessing the potential of VEGETATION sensor data for mapping snow and ice cover: a Normalized Difference Snow and Ice Index

The VEGETATION (VGT) sensor in SPOT 4 has four spectral bands that are equivalent to Landsat Thematic Mapper (TM) bands (blue, red, near-infrared and mid-infrared spectral bands) and provides daily images of the global land surface at a 1-km spatial resolution. We propose a new index for identifying and mapping of snow ice cover, namely the Normalized Difference Snow/Ice Index (NDSII), which uses reflectance values of red and mid-infrared spectral bands of Landsat TM and VGT. For Landsat TM data, NDSII is calculated as NDSIITM =(TM3 -TM5)/(TM3 +TM5); for VGT data, NDSII is calculated as NDSIIVGT =(B2- MIR)/(B2 + MIR). As a case study we used a Landsat TM image that covers the eastern part of the Qilian mountain range in the Qinghai-Xizang (Tibetan) plateau of China. NDSIITM gave similar estimates of the area and spatial distribution of snow/ice cover to the Normalized Difference Snow Index (NDSI=(TM2-TM5)/(TM2+TM5)) which has been proposed by Hall et al. The results indicated that the VGT sensor might have the potential for operational monitoring and mapping of snow/ice cover from regional to global scales, when using NDSIIVGT.

Trajectory Mapping ("TM''): A New Non-Metric Scaling Technique

Trajectory Mapping "TM'' is a new scaling technique designed to recover the parameterizations, axes, and paths used to traverse a feature space. Unlike Multidimensional Scaling (MDS), there is no assumption that the space is homogenous or metric. Although some metric ordering information is obtained with TM, the main output is the feature parameterizations that partition the given domain of object samples into different categories. Following an introductory example, the technique is further illustrated using first a set of colors and then a collection of textures taken from Brodatz (1966).

Non-existence of polar factorisations and polar inclusion of a vector-valued mapping

R.J. DOUGLAS, Non-existence of polar factorisations and polar inclusion of a vector-valued mapping. Intern. Jour. Of Pure and Appl. Math., (IJPAM) 41, no. 3 (2007).

Uniqueness of the polar factorisation and projection of a vector-valued mapping

G.R. BURTON and R.J. DOUGLAS, Uniqueness of the polar factorisation and projection of a vector-valued mapping. Ann. I.H. Poincare ? A.N. 20 (2003), 405-418.

Automated cross-modal mapping in robotic eye/hand systems using plastic radial basis function networks

Q. Meng and M. H Lee, Automated cross-modal mapping in robotic eye/hand systems using plastic radial basis function networks, Connection Science, 19(1), pp 25-52, 2007.

Biologically inspired automatic construction of cross-modal mapping in robotic eye/hand systems

Q. Meng and M.H. Lee, 'Biologically inspired automatic construction of cross-modal mapping in robotic eye/hand systems', IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2006,) ,4742-49, Beijing, 2006.

'Preferring the wrong way': Mapping the Ethical Diversity of US Twentieth-Century Poetry

Woods, T. (2006). 'Preferring the wrong way': Mapping the Ethical Diversity of US Twentieth-Century Poetry. In C. Bigsby (Ed.), The Cambridge Companion to Modern American Culture (pp.450-468). Cambridge: Cambridge University Press. RAE2008

The D-CIXS X-ray mapping spectrometer on SMART-1

Grande, Manuel; Browning, R.; Waltham, N.; Parker, D., 'The D-CIXS X-ray mapping spectrometer on SMART-1', Planetary and Space Science (2003) 51(6) pp.427-433 RAE2008

Cross-species identification of Mendel's/locus

Armstead, I. P., Donnison, I. S., Aubry, S., Harper, J. A., H?rtensteiner, S., James, C. L., Mani, J., Moffet, M., Ougham, H. J., Roberts, L. A., Thomas, A. M., Weeden, N., Thomas, S., King, I. P. (2007). Cross-species identification of Mendel's/locus. Science, 315 (5808), 73. Sponsorship: BBSRC RAE2008

Alignment of the genomes of brachypodium distachyon and temperate cereals and grasses using bacterial artificial chromosome landing with fluorescence in situ hybridization

Robert Hasterok, Agnieszka Marasek, Iain S. Donnison, Ian Armstead, Ann Thomas, Ian P. King, Elzbieta Wolny, Dominika Idziak, John Draper and Glyn Jenkins (2006). Alignment of the genomes of brachypodium distachyon and temperate cereals and grasses using bacterial artificial chromosome landing with fluorescence in situ hybridization.Genetics, 73 (1), 349-362. Sponsorship: Royal Society / BBSRC;BBSRC RAE2008

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

NETEMBED: A Network Resource Mapping Service for Distributed Applications

Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory constraints) and network conditions (e.g., link delay, bandwidth, loss rate, and jitter) whose characteristics are both complex and time-varying. At the same time, distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on resources they wish to utilize. Examples include selecting nodes and links to schedule an overlay multicast file transfer across the Grid, or embedding a network experiment with specific resource constraints in a distributed testbed such as PlanetLab. Thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of "mapping" application-level requirements onto the network in such a manner that the requirements of the application are realized, assuming that the underlying characteristics of the network are known. We refer to this problem as the network embedding problem. In this paper, we propose a new approach to tackle this combinatorially-hard problem. Thanks to a number of heuristics, our approach greatly improves performance and scalability over previously existing techniques. It does so by pruning large portions of the search space without overlooking any valid embedding. We present a construction that allows a compact representation of candidate embeddings, which is maintained by carefully controlling the order via which candidate mappings are inserted and invalid mappings are removed. We present an implementation of our proposed technique, which we call NETEMBED – a service that identify feasible mappings of a virtual network configuration (the query network) to an existing real infrastructure or testbed (the hosting network). We present results of extensive performance evaluation experiments of NETEMBED using several combinations of real and synthetic network topologies. Our results show that our NETEMBED service is quite effective in identifying one (or all) possible embeddings for quite sizable queries and hosting networks – much larger than what any of the existing techniques or services are able to handle.