专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明授权

US09081853B2 Information display system based on user profile data with assisted and explicit profile modification 有权
标题翻译：基于用户简档数据的信息显示系统，辅助和显式配置文件修改
公开(公告)号：US09081853B2
公开(公告)日：2015-07-14
申请号：US12417489
申请日：2009-04-02
申请人： Ramana B. Rao , Todd A. Cass , Moshe Cohen , Brian L. Neumann , Linda Uyechi
发明人： Ramana B. Rao , Todd A. Cass , Moshe Cohen , Brian L. Neumann , Linda Uyechi
IPC分类号： G06F3/0482 , G06F3/0483 , G06Q10/10 , H04L29/06 , G06F17/30
CPC分类号： G06F17/30702
摘要： 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.
摘要翻译：一种数据处理系统，用于传送包含一个或多个关注节点的基于简档个性化系统的简档数据结构。兴趣节点包括相应的目标集合和限定符集合，其中目标和限定符包括要用于过滤用于传递的信息文件作为关注节点的结果集的类型属性。目标和限定词应用可用信息文件的类型化属性来生成过滤集。显示个性化结果的网页包括基于复杂内容分析的工具，以帮助用户创建和编辑打开的配置文件。用于呈现和更新网页的方法响应于这些工具的使用。

12. 发明授权

US08232995B2 Local relative layout of node-link structures in space with negative curvature 失效
标题翻译：具有负曲率的空间中节点链接结构的局部相对布局
公开(公告)号：US08232995B2
公开(公告)日：2012-07-31
申请号：US09124805
申请日：1998-07-29
申请人： John O. Lamping , Ramana B. Rao , Tichomir G. Tenev
发明人： John O. Lamping , Ramana B. Rao , Tichomir G. Tenev
IPC分类号： G06T11/20 , G06F15/16
CPC分类号： G06T11/206
摘要： 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.
摘要翻译：节点链接结构布置在具有负曲率的空间中，例如双曲面。获取结构中的元素的附近关系数据，指示关于附近节点 - 链接关系的信息; 然后根据附近的关系数据获得元素的布局数据。布局数据表示元素在负弯曲空间中相对于父母的位置。布局数据可以指示位置位移和母体和元素之间的角度位移。附近的关系数据可以通过对正在或已经布置的集合中的父母的每个孩子的父母的孙子计数来获得。可以使用计数来获得组中每个孩子的半径和角度，并且可以使用半径和角度来获得位置位移和角位移。因此，附近的节点链接关系可以仅包括父母与其子孙之间的关系。

13. 发明授权

US06377259B2 Presenting node-link structures with modification 失效
标题翻译：呈现具有修改的节点链接结构
公开(公告)号：US06377259B2
公开(公告)日：2002-04-23
申请号：US09124528
申请日：1998-07-29
申请人： Tichomir G. Tenev , Ramana B. Rao , John O. Lamping
发明人： Tichomir G. Tenev , Ramana B. Rao , John O. Lamping
IPC分类号： G06T1120
CPC分类号： G06T11/206
摘要： 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. The modification can include both deletion and insertion, and the sequence can include a first subsequence in which features are deleted and a second subsequence in which features are inserted. Moving elements can follow paths that are not parallel straight lines. Separate changes can be concurrently animated.
摘要翻译：一系列步骤在显示器上呈现节点链接表示。序列包括第一步骤，最后步骤和至少一个中间步骤。第一步提供表示第一个节点链接结构的第一个表示。最后一步呈现代表作为第一个节点链接结构的修改版本的第二个节点链接结构的最后一个表示。两个节点链接结构都包括一组包含移动元素的共享元素。移动元件由在第一和最后表示中具有不同位置的特征表示。每个中间步骤呈现中间表示，其包括表示包括移动元素的共享元素的子集的特征，并且子集中的每个元素也由第一和最后表示中的特征表示。表示移动元素的特征通过步骤顺序具有对象持续性。修改可以包括删除和插入，并且该序列可以包括删除特征的第一子序列和其中插入特征的第二子序列。移动元件可以遵循不平行直线的路径。单独的更改可以同时动画。

14. 发明授权

US5835905A System for predicting documents relevant to focus documents by spreading activation through network representations of a linked collection of documents 失效
标题翻译：用于通过链接的文档集合的网络表示来传播激活来预测与焦点文档相关的文档的系统
公开(公告)号：US5835905A
公开(公告)日：1998-11-10
申请号：US831807
申请日：1997-04-09
申请人： Peter L. Pirolli , James E. Pitkow , Ramana B. Rao
发明人： Peter L. Pirolli , James E. Pitkow , Ramana B. Rao
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , G06F17/30663 , Y10S707/99933 , Y10S707/99935 , Y10S707/99943
摘要： A system for extracting and analyzing information from a collection of linked documents at a locality to enable categorization of documents and prediction of documents relevant to a focus document. The system obtains and analyzes topology, usage and path information from for a collection at a locality, e.g. a web locality on the world wide web. For categorization, document meta information is represented as document vectors. Predefined criteria is applied to the document vectors to create lists of "similar" types of documents. For relevance prediction, networks representing topology, usage path and text similarity amongst the documents in the collection are created. A spreading activation technique is applied to the networks starting at a focus document to predict the documents relevant to the focus document. Using category and relevance prediction information, tools can be built to enable a user to more efficiently traverse through the collection of linked documents.
摘要翻译：一种用于从一个地点的链接文档集合中提取和分析信息的系统，以便对文档进行分类和与焦点文档相关的文档的预测。该系统从一个地点的集合中获取和分析拓扑，使用和路径信息，例如。万维网上的网站。对于分类，文档元信息被表示为文档向量。将预定义的标准应用于文档向量以创建“类似”类型的文档的列表。对于相关性预测，创建代表集合中的文档之间的拓扑，使用路径和文本相似性的网络。传播激活技术应用于从焦点文档开始的网络，以预测与焦点文档相关的文档。使用类别和相关性预测信息，可以构建工具以使用户能够更有效地遍历链接文档的集合。

15. 发明授权

US5657450A Method and apparatus for time estimation and progress feedback on distal access operations 失效
标题翻译：远程接入操作时间估计和进度反馈的方法和装置
公开(公告)号：US5657450A
公开(公告)日：1997-08-12
申请号：US559384
申请日：1995-11-15
申请人： Ramana B. Rao , Anand Rajaraman
发明人： Ramana B. Rao , Anand Rajaraman
IPC分类号： G06F11/34 , G06F17/30 , H04L29/06 , H04L29/08
CPC分类号： G06F17/30551 , G06F11/34 , G06F17/30386 , H04L29/06 , H04L67/2833 , H04L67/2852 , H04L67/325 , G06F11/3476 , H04L69/329
摘要： A method and apparatus for providing time estimates and progress feedback on long-running distal information source access operations. An intermediate server that is "close" to a client workspace creates time estimates and progress information for operations using models of known information sources and an estimated merge processing cost. The model provides information as to how long various operations take for each of the known information sources during predetermined intervals of the day. During the course of interaction with the known information sources, the intermediary server builds the model. The model will take into account a variety of implicit factors including network distance and operation complexity, and explicit factors including time of day and operation type. The present invention will synthesize the model information for multiple information sources when the query is directed to a plurality of information sources. The estimated merge processing cost is processing overhead associated with merging the results obtained for operations over multiple information sources.
摘要翻译：一种用于提供长时间运行的远程信息源访问操作的时间估计和进度反馈的方法和装置。与客户端工作区“关闭”的中间服务器使用已知信息源模型和估计的合并处理成本创建操作的时间估计和进度信息。该模型提供关于在一天的预定间隔期间各种操作对于每个已知信息源所花费的时间的信息。在与已知信息源的交互过程中，中介服务器构建模型。该模型将考虑到各种隐含因素，包括网络距离和运营复杂性，以及明确的因素，包括时间和操作类型。当查询针对多个信息源时，本发明将合成多个信息源的模型信息。估计的合并处理成本是与针对多个信息源的操作获得的结果合并相关联的处理开销。

16. 发明授权

US5632009A Method and system for producing a table image showing indirect data representations 失效
标题翻译：用于产生显示间接数据表示的表格图像的方法和系统
公开(公告)号：US5632009A
公开(公告)日：1997-05-20
申请号：US611013
申请日：1996-03-05
申请人： Ramana B. Rao , Stuart K. Card
发明人： Ramana B. Rao , Stuart K. Card
IPC分类号： G06F3/023 , G06F17/24 , G06T11/20 , G06F15/00
CPC分类号： G06F3/023 , G06F17/246 , G06T11/206
摘要： A method for operating a processor-controlled system produces 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. The underlying data in the nD data array is thus graphically and indirectly represented in the table image, facilitating the visual inspection and identification of patterns and trends in the data. In addition, for very large conventional table images that do not fit in a standard sized display area, indirect representation of the data occupies substantially less space in the display area, permitting very large tables to be entirely represented graphically in one image. A sophisticated user interface permits a system user to perform table manipulation functions, such as reordering rows and column, sorting rows or columns, and deriving new rows or column, in order to further reveal data trends and patterns in the graphical representations.
摘要翻译：用于操作处理器控制的系统的方法产生包括在每个单元区域中的图形显示对象的表格图像，间隔地表示下层n维（nD）信息数据阵列中的数据值。从输入信号源接收请求信号数据，以将表格图像呈现在连接到处理器控制系统的显示装置的显示区域中。响应于请求信号数据，对于表格图像中的每个单元，获得nD数据阵列中的源数据项的源数据值和数据类型，并且使用该数据类型选择单元显示类型。具有代表数据值的数据类型的至少一个显示特征的图形显示对象从单元格呈现类型产生，并且将定义表格图像的图像定义数据和每个单元的图形显示对象提供给系统显示设备显示。因此，nD数据阵列中的底层数据在表格图中以图形和间接的方式表示，便于目视检查和识别数据中的图案和趋势。此外，对于不适合标准大小的显示区域的非常大的常规表格图像，数据的间接表示在显示区域中占据显着更少的空间，允许在一个图像中以非常大的表格完全表示。复杂的用户界面允许系统用户执行表格操作功能，例如重新排序行和列，排序行或列，以及派生新行或列，以便进一步显示图形表示中的数据趋势和模式。

17. 发明授权

US5619632A Displaying node-link structure with region of greater spacings and peripheral branches 失效
标题翻译：显示具有较大间隔和外围分支的区域的节点链接结构
公开(公告)号：US5619632A
公开(公告)日：1997-04-08
申请号：US306074
申请日：1994-09-14
申请人： John O. Lamping , Ramana B. Rao
发明人： John O. Lamping , Ramana B. Rao
IPC分类号： G06F3/14 , G06F3/048 , G06F7/556 , G06F19/00 , G06T11/20 , G06T11/00
CPC分类号： G06T11/206
摘要： Node-link data defining a node-link structure are used to present a sequence of representations on a display. The last representation in the sequence is perceptible as a changed continuation of the first. Each representation includes bounded node features, each with a center of area and a nearest node spacing that define a mid-spacing circle. All mid-spacing circles together determine an outer convex hull enclosing a total area for the representation. The mid-spacing circles of a subset of more spaced node features determine an inner convex hull enclosing approximately half the total area and enclosing a region in which nearest node spacings are in general perceptibly greater than in another region outside the second convex hull. The node features also represent a peripheral branch with lower level nodes that are not represented by more spaced node features. In the peripheral branch, node features that share a parent have centers of area positioned approximately along an arc with sufficiently similar spacings from the center of area of the parent node feature and from adjacent node features that they are perceptible as a group of related node features. The inner convex hulls of the first and last representations include subsets of node features representing different sets of nodes. The sequence can produce a perception that one node feature's nearest node spacing increases while another's decreases. The representations can be presented by a series of iterations, and can be presented at animation speeds to produce a perception of continuously moving node features.
摘要翻译：定义节点链接结构的节点链接数据用于在显示器上呈现一系列表示。序列中的最后一个表现可以看作是第一个变化的延续。每个表示包括有界节点特征，每个具有区域的中心和定义中间间隔的最近的节点间隔。所有中间间隔的圆圈一起确定了外表面的外凸面，其中包含总面积。更多间隔节点特征的子集的中间间隔圆环确定包围大约一半总面积的内凸包，并且包围一个区域，其中最靠近的节点间距通常比第二凸包外的另一个区域更明显。节点特征还表示具有较低级别节点的外围分支，其不由更多间隔的节点特征表示。在外围分支中，共享一个父节点的节点特征具有大致沿弧线定位的中心，其具有与父节点特征的区域中心和相邻节点特征之间具有足够相似的间隔，它们被认为是一组相关节点特征。第一个和最后一个表示的内部凸包包括表示不同节点集合的节点特征的子集。该序列可以产生一个节点特征的最近节点间隔增加而另一个节点特征减小的感知。这些表示可以通过一系列迭代来呈现，并且可以以动画速度呈现以产生连续移动的节点特征的感知。

18. 发明授权

US5590250A Layout of node-link structures in space with negative curvature 失效
标题翻译：具有负曲率的空间节点链接结构的布局
公开(公告)号：US5590250A
公开(公告)日：1996-12-31
申请号：US306043
申请日：1994-09-14
申请人： John O. Lamping , Ramana B. Rao
发明人： John O. Lamping , Ramana B. Rao
IPC分类号： G06F3/14 , G06F3/048 , G06F9/44 , G06F19/00 , G06N5/04 , G06T11/20 , G06T11/60 , G06T11/80 , G06T1/40
CPC分类号： G06T11/206
摘要： Layout data indicate positions in a negatively curved layout space for nodes in a hierarchical branch of a node-link structure. The layout data indicate a parent position for parent nodes and, for children that share a parent node, child positions approximately along a circle in the layout space with the parent position approximately at the circle's center. Adjacent child positions are separated by approximately a base spacing. The radii of circles within the branch together approximate a function that increases slowly with number of child nodes such that the radii and spacings along circles are all approximately uniform within the branch. The layout data can be obtained from data defining the node-link structure. The layout data can be used to perform mappings, each obtaining positions for a subset of the nodes. The layout data can be used to present a first representation of the node-link structure on a display. In response to a user signal indicating a change from a first display position near a first feature to a second display position, a second representation can be presented that is perceptible as a changed continuation of the first. The second representation includes, near the second display position, a second feature representing the same part of the node-link structure as the first feature. The second representation can be obtained by a transformation of the layout space, which can be a discrete approximation of a hyperbolic plane.
摘要翻译：布局数据表示节点 - 链接结构的分层分支中节点的负弯曲布局空间中的位置。布局数据指示父节点的父位置，并且对于共享父节点的子节点，子空间大致沿着布局空间中的圆形位置，父位置大约在圆的中心。相邻的小孩位置大致分开一个基座间距。分支中的圆的半径一起近似一个随着子节点数的增加而缓慢增加的函数，使得圆中的半径和间距在分支内大致均匀。布局数据可以从定义节点链接结构的数据获得。布局数据可用于执行映射，每个获取节点的子集的位置。布局数据可用于在显示器上呈现节点链接结构的第一表示。响应于指示从第一特征附近的第一显示位置到第二显示位置的改变的用户信号，可以呈现可被认为是第一特征的改变的继续的第二表示。第二表示包括在第二显示位置附近的表示与第一特征的节点链接结构的相同部分的第二特征。可以通过布局空间的变换获得第二表示，其可以是双曲面的离散近似。

19. 发明申请

US20090193005A1 Processor for Fast Contextual Matching 有权
标题翻译：快速上下文匹配的处理器
公开(公告)号：US20090193005A1
公开(公告)日：2009-07-30
申请号：US12414581
申请日：2009-03-30
申请人： Ramana B. Rao , Swapnil Hajela , Nareshkumar Rajkumar
发明人： Ramana B. Rao , Swapnil Hajela , Nareshkumar Rajkumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30666 , G06F17/30622 , Y10S707/99933
摘要： 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.
摘要翻译：使用被布置为执行查询的数据处理器来找到在文档语料库中具有选择特征的词。存储器存储索引结构，其中索引结构中的条目将具有所选特征的单词和标记映射到语料库中的文档内的位置。索引结构中的条目表示单词，其他条目表示具有标记词的位置信息的标记。标记的条目可以是标记与各个标记的词的前缀或相邻的令牌。查询处理器通过向查询添加单词的标记来形成修改的查询。处理器执行修改后的查询。

20. 发明授权

US06654761B2 Controlling which part of data defining a node-link structure is in memory 失效
标题翻译：控制定义节点链接结构的数据的哪一部分在内存中
公开(公告)号：US06654761B2
公开(公告)日：2003-11-25
申请号：US09124474
申请日：1998-07-29
申请人： Tichomir G. Tenev , John O. Lamping , Ramana B. Rao
发明人： Tichomir G. Tenev , John O. Lamping , Ramana B. Rao
IPC分类号： G06F700
CPC分类号： G06F17/30958 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： 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.
摘要翻译：在一系列迭代中，每个迭代自动遍历节点链接结构的一组元素，迭代修改定义存储器中的结构的节点链接数据的一部分。节点链接数据的修改部分更有可能定义将由下一次迭代遍历的元素集合。迭代可以确定是否删除节点链接数据的任何部分，然后应用诸如导航历史标准或最近最少遍历的标准之类的标准来确定要删除哪个部分。迭代还可以确定它的元素集合是否包含一个没有由内存中的节点链接数据部分定义的子节点的元素，并且可以获得定义这些子节点的修改部分。例如，每个迭代可以准备并呈现节点链接结构的表示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式