1,555 research outputs found
Submodularity of Energy Related Controllability Metrics
The quantification of controllability and observability has recently received
new interest in the context of large, complex networks of dynamical systems. A
fundamental but computationally difficult problem is the placement or selection
of actuators and sensors that optimize real-valued controllability and
observability metrics of the network. We show that several classes of energy
related metrics associated with the controllability Gramian in linear dynamical
systems have a strong structural property, called submodularity. This property
allows for an approximation guarantee by using a simple greedy heuristic for
their maximization. The results are illustrated for randomly generated systems
and for placement of power electronic actuators in a model of the European
power grid.Comment: 7 pages, 2 figures; submitted to the 2014 IEEE Conference on Decision
and Contro
On Submodularity and Controllability in Complex Dynamical Networks
Controllability and observability have long been recognized as fundamental
structural properties of dynamical systems, but have recently seen renewed
interest in the context of large, complex networks of dynamical systems. A
basic problem is sensor and actuator placement: choose a subset from a finite
set of possible placements to optimize some real-valued controllability and
observability metrics of the network. Surprisingly little is known about the
structure of such combinatorial optimization problems. In this paper, we show
that several important classes of metrics based on the controllability and
observability Gramians have a strong structural property that allows for either
efficient global optimization or an approximation guarantee by using a simple
greedy heuristic for their maximization. In particular, the mapping from
possible placements to several scalar functions of the associated Gramian is
either a modular or submodular set function. The results are illustrated on
randomly generated systems and on a problem of power electronic actuator
placement in a model of the European power grid.Comment: Original arXiv version of IEEE Transactions on Control of Network
Systems paper (Volume 3, Issue 1), with a addendum (located in the ancillary
documents) that explains an error in a proof of the original paper and
provides a counterexample to the corresponding resul
What Will Italy Become Without Its Elders?
Our elders are dying one by one, oak trees struck down by an acceleration of greed and skepticism. The generation that was raised in the angst of World War II is gone.
Coffins, too many to bury. Lined up at the Monumental Cemetery, in churches, in convoys in the streets around Borgo Palazzo—our elders, waiting to be turned back to ashes.
The crematorium fire never ceases burning, smoldering 24 hours a day. Crackling, it consumes bones, lace collars, mustaches, and memories
Twinning Automata and Regular Expressions for String Static Analysis
In this paper we formalize TARSIS, a new abstract domain based on the abstract interpretation theory that approximates string values through finite state automata. The main novelty of TARSIS is that it works over an alphabet of strings instead of single characters. On the one hand, such an approach requires a more complex and refined definition of the widening operator, and the abstract semantics of string operators. On the other hand, it is in position to obtain strictly more precise results than state-of-the-art approaches. We implemented a prototype of TARSIS, and we applied it to some case studies taken from some of the most popular Java libraries manipulating string values. The experimental results confirm that TARSIS is in position to obtain strictly more precise results than existing analyses
Static analysis for dummies: Experiencing LiSA
Semantics-based static analysis requires a significant theoretical background before being able to design and implement a new analysis. Unfortunately, the development of even a toy static analyzer from scratch requires to implement an infrastructure (parser, control flow graphs representation, fixpoint algorithms, etc.) that is too demanding for bachelor and master students in computer science. This approach difficulty can condition the acquisition of skills on software verification which are of major importance for the design of secure systems. In this paper, we show how LiSA (Library for Static Analysis) can play a role in that respect. LiSA implements the basic infrastructure that allows a non-expert user to develop even simple analyses (e.g., dataflow and numerical non-relational domains) focusing only on the design of the appropriate representation of the property of interest and of the sound approximation of the program statements
A Quantile-Based Watermarking Approach for Distortion Minimization
Distortion-based watermarking techniques embed the watermark by performing tolerable changes in the digital assets being protected. For relational data, mark insertion can be performed over the different data types of the database relations’ attributes. An important goal for distortion-based approaches is to minimize as much as possible the changes that the watermark embedding provokes into data, preserving their usability, watermark robustness, and capacity. This paper proposes a quantile-based watermarking technique for numerical cover type focused on preserving the distribution of attributes used as mark carriers. The experiments performed to validate our proposal show a significant distortion reduction compared to traditional approaches while maintaining watermark capacity levels. Also, positive achievements regarding robustness are visible, evidencing our technique’s resilience against subset attacks
- …