High-resolution record of climate change in the Owens Lake Basin, California, for the period 52,500 to 12,500 YBP

EXTRACT (SEE PDF FOR FULL ABSTRACT): High-resolution oxygen-18 and total inorganic carbon (TIC) studies of cored sediments from the Owens Lake Basin, California, indicate that Owens Lake was hydrologically open (overflowing) most of the time between 52,500 and 12,500 carbon-14 YBP. ... The lack of a strong correspondence between North Atlantic climate records and the Owens Lake delta-oxygen-18 record has two possible explanations: (1) the sequence of large and abrupt climate change indicated in North Atlantic records is not global in scope and is largely confined to the North Atlantic and surrounding areas, or (2) Owens Lake is located in a part of the Great Basin that is relatively insensitive to the effects of climate perturbations recorded in the North Atlantic region.

The stripe-backed weasel Mustela strigidorsa: taxonomy, ecology, distribution and status

1. The stripe-backed weasel Mustela strigidorsa is one of the rarest and least-known mustelids in the world. Its phylogenetic relationships with other Mustela species remain controversial, though several unique morphological features distinguish it from congeners. 2. It probably lives mainly in evergreen forests in hills and mountains, but has also been recorded from plains forest, dense scrub, secondary forest, grassland and farmland. Known sites range in altitude from 90 m to 2500 m. Data are insufficient to distinguish between habitat and altitudes which support populations, and those where only dispersing animals may occur. 3. It has been confirmed from many localities in north-east India, north and central Myanmar, south China, north Thailand, north and central Laos, and north and central Vietnam. Given the limited survey effort, the number of recent records shows that the species is not as rare as hitherto believed. Neither specific nor urgent conservation needs are apparent.

scenario-focused development method for a pen-based user interface: model and applications

Pen-based user interface (PUI) has drawn significant interest, owing to its intuitiveness and convenience. While much of the research focuses on the technology, the usability of a PUI has been relatively low since human factors have not been considered sufficiently. Scenario-centric designs are ideal ways to improve usability. However, such designs possess some problems in practical use. To cope with these design issues, the concept of “interface scenarios” is proposed in to facilitate the interface design, and to help users understand the interaction process in such designs. The proposed scenario-focused development method for PUI is coupled with a practical application to show its effectiveness and usability.

network and device-level impacts: performance and reliability of active i/o storage systems

中国计算机学会

Phylogeography of the Northern Atlantic species Chondrus crispus (Gigartinales, Rhodophyta) inferred from nuclear rDNA internal transcribed spacer sequences

Eighteen isolates of the red algae Chondrus crispus were collected from Northern Atlantic sites, together with C. ocellatus, C. yendoi and C. pinnulatus from the North Pacific. The nuclear rDNA internal transcribed spacer (ITS) was sequenced and compared, spanning both the ITS regions and the 5.8S rRNA gene. Percentage of nucleotide variation for C. crispus ranged from 0.3% to 4.0%. Phylogenetic analyses were performed using maximum parsimony (MP), neighbor-joining (NJ) and minimum evolution methods. They showed that two main clades existed within the C. crispus samples examined and that suggested C. crispus had a single Atlantic origin. The clustering however did not follow the geographic origin. We hypothesized that the current distribution of C. crispus populations might be a result of three main factors: temperature boundaries, paleoclimate and paleoceanography. ITS data exhibited abundant molecular information not only for phylogeographical investigation but also for systematics studies.

Inter-simple sequence repeat (ISSR) analysis of genetic variation of Chondrus crispus populations from North Atlantic

ISSR analysis was used to investigate genetic variations of 184 haploid and diploid samples from nine North Atlantic Chondrus crispus Stackhouse populations and one outgroup Yellow Sea Chondrus ocellatus Holmes population. Twenty-two of 50 primers were selected and 163 loci were scored for genetic diversity analysis. Genetic diversity varied among populations, percentage of polymorphic bands (PPB) ranged from 27.0 to 55.8%, H(Nei's genetic diversity) ranged from 0.11 to 0.20 and I(Shannon's information index) ranged from 0.16 to 0.30. Estimators PPB, H and I had similar values in intra-population genetic diversity, regardless of calculation methods. Analysis of molecular variance (AMOVA) apportioned inter-population and intra-population variations for C crispus, showing more genetic variance (56.5%) occurred in intra-population, and 43.5% variation among nine populations. The Mantel test suggested that genetic differentiation between nine C. crispus populations was closely related with geographic distances (R = 0.78, P = 0.002). Results suggest that, on larger distance scale (ca. > 1000 km), ISSR analysis is useful for determining genetic differentiations of C crispus populations including morphologically inseparable haploid and diploid individuals. (c) 2007 Elsevier B.V. All rights reserved.

Isolation and mapping of telomeric pentanucleotide (TAACC)(n) repeats of the pacific whiteleg shrimp, Penaeus vannamei, using fluorescence in situ hybridization

To develop genetic and physical maps for shrimp, accurate information on the actual number of chromosomes and a large number of genetic markers is needed. Previous reports have shown two different chromosome numbers for the Pacific whiteleg shrimp, Penaeus vannamei, the most important penaeid shrimp species cultured in the Western hemisphere. Preliminary results obtained by direct sequencing of clones from a Sau3A-digested genomic library of P. vannamei ovary identified a large number of (TAACC/GGTTA)-containing SSRs. The objectives of this study were to (1) examine the frequency of (TAACC)(n) repeats in 662 P. vannamei genomic clones that were directly sequenced, and perform homology searches of these clones, (2) confirm the number of chromosomes in testis of P. vannamei, and (3) localize the TAACC repeats in P. vannamei chromosome spreads using fluorescence in situ hybridization (FISH). Results for objective I showed that 395 out of the 662 clones sequenced contained single or multiple SSRs with three or more repeat motifs, 199 of which contained variable tandem repeats of the pentanucleotide (TAACC/GGTTA),, with 3 to 14 copies per sequence. The frequency of (TAACC)n repeats in P. vannamei is 4.68 kb for SSRs with five or more repeat motifs. Sequence comparisons using the BLASTN nonredundant and expressed sequence tag (EST) databases indicated that most of the TAACC-containing clones were similar to either the core pentanucleotide repeat in PVPENTREP locus (GenBank accession no. X82619) or portions of 28S rRNA. Transposable elements (transposase for Tn1000 and reverse transcriptase family members), hypothetical or unnamed protein products, and genes of known function such as 18S and 28S rRNAs, heat shock protein 70, and thrombospondin were identified in non-TAACC-containing clones. For objective 2, the meiotic chromosome number of P. vannamei was confirmed as N = 44. For objective 3, four FISH probes (P1 to P4) containing different numbers of TAACC repeats produced positive signals on telomeres of P. vannamei chromosomes. A few chromosomes had positive signals interstitially. Probe signal strength and chromosome coverage differed in the general order of P1 > P2 > P3 > P4, which correlated with the length of TAACC repeats within the probes: 83, 66, 35, and 30 bp, respectively, suggesting that the TAACC repeats, and not the flanking sequences, produced the TAACC signals at chromosome ends and TAACC is likely the telomere sequence for P. vannamei.

Rapid compensatory evolution promotes the survival of conjugative plasmids

Conjugative plasmids play a vital role in bacterial adaptation through horizontal gene transfer. Explaining how plasmids persist in host populations however is difficult, given the high costs often associated with plasmid carriage. Compensatory evolution to ameliorate this cost can rescue plasmids from extinction. In a recently published study we showed that compensatory evolution repeatedly targeted the same bacterial regulatory system, GacA/GacS, in populations of plasmid-carrying bacteria evolving across a range of selective environments. Mutations in these genes arose rapidly and completely eliminated the cost of plasmid carriage. Here we extend our analysis using an individual based model to explore the dynamics of compensatory evolution in this system. We show that mutations which ameliorate the cost of plasmid carriage can prevent both the loss of plasmids from the population and the fixation of accessory traits on the bacterial chromosome. We discuss how dependent the outcome of compensatory evolution is on the strength and availability of such mutations and the rate at which beneficial accessory traits integrate on the host chromosome.

Learning Unions of Rectangles with Queries

We investigate the efficient learnability of unions of k rectangles in the discrete plane (1,...,n)[2] with equivalence and membership queries. We exhibit a learning algorithm that learns any union of k rectangles with O(k^3log n) queries, while the time complexity of this algorithm is bounded by O(k^5log n). We design our learning algorithm by finding "corners" and "edges" for rectangles contained in the target concept and then constructing the target concept from those "corners" and "edges". Our result provides a first approach to on-line learning of nontrivial subclasses of unions of intersections of halfspaces with equivalence and membership queries.

On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs

The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.

A Short History of Computational Complexity

National Science Foundation (CCR-998310); Army Research Office (DAAD19-02-1-0058)

Universal Quantum Circuits

We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal. Our results apply to a number of well-studied quantum circuit classes.

On Finding Sensitivity of Quantum and Classical Gates

We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results.