31549238
Online Animated Graph Drawing for Web Navigation
This paper describes an online animated graph drawing method. The method deals with huge graphs which are partially unknown. It is instantiated in OFDAV, a web diagram visualizer.
9564181
Navigating Clustered Graphs Using Force-Directed Methods
Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes. Current graph drawing methods successfully deal with (at best) a few hundred nodes. This paper describes a strategy for the visualization and navigation of graphs. The strategy has three elements:
847742
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of abstract data and relations amount data items. It uses a graph model to present the data items and the relations and tries to geometrically convert the abstract graph into a 2D plane for visualization. There are many applications in this area, such as family trees, software design diagrams and web site-maps.The real world data that we want to visualize, however, is more complex than those that can be simply presented with traditional techniques, because it contains many domain-specific attributes.For example, in a web site-map (visualization) a simple graphical node can be used to represent a web page. However, this node is unable to represent some domain-specific attributes associated with the web page, such as the access frequency and the connectivity of the page in the web locality.This paper introduces a new model for Attributed Information Visualization that can be used to visualize the relational data with many associated attributes. We split the visualization model into two mappings between the abstract data and physical pictures, Geometric Mapping and Graphical Mapping.
12488692
Exploring UDDI Registries Using Modified OFDAV Browser
This paper introduces a framework of interactive navigating through the web-based UDDI Business Registries. By creating a 2D interactive visual interface, service requesters are able to visually navigate through the large information hierarchies that are usually used to present the UDDI Business Registries. Instead of using the traditional keywords or click-through searching methodologies, which are often inefficient and less obvious, we use a visualization technique, namely Online Force-Directed Animated Visualization (OFDA VJ, to create our visual interface. A simplified prototype with visual interface has been developed for the purpose of demonstration.
22192509
A space-optimized tree visualization
We describe a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views.
39737048
Creating a Visual Interface for Navigating Large UDDI Business Registries
This paper introduces a framework of a 20 visual interface for interactive navigating of UDDI Business Registries to discover appropriate services for the service requester among the available Web Services. By creating a 20 interactive visual interface, users are able to visually navigate through the large information hierarchies that are usually used to present the UDDI Business Registries, instead of using the traditional keywords or click-through searching methodologies which are often inefficient and less obvious. Several visualization techniques can be employed to achieve this objective, Image-Map used in this case. A simplified web-based UDDI business registry prototype with visual interface has been developed by using some open source technologies, such as, MySQL for backend data source layer, Apache HTTP server with PHP for business logic layer and dynamic ImageMap visualization with XHTML and client side scripting language JavaScript for presentation layer.
6607773
DMDC: Delayed Memory Dependence Checking through Age-Based Filtering
One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution of memory instructions. Traditional CAM-based associative queues can be very slow and energy hungry. In this paper we introduce two new management schemes. The first one is a filtering scheme based on simple age-tracking. This scheme can easily avoid 95-98% of associative load queue (LQ) searches using only a few registers. This translates into significant power savings. More importantly, however, this filtering makes our second scheme, delayed memory dependence checking (DMDC), practical. With a small hash table, DMDC completely avoids the need for an associative LQ and relies on indexing-based checking at the commit phase and hence cuts the energy spent on LQ by an average of 95%. At an average of about 0.3%, the performance impact is negligible. When the energy cost of the increased execution time is factored in, the processor still makes net energy savings of about 3-8%, depending on the configuration and the applications
40799553
Function Field Sieve Method for Discrete Logarithms over Finite Fields
We present a function field sieve method for discrete logarithms over finite fields. This method is an analog of the number field sieve method originally developed for factoring integers. It is asymptotically faster than the previously known algorithms when applied to finite fields Fpn, where p6?n.
14192673
PlanetFlow: maintaining accountability for network services
PlanetFlow is a network auditing service that maintains comprehensive, permanent accountability for all traffic generated by PlanetLab services, in accordance with common Internet practice and the terms of the PlanetLab Acceptable Use Policy. PlanetFlow audits the usage of PlanetLab network resources in order to facilitate the resolution of complaints, limit liability, and minimize problematic behavior.The current implementation of PlanetFlow consists of a low overhead flow classifier, an autonomously managed distributed database, and a publicly accessible Web interface. PlanetFlow currently processes up to 4 TB of generated traffic per day, and incurs negligible CPU and storage overhead.
11321375
An overlay data plane for PlanetLab
PlanetLab is a geographically distributed overlay platform designed to support the deployment and evaluation of planetary-scale network services. It currently includes over 500 machines spanning 252 sites and 29 countries, and has supported over 450 research projects. PlanetLab can support large-scale overlays running in slices (i.e., collections of distributed virtual machines). It has significantly lowered the barriers to deploying overlays. The paper describes how to lower them further by introducing a general data plane for overlay networks. Researchers can plug their own control planes into this data plane to run fully functional overlays easily on PlanetLab, and students can use the overlay data plane as a hands-on tool for learning about internetworking concepts. The overlay data plane is the first step in the "Internet-in-a-slice" project, which will let members of the PlanetLab community experiment with virtual Internets running on PlanetLab.
62155376
In VINI veritas: realistic and controlled network experimentation
This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides a high degree of control over network conditions. VINI allows researchers to deploy and evaluate their ideas with real routing software, traffic loads, and network events. To provide researchers flexibility in designing their experiments, VINI supports simultaneous experiments with arbitrary network topologies on a shared physical infrastructure. This paper tackles the following important design question: What set of concepts and techniques facilitate flexible, realistic, and controlled experimentation (e.g., multiple topologies and the ability to tweak routing algorithms) on a fixed physical infrastructure? We first present VINI's high-level design and the challenges of virtualizing a single network. We then present PL-VINI, an implementation of VINI on PlanetLab, running the "Internet In a Slice". Our evaluation of PL-VINI shows that it provides a realistic and controlled environment for evaluating new protocols and services.