HierarchyMap: A Novel Approach to Treemap Visualization of Hierarchical Data

The HierarchyMap describes a novel approach for Treemap Visualization method for representing large volume of hierarchical information on a 2-dimensional space. HierarchyMap algorithm is a new ordered treemap algorithm. Results of the implementation of HierarchyMap treemap algorithm show that it is capable of representing several thousands of hierarchical data on 2-dimensional space on a computer and Portable Device Application (PDA) screens while still maintaining the qualities found in existing treemap algorithms such as readability, low aspect ratio, reduced run time, and reduced number of thin rectangles. The HierarchyMap treemap algorithm is implemented in Java programming language and tested with dataset of Departmental and Faculty systems of Universities, Family trees, Plant and Animal taxonomy structure

A survey of comics research in computer science

Graphical novels such as comics and mangas are well known all over the world. The digital transition started to change the way people are reading comics, more and more on smartphones and tablets and less and less on paper. In the recent years, a wide variety of research about comics has been proposed and might change the way comics are created, distributed and read in future years. Early work focuses on low level document image analysis: indeed comic books are complex, they contains text, drawings, balloon, panels, onomatopoeia, etc. Different fields of computer science covered research about user interaction and content generation such as multimedia, artificial intelligence, human-computer interaction, etc. with different sets of values. We propose in this paper to review the previous research about comics in computer science, to state what have been done and to give some insights about the main outlooks

Core percolation in random graphs: a critical phenomena analysis

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the "core". In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the number of isolated vertices and the number of vertices and edges in the core. We show that a second order phase transition occurs at "alpha = e = 2.718...": below the transition, the core is small but above the transition, it occupies a finite fraction of the initial graph. The finite size scaling properties are then studied numerically in detail in the critical region, and we propose a consistent set of critical exponents, which does not coincide with the set of standard percolation exponents for this model. We clarify several aspects in combinatorial optimization and spectral properties of the adjacency matrix of random graphs. Key words: random graphs, leaf removal, core percolation, critical exponents, combinatorial optimization, finite size scaling, Monte-Carlo.Comment: 15 pages, 9 figures (color eps) [v2: published text with a new Title and addition of an appendix, a ref. and a fig.

VISUALIZING E-VOTING RESULTS

Recently, the urge for e-voting has been described to be the inevitable future of electioneering in most countries of the world. Despite all its good features, like the other voting systems it has been seen to also be susceptible to rigging and fraud. Some of its undesirable features include not allowing recounting of votes after election in case of a protest like the others. Another issue is that of erroneous software which can greatly affect the result of the election. All these is further compounded by the fact that voting systems deals with very large amount of data that is collected from a distributed population source hence the raw data are extremely difficult to comprehend and therefore monitor. This paper attempts to solve this problem using a TreeMap based visualization technique to monitor in real-time the distributed balloting and voting processes. The paper proved that TreeMap algorithms can be configured and deployed on the central server to monitor effectively the voting transactions in real-time and hence enable transparency

A tight upper bound for the path length of AVL trees

AbstractWe prove that the internal path length of an AVL tree of size N is bounded from above by 1.4404N(log2 N-log2log2N)+O(N) and show that this bound is achieved by an infinite family of AVL trees, each tree of which is not of maximal height. These results carry over to the comparison cost of brother trees