Patents by Inventor Ramana B. Rao
Ramana B. Rao has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9081853Abstract: A data processing system for delivering an open profile personalization system based profile data structures that contain one or more interest nodes. The interest nodes include respective sets of targets and qualifiers, where the targets and qualifiers comprise typed-attributes to be used in the filtering of information files for delivery as a result set for the interest nodes. Targets and qualifiers are applied the typed-attributes of available information files to produce the filtered set. Web pages showing the personalized results include tools based on sophisticated content analysis to assist the user in creation and editing of the open profile. A method for presenting and updating the web pages is responsive to the use of these tools.Type: GrantFiled: April 2, 2009Date of Patent: July 14, 2015Assignee: GRAHAM HOLDINGS COMPANYInventors: Ramana B. Rao, Todd A. Cass, Moshe Cohen, Brian L. Neumann, Linda Uyechi
-
Patent number: 8232995Abstract: A node-link structure is laid out in a space with negative curvature, such as the hyperbolic plane. Nearby relationship data are obtained for an element in the structure, indicating information about nearby node-link relationships; then layout data for the element are obtained, based on the nearby relationship data. The layout data indicate the element's position relative to a parent in the negatively curved space. The layout data can indicate a position displacement and an angle displacement between the parent and the element. The nearby relationship data can be obtained by counting grandchildren of the parent for each child of the parent that is in a set that are being or have been laid out. The counts can be used to obtain a radius and an angle for each child in the set, and the radii and angles can be used to obtain the position displacement and angle displacement. The nearby node-link relationships can thus include only relationships among the parent and its children and grandchildren.Type: GrantFiled: July 29, 1998Date of Patent: July 31, 2012Assignee: SAP America, Inc.Inventors: John O. Lamping, Ramana B. Rao, Tichomir G. Tenev
-
Patent number: 8135717Abstract: Words having selected characteristics in a corpus of documents are found using a data processor arranged to execute queries. Memory stores an index structure in which entries in the index structure map words and marks for words having the selected characteristics to locations within documents in the corpus. Entries in the index structure represent words and other entries represent marks with the location information of a marked word. The entries for the marks can be tokens coalesced with prefixes of respective marked words or adjacent. A query processor forms a modified query by adding a mark for a word to the query. The processor executes the modified query.Type: GrantFiled: March 30, 2009Date of Patent: March 13, 2012Assignee: SAP America, Inc.Inventors: Ramana B. Rao, Swapnil Hajela, Nareshkumar Rajkumar
-
Tree visualization system and method based upon a compressed half-plane model of hyperbolic geometry
Patent number: 7620913Abstract: A node-link structure is displayed within a display area having a narrow rectangular shape with an edge along one side acting as a horizon of a hyperbolic space half-plane. Lower level node features that share a parent node feature have centers of area positioned on the display in order along a line parallel with the horizon, with sufficiently similar spacings along an axis perpendicular to the horizon from the region around a parent node feature, and with sufficiently similar spacings in a dimension parallel to the horizon from adjacent node features along the line, that the lower level node features sharing the parent node feature are perceptible as a group of related node features. The half-plane model with compression is used for layout of the node-link data, and the hyperbolic layout data is mapped to a Euclidean space for display.Type: GrantFiled: March 17, 2005Date of Patent: November 17, 2009Assignee: Business Objects AmericasInventors: Yozo Hida, John O. Lamping, Ramana B. Rao -
Publication number: 20090254838Abstract: A data processing system for delivering an open profile personalization system based profile data structures that contain one or more interest nodes. The interest nodes include respective sets of targets and qualifiers, where the targets and qualifiers comprise typed-attributes to be used in the filtering of information files for delivery as a result set for the interest nodes. Targets and qualifiers are applied the typed-attributes of available information files to produce the filtered set. Web pages showing the personalized results include tools based on sophisticated content analysis to assist the user in creation and editing of the open profile. A method for presenting and updating the web pages is responsive to the use of these tools.Type: ApplicationFiled: April 2, 2009Publication date: October 8, 2009Applicant: iCurrent, Inc.Inventors: RAMANA B. RAO, Todd A. Cass, Moshe Cohen, Brian L. Neumann, Linda Uyechi
-
Publication number: 20090193005Abstract: Words having selected characteristics in a corpus of documents are found using a data processor arranged to execute queries. Memory stores an index structure in which entries in the index structure map words and marks for words having the selected characteristics to locations within documents in the corpus. Entries in the index structure represent words and other entries represent marks with the location information of a marked word. The entries for the marks can be tokens coalesced with prefixes of respective marked words or adjacent. A query processor forms a modified query by adding a mark for a word to the query. The processor executes the modified query.Type: ApplicationFiled: March 30, 2009Publication date: July 30, 2009Inventors: Ramana B. Rao, Swapnil Hajela, Nareshkumar Rajkumar
-
Patent number: 7516125Abstract: Words having selected characteristics in a corpus of documents are found using a data processor arranged to execute queries. Memory stores an index structure in which entries in the index structure map words and marks for words having the selected characteristics to locations within documents in the corpus. Entries in the index structure represent words and other entries represent marks with the location information of a marked word. The entries for the marks can be tokens coalesced with prefixes of respective marked words or adjacent. A query processor forms a modified query by adding a mark for a word to the query. The processor executes the modified query.Type: GrantFiled: March 29, 2006Date of Patent: April 7, 2009Assignee: Business Objects AmericasInventors: Ramana B. Rao, Swapnil Hajela, Nareshkumar Rajkumar
-
Tree visualization system and method based upon a compressed half-plane model of hyperbolic geometry
Patent number: 6901555Abstract: A node-link structure is displayed within a display area, having a narrow rectangular shape with an edge along one side acting as a horizon of a hyperbolic space half-plane. Lower level node features that share a parent node feature have centers of area positioned on the display in order along a line parallel with the horizon, with sufficiently similar spacings along an axis perpendicular to the horizon from the region around a parent node feature, and with sufficiently similar spacings in a dimension parallel to the horizon from adjacent node features along the line, that the lower level node features sharing the parent node feature are perceptible as a group of related node features. The half-plane model with compression is used for layout of the node-link data, and the hyperbolic layout data is mapped to a Euclidean space for display.Type: GrantFiled: July 9, 2001Date of Patent: May 31, 2005Assignee: Inxight Software, Inc.Inventors: Yozo Hida, John O. Lamping, Ramana B. Rao -
Patent number: 6654761Abstract: In a series of iterations, each of which automatically traverses a set of elements of a node-link structure, an iteration modifies the part of node-link data defining the structure that is in memory. The modified part of node-link data is more likely to define the set of elements that will be traversed by the next iteration. The iteration can determine whether to remove any of the part of node-link data, and then apply a criterion, such as a navigation history criterion or a least recently traversed criterion, to determine which of the part to remove. The iteration can also determine whether its set of elements includes an element with children that are not defined by the part of node-link data in memory, and can obtain a modified part that defines those children. Each iteration can, for example, prepare and present a representation of the node-link structure.Type: GrantFiled: July 29, 1998Date of Patent: November 25, 2003Assignee: Inxight Software, Inc.Inventors: Tichomir G. Tenev, John O. Lamping, Ramana B. Rao
-
Patent number: 6628312Abstract: A software visualization tool consistent with the present invention integrates OLAP functionality with focus+context based techniques for navigation through and inspection of large multidimensional datasets. Focus+context based navigation techniques are used to increase the clarity and information content provided to the user. The visualization tool supports a number of operations of the data set, including: select-slice, aggregation, promote/demote, repeat-variables, and sort.Type: GrantFiled: December 2, 1998Date of Patent: September 30, 2003Assignee: InXight Software, Inc.Inventors: Ramana B. Rao, Tichomir G. Tenev, Stuart K. Card
-
Patent number: 6581056Abstract: An information retrieval system having a secondary content analysis engine for use on collections of documents. Such collections of documents dynamically arise as a result of queries one or more, possibly distal, information sources. The secondary content analysis engine resides on an Information Access client computer system and allows the user to: 1) iteratively refine queries in more powerful ways than typically supported by relevance feedback or other query modification methods, 2) browse a medium-sized collection of documents (on the order of 1000 items) in more effective ways than is traditionally possible or 3) obtain more information for increasing user understanding of the collection.Type: GrantFiled: June 27, 1996Date of Patent: June 17, 2003Assignee: Xerox CorporationInventor: Ramana B. Rao
-
Tree visualization system and method based upon a compressed half-plane model of hyperbolic geometry
Publication number: 20030007002Abstract: Methods and systems for browsing a node-link structure involves displaying representations of the node-link structure within a display area, which are well suited to utilization of display areas with a narrow rectangular shape. An animated view of the node-link structure is accomplished, which preserves focus and context for the user, and allows scrolling among related nodes. Thus, the node link data is used to present a sequence of representations of the node-link structure on a display. The display has an edge along one side acting as a horizon corresponding for example with the horizon of a hyperbolic space half-plane. The sequence begins with a first representation and ends with the last representation, perceptible as changed continuation of the first representation.Type: ApplicationFiled: July 9, 2001Publication date: January 9, 2003Inventors: Yozo Hida, John O. Lamping, Ramana B. Rao -
Publication number: 20020085002Abstract: A node-link structure is laid out in a space with negative curvature, such as the hyperbolic plane. Nearby relationship data are obtained for an element in the structure, indicating information about nearby node-link relationships; then layout data for the element are obtained, based on the nearby relationship data. The layout data indicate the element's position relative to a parent in the negatively curved space. The layout data can indicate a position displacement and an angle displacement between the parent and the element. The nearby relationship data can be obtained by counting grandchildren of the parent for each child of the parent that is in a set that are being or have been laid out. The counts can be used to obtain a radius and an angle for each child in the set, and the radii and angles can be used to obtain the position displacement and angle displacement. The nearby node-link relationships can thus include only relationships among the parent and its children and grandchildren.Type: ApplicationFiled: July 29, 1998Publication date: July 4, 2002Inventors: JOHN O. LAMPING, RAMANA B. RAO, TICHOMIR G. TENEV
-
Publication number: 20020069221Abstract: A multi-level focus software visualization tool uses a focus+context visualization technique for displaying tables in which multiple table cells may be mapped to a single pixel or a single pixel row. Three or more focus levels may be used instead of the conventional two-focus levels. Accordingly, the whole table presented can be seen on the screen, thus minimizing the mechanical overhead of user navigation and allowing the user to quickly spot trends and outlining data.Type: ApplicationFiled: December 2, 1998Publication date: June 6, 2002Inventors: RAMANA B. RAO, TICHOMIR G. TENEV
-
Patent number: 6377259Abstract: A sequence of steps presents node-link representations on a display. The sequence includes a first step, a last step, and at least one intermediate step. The first step presents a first representation that represents a first node-link structure. The last step presents a last representation that represents a second node-link structure that is a modified version of the first node-link structure. Both node-link structures include a set of shared elements that include a moving element. The moving element is represented by features that have different positions in the first and last representations. Each intermediate step presents an intermediate representation that includes features representing a subset of the shared elements including the moving element, and each element in the subset is also represented by features in the first and last representations. The feature representing the moving element has object constancy through the sequence of steps.Type: GrantFiled: July 29, 1998Date of Patent: April 23, 2002Assignee: Inxight Software, Inc.Inventors: Tichomir G. Tenev, Ramana B. Rao, John O. Lamping
-
Publication number: 20010045952Abstract: A sequence of steps presents node-link representations on a display. The sequence includes a first step, a last step, and at least one intermediate step. The first step presents a first representation that represents a first node-link structure. The last step presents a last representation that represents a second node-link structure that is a modified version of the first node-link structure. Both node-link structures include a set of shared elements that include a moving element. The moving element is represented by features that have different positions in the first and last representations. Each intermediate step presents an intermediate representation that includes features representing a subset of the shared elements including the moving element, and each element in the subset is also represented by features in the first and last representations. The feature representing the moving element has object constancy through the sequence of steps.Type: ApplicationFiled: July 29, 1998Publication date: November 29, 2001Inventors: TICHOMIR G. TENEV, RAMANA B. RAO, JOHN O. LAMPING
-
Publication number: 20010042062Abstract: In a series of iterations, each of which automatically traverses a set of elements of a node-link structure, an iteration modifies the part of node-link data defining the structure that is in memory. The modified part of node-link data is more likely to define the set of elements that will be traversed by the next iteration. The iteration can determine whether to remove any of the part of node-link data, and then apply a criterion, such as a navigation history criterion or a least recently traversed criterion, to determine which of the part to remove. The iteration can also determine whether its set of elements includes an element with children that are not defined by the part of node-link data in memory, and can obtain a modified part that defines those children. Each iteration can, for example, prepare and present a representation of the node-link structure.Type: ApplicationFiled: July 29, 1998Publication date: November 15, 2001Inventors: TICHOMIR G. TENEV, JOHN O. LAMPING, RAMANA B. RAO
-
Patent number: 6300957Abstract: A node-link structure laid out in a space with negative curvature, such as the hyperbolic plane, is mapped to a rendering space, such as the unit disk, beginning from a starting element that has both a parent and a child. Data identifying the starting element are obtained, such as based on user signals. The starting element can be located at a starting position in the unit disk. Then a set of other elements can be mapped, each reachable from the starting element by a path that leads only through elements in the set. Each element's position in the negatively curved space relative to a preceding element on its path and the position of the preceding element in the rendering space can be used to obtain the element's position in the rendering space. The positions in the unit disk can then be used to present a representation of the node-link structure.Type: GrantFiled: July 29, 1998Date of Patent: October 9, 2001Assignee: Inxight Software, Inc.Inventors: Ramana B. Rao, John O. Lamping, Tichomir G. Tenev
-
Patent number: 6108698Abstract: Node-link data defining a graph also include tree defining data. The node-link data with the tree defining data further define a tree within the graph. The tree defining data indicate a set of elements in the graph that are represented in the tree. Each of a subset of elements in the set is represented more than once in the tree. For at least one element in the subset, the tree defining data indicate which representations of the element have descendants in the tree and which representations have none. The tree defining data can, for example, be expansion flags for links in the graph that are in the set of elements, with each links expansion flag indicating whether the link's to-node is expanded or contracted in the tree. In response to each of a series of expand and contract signals from a user, an iteration can modify the tree defining data and use it to present a representation of the graph with the indicated node expanded or contracted as requested.Type: GrantFiled: July 29, 1998Date of Patent: August 22, 2000Assignee: Xerox CorporationInventors: Tichomir G. Tenev, Ramana B. Rao, Harold J. Shinsato, Jr., John O. Lamping
-
Patent number: 6085202Abstract: A method is disclosed for operating a processor-controlled system to produce a table image including graphical display objects in each of the cell regions indirectly representing the data values in an underlying n-dimensional (nD) information data array. Request signal data is received from a input signal source to present the table image in the display area of a display device connected to the processor-controlled system. In response to the request signal data, for each cell in the table image, the source data value and data type of a source data item in the nD data array is obtained, and a cell presentation type is selected using the data type. A graphical display object having at least one display feature representative of the data type of the data value is produced from the cell presentation type, and image definition data defining table image and the graphical display object for each cell is provided to a system display device for display.Type: GrantFiled: March 27, 1998Date of Patent: July 4, 2000Assignee: Xerox CorporationInventors: Ramana B. Rao, Stuart K. Card