Sparse computation for large-scale binary classification

Well-known data mining algorithms rely on inputs in the form of pairwise similarities between objects. For large datasets it is computationally impossible to perform all pairwise comparisons. We therefore propose a novel approach that uses approximate Principal Component Analysis to efficiently identify groups of similar objects. The effectiveness of the approach is demonstrated in the context of binary classification using the supervised normalized cut as a classifier. For large datasets from the UCI repository, the approach significantly improves run times with minimal loss in accuracy.

Die Stellung, Rechte u. Pflichten d. Erstgeborenen : parallel zu d. Primogenitur d. antiken Völker dargest.

von [R.] Kirsch

SLR-GNSS analysis in the framework of the ITRF2013 computation

Pre-combined SLR-GNSS solutions are studied and the impact of different types of datum definition on the estimated parameters is assessed. It is found that the origin is realized best by using only the SLR core network for defining the geodetic datum and the inclusion of the GNSS core sites degrades the origin. The orientation, however, requires a dense and continuous network, thus, the inclusion of the GNSS core network is absolutely needed.

Fast parallel kriging-based stepwise uncertainty reduction with application to the identification of an excursion set

Stepwise uncertainty reduction (SUR) strategies aim at constructing a sequence of points for evaluating a function  f in such a way that the residual uncertainty about a quantity of interest progressively decreases to zero. Using such strategies in the framework of Gaussian process modeling has been shown to be efficient for estimating the volume of excursion of f above a fixed threshold. However, SUR strategies remain cumbersome to use in practice because of their high computational complexity, and the fact that they deliver a single point at each iteration. In this article we introduce several multipoint sampling criteria, allowing the selection of batches of points at which f can be evaluated in parallel. Such criteria are of particular interest when f is costly to evaluate and several CPUs are simultaneously available. We also manage to drastically reduce the computational cost of these strategies through the use of closed form formulas. We illustrate their performances in various numerical experiments, including a nuclear safety test case. Basic notions about kriging, auxiliary problems, complexity calculations, R code, and data are available online as supplementary materials.

A g-factor metric for k-t-GRAPPA- and PEAK-GRAPPA-based parallel imaging.

PURPOSE The aim of this work is to derive a theoretical framework for quantitative noise and temporal fidelity analysis of time-resolved k-space-based parallel imaging methods. THEORY An analytical formalism of noise distribution is derived extending the existing g-factor formulation for nontime-resolved generalized autocalibrating partially parallel acquisition (GRAPPA) to time-resolved k-space-based methods. The noise analysis considers temporal noise correlations and is further accompanied by a temporal filtering analysis. METHODS All methods are derived and presented for k-t-GRAPPA and PEAK-GRAPPA. A sliding window reconstruction and nontime-resolved GRAPPA are taken as a reference. Statistical validation is based on series of pseudoreplica images. The analysis is demonstrated on a short-axis cardiac CINE dataset. RESULTS The superior signal-to-noise performance of time-resolved over nontime-resolved parallel imaging methods at the expense of temporal frequency filtering is analytically confirmed. Further, different temporal frequency filter characteristics of k-t-GRAPPA, PEAK-GRAPPA, and sliding window are revealed. CONCLUSION The proposed analysis of noise behavior and temporal fidelity establishes a theoretical basis for a quantitative evaluation of time-resolved reconstruction methods. Therefore, the presented theory allows for comparison between time-resolved parallel imaging methods and also nontime-resolved methods. Magn Reson Med, 2014. © 2014 Wiley Periodicals, Inc.

Evidence for C−H⋅⋅⋅O Hydrogen Bond Assisted Recognition of a Pyrimidine Base in the Parallel DNA Triple-Helical Motif

The efficient recognition of the pyrimidine base uracil by hypoxanthine or thymine in the parallel DNA triplex motif is based on the interplay of a conventional N−H⋅⋅⋅O and an unconventional C−H⋅⋅⋅O hydrogen bond.

Biological variation of established and novel biomarkers for atherosclerosis: Results from a prospective, parallel-group cohort study.

BACKGROUND Biomarkers are a promising tool for the management of patients with atherosclerosis, but their variation is largely unknown. We assessed within-subject and between-subject biological variation of biomarkers in peripheral artery disease (PAD) patients and healthy controls, and defined which biomarkers have a favorable variation profile for future studies. METHODS Prospective, parallel-group cohort study, including 62 patients with stable PAD (79% men, 65±7years) and 18 healthy control subjects (44% men, 57±7years). Blood samples were taken at baseline, and after 3-, 6-, and 12-months. We calculated within-subject (CVI) and between-subject (CVG) coefficients of variation and intra-class correlation coefficient (ICC). RESULTS Mean levels of D-dimer, hs-CRP, IL-6, IL-8, MMP-9, MMP-3, S100A8/A9, PAI-1, sICAM-1, and sP-selectin levels were higher in PAD patients than in healthy controls (P≤.05 for all). CVI and CVG of the different biomarkers varied considerably in both groups. An ICC≥0.5 (indicating moderate-to-good reliability) was found for hs-CRP, D-Dimer, E-selectin, IL-10, MCP-1, MMP-3, oxLDL, sICAM-1 and sP-selectin in both groups, for sVCAM in healthy controls and for MMP-9, PAI-1 and sCD40L in PAD patients. CONCLUSIONS Single biomarker measurements are of limited utility due to large within-subject variation, both in PAD patients and healthy subjects. D-dimer, hs-CRP, MMP-9, MMP-3, PAI-1, sP-selectin and sICAM-1 are biomarkers with both higher mean levels in PAD patients and a favorable variation profile making them most suitable for future studies.

A Parallel Solver for the Time-Periodic Navier–Stokes Equations

We investigate parallel algorithms for the solution of the Navier–Stokes equations in space-time. For periodic solutions, the discretized problem can be written as a large non-linear system of equations. This system of equations is solved by a Newton iteration. The Newton correction is computed using a preconditioned GMRES solver. The parallel performance of the algorithm is illustrated.

Parallel adaptations to nectarivory in parrots, key innovations and the diversification of the Loriinae

Specialization to nectarivory is associated with radiations within different bird groups, including parrots. One of them, the Australasian lories, were shown to be unexpectedly species rich. Their shift to nectarivory may have created an ecological opportunity promoting species proliferation. Several morphological specializations of the feeding tract to nectarivory have been described for parrots. However, they have never been assessed in a quantitative framework considering phylogenetic nonindependence. Using a phylogenetic comparative approach with broad taxon sampling and 15 continuous characters of the digestive tract, we demonstrate that nectarivorous parrots differ in several traits from the remaining parrots. These trait-changes indicate phenotype–environment correlations and parallel evolution, and may reflect adaptations to feed effectively on nectar. Moreover, the diet shift was associated with significant trait shifts at the base of the radiation of the lories, as shown by an alternative statistical approach. Their diet shift might be considered as an evolutionary key innovation which promoted significant non-adaptive lineage diversification through allopatric partitioning of the same new niche. The lack of increased rates of cladogenesis in other nectarivorous parrots indicates that evolutionary innovations need not be associated one-to-one with diversification events.

How comparable are parallel corpora? Measuring the distribution of general vocabulary and connectives

In this paper, we question the homogeneity of a large parallel corpus by measuring the similarity between various sub-parts. We compare results obtained using a general measure of lexical similarity based on χ2 and by counting the number of discourse connectives. We argue that discourse connectives provide a more sensitive measure, revealing differences that are not visible with the general measure. We also provide evidence for the existence of specific characteristics defining translated texts as opposed to non-translated ones, due to a universal tendency for explicitation.