94,797 research outputs found
Structural Analysis: Shape Information via Points-To Computation
This paper introduces a new hybrid memory analysis, Structural Analysis,
which combines an expressive shape analysis style abstract domain with
efficient and simple points-to style transfer functions. Using data from
empirical studies on the runtime heap structures and the programmatic idioms
used in modern object-oriented languages we construct a heap analysis with the
following characteristics: (1) it can express a rich set of structural, shape,
and sharing properties which are not provided by a classic points-to analysis
and that are useful for optimization and error detection applications (2) it
uses efficient, weakly-updating, set-based transfer functions which enable the
analysis to be more robust and scalable than a shape analysis and (3) it can be
used as the basis for a scalable interprocedural analysis that produces precise
results in practice.
The analysis has been implemented for .Net bytecode and using this
implementation we evaluate both the runtime cost and the precision of the
results on a number of well known benchmarks and real world programs. Our
experimental evaluations show that the domain defined in this paper is capable
of precisely expressing the majority of the connectivity, shape, and sharing
properties that occur in practice and, despite the use of weak updates, the
static analysis is able to precisely approximate the ideal results. The
analysis is capable of analyzing large real-world programs (over 30K bytecodes)
in less than 65 seconds and using less than 130MB of memory. In summary this
work presents a new type of memory analysis that advances the state of the art
with respect to expressive power, precision, and scalability and represents a
new area of study on the relationships between and combination of concepts from
shape and points-to analyses
Design of Automatically Adaptable Web Wrappers
Nowadays, the huge amount of information distributed through the Web motivates studying techniques to\ud
be adopted in order to extract relevant data in an efficient and reliable way. Both academia and enterprises\ud
developed several approaches of Web data extraction, for example using techniques of artificial intelligence or\ud
machine learning. Some commonly adopted procedures, namely wrappers, ensure a high degree of precision\ud
of information extracted from Web pages, and, at the same time, have to prove robustness in order not to\ud
compromise quality and reliability of data themselves.\ud
In this paper we focus on some experimental aspects related to the robustness of the data extraction process\ud
and the possibility of automatically adapting wrappers. We discuss the implementation of algorithms for\ud
finding similarities between two different version of a Web page, in order to handle modifications, avoiding\ud
the failure of data extraction tasks and ensuring reliability of information extracted. Our purpose is to evaluate\ud
performances, advantages and draw-backs of our novel system of automatic wrapper adaptation
A storage and access architecture for efficient query processing in spatial database systems
Due to the high complexity of objects and queries and also due to extremely
large data volumes, geographic database systems impose stringent requirements on their
storage and access architecture with respect to efficient query processing. Performance
improving concepts such as spatial storage and access structures, approximations, object
decompositions and multi-phase query processing have been suggested and analyzed as
single building blocks. In this paper, we describe a storage and access architecture which
is composed from the above building blocks in a modular fashion. Additionally, we incorporate
into our architecture a new ingredient, the scene organization, for efficiently
supporting set-oriented access of large-area region queries. An experimental performance
comparison demonstrates that the concept of scene organization leads to considerable
performance improvements for large-area region queries by a factor of up to 150
Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition
Large-scale interconnected uncertain systems commonly have large state and
uncertainty dimensions. Aside from the heavy computational cost of solving
centralized robust stability analysis techniques, privacy requirements in the
network can also introduce further issues. In this paper, we utilize IQC
analysis for analyzing large-scale interconnected uncertain systems and we
evade these issues by describing a decomposition scheme that is based on the
interconnection structure of the system. This scheme is based on the so-called
chordal decomposition and does not add any conservativeness to the analysis
approach. The decomposed problem can be solved using distributed computational
algorithms without the need for a centralized computational unit. We further
discuss the merits of the proposed analysis approach using a numerical
experiment.Comment: 3 figures. Submitted to the 19th IFAC world congres
Uncertainty in phylogenetic tree estimates
Estimating phylogenetic trees is an important problem in evolutionary
biology, environmental policy and medicine. Although trees are estimated, their
uncertainties are discarded by mathematicians working in tree space. Here we
explicitly model the multivariate uncertainty of tree estimates. We consider
both the cases where uncertainty information arises extrinsically (through
covariate information) and intrinsically (through the tree estimates
themselves). The importance of accounting for tree uncertainty in tree space is
demonstrated in two case studies. In the first instance, differences between
gene trees are small relative to their uncertainties, while in the second, the
differences are relatively large. Our main goal is visualization of tree
uncertainty, and we demonstrate advantages of our method with respect to
reproducibility, speed and preservation of topological differences compared to
visualization based on multidimensional scaling. The proposal highlights that
phylogenetic trees are estimated in an extremely high-dimensional space,
resulting in uncertainty information that cannot be discarded. Most
importantly, it is a method that allows biologists to diagnose whether
differences between gene trees are biologically meaningful, or due to
uncertainty in estimation.Comment: Final version accepted to Journal of Computational and Graphical
Statistic
- …