As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build, and evaluate a scalable infrastructure for answering queries over distributed measurements, at reduced costs (in terms of both network traffic and query latency) while maintaining required precision. In this infrastructure, e...

Index structures are one of the most important tools that DBAs leverage in order to improve the performance of analytics and transactional workloads. However, with the explosion of data that is constantly being generated in a wide variety of domains including autonomous vehicles, Internet of Œings (IoT) devices, and E-commerce sites, building several indexes can o‰en become prohibitive and cons...

The motion of a viscous incompressible fluid flow in bounded domains with a smooth boundary can be described by the nonlinear Navier-Stokes equations. This description corresponds to the so-called Eulerian approach. We develop a new approximation method for the Navier-Stokes equations in both the stationary and the non-stationary case by a suitable coupling of the Eulerian and the Lagrangian re...

We develop the Sparse Approximate Matrix Multiply (SpAMM) n-body solver for first order Newton Schulz iteration of the matrix square root and inverse square root. The solver performs recursive two-sided metric queries on a modified Cauchy-Schwarz criterion (octree-occlusion-culling in the ijkcube), yielding a bounded relative error in the matrix-matrix product and reduced complexity for problem...

In contrast with the notion of complexity, a set A is called anticomplex if the Kolmogorov complexity of the initial segments of A chosen by a recursive function is always bounded by the identity function. We show that, as for complexity, the natural arena for examining anti-complexity is the weak-truth table degrees. In this context, we show the equivalence of anticomplexity and other lowness ...

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group H ≤ Sn of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem...

We analyze some aspects of scan statistics, which have been proposed to help for the detection of weak signals in genetic linkage analysis. We derive approximate expressions for the power of a test based on moving averages of the identity by descent allele sharing proportions for pairs of relatives at several contiguous markers. We confirm these approximate formulae by simulation. The results s...

Introduction The motivating example for the main theorem of this paper is the following elementary factorization in the Banach algebra c0 of complex sequences converging to zero. If a; is in c0, then there is an a ^ 0 in c0 such that x is in f(a).c0 for each continuous function / on [0, oo) with J-i{0} = {0} and/not tending to zero 'too quickly' as t tends to zero. This observation is essential...