14,340 research outputs found
The 0-1 inverse maximum stable set problem
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal. We focus on its 0-1 version, which is to modify as little as possible the structure of the given instance so that the fixed solution becomes optimal in the new instance. In this paper, we consider the 0-1 inverse maximum stable set problem against a specific (optimal or not) algorithm, which is to delete as few vertices as possible so that the fixed stable set S* can be returned as a solution by the given algorithm in the new instance. Firstly, we study the hardness and approximation results of the 0-1 inverse maximum stable set problem against the algorithms. Greedy and 2-opt. Secondly, we identify classes of graphs for which the 0-1 inverse maximum stable set problem can be polynomially solvable. We prove the tractability of the problem for several classes of perfect graphs such as comparability graphs and chordal graphs.Combinatorial inverse optimization, maximum stable set problem, NP-hardness, performance ratio, perfect graphs.
Euclidean distance geometry and applications
Euclidean distance geometry is the study of Euclidean geometry based on the
concept of distance. This is useful in several applications where the input
data consists of an incomplete set of distances, and the output is a set of
points in Euclidean space that realizes the given distances. We survey some of
the theory of Euclidean distance geometry and some of the most important
applications: molecular conformation, localization of sensor networks and
statics.Comment: 64 pages, 21 figure
Spectral Theory of Sparse Non-Hermitian Random Matrices
Sparse non-Hermitian random matrices arise in the study of disordered
physical systems with asymmetric local interactions, and have applications
ranging from neural networks to ecosystem dynamics. The spectral
characteristics of these matrices provide crucial information on system
stability and susceptibility, however, their study is greatly complicated by
the twin challenges of a lack of symmetry and a sparse interaction structure.
In this review we provide a concise and systematic introduction to the main
tools and results in this field. We show how the spectra of sparse
non-Hermitian matrices can be computed via an analogy with infinite dimensional
operators obeying certain recursion relations. With reference to three
illustrative examples --- adjacency matrices of regular oriented graphs,
adjacency matrices of oriented Erd\H{o}s-R\'{e}nyi graphs, and adjacency
matrices of weighted oriented Erd\H{o}s-R\'{e}nyi graphs --- we demonstrate the
use of these methods to obtain both analytic and numerical results for the
spectrum, the spectral distribution, the location of outlier eigenvalues, and
the statistical properties of eigenvectors.Comment: 60 pages, 10 figure
Non Parametric Distributed Inference in Sensor Networks Using Box Particles Messages
This paper deals with the problem of inference in distributed systems where the probability model is stored in a distributed fashion. Graphical models provide powerful tools for modeling this kind of problems. Inspired by the box particle filter which combines interval analysis with particle filtering to solve temporal inference problems, this paper introduces a belief propagation-like message-passing algorithm that uses bounded error methods to solve the inference problem defined on an arbitrary graphical model. We show the theoretic derivation of the novel algorithm and we test its performance on the problem of calibration in wireless sensor networks. That is the positioning of a number of randomly deployed sensors, according to some reference defined by a set of anchor nodes for which the positions are known a priori. The new algorithm, while achieving a better or similar performance, offers impressive reduction of the information circulating in the network and the needed computation times
A comparison of two techniques for bibliometric mapping: Multidimensional scaling and VOS
VOS is a new mapping technique that can serve as an alternative to the
well-known technique of multidimensional scaling. We present an extensive
comparison between the use of multidimensional scaling and the use of VOS for
constructing bibliometric maps. In our theoretical analysis, we show the
mathematical relation between the two techniques. In our experimental analysis,
we use the techniques for constructing maps of authors, journals, and keywords.
Two commonly used approaches to bibliometric mapping, both based on
multidimensional scaling, turn out to produce maps that suffer from artifacts.
Maps constructed using VOS turn out not to have this problem. We conclude that
in general maps constructed using VOS provide a more satisfactory
representation of a data set than maps constructed using well-known
multidimensional scaling approaches
Covariance approximation for large multivariate spatial data sets with an application to multiple climate model errors
This paper investigates the cross-correlations across multiple climate model
errors. We build a Bayesian hierarchical model that accounts for the spatial
dependence of individual models as well as cross-covariances across different
climate models. Our method allows for a nonseparable and nonstationary
cross-covariance structure. We also present a covariance approximation approach
to facilitate the computation in the modeling and analysis of very large
multivariate spatial data sets. The covariance approximation consists of two
parts: a reduced-rank part to capture the large-scale spatial dependence, and a
sparse covariance matrix to correct the small-scale dependence error induced by
the reduced rank approximation. We pay special attention to the case that the
second part of the approximation has a block-diagonal structure. Simulation
results of model fitting and prediction show substantial improvement of the
proposed approximation over the predictive process approximation and the
independent blocks analysis. We then apply our computational approach to the
joint statistical modeling of multiple climate model errors.Comment: Published in at http://dx.doi.org/10.1214/11-AOAS478 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
In-Network Distributed Solar Current Prediction
Long-term sensor network deployments demand careful power management. While
managing power requires understanding the amount of energy harvestable from the
local environment, current solar prediction methods rely only on recent local
history, which makes them susceptible to high variability. In this paper, we
present a model and algorithms for distributed solar current prediction, based
on multiple linear regression to predict future solar current based on local,
in-situ climatic and solar measurements. These algorithms leverage spatial
information from neighbors and adapt to the changing local conditions not
captured by global climatic information. We implement these algorithms on our
Fleck platform and run a 7-week-long experiment validating our work. In
analyzing our results from this experiment, we determined that computing our
model requires an increased energy expenditure of 4.5mJ over simpler models (on
the order of 10^{-7}% of the harvested energy) to gain a prediction improvement
of 39.7%.Comment: 28 pages, accepted at TOSN and awaiting publicatio
- …