7673579
Managing personal and group collections of information
The internet revolution has dramatically increased the amount of information available to users. Various tools such as search engines have been developed to help users find the information they need from this vast repository. Users often also need tools to help manipulate the growing amount of useful information they have discovered. Current tools available for this purpose are typically local components of web browsers designed to manage URL bookmarks. They provide limited functionalities to handle high information complexities.
12280706
A distributed multi-agent system for collaborative information management and sharing
In this paper, we present DIAMS, a system of distributed, collaborative agents to help users access, manage, share and exchange information. A DIAMS personal agent helps its owner find information most relevant to current needs. It provides tools and utilities for users to manage their information repositories with dynamic organization and virtual views. Flexible hierarchical display is integrated with indexed query search to support effective information access. Automatic indexing methods are employed to support user queries and communication between agents.
36321582
Enacting object-oriented methods by a process environment
Abstract This paper describes modeling and enactment of two object-oriented methods, namely the OMT method and the Booch method, using the concurrent software process language (CSPL). CSPL is a process-centered environment using Ada95-like syntax to model a method as a process program which is then compiled to C-shell executing in UNIX. A method can thus be enacted (executed) using this approach. Experiences of the approach are depicted. It is demonstrated that CSPL is feasible and appropriate for modeling and enacting methods, including object-oriented methods. Additionally, partial CSPL program modeling the Booch method is included in the Appendix.
206057505
Algorithmic Graph Embeddings
The complexity of embedding a graph into a variety of topological surfaces is investigated. A new data structure for graph embeddings is introduced and shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph G and an integer k, construct a genus k embedding for the graph G” for a large range of the integers k and for a large class of graphs.
119479
Visualizing and discovering web navigational patterns
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analysis is necessary to discover useful patterns and understand the navigational behaviour of web site visitors, whether to improve web site structures, provide intelligent on-line tools or offer support to human decision makers. Moreover, interactive investigation of web access logs is often desired since it allows ad hoc discovery and examination of patterns not a priori known. Various visualization tools have been provided for this task but they often lack the functionality to conveniently generate new patterns. In this paper we propose a visualization tool to visualize web graphs, representations of web structure overlaid with information and pattern tiers. We also propose a web graph algebra to manipulate and combine web graphs and their layers in order to discover new patterns in an ad hoc manner.
16627993
Increased display size and resolution improve task performance in Information-Rich Virtual Environments
Physically large-size high-resolution displays have been widely applied in various fields. There is a lack of research, however, that demonstrates empirically how users benefit from the increased size and resolution afforded by emerging technologies. We designed a controlled experiment to evaluate the individual and combined effects of display size and resolution on task performance in an Information-Rich Virtual Environment (IRVE). We also explored how a wayfinding aid would facilitate spatial information acquisition and mental map construction when users worked with various displays. We found that users were most effective at performing IRVE search and comparison tasks on large high-resolution displays. In addition, users working with large displays became less reliant on wayfinding aids to form spatial knowledge. We discuss the impact of these results on the design and presentation of IRVEs, the choice of displays for particular applications, and future work to extend our findings.
15777163
Limit points for average genus II. 2-Connected non-simplicial graphs
Abstract In part (I) of this paper, it was proved that there are no limit points for the set of values of average genus of 2-connected simplicial graphs and of 3-connected graphs. The need for such restrictions is now demonstrated by showing that infinitely many real numbers are limit points of values of average genus for 2-connected non-simplicial graphs. A systematic method for constructing such limit points is presented, and it is proved that this method is essentially the only way to construct limit points of values of average genus for “homeomorphically nested” 2-connected graphs.