公开(公告)号：BR9901366A

公开(公告)日：2000-09-12

申请号：BR9901366

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PITKOW JAMES E ,  PIROLLI PETER L T ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F12/00 ,  G06F17/30

Abstract: A method for displaying in a coherent manner the changes over time of a web site's structure, usage, and content is disclosed. Time tubes are generated by a method of displaying a related series of graphs. Time tubes illustrate changes in a graph that undergoes one or more transformations from one state to another. The transformations are displayed using the length of the cylindrical tube, filling the length of the time tube with planar slices which represent the data at various stages of the transformations. Time tubes may encode several dimensions of the transformations simultaneously by altering the representation of size, color, and layout among the planar slices. Temporal transformations occur when web pages are added or deleted over time. Value-based transformations include node colors, which may be used to encode a specific page's usage parameter. Spatial transformations include the scaling of physical dimension as graphs expand or contract in size. The states of a graph at various times are represented as a series of related graphs. In a preferred embodiment, an inventory of all existing nodes is performed so as to generate a list of all nodes that have existed at any time. This inventory is used to produce a layout template in which each unique node is assigned a unique layout position. To produce each planar slice, the specific nodes which exist in the slice are placed at their respective positions assigned in the layout template. In another aspect, corresponding nodes in planar slices are linked, such as with translucent streamlines, in response to a user selecting a node in a planar slice by placing his cursor over the selected node, or to show clustering of two or more nodes in one planar slice into a single node in an adjacent planar slice.

公开(公告)号：BR9901365A

公开(公告)日：2000-03-28

申请号：BR9901365

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PIROLLI PETER L T ,  PITKOW JAMES E ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F17/30

Abstract: Methods for displaying results of a spreading activation algorithm and for defining an activation input vector for the spreading activation algorithm are disclosed. A planar disk tree is used to represent the generalized graph structure being modeled in a spreading activation algorithm. Activation bars on some or all nodes of the planar disk tree in the dimension perpendicular to the disk tree encode the final activation level resulting at the end of N iterations of the spreading activation algorithm. The number of nodes for which activation bars are displayed may be a predetermined number, a predetermine fraction of all nodes, or a determined by a predetermined activation level threshold. The final activation levels resulting from activation spread through more than one flow network corresponding to the same generalized graph are displayed as color encoded segments on the activation bars. Content, usage, topology, or recommendation flow networks may be used for spreading activation. The difference between spreading activation through different flow networks corresponding to the same generalized graph may be displayed by subtracting the resulting activation patterns from each network and displaying the difference. The spreading activation input vector is determined by continually measuring the dwell time that the user's cursor spends on a displayed node. Activation vectors at various intermediate steps of the N-step spreading activation algorithm are color encoded onto nodes of disk trees within time tubes. The activation input vector and the activation vectors resulting from all N steps are displayed in a time tube having N+1 planar disk trees. Alternatively, a periodic subset of all N activation vectors are displayed, or a subset showing planar disk trees representing large changes in activation levels or phase shifts are displayed while planar disk trees representing smaller changes in activation levels are not displayed.

公开(公告)号：BR9901367A

公开(公告)日：2000-05-09

申请号：BR9901367

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： CHI ED H ,  PIROLLI PETER L T ,  PITKOW JAMES E ,  GOSSWELLER RICH ,  MACKINLAY JOCK D ,  CARD STUART K

IPC: G06F12/00 ,  G06F17/30

Abstract: A method for generating a tree structure representation of a generalized graph structure for display includes the more important links in the representation. Usage parameters are referenced in generating the tree structure from the generalized graph structure. Frequency, recency, spacing of accesses, and path information are exemplary types of usage parameters. A breadth-first or depth-first traversal of the graph references usage parameters associated with each node or link. The usage parameters which are associated with each node are referenced in order to determine the visitation order. The visitation order is determined by visiting the highest used nodes or links first. A method of displaying the tree structure references the usage parameters to determine the positioning of the nodes in the layout of the tree structure. In a preferred embodiment, the root node is positioned in the center of the layout. In one example, sibling nodes are spread out on links which emanate radially about their parent. The highest-used sibling nodes can be placed farthest apart from each other so as to achieve optimal separation so that they have the most growth space. The lowest-used nodes are then placed in the remaining space between the high-usage nodes. In another example, sibling nodes are positioned at the same radius from the root node. Each leaf node in the hierarchy is assigned the same amount of angular space. The layout angle of each node is a function of the ranking of the node's usage parameter relative to its siblings. Derived usage parameters such as need probability, cocitation clustering, or functions of both node and link usages can alternatively be referenced.

公开(公告)号：JP2000029660A

公开(公告)日：2000-01-28

申请号：JP11096999

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PIROLLI PETER L T ,  PITKOW JAMES E ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F17/30 ,  G06F3/14 ,  G06F13/00

Abstract: PROBLEM TO BE SOLVED: To display the result of activated spread algorithm by displaying activated bar on some or all nodes of a plane circular tree in its vertical dimension and encoding the final activation level obtained at the end of N-time iteration of the activated spread algorithm. SOLUTION: The circular tree is displayed in plane (S2701). Then the input vector C of the activated spread algorithm is determined (S2702). Then an activated spread vector A is calculated iteratively as to N-time iteration (S2703). In this case, the activated bar in the dimension perpendicular to the circular tree encodes the final activation level obtained at the end of the N-time iteration of the activated spread algorithm. Then the final activated vector A(N) is displayed perpendicularly to the plane of the circular tree (S2704). Then it is judged whether or not there is input for the activated spread algorithm (S2705). When there is further input, a new activated input vector C is used (S2750).

公开(公告)号：JPH11327993A

公开(公告)日：1999-11-30

申请号：JP11094099

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： CHI ED H ,  PIROLLI PETER L T ,  PITKOW JAMES E ,  GOSSWELLER RICH ,  MACKINLAY JOCK D ,  CARD STUART K

IPC: G06F12/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To provide a method for generating and displaying the tree structure expression of a generalized graph structure. SOLUTION: A using degree parameter is referred to so as to generate a tree structure from the generalized graph structure. As the examples of the using degree parameter, there are a frequency, newness, the interval of access and route information, etc. In the width preferential or depth preferential patrol of a graph, the using degree parameters relating to respective nodes or links are referred to. The using degree parameters relating to the respective nodes are referred to so as to decide the order of visiting them. The visiting order is decided by visiting the node or link of a highest using degree first (S903). In a tree structure display method, the using degree parameter is referred to and the arrangement of the nodes in the layout of the tree structure is decided.

公开(公告)号：JPH11327994A

公开(公告)日：1999-11-30

申请号：JP11095899

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PITKOW JAMES E ,  PIROLLI PETER L T ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F12/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To make it possible to systematically display temporal variations of the structure and contents of a web site by generating and displaying a series of plane slices corresponding to a series of graphs. SOLUTION: A general computer 100 is equipped with at least a microprocessor 102, a display monitor 104, and a cursor controller 105. The general computer 100 may be equipped with a random access memory 107, a hard disk 103, a ROM memory 108, a keyboard 106, a modem 110, and a graphic coprocessor 109. An inventory of all unique nodes in a series of relative graphs is generated and unique layout positions in a plane template are assigned to respective unique nodes. Further, a series of plane slices corresponding to the series of relative graphs are generated by arranging the unique layout positions in the plane template at the lane slices corresponding to the respective graphs and displayed at the same time.