5,416 research outputs found
On Semantic Word Cloud Representation
We study the problem of computing semantic-preserving word clouds in which
semantically related words are close to each other. While several heuristic
approaches have been described in the literature, we formalize the underlying
geometric algorithm problem: Word Rectangle Adjacency Contact (WRAC). In this
model each word is associated with rectangle with fixed dimensions, and the
goal is to represent semantically related words by ensuring that the two
corresponding rectangles touch. We design and analyze efficient polynomial-time
algorithms for some variants of the WRAC problem, show that several general
variants are NP-hard, and describe a number of approximation algorithms.
Finally, we experimentally demonstrate that our theoretically-sound algorithms
outperform the early heuristics
Rectilinear partitioning of irregular data parallel computations
New mapping algorithms for domain oriented data-parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns are described. Researchers consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network. Discussed here is an improved algorithm for finding the optimal partitioning in one dimension, new algorithms for partitioning in two dimensions, and optimal partitioning in three dimensions. The application of these algorithms to real problems are discussed
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of
paper, each assigned a folding direction of mountain or valley, is there a flat
folding by a sequence of simple folds? There are several models of simple
folds; the simplest one-layer simple fold rotates a portion of paper about a
crease in the paper by +-180 degrees. We first consider the analogous questions
in one dimension lower -- bending a segment into a flat object -- which lead to
interesting problems on strings. We develop efficient algorithms for the
recognition of simply foldable 1D crease patterns, and reconstruction of a
sequence of simple folds. Indeed, we prove that a 1D crease pattern is
flat-foldable by any means precisely if it is by a sequence of one-layer simple
folds.
Next we explore simple foldability in two dimensions, and find a surprising
contrast: ``map'' folding and variants are polynomial, but slight
generalizations are NP-complete. Specifically, we develop a linear-time
algorithm for deciding foldability of an orthogonal crease pattern on a
rectangular piece of paper, and prove that it is (weakly) NP-complete to decide
foldability of (1) an orthogonal crease pattern on a orthogonal piece of paper,
(2) a crease pattern of axis-parallel and diagonal (45-degree) creases on a
square piece of paper, and (3) crease patterns without a mountain/valley
assignment.Comment: 24 pages, 19 figures. Version 3 includes several improvements thanks
to referees, including formal definitions of simple folds, more figures,
table summarizing results, new open problems, and additional reference
Quantum algorithms for classical lattice models
We give efficient quantum algorithms to estimate the partition function of
(i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the
Ising model with magnetic fields on a planar graph, (iii) the Potts model on a
quasi 2D square lattice, and (iv) the Z_2 lattice gauge theory on a
three-dimensional square lattice. Moreover, we prove that these problems are
BQP-complete, that is, that estimating these partition functions is as hard as
simulating arbitrary quantum computation. The results are proven for a complex
parameter regime of the models. The proofs are based on a mapping relating
partition functions to quantum circuits introduced in [Van den Nest et al.,
Phys. Rev. A 80, 052334 (2009)] and extended here.Comment: 21 pages, 12 figure
Thermodynamics and Topology of Disordered Systems: Statistics of the Random Knot Diagrams on Finite Lattice
The statistical properties of random lattice knots, the topology of which is
determined by the algebraic topological Jones-Kauffman invariants was studied
by analytical and numerical methods. The Kauffman polynomial invariant of a
random knot diagram was represented by a partition function of the Potts model
with a random configuration of ferro- and antiferromagnetic bonds, which
allowed the probability distribution of the random dense knots on a flat square
lattice over topological classes to be studied. A topological class is
characterized by the highest power of the Kauffman polynomial invariant and
interpreted as the free energy of a q-component Potts spin system for
q->infinity. It is shown that the highest power of the Kauffman invariant is
correlated with the minimum energy of the corresponding Potts spin system. The
probability of the lattice knot distribution over topological classes was
studied by the method of transfer matrices, depending on the type of local
junctions and the size of the flat knot diagram. The obtained results are
compared to the probability distribution of the minimum energy of a Potts
system with random ferro- and antiferromagnetic bonds.Comment: 37 pages, latex-revtex (new version: misprints removed, references
added
- …