Shared nothing systems offer a tremendous processing capacity. In such highly parallel systems the data are typically declustered across the system processing elements (PEs) to exploit the I/O bandwidth of the PEs. However, the access pattern is inherently dynamic, which in turn can lead to performance degradation as some PEs become hot spot (bottleneck). Therefore, reorganization for heat (loa...

We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal regression directly without resorting to numerical optimization. Ideal regression is useful whenever the solution to a learning problem can be described by a ...

Given a set of integers W , the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a Hilbert’s Nullstellensatz refutation, or certificate, that a given set of integers is not partitionable. We provide an explicit construction of a minimum-degre...

The roots of a system of two bivariate polynomial equations are calculated using a two-step method. First all x-roots and y-roots are determined independently. Then tolerance based weighted matching is used to form (x, y)-pairs that together form a minimum-error solution to

We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree and in the height of the input equations but exponential in their number of variables and nonzero terms.

A particular version of the 16th Hilbert’s problem is to estimate the number, M(n), of limit cycles bifurcating from a singularity of center-focus type. This paper is devoted to finding lower bounds for M(n) for some concrete n by studying the cyclicity of different weak-foci. Since a weak-focus with high order is the most current way to produce high cyclicity, we search for systems with the hi...

Exceptional orthogonal polynomial systems (X-OPS) arise as eigenfunctions of Sturm-Liouville problems and generalize in this sense the classical families of Hermite, Laguerre and Jacobi. They also generalize the family of CPRS orthogonal polynomials introduced by Cariñena et al., [3]. We formulate the following conjecture: every exceptional orthogonal polynomial system is related to a classical...

Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients. Moreover, we show that there exists a minimal solution, and the algorithm constructs it (in case of solvability). This extends a similar complexity bound estab...

It is common in wireless communications to perform some form of linear precoding operation on the source signal prior to transmission over a channel. Although the traditional reason for precoding is to improve the performance of the communication system, this paper draws attention to the fact that the receiver can identify the impulse response of the channel without any prior knowledge of the t...