2,648 research outputs found
Fault-tolerant additive weighted geometric spanners
Let S be a set of n points and let w be a function that assigns non-negative
weights to points in S. The additive weighted distance d_w(p, q) between two
points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it
is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance
between p and q. A graph G(S, E) is called a t-spanner for the additive
weighted set S of points if for any two points p and q in S the distance
between p and q in graph G is at most t.d_w(p, q) for a real number t > 1.
Here, d_w(p,q) is the additive weighted distance between p and q. For some
integer k \geq 1, a t-spanner G for the set S is a (k, t)-vertex fault-tolerant
additive weighted spanner, denoted with (k, t)-VFTAWS, if for any set S'
\subset S with cardinality at most k, the graph G \ S' is a t-spanner for the
points in S \ S'. For any given real number \epsilon > 0, we obtain the
following results:
- When the points in S belong to Euclidean space R^d, an algorithm to compute
a (k,(2 + \epsilon))-VFTAWS with O(kn) edges for the metric space (S, d_w).
Here, for any two points p, q \in S, d(p, q) is the Euclidean distance between
p and q in R^d.
- When the points in S belong to a simple polygon P, for the metric space (S,
d_w), one algorithm to compute a geodesic (k, (2 + \epsilon))-VFTAWS with
O(\frac{k n}{\epsilon^{2}}\lg{n}) edges and another algorithm to compute a
geodesic (k, (\sqrt{10} + \epsilon))-VFTAWS with O(kn(\lg{n})^2) edges. Here,
for any two points p, q \in S, d(p, q) is the geodesic Euclidean distance along
the shortest path between p and q in P.
- When the points in lie on a terrain T, an algorithm to compute a
geodesic (k, (2 + \epsilon))-VFTAWS with O(\frac{k n}{\epsilon^{2}}\lg{n})
edges.Comment: a few update
A reduced semantics for deciding trace equivalence using constraint systems
Many privacy-type properties of security protocols can be modelled using
trace equivalence properties in suitable process algebras. It has been shown
that such properties can be decided for interesting classes of finite processes
(i.e., without replication) by means of symbolic execution and constraint
solving. However, this does not suffice to obtain practical tools. Current
prototypes suffer from a classical combinatorial explosion problem caused by
the exploration of many interleavings in the behaviour of processes.
M\"odersheim et al. have tackled this problem for reachability properties using
partial order reduction techniques. We revisit their work, generalize it and
adapt it for equivalence checking. We obtain an optimization in the form of a
reduced symbolic semantics that eliminates redundant interleavings on the fly.Comment: Accepted for publication at POST'1
The mechanism of radiation action in leukaemogenesis. Isolation of a leukaemogenic filtrable agent from tissues of irradiated and normal C57BL mice.
IRRADIATION of C57B1 mice induced a high incidence of lymphatic leukaemia, while being refractory to the spontaneous development of the disease. Several investigators have isolated a leukaemogenic agent from these radiation-induced tumours, which produces lymphoid leukaemia when injected into isologous newborn or young adult non-irradiated mice (Lieberman and Kaplan, 1959; Latarjet and Duplan, 1962; Laznicka and Smetanova, 1963; Ilbery and Winn, 1964). It has been assumed that the leukaemogenic agent is present during post-natal life in non-irradiated C57B1 mice, and that ionizing irradiation causes the release of a leukaemogenic agent, in addition to thymus and bone marrow injury, which are essential factors in radiation leukaemogenesis (Kaplan, 1964). Experimental support for this hypothesis was provided by demonstrating the presence of a leukaemogenic agent, for a limited period after completion of the irradiation treatment, in centrifugates prepared from pooled, irradiated, non-]eukaemic thymus and bone marrow (Haran-Ghera, 1966). The aim of the present studies was to isolate a leukaemogenic filtrate fro
07241 Abstracts Collection -- Tools for the Model-based Development of Certifiable, Dependable Systems
From June 10th to June 15th 2007, the
Dagstuhl Seminar 07241 ``Tools for the Model-based Development of Certifiable, Dependable Systems\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
07241 Summary -- Tools for the Model-based Development of Certifiable, Dependable Systems
This paper summarizes the objectives and structure of a
seminar with the same title, held from June 10th to June 15th, 2007
at Schloss Dagstuhl, Germany
Approximate Minimum Diameter
We study the minimum diameter problem for a set of inexact points. By
inexact, we mean that the precise location of the points is not known. Instead,
the location of each point is restricted to a contineus region (\impre model)
or a finite set of points (\indec model). Given a set of inexact points in
one of \impre or \indec models, we wish to provide a lower-bound on the
diameter of the real points.
In the first part of the paper, we focus on \indec model. We present an
time
approximation algorithm of factor for finding minimum diameter
of a set of points in dimensions. This improves the previously proposed
algorithms for this problem substantially.
Next, we consider the problem in \impre model. In -dimensional space, we
propose a polynomial time -approximation algorithm. In addition, for
, we define the notion of -separability and use our algorithm for
\indec model to obtain -approximation algorithm for a set of
-separable regions in time
Technical Note: Comparing and ranking soil drought indices performance over Europe, through remote-sensing of vegetation
In the past years there have been many attempts to produce and improve global soil-moisture datasets and drought indices. However, comparing and validating these various datasets is not straightforward. Here, interannual variations in drought indices are compared to interannual changes in vegetation, as captured by NDVI. By comparing the correlations of the different indices with NDVI we evaluated which drought index describes most realistically the actual changes in vegetation. Strong correlation between NDVI and the drought indices were found in areas that are classified as warm temperate climate with hot or warm dry summers. In these areas we ranked the PDSI, PSDI-SC, SPI3, and NSM indices, based on the interannual correlation with NDVI, and found that NSM outperformed the rest. Using this best performing index, and the ICA (Independent Component Analysis) technique, we analyzed the response of vegetation to temperature and soil-moisture stresses over Europe
Near-Perfect Correlation of the Resistance Components of Mesoscopic Samples at the Quantum Hall Regime
We study the four-terminal resistance fluctuations of mesoscopic samples near
the transition between the and the quantum Hall states. We
observe near-perfect correlations between the fluctuations of the longitudinal
and Hall components of the resistance. These correlated fluctuations appear in
a magnetic-field range for which the two-terminal resistance of the samples is
quantized. We discuss these findings in light of edge-state transport models of
the quantum Hall effect. We also show that our results lead to an ambiguity in
the determination of the width of quantum Hall transitions.Comment: As publishe
Abstract Interpretation with Unfoldings
We present and evaluate a technique for computing path-sensitive interference
conditions during abstract interpretation of concurrent programs. In lieu of
fixed point computation, we use prime event structures to compactly represent
causal dependence and interference between sequences of transformers. Our main
contribution is an unfolding algorithm that uses a new notion of independence
to avoid redundant transformer application, thread-local fixed points to reduce
the size of the unfolding, and a novel cutoff criterion based on subsumption to
guarantee termination of the analysis. Our experiments show that the abstract
unfolding produces an order of magnitude fewer false alarms than a mature
abstract interpreter, while being several orders of magnitude faster than
solver-based tools that have the same precision.Comment: Extended version of the paper (with the same title and authors) to
appear at CAV 201
- …