41,037 research outputs found
Data-Oblivious Graph Algorithms in Outsourced External Memory
Motivated by privacy preservation for outsourced data, data-oblivious
external memory is a computational framework where a client performs
computations on data stored at a semi-trusted server in a way that does not
reveal her data to the server. This approach facilitates collaboration and
reliability over traditional frameworks, and it provides privacy protection,
even though the server has full access to the data and he can monitor how it is
accessed by the client. The challenge is that even if data is encrypted, the
server can learn information based on the client data access pattern; hence,
access patterns must also be obfuscated. We investigate privacy-preserving
algorithms for outsourced external memory that are based on the use of
data-oblivious algorithms, that is, algorithms where each possible sequence of
data accesses is independent of the data values. We give new efficient
data-oblivious algorithms in the outsourced external memory model for a number
of fundamental graph problems. Our results include new data-oblivious
external-memory methods for constructing minimum spanning trees, performing
various traversals on rooted trees, answering least common ancestor queries on
trees, computing biconnected components, and forming open ear decompositions.
None of our algorithms make use of constant-time random oracles.Comment: 20 page
Lagrangian ADER-WENO Finite Volume Schemes on Unstructured Triangular Meshes Based On Genuinely Multidimensional HLL Riemann Solvers
In this paper we use the genuinely multidimensional HLL Riemann solvers
recently developed by Balsara et al. to construct a new class of
computationally efficient high order Lagrangian ADER-WENO one-step ALE finite
volume schemes on unstructured triangular meshes. A nonlinear WENO
reconstruction operator allows the algorithm to achieve high order of accuracy
in space, while high order of accuracy in time is obtained by the use of an
ADER time-stepping technique based on a local space-time Galerkin predictor.
The multidimensional HLL and HLLC Riemann solvers operate at each vertex of the
grid, considering the entire Voronoi neighborhood of each node and allows for
larger time steps than conventional one-dimensional Riemann solvers. The
results produced by the multidimensional Riemann solver are then used twice in
our one-step ALE algorithm: first, as a node solver that assigns a unique
velocity vector to each vertex, in order to preserve the continuity of the
computational mesh; second, as a building block for genuinely multidimensional
numerical flux evaluation that allows the scheme to run with larger time steps
compared to conventional finite volume schemes that use classical
one-dimensional Riemann solvers in normal direction. A rezoning step may be
necessary in order to overcome element overlapping or crossing-over. We apply
the method presented in this article to two systems of hyperbolic conservation
laws, namely the Euler equations of compressible gas dynamics and the equations
of ideal classical magneto-hydrodynamics (MHD). Convergence studies up to
fourth order of accuracy in space and time have been carried out. Several
numerical test problems have been solved to validate the new approach
On dynamic breadth-first search in external-memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially nodes and O(n) edges and monotone update sequences of either edge insertions or edge deletions, we prove an amortized high-probability bound of O(n/B^{2/3}+\sort(n)\cdot \log B) I/Os per update. In contrast, the currently best approach for static BFS on sparse undirected graphs requires \Omega(n/B^{1/2}+\sort(n)) I/Os. 1998 ACM Subject Classification: F.2.2. Key words and phrases: External Memory, Dynamic Graph Algorithms, BFS, Randomization
An Algorithm to Compute the Topological Euler Characteristic, Chern-Schwartz-MacPherson Class and Segre Class of Projective Varieties
Let be a closed subscheme of a projective space . We give
an algorithm to compute the Chern-Schwartz-MacPherson class, Euler
characteristic and Segre class of . The algorithm can be implemented using
either symbolic or numerical methods. The algorithm is based on a new method
for calculating the projective degrees of a rational map defined by a
homogeneous ideal. Using this result and known formulas for the
Chern-Schwartz-MacPherson class of a projective hypersurface and the Segre
class of a projective variety in terms of the projective degrees of certain
rational maps we give algorithms to compute the Chern-Schwartz-MacPherson class
and Segre class of a projective variety. Since the Euler characteristic of
is the degree of the zero dimensional component of the
Chern-Schwartz-MacPherson class of our algorithm also computes the Euler
characteristic . Relationships between the algorithm developed here
and other existing algorithms are discussed. The algorithm is tested on several
examples and performs favourably compared to current algorithms for computing
Chern-Schwartz-MacPherson classes, Segre classes and Euler characteristics
- …