1,613 research outputs found
On Nonnegative Integer Matrices and Short Killing Words
Let be a natural number and a set of -matrices
over the nonnegative integers such that the joint spectral radius of
is at most one. We show that if the zero matrix is a product
of matrices in , then there are with . This result has applications in
automata theory and the theory of codes. Specifically, if
is a finite incomplete code, then there exists a word of
length polynomial in such that is not a factor of any
word in . This proves a weak version of Restivo's conjecture.Comment: This version is a journal submission based on a STACS'19 paper. It
extends the conference version as follows. (1) The main result has been
generalized to apply to monoids generated by finite sets whose joint spectral
radius is at most 1. (2) The use of Carpi's theorem is avoided to make the
paper more self-contained. (3) A more precise result is offered on Restivo's
conjecture for finite code
Geometric and form feature recognition tools applied to a design for assembly methodology
The paper presents geometric tools for an automated Design for Assembly (DFA) assessment system. For each component in an assembly a two step features search is performed: firstly (using the minimal bounding box) mass, dimensions and symmetries are identified allowing the part to be classified, according to DFA convention, as either rotational or prismatic; secondly form features are extracted allowing an effective method of mechanised orientation to be determined. Together these algorithms support the fuzzy decision support system, of an assembly-orientated CAD system known as FuzzyDFA
Efficient Evaluation of the Number of False Alarm Criterion
This paper proposes a method for computing efficiently the significance of a
parametric pattern inside a binary image. On the one hand, a-contrario
strategies avoid the user involvement for tuning detection thresholds, and
allow one to account fairly for different pattern sizes. On the other hand,
a-contrario criteria become intractable when the pattern complexity in terms of
parametrization increases. In this work, we introduce a strategy which relies
on the use of a cumulative space of reduced dimensionality, derived from the
coupling of a classic (Hough) cumulative space with an integral histogram
trick. This space allows us to store partial computations which are required by
the a-contrario criterion, and to evaluate the significance with a lower
computational cost than by following a straightforward approach. The method is
illustrated on synthetic examples on patterns with various parametrizations up
to five dimensions. In order to demonstrate how to apply this generic concept
in a real scenario, we consider a difficult crack detection task in still
images, which has been addressed in the literature with various local and
global detection strategies. We model cracks as bounded segments, detected by
the proposed a-contrario criterion, which allow us to introduce additional
spatial constraints based on their relative alignment. On this application, the
proposed strategy yields state-of the-art results, and underlines its potential
for handling complex pattern detection tasks
Geometric and form feature recognition tools applied to a design for assembly methodology
International audienceThe paper presents geometric tools for an automated Design for Assembly (DFA) assessment system. For each component in an assembly a two step features search is performed: firstly (using the minimal bounding box) mass, dimensions and symmetries are identified allowing the part to be classified, according to DFA convention, as either rotational or prismatic; secondly form features are extracted allowing an effective method of mechanised orientation to be determined. Together these algorithms support the fuzzy decision support system, of an assembly-orientated CAD system known as FuzzyDFA
Geometric and form feature recognition tools applied to a design for assembly methodology
International audienceThe paper presents geometric tools for an automated Design for Assembly (DFA) assessment system. For each component in an assembly a two step features search is performed: firstly (using the minimal bounding box) mass, dimensions and symmetries are identified allowing the part to be classified, according to DFA convention, as either rotational or prismatic; secondly form features are extracted allowing an effective method of mechanised orientation to be determined. Together these algorithms support the fuzzy decision support system, of an assembly-orientated CAD system known as FuzzyDFA
Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability
We consider the parameterized verification of arbitrarily large networks of
agents which communicate by broadcasting and receiving messages. In our model,
the broadcast topology is reconfigurable so that a sent message can be received
by any set of agents. In addition, agents have local registers which are
initially distinct and may therefore be thought of as identifiers. When an
agent broadcasts a message, it appends to the message the value stored in one
of its registers. Upon reception, an agent can store the received value or test
this value for equality with one of its own registers. We consider the
coverability problem, where one asks whether a given state of the system may be
reached by at least one agent. We establish that this problem is decidable;
however, it is as hard as coverability in lossy channel systems, which is
non-primitive recursive. This model lies at the frontier of decidability as
other classical problems on this model are undecidable; this is in particular
true for the target problem where all processes must synchronize on a given
state. By contrast, we show that the coverability problem is NP-complete when
each agent has only one register
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints
In parametric lock-sharing systems processes can spawn new processes to run in parallel, and can create new locks. The behavior of every process is given by a pushdown automaton. We consider infinite behaviors of such systems under strong process fairness condition. A result of a potentially infinite execution of a system is a limit configuration, that is a potentially infinite tree. The verification problem is to determine if a given system has a limit configuration satisfying a given regular property. This formulation of the problem encompasses verification of reachability as well as of many liveness properties. We show that this verification problem, while undecidable in general, is decidable for nested lock usage.
We show Exptime-completeness of the verification problem. The main source of complexity is the number of parameters in the spawn operation. If the number of parameters is bounded, our algorithm works in Ptime for properties expressed by parity automata with a fixed number of ranks
- …