Chromosomal mapping of major ribosomal rRNA genes in the hard clam (Mercenaria mercenaria) using fluorescence in situ hybridization

Karyotype and chromosomal location of the major ribosomal RNA genes were studied in the hard clam (Mercenaria mercenaria Linnaeus) using fluorescence in situ hybridization (FISH). Metaphase chromosomes were obtained from early embryos. Internal transcribed spacers (ITS) between major RNA genes were amplified and used as FISH probes. The probes were labeled with digoxigenin-11-dUTP by polymerase chain reaction and detected with fluorescein-labeled anti-digoxigenin antibodies. FISH with the ITS probes produced two to four signals per nucleus or metaphase. M. mercenaria had a haploid number of 19 chromosomes with a karyotype of seven metacentric, four metacentric or submetacentric, seven submetacentric, and one submetacentric or subtelocentric chromosomes (7M + 4M/SM + 7SM + 1SM/ST). Two ITS loci were observed: one located near the centromere on the long arm of Chromosome 10 and the other at the telomere of the short arm of Chromosome 12. FISH signals on Chromosome 10 are strong and consistent, while signals on Chromosome 12 are variable. This study provides the first karyotype and chromosomal assignment of the major RNA genes in M. mercenaria. Similar studies in a wide range of species are needed to understand the role of chromosomal changes in bivalve evolution.

A preliminary genetic linkage map of the pacific abalone Haliotis discus hannai Ino

Preliminary genetic linkage maps were constructed for the Pacific abalone (Haliotis discus hannai Ino) using amplified fragment length polymorphism (AFLP), randomly amplified polymorphic DNA (RAPD), and microsatellite markers segregating in a F, family. Nine microsatellite loci, 41 RAPD, and 2688 AFLP markers were genotyped in the parents and 86 progeny of the mapping family. Among the 2738 markers, 384 (including 365 AFLP markers, 10 RAPD markers, and 9 microsatellite loci) were polymorphic and segregated in one or both parents: 241 in the female and 146 in the male. The majority of these markers, 232 in the female and 134 in the male, segregated according to the expected 1:1 Mendelian ratio (alpha = 0.05). Two genetic linkage maps were constructed using markers segregating in the female or the male parent. The female framework map consisted of 119 markers in 22 linkage groups, covering 1773.6 cM with an average intermarker space of 18.3 cM. The male framework map contained 94 markers in 19 linkage groups, spanning 1365.9 cM with an average intermarker space of 18.2 cM. The sex determination locus was mapped to the male map but not to the female map, suggesting a XY-male determination mechanism. Distorted markers showing excess of homozygotes were mapped in clusters, probably because of their linkage to a gene that is incompatible between two parental populations.

Chromosomal mapping of the major ribosomal RNA genes in the dwarf surfclam (Mulinia lateralis Say)

Chromosomal location of the major ribosomal RNA genes (rRNA) were studied in the dwarf surfclam (Mulinia lateralis, Say) using fluorescence in situ hybridization (FISH). FISH probes for the rRNA genes were made by polymerase chain reaction (PCR), labeled with digoxigenin-11-dUTP and detected with fluorescein-labeled antidigoxigenin antibodies. Mulinia lateralis had a diploid number of 38 chromosomes and all chromosomes were telocentric. FISH with the rRNA probe produced positive and consistent signals on two pairs of chromosomes: Chromosome 15 with a relative length of 4.6% and Chromosome 19, the shortest chromosome. Both loci were telomeric. The rRNA location provides the first physical landmark of the M. lateralis genome.

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

An association mapping approach to identify flowering time genes in natural populations of Lolium perenne (L.)

Sk?t, L., Humphreys, M. O., Armstead, I. P., Heywood, S., Sk?t, K. P., Sanderson, R., Thomas, I. D., Chorlton, K. H., & Sackville Hamilton, N. R. (2005). An association mapping approach to identify flowering time genes in natural populations of Lolium perenne (L.). Molecular Breeding, 15(3), 233-245. Sponsorship: 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.