Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than on...

We present Hand K-band NIRSPEC spectroscopy of super star clusters (SSCs) in the irregular starburst galaxy NGC 1569, obtained at the Keck Observatory. We fit these photospheric spectra to NextGen model atmospheres to obtain effective spectral types of clusters, and find that the information in both Hand K-band spectra is necessary to remove degeneracy in the fits. The light of SSC B is unambig...

Iteration theories, as introduced by Stephen Bloom and Zoltán Ésik, are Lawvere theories equipped with a function assigning to every morphism e : n → n + k (representing a system of n recursive equations whose left-hand sides are variables and right-hand sides are terms in those n variables and k parameters) a morphism e† : n → k (representing a solution of those equations). This function is re...

It is known that random k-SAT formulas with at least (2 · ln 2) ·n random clauses are unsatisfiable with high probability. This result is simply obtained by bounding the expected number of satisfying assignments of a random k-SAT instance by an expression tending to 0 when n, the number of variables tends to infinity. This argument does not give us an efficient algorithm certifying the unsatisf...

For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit defines a k-universal function. This means, informally, that for every subset K of k outputs, every possible valuation of the variables in K is reachable (we prove that k is very close to m with an arbitrarily high probability)...

Set disjointness is one of the most fundamental problems in communication complexity. In the multi-party number-in-hand version of set disjointness, k players receive private inputs X1, . . . , Xk ⊆ {1, . . . , n}, and their goal is to determine whether or not ⋂k i=1Xi = ∅. In this paper we prove a tight lower bound on the randomized communication complexity of multi-party number-in-hand set di...

In this paper, we prove an equivariant version of the classical Dold-Thom theorem. Let G be a finite group, X a G-space, and k a covariant coefficient system on G. We construct a topological abelian group GX ⊗ G k by the coend construction. We then prove that for a G-CW complex X, πi(GX⊗ B G k) ∼= H i (X; k), where the right hand side is the Bredon equivariant homology of X with coefficients in...

In this paper, an equivariant version of the classical Dold-Thom theorem is proved. Let G be a finite group, X a G-space, and k a covariant coefficient system on G. Then a topological abelian group GX ⊗GF k is constructed by the coend construction. For a G-CW complex X, it is proved that there is a natural isomorphism πi(GX ⊗GF k) ∼= H G i (X; k), where the right hand side is the Bredon equivar...