2,846 research outputs found
Sparse Fault-Tolerant BFS Trees
This paper addresses the problem of designing a sparse {\em fault-tolerant}
BFS tree, or {\em FT-BFS tree} for short, namely, a sparse subgraph of the
given network such that subsequent to the failure of a single edge or
vertex, the surviving part of still contains a BFS spanning tree for
(the surviving part of) . Our main results are as follows. We present an
algorithm that for every -vertex graph and source node constructs a
(single edge failure) FT-BFS tree rooted at with O(n \cdot
\min\{\Depth(s), \sqrt{n}\}) edges, where \Depth(s) is the depth of the BFS
tree rooted at . This result is complemented by a matching lower bound,
showing that there exist -vertex graphs with a source node for which any
edge (or vertex) FT-BFS tree rooted at has edges. We then
consider {\em fault-tolerant multi-source BFS trees}, or {\em FT-MBFS trees}
for short, aiming to provide (following a failure) a BFS tree rooted at each
source for some subset of sources . Again, tight bounds
are provided, showing that there exists a poly-time algorithm that for every
-vertex graph and source set of size constructs a
(single failure) FT-MBFS tree from each source , with
edges, and on the other hand there exist
-vertex graphs with source sets of cardinality , on
which any FT-MBFS tree from has edges.
Finally, we propose an approximation algorithm for constructing
FT-BFS and FT-MBFS structures. The latter is complemented by a hardness result
stating that there exists no approximation algorithm for these
problems under standard complexity assumptions
On the Shapley-like Payoff Mechanisms in Peer-Assisted Services with Multiple Content Providers
This paper studies an incentive structure for cooperation and its stability
in peer-assisted services when there exist multiple content providers, using a
coalition game theoretic approach. We first consider a generalized coalition
structure consisting of multiple providers with many assisting peers, where
peers assist providers to reduce the operational cost in content distribution.
To distribute the profit from cost reduction to players (i.e., providers and
peers), we then establish a generalized formula for individual payoffs when a
"Shapley-like" payoff mechanism is adopted. We show that the grand coalition is
unstable, even when the operational cost functions are concave, which is in
sharp contrast to the recently studied case of a single provider where the
grand coalition is stable. We also show that irrespective of stability of the
grand coalition, there always exist coalition structures which are not
convergent to the grand coalition. Our results give us an important insight
that a provider does not tend to cooperate with other providers in
peer-assisted services, and be separated from them. To further study the case
of the separated providers, three examples are presented; (i) underpaid peers,
(ii) service monopoly, and (iii) oscillatory coalition structure. Our study
opens many new questions such as realistic and efficient incentive structures
and the tradeoffs between fairness and individual providers' competition in
peer-assisted services.Comment: 13 pages, 4 figures, an extended version of the paper to be presented
in ICST GameNets 2011, Shanghai, China, April 201
Dynamic and Multi-functional Labeling Schemes
We investigate labeling schemes supporting adjacency, ancestry, sibling, and
connectivity queries in forests. In the course of more than 20 years, the
existence of labeling schemes supporting each of these
functions was proven, with the most recent being ancestry [Fraigniaud and
Korman, STOC '10]. Several multi-functional labeling schemes also enjoy lower
or upper bounds of or
respectively. Notably an upper bound of for
adjacency+siblings and a lower bound of for each of the
functions siblings, ancestry, and connectivity [Alstrup et al., SODA '03]. We
improve the constants hidden in the -notation. In particular we show a lower bound for connectivity+ancestry and
connectivity+siblings, as well as an upper bound of for connectivity+adjacency+siblings by altering existing
methods.
In the context of dynamic labeling schemes it is known that ancestry requires
bits [Cohen, et al. PODS '02]. In contrast, we show upper and lower
bounds on the label size for adjacency, siblings, and connectivity of
bits, and to support all three functions. There exist efficient
adjacency labeling schemes for planar, bounded treewidth, bounded arboricity
and interval graphs. In a dynamic setting, we show a lower bound of
for each of those families.Comment: 17 pages, 5 figure
Resolution of Pawcatuck National Bank of Pawcatuck, Connecticut Concerning the Death of Peleg Clarke, Jr., October 16, 1899
This handwritten resolution, dated October 16, 1899, is written on behalf of the board of directors of Pawcatuck National Bank upon learning of the death of former bank president, Peleg Clarke, Jr. The resolution states that the board bows to the will of God in having taken the former bank president who they state served this Institution faithfully and well from 1874 to 1899 and further resolves to send the resolution to Clarke\u27s family with their deepest sympathy. The resolution is signed by Peleg S. Barber, the current president, and J. A. Brown, the current clerk. The resolution is written on Pawcatuck National Bank letterhead that still names Peleg Clarke as president.https://scholarsjunction.msstate.edu/fvw-manuscripts-clarke/1079/thumbnail.jp
Locally Optimal Load Balancing
This work studies distributed algorithms for locally optimal load-balancing:
We are given a graph of maximum degree , and each node has up to
units of load. The task is to distribute the load more evenly so that the loads
of adjacent nodes differ by at most .
If the graph is a path (), it is easy to solve the fractional
version of the problem in communication rounds, independently of the
number of nodes. We show that this is tight, and we show that it is possible to
solve also the discrete version of the problem in rounds in paths.
For the general case (), we show that fractional load balancing
can be solved in rounds and discrete load
balancing in rounds for some function , independently of the
number of nodes.Comment: 19 pages, 11 figure
Robots with Lights: Overcoming Obstructed Visibility Without Colliding
Robots with lights is a model of autonomous mobile computational entities
operating in the plane in Look-Compute-Move cycles: each agent has an
externally visible light which can assume colors from a fixed set; the lights
are persistent (i.e., the color is not erased at the end of a cycle), but
otherwise the agents are oblivious. The investigation of computability in this
model, initially suggested by Peleg, is under way, and several results have
been recently established. In these investigations, however, an agent is
assumed to be capable to see through another agent. In this paper we start the
study of computing when visibility is obstructable, and investigate the most
basic problem for this setting, Complete Visibility: The agents must reach
within finite time a configuration where they can all see each other and
terminate. We do not make any assumption on a-priori knowledge of the number of
agents, on rigidity of movements nor on chirality. The local coordinate system
of an agent may change at each activation. Also, by definition of lights, an
agent can communicate and remember only a constant number of bits in each
cycle. In spite of these weak conditions, we prove that Complete Visibility is
always solvable, even in the asynchronous setting, without collisions and using
a small constant number of colors. The proof is constructive. We also show how
to extend our protocol for Complete Visibility so that, with the same number of
colors, the agents solve the (non-uniform) Circle Formation problem with
obstructed visibility
Towards the interoperability of computerised guidelines and electronic health records: an experiment with openEHR archetypes and a chronic heart failure guideline
Clinical guidelines contain recommendations based on the best empirical evidence available at the moment. There is a wide consensus about the benefits of guidelines and about the fact that they should be deployed through clinical information systems, making them available during clinical consultations. However, one of the main obstacles to this integration is the interaction with the electronic healthrecord system. With the aim of solving the interoperability problems of guideline systems, we have investigated the utilisation of the openEHR standardisation proposal in the context of one of the existing guideline representation languages. Concretely, we have designed a collection of archetypes to be used within a chronic heart failure guideline. The main contribution of our work is the utilisation of openEHR archetypes in the framework of guideline representation languages. Other contributions include both the concrete set of archetypes that we have selected and the methodological approach that we have followed to obtain itThis work has been supported by Fundaci´o Caixa Castell´o-Bancaixa, through the research project P11B2009-3
A two-dimensional representation of four-dimensional gravitational waves
The Einstein equation in D dimensions, if restricted to the class of
space-times possessing n = D - 2 commuting hypersurface-orthogonal Killing
vectors, can be equivalently written as metric-dilaton gravity in 2 dimensions
with n scalar fields. For n = 2, this results reduces to the known reduction of
certain 4-dimensional metrics which include gravitational waves. Here, we give
such a representation which leads to a new proof of the Birkhoff theorem for
plane-symmetric space--times, and which leads to an explanation, in which sense
two (spin zero-) scalar fields in 2 dimensions may incorporate the (spin two-)
gravitational waves in 4 dimensions. (This result should not be mixed up with
well--known analogous statements where, however, the 4-dimensional space-time
is supposed to be spherically symmetric, and then, of course, the equivalent
2-dimensional picture cannot mimic any gravitational waves.) Finally, remarks
on hidden symmetries in 2 dimensions are made.Comment: 12 pages, LaTeX, no figures, Int. J. Mod. Phys. D in prin
Time-Symmetric Initial Data for Multi-Body Solutions in Three Dimensions
Time-symmetric initial data for two-body solutions in three dimensional
anti-deSitter gravity are found. The spatial geometry has constant negative
curvature and is constructed as a quotient of two-dimensional hyperbolic space.
Apparent horizons correspond to closed geodesics. In an open universe, it is
shown that two black holes cannot exist separately, but are necessarily
enclosed by a third horizon. In a closed universe, two separate black holes can
exist provided there is an additional image mass.Comment: 12 pages, harvmac macro, minor changes in wordin
- …