29173670
Dynamic Visualization of Spatially Referenced Information
This paper proposes a dynamic visualization approach that combines the graph metaphor and the spatial metaphor for visualizing and navigating spatially referenced data. It provides users with a “marching” scheme for viewing a series of graphs G1, G2, ... Gn that are related to a spatial map. Moreover, It provides three types of navigation mechanisms. This dynamic visualization can facilitate the processes of spatially referenced data mining.
12101937
Hierarchical information visualization using enccon model
This paper describes a new efficient approach for visualizing large hierarchical information. Our technique is based on the connection + enclosure visualization model [1] from which the area division is used for the recursive positioning of nodes, while a node-link diagram is still drawn to present the entire hierarchical structure. We inherit the advantages of Space-Optimized (SO) Tree technique [1] that can enhance the usability of display space by using area division. However, we replace a set of polygons used in SO Tree by a set of rectangles for the area division. This not only decreases the computation cost in calculating geometrical polygons, but also greatly reduces the human perceptual and cognitive loads spent on understanding the underlying hierarchical structure. We use semantic zooming technique to enlarge a particular viewing area and filter out the rest of structure that is less interested. The navigation is accommodated by animation in order to preserve the mental map [2].
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.
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.
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:
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.
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.
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.
34980398
Efficient Checkers for Number-Theoretic Computations
Blum has recently proposed a new approach to the problem of program correctness, the program checker. Here, efficient program checkers are presented for two important number theory problems, integer GCD and modular exponentiation. The former result answers an open problem posed by Blum. The latter result paves the way for more robust cryptographic programs, as modular exponentiation is the basis for several cryptosystems. Taken together, these results lay the foundation for more reliable number-theoretic programs.
4678514
Steering Model-Driven Development of Enterprise Information System Through Responsibilities
OMG proposes the MDA that promotes the ideas of modeling in UML and transforming UML models to code. But UML is not universal for every domain and the direct translation approach of the MDA is not adequate. In this paper, we introduce REST, an idea of using responsibilities as contextual information to instruct machines to generate software systems. First, we give an overview of RESTDA a software development architecture for business based on the concept of REST. Then we describe a domain-specific language Business Models. It helps developers to describe a business from a documentprocessing perspective. We also introduce a rule-based validation of consistency within Business Models. Finally, we describe the transformation mechanism of RESTDA. Our approach provides machines higher intelligence to generate source code for different contexts.
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