1,030 research outputs found
Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets
Area-proportional Euler diagrams representing three sets are commonly used to visualize the results of medical experiments, business data, and information from other applications where statistical results are best shown using interlinking curves. Currently, there is no tool that will reliably visualize exact area-proportional diagrams for up to three sets. Limited success, in terms of diagram accuracy, has been achieved for a small number of cases, such as Venn-2 and Venn-3 where all intersections between the sets must be represented. Euler diagrams do not have to include all intersections and so permit the visualization of cases where some intersections have a zero value. This paper describes a general, implemented, method for visualizing all 40 Euler-3 diagrams in an area-proportional manner. We provide techniques for generating the curves with circles and convex polygons, analyze the drawability of data with these shapes, and give a mechanism for deciding whether such data can be drawn with circles. For the cases where non-convex curves are necessary, our method draws an appropriate diagram using non-convex polygons. Thus, we are now always able to automatically visualize data for up to three sets
eulerForce: Force-directed Layout for Euler Diagrams
Euler diagrams use closed curves to represent sets and their relationships. They facilitate set analysis, as humans tend to perceive distinct regions when closed curves are drawn on a plane. However, current automatic methods often produce diagrams with irregular, non-smooth curves that are not easily distinguishable. Other methods restrict the shape of the curve to for instance a circle, but such methods cannot draw an Euler diagram with exactly the required curve intersections for any set relations. In this paper, we present eulerForce, as the first method to adopt a force-directed approach to improve the layout and the curves of Euler diagrams generated by current methods. The layouts are improved in quick time. Our evaluation of eulerForce indicates the benefits of a force-directed approach to generate comprehensible Euler diagrams for any set relations in relatively fast time
Invariants, Kronecker Products, and Combinatorics of Some Remarkable Diophantine Systems (Extended Version)
This work lies across three areas (in the title) of investigation that are by
themselves of independent interest. A problem that arose in quantum computing
led us to a link that tied these areas together. This link consists of a single
formal power series with a multifaced interpretation. The deeper exploration of
this link yielded results as well as methods for solving some numerical
problems in each of these separate areas.Comment: 33 pages, 5 figure
Realizations of AF-algebras as graph algebras, Exel-Laca algebras, and ultragraph algebras
We give various necessary and sufficient conditions for an AF-algebra to be
isomorphic to a graph C*-algebra, an Exel-Laca algebra, and an ultragraph
C*-algebra. We also explore consequences of these results. In particular, we
show that all stable AF-algebras are both graph C*-algebras and Exel-Laca
algebras, and that all simple AF-algebras are either graph C*-algebras or
Exel-Laca algebras. In addition, we obtain a characterization of AF-algebras
that are isomorphic to the C*-algebra of a row-finite graph with no sinks.Comment: 34 pages, Version 2 comments: Some minor typos corrected; Version 3
comments: Some typos corrected. This is the version to appea
Visualizing Set Relations and Cardinalities Using Venn and Euler Diagrams
In medicine, genetics, criminology and various other areas, Venn and Euler diagrams are used to visualize data set relations and their cardinalities. The data sets are represented by closed curves and the data set relationships are depicted by the overlaps between these curves. Both the sets and their intersections are easily visible as the closed curves are preattentively processed and form common regions that have a strong perceptual grouping effect. Besides set relations such as intersection, containment and disjointness, the cardinality of the sets and their intersections can also be depicted in the same diagram (referred to as area-proportional) through the size of the curves and their overlaps. Size is a preattentive feature and so similarities, differences and trends are easily identified. Thus, such diagrams facilitate data analysis and reasoning about the sets. However, drawing these diagrams manually is difficult, often impossible, and current automatic drawing methods do not always produce appropriate diagrams.
This dissertation presents novel automatic drawing methods for different types of Euler diagrams and a user study of how such diagrams can help probabilistic judgement. The main drawing algorithms are: eulerForce, which uses a force-directed approach to lay out Euler diagrams; eulerAPE, which draws area-proportional Venn diagrams with ellipses. The user study evaluated the effectiveness of area- proportional Euler diagrams, glyph representations, Euler diagrams with glyphs and text+visualization formats for Bayesian reasoning, and a method eulerGlyphs was devised to automatically and accurately draw the assessed visualizations for any Bayesian problem. Additionally, analytic algorithms that instantaneously compute the overlapping areas of three general intersecting ellipses are provided, together with an evaluation of the effectiveness of ellipses in drawing accurate area-proportional Venn diagrams for 3-set data and the characteristics of the data that can be depicted accurately with ellipses
Shape-based peak identification for ChIP-Seq
We present a new algorithm for the identification of bound regions from
ChIP-seq experiments. Our method for identifying statistically significant
peaks from read coverage is inspired by the notion of persistence in
topological data analysis and provides a non-parametric approach that is robust
to noise in experiments. Specifically, our method reduces the peak calling
problem to the study of tree-based statistics derived from the data. We
demonstrate the accuracy of our method on existing datasets, and we show that
it can discover previously missed regions and can more clearly discriminate
between multiple binding events. The software T-PIC (Tree shape Peak
Identification for ChIP-Seq) is available at
http://math.berkeley.edu/~vhower/tpic.htmlComment: 12 pages, 6 figure
- …