796 research outputs found
Algorithms for the workflow satisfiability problem engineered for counting constraints
The workflow satisfiability problem (WSP) asks whether there exists an
assignment of authorized users to the steps in a workflow specification that
satisfies the constraints in the specification. The problem is NP-hard in
general, but several subclasses of the problem are known to be fixed-parameter
tractable (FPT) when parameterized by the number of steps in the specification.
In this paper, we consider the WSP with user-independent counting constraints,
a large class of constraints for which the WSP is known to be FPT. We describe
an efficient implementation of an FPT algorithm for solving this subclass of
the WSP and an experimental evaluation of this algorithm. The algorithm
iteratively generates all equivalence classes of possible partial solutions
until, whenever possible, it finds a complete solution to the problem. We also
provide a reduction from a WSP instance to a pseudo-Boolean SAT instance. We
apply this reduction to the instances used in our experiments and solve the
resulting PB SAT problems using SAT4J, a PB SAT solver. We compare the
performance of our algorithm with that of SAT4J and discuss which of the two
approaches would be more effective in practice
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs and , a homomorphism of to is a mapping $f:\
V(G)\dom V(H)uv\in A(G)f(u)f(v)\in A(H)u \in V(G)c_i(u), i \in V(H)f\sum_{u\in V(G)}c_{f(u)}(u)HHHGc_i(u)u\in V(G)i\in V(H)GH$ and, if one exists, to find one of minimum cost.
Minimum cost homomorphism problems encompass (or are related to) many well
studied optimization problems such as the minimum cost chromatic partition and
repair analysis problems. We focus on the minimum cost homomorphism problem for
locally semicomplete digraphs and quasi-transitive digraphs which are two
well-known generalizations of tournaments. Using graph-theoretic
characterization results for the two digraph classes, we obtain a full
dichotomy classification of the complexity of minimum cost homomorphism
problems for both classes
Parameterized and Approximation Algorithms for the Load Coloring Problem
Let be two positive integers and let be a graph. The
-Load Coloring Problem (denoted -LCP) asks whether there is a
-coloring such that for every ,
there are at least edges with both endvertices colored . Gutin and Jones
(IPL 2014) studied this problem with . They showed -LCP to be fixed
parameter tractable (FPT) with parameter by obtaining a kernel with at most
vertices. In this paper, we extend the study to any fixed by giving
both a linear-vertex and a linear-edge kernel. In the particular case of ,
we obtain a kernel with less than vertices and less than edges. These
results imply that for any fixed , -LCP is FPT and that the
optimization version of -LCP (where is to be maximized) has an
approximation algorithm with a constant ratio for any fixed
Comment on "Chain Length Scaling of Protein Folding Time", PRL 77, 5433 (1996)
In a recent Letter, Gutin, Abkevich, and Shakhnovich (GAS) reported on a
series of dynamical Monte Carlo simulations on lattice models of proteins.
Based on these highly simplified models, they found that four different
potential energies lead to four different folding time scales tau_f, where
tau_f scales with chain length as N^lambda (see, also, Refs. [2-4]), with
lambda varying from 2.7 to 6.0. However, due to the lack of microscopic models
of protein folding dynamics, the interpretation and origin of the data have
remained somewhat speculative. It is the purpose of this Comment to point out
that the application of a simple "mesoscopic" model (cond-mat/9512019, PRL 77,
2324, 1996) of protein folding provides a full account of the data presented in
their paper. Moreover, we find a major qualitative disagreement with the
argumentative interpretation of GAS. Including, the origin of the dynamics, and
size of the critical folding nucleus.Comment: 1 page Revtex, 1 fig. upon request. Submitted to PR
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
The radiating part of circular sources
An analysis is developed linking the form of the sound field from a circular
source to the radial structure of the source, without recourse to far-field or
other approximations. It is found that the information radiated into the field
is limited, with the limit fixed by the wavenumber of source multiplied by the
source radius (Helmholtz number). The acoustic field is found in terms of the
elementary fields generated by a set of line sources whose form is given by
Chebyshev polynomials of the second kind, and whose amplitude is found to be
given by weighted integrals of the radial source term. The analysis is
developed for tonal sources, such as rotors, and, for Helmholtz number less
than two, for random disk sources. In this case, the analysis yields the
cross-spectrum between two points in the acoustic field. The analysis is
applied to the problems of tonal radiation, random source radiation as a model
problem for jet noise, and to noise cancellation, as in active control of noise
from rotors. It is found that the approach gives an accurate model for the
radiation problem and explicitly identifies those parts of a source which
radiate.Comment: Submitted to Journal of the Acoustical Society of Americ
- …