11321138
Attributed graph visualization of collaborative workspaces
Collaborative workspaces are becoming increasingly commonplace, particularly in large, distributed organizations where virtual teams formed in order to jointly carry out collaborative project work. Typical collaborative workspaces often have a large number of objects and relations as well as their associated domain-specific attributes. The visualization of these domain-specific attributes is the challenge of this research. This paper presents a new approach for visualizing the attributes of objects and relations in collaborative workspaces. This new visualization provides not only a structural view of the collaborative workspaces but also a graphical view of a variety of domain-specific attributes associated with collaborative objects and relations. This paper also describes a framework for the attributed visualization of collaborative workspaces.
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.
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.
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].
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:
57256946
Slackened Memory Dependence Enforcement: Combining Opportunistic Forwarding with Decoupled Verification
An efficient mechanism to track and enforce memory dependences is crucial to an out-of-order microprocessor. The conventional approach of using cross-checked load queue and store queue, while very effective in earlier processor incarnations, suffers from scalability problems in modern high-frequency designs that rely on buffering many in-flight instructions to exploit instruction-level parallelism. In this paper, we make a case for a very different approach to dynamic memory disambiguation. We move away from the conventional exact disambiguation strategy and adopt an opportunistic method: we allow loads and stores to access an L0 cache as they are issued out of program order, hoping that with such a laissez-faire approach, most loads actually obtain the right value. To guarantee correctness, they execute a second time in program order to access the nonspeculative L1 cache. A discrepancy between the two executions triggers a replay. Such a design completely eliminates the necessity of real-time violation detection and thus avoids the conventional approach's complexity and the associated scalability issue. We show that even a simplistic design can provide similar performance level achieved with a conventional queue-based approach with optimisticallysized queues. When simple, optional optimizations are applied, the performance level is close to that achieved with ideally-sized queues.
3067574
Steering model-driven evolution by responsibilities
The model-driven development approach provides an alternative solution to human-centered software evolution. In this paper, we propose using the concept of responsibility to define model mapping where responsibility represents a high-level description of "tasks to be accomplished by something". Based on this concept, we have created RESTDA, a development architecture for building enterprise information systems. In RESTDA, a software system is defined by three world levels and two views. The three world levels represent different levels of abstraction within the software system. The two views separate the structural concepts and behavioral concepts of each world level. RESTDA applies a two-phase generation. The first phase generates an intermediate model from high-level models. The second phase generates code from the intermediate model. The automatic transformation promises that any change to the business requirements results in corresponding code generation. The intermediate model separates changes to the underlying implementation technology from the top-most level.
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.
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.
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