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

1. 发明授权

US08161044B2 Faceted web searches of user preferred categories throughout one or more taxonomies 有权
标题翻译：通过一个或多个分类法对用户首选类别进行多方面网页搜索
公开(公告)号：US08161044B2
公开(公告)日：2012-04-17
申请号：US11258130
申请日：2005-10-26
申请人： Jason M. Blackwell , Claude J. Elie , Danny R. Hager , Clare T. Kibler
发明人： Jason M. Blackwell , Claude J. Elie , Danny R. Hager , Clare T. Kibler
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： A system and method of web searching is provided. The method comprises defining one or more user preferred categories and conducting a search within the one or more user preferred categories based upon search criteria by comparing the search criteria to content information within each of the one or more user preferred categories. The method further includes displaying search results associated with each of the preferred categories which have matching criteria based on the conducted search.
摘要翻译：提供了一种网络搜索的系统和方法。该方法包括通过将搜索标准与一个或多个用户优选类别中的每一个内的内容信息进行比较，基于搜索准则来定义一个或多个用户优选类别并在一个或多个用户优选类别内进行搜索。该方法还包括显示与基于进行的搜索具有匹配标准的每个优选类别相关联的搜索结果。

2. 发明授权

US07962519B2 Method, system, and program product for building hierarchies 失效
标题翻译：用于构建层次结构的方法，系统和程序产品
公开(公告)号：US07962519B2
公开(公告)日：2011-06-14
申请号：US11834266
申请日：2007-08-06
申请人： Clare T. Kibler , Jason M. Blackwell , Robert A. Morgan
发明人： Clare T. Kibler , Jason M. Blackwell , Robert A. Morgan
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： In general, the present invention allows one to define both a hierarchy with one or more peers and no parents (e.g., one or more blades and no chassis) and a hierarchy with one or more peers and a parent (e.g., one or more blades and a chassis) as long as the relationships are valid. Rather than relying on a user's a priori knowledge of the hierarchical relationships, this invention allows a user to select any starting point and then drive in any desired direction. Despite this flexibility, the invention still allows rules for permissible relationships to be enforced. Thus, driving is limited by the relationships extant in the underlying data, or the known combining rules.
摘要翻译：通常，本发明允许将一个层级与一个或多个对等体以及没有父母（例如，一个或多个刀片而不是机架）以及具有一个或多个对等体和父（例如，一个或多个刀片和底盘），只要关系是有效的。本发明不是依赖于用户对层级关系的先验知识，而是允许用户选择任何起始点，然后以任何所需的方向驱动。尽管有这种灵活性，本发明仍然允许执行允许关系的规则。因此，驾驶受底层数据中存在的关系或已知的组合规则的限制。

3. 发明申请

US20090043810A1 METHOD, SYSTEM, AND PROGRAM PRODUCT FOR BUILDING HIERARCHIES 失效
标题翻译：用于建筑物分类的方法，系统和程序产品
公开(公告)号：US20090043810A1
公开(公告)日：2009-02-12
申请号：US11834266
申请日：2007-08-06
申请人： Clare T. Kibler , Jason M. Blackwell , Robert A. Morgan
发明人： Clare T. Kibler , Jason M. Blackwell , Robert A. Morgan
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： In general, the present invention allows one to define both a hierarchy with one or more peers and no parents (e.g., one or more blades and no chassis) and a hierarchy with one or more peers and a parent (e.g., one or more blades and a chassis) as long as the relationships are valid. Rather than relying on a user's a priori knowledge of the hierarchical relationships, this invention allows a user to select any starting point and then drive in any desired direction. Despite this flexibility, the invention still allows rules for permissible relationships to be enforced. Thus, driving is limited by the relationships extant in the underlying data, or the known combining rules.
摘要翻译：通常，本发明允许将一个层级与一个或多个对等体以及没有父母（例如，一个或多个刀片而不是机架）以及具有一个或多个对等体和父（例如，一个或多个刀片和底盘），只要关系是有效的。本发明不是依赖于用户对层级关系的先验知识，而是允许用户选择任何起始点，然后以任何所需的方向驱动。尽管有这种灵活性，本发明仍然允许执行允许关系的规则。因此，驾驶受底层数据中存在的关系或已知的组合规则的限制。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式