Performance comparison of point and spatial access methods

In the past few years a large number of multidimensional point access methods, also called multiattribute index structures, has been suggested, all of them claiming good performance. Since no performance comparison of these structures under arbitrary (strongly correlated nonuniform, short "ugly") data distributions and under various types of queries has been performed, database researchers and designers were hesitant to use any of these new point access methods. As shown in a recent paper, such point access methods are not only important in traditional database applications. In new applications such as CAD/CIM and geographic or environmental information systems, access methods for spatial objects are needed. As recently shown such access methods are based on point access methods in terms of functionality and performance. Our performance comparison naturally consists of two parts. In part I we w i l l compare multidimensional point access methods, whereas in part I I spatial access methods for rectangles will be compared. In part I we present a survey and classification of existing point access methods. Then we carefully select the following four methods for implementation and performance comparison under seven different data files (distributions) and various types of queries: the 2-level grid file, the BANG file, the hB-tree and a new scheme, called the BUDDY hash tree. We were surprised to see one method to be the clear winner which was the BUDDY hash tree. It exhibits an at least 20 % better average performance than its competitors and is robust under ugly data and queries. In part I I we compare spatial access methods for rectangles. After presenting a survey and classification of existing spatial access methods we carefully selected the following four methods for implementation and performance comparison under six different data files (distributions) and various types of queries: the R-tree, the BANG file, PLOP hashing and the BUDDY hash tree. The result presented two winners: the BANG file and the BUDDY hash tree. This comparison is a first step towards a standardized testbed or benchmark. We offer our data and query files to each designer of a new point or spatial access method such that he can run his implementation in our testbed

High-frequency multimodal atomic force microscopy

Multifrequency atomic force microscopy imaging has been recently demonstrated as a powerful technique for quickly obtaining information about the mechanical properties of a sample. Combining this development with recent gains in imaging speed through small cantilevers holds the promise of a convenient, high-speed method for obtaining nanoscale topography as well as mechanical properties. Nevertheless, instrument bandwidth limitations on cantilever excitation and readout have restricted the ability of multifrequency techniques to fully benefit from small cantilevers. We present an approach for cantilever excitation and deflection readout with a bandwidth of 20 MHz, enabling multifrequency techniques extended beyond 2 MHz for obtaining materials contrast in liquid and air, as well as soft imaging of delicate biological samples

Contrasting heterozygosity-fitness correlations across life in a long-lived seabird

Selection is a central force underlying evolutionary change and can vary in strength and direction, for example across time and space. The fitness consequences of individual genetic diversity have often been investigated by testing for multilocus heterozygosity-fitness correlations (HFCs), but few studies have been able to assess HFCs across life stages and in both sexes. Here, we test for HFCs using a 26-year longitudinal individual-based data set from a large population of a long-lived seabird (the common tern, Sterna hirundo), where 7,974 chicks and breeders of known age were genotyped at 15 microsatellite loci and sampled for life-history traits over the complete life cycle. Heterozygosity was not correlated with fledging or post-fledging prospecting probabilities, but was positively correlated with recruitment probability. For breeders, annual survival was not correlated with heterozygosity, but annual fledgling production was negatively correlated with heterozygosity in males and highest in intermediately heterozygous females. The contrasting HFCs among life stages and sexes indicate differential selective processes and emphasize the importance of assessing fitness consequences of traits over complete life histories

Epigenetic meta-analysis across three civilian cohorts identifies NRG1 and HGS as blood-based biomarkers for post-traumatic stress disorder

Aim: Trauma exposure is a necessary, but not deterministic, contributor to post-traumatic stress disorder (PTSD). Epigenetic factors may distinguish between trauma-exposed individuals with versus without PTSD. Materials & methods: We conducted a meta-analysis of PTSD epigenome-wide association studies in trauma-exposed cohorts drawn from civilian contexts. Whole blood-derived DNA methylation levels were analyzed in 545 study participants, drawn from the three civilian cohorts participating in the PTSD working group of the Psychiatric Genomics Consortium. Results: Two CpG sites significantly associated with current PTSD in NRG1 (cg23637605) and in HGS (cg19577098). Conclusion: PTSD is associated with differential methylation, measured in blood, within HGS and NRG1 across three civilian cohorts

A monolithic MEMS position sensor for closed-loop high-speed atomic force microscopy

The accuracy and repeatability of atomic force microscopy (AFM) imaging significantly depend on the accuracy of the piezoactuator. However, nonlinear properties of piezoactuators can distort the image, necessitating sensor-based closed-loop actuators to achieve high accuracy AFM imaging. The advent of high-speed AFM has made the requirements on the position sensors in such a system even more stringent, requiring higher bandwidths and lower sensor mass than traditional sensors can provide. In this paper, we demonstrate a way for high-speed, high-precision closed-loop AFM nanopositioning using a novel, miniaturized micro-electro-mechanical system position sensor in conjunction with a simple PID controller. The sensor was developed to respond to the need for small, lightweight, high-bandwidth, long-range and sub-nm-resolution position measurements in high-speed AFM applications. We demonstrate the use of this sensor for closed-loop operation of conventional as well as high-speed AFM operation to provide distortion-free images. The presented implementation of this closed-loop approach allows for positioning precision down to 2.1 Å, reduces the integral nonlinearity to below 0.2%, and allows for accurate closed loop imaging at line rates up to 300 Hz

Studying biological membranes with extended range high-speed atomic force microscopy

High-speed atomic force microscopy has proven to be a valuable tool for the study of biomolecular systems at the nanoscale. Expanding its application to larger biological specimens such as membranes or cells has, however, proven difficult, often requiring fundamental changes in the AFM instrument. Here we show a way to utilize conventional AFM instrumentation with minor alterations to perform high-speed AFM imaging with a large scan range. Using a two-actuator design with adapted control systems, a 130 x 130 x 5 mu m scanner with nearly 100 kHz open-loop small-signal Z-bandwidth is implemented. This allows for high-speed imaging of biologically relevant samples as well as high-speed measurements of nanomechanical surface properties. We demonstrate the system performance by real-time imaging of the effect of charged polymer nanoparticles on the integrity of lipid membranes at high imaging speeds and peak force tapping measurements at 32 kHz peak force rate

Tracing Sub-Structure in the European American Population with PCA-Informative Markers

Genetic structure in the European American population reflects waves of migration and recent gene flow among different populations. This complex structure can introduce bias in genetic association studies. Using Principal Components Analysis (PCA), we analyze the structure of two independent European American datasets (1,521 individuals–307,315 autosomal SNPs). Individual variation lies across a continuum with some individuals showing high degrees of admixture with non-European populations, as demonstrated through joint analysis with HapMap data. The CEPH Europeans only represent a small fraction of the variation encountered in the larger European American datasets we studied. We interpret the first eigenvector of this data as correlated with ancestry, and we apply an algorithm that we have previously described to select PCA-informative markers (PCAIMs) that can reproduce this structure. Importantly, we develop a novel method that can remove redundancy from the selected SNP panels and show that we can effectively remove correlated markers, thus increasing genotyping savings. Only 150–200 PCAIMs suffice to accurately predict fine structure in European American datasets, as identified by PCA. Simulating association studies, we couple our method with a PCA-based stratification correction tool and demonstrate that a small number of PCAIMs can efficiently remove false correlations with almost no loss in power. The structure informative SNPs that we propose are an important resource for genetic association studies of European Americans. Furthermore, our redundancy removal algorithm can be applied on sets of ancestry informative markers selected with any method in order to select the most uncorrelated SNPs, and significantly decreases genotyping costs

Splaying Preorders and Postorders

Let $T$ be a binary search tree. We prove two results about the behavior of the Splay algorithm (Sleator and Tarjan 1985). Our first result is that inserting keys into an empty binary search tree via splaying in the order of either $T$'s preorder or $T$'s postorder takes linear time. Our proof uses the fact that preorders and postorders are pattern-avoiding: i.e. they contain no subsequences that are order-isomorphic to $(2,3,1)$ and $(3,1,2)$, respectively. Pattern-avoidance implies certain constraints on the manner in which items are inserted. We exploit this structure with a simple potential function that counts inserted nodes lying on access paths to uninserted nodes. Our methods can likely be extended to permutations that avoid more general patterns. Second, if $T'$ is any other binary search tree with the same keys as $T$ and $T$ is weight-balanced (Nievergelt and Reingold 1973), then splaying $T$'s preorder sequence or $T$'s postorder sequence starting from $T'$ takes linear time. To prove this, we demonstrate that preorders and postorders of balanced search trees do not contain many large "jumps" in symmetric order, and exploit this fact by using the dynamic finger theorem (Cole et al. 2000). Both of our results provide further evidence in favor of the elusive "dynamic optimality conjecture.