Covariance matrices are ubiquitous in computational science and engineering. In particular, large covariance matrices arise from multivariate spatial data sets, for instance, in climate/weather modeling applications to improve prediction using statistical methods and spatial data. One of the most time-consuming computational steps consists in calculating the Cholesky factorization of the symmet...

February 1, 2017 Version 3.0.0 Date 2016-09-16 Title Rank Product method for identifying differentially expressed genes with application in meta-analysis Author Francesco Del Carratore , Andris Janckevics Fangxin Hong , Ben Wittner , Rainer Breitling <r.breitling...

Classification of harmonic and semiharmonic graphs according to their cyclomatic number became of interest recently. All finite harmonic graphs with up to four independent cycles, as well as all finite semiharmonic graphs with at most one cycle were determined. Here, we determine all finite semiharmonic bicyclic graphs. Besides that, we present several methods to construct semiharmonic graphs f...

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determin...

In this note, all chromatic equivalence classes for 2-connected 3-chromatic graphs with five triangles and cyclomatic number six are described. New families of chromatically unique graphs of order n are presented for each n ≥ 8. This is a generalization of a result stated in [5]. Moreover, a proof for the conjecture posed in [5] is given.

A space X is called an α-Toronto space if X is scattered of Cantor– Bendixson rank α and is homeomorphic to each of its subspaces of the same rank. We answer a question of Steprāns by constructing a countable α-Toronto space for each α ≤ ω. We also construct consistent examples of countable α-Toronto spaces for each

For a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number of edge-disjoint cycles of G. We prove that for every k ≥ 0 there is a finite set P(k) such that every 2-connected graph G for which μ(G)− ν(G) = k arises by applying a simple extension rule to a graph in P(k). Furthermore, we determine P(k) for k ≤ 2 exactly.

The 2017 CLEF eHeath Task2 requires to rank the retrieval results given by medical database. The purpose is to reduce efforts that experts devote to finding indeed relevant documents. We utilize a customized Learning-to-Rank model to re-rank the retrieval result. Additionally, we adopt word2vec to represent queries and documents and compute the relevant score by cosine distance. We find that th...