-
1.发明授权System and method and computer program product for ranking logical directories 失效用于对逻辑目录进行排序的系统和方法以及计算机程序产品公开(公告)号：US07464076B2
公开(公告)日：2008-12-09
申请号：US10847143
申请日：2004-05-15
IPC分类号： G06F17/30
CPC分类号： G06F17/30958 , G06F17/30864 , Y10S707/99933 , Y10S707/99934
摘要： A logical directory ranking system ranks documents or web pages utilizing logical directories. The present system groups together compound documents as a single information node with one or more leaves, constructing a logical directory graph. URLs can be grouped at a level of granularity below an individual directory. For example, the URLs may be grouped together on the basis of hostname, domain, or any level of the hierarchy of the URLs. Edges in the logical directory graph are formed by links between the logical directories. Edges have weights corresponding to the number of links between logical directories. Nodes have weights corresponding to the number of web pages or leaves represented by a node. A ranking level is determined for each node as a function of the node weight and the edge weight. The ranking level is then applied to each URL that the node represents.
摘要翻译： 逻辑目录排名系统使用逻辑目录对文档或网页进行排序。 本系统将复合文档分组为具有一个或多个叶子的单个信息节点，构建逻辑目录图。 URL可以按照单个目录下的粒度级别进行分组。 例如，可以根据主机名，域或URL的层次结构的任何级别将URL分组在一起。 逻辑目录图中的边缘由逻辑目录之间的链接形成。 边缘具有与逻辑目录之间的链接数相对应的权重。 节点具有对应于由节点表示的网页或叶的数量的权重。 根据节点权重和边缘权重，确定每个节点的排名级别。 然后将排名级别应用于节点所表示的每个URL。
-
公开(公告)号：US07251654B2
公开(公告)日：2007-07-31
申请号：US10847164
申请日：2004-05-15
CPC分类号： G06F17/30864 , G06F17/30613 , Y10S707/99937 , Y10S707/99945
摘要： A dangling web page processing system ranks dangling web pages on the web. The system ranks dangling web pages of high quality that cannot be crawled by a crawler. In addition, the system adjusts ranks to penalize dangling web pages that return errors when links on the dangling web pages are crawled. By providing a rank for dangling web pages, the present system allows the concentration of crawling resources on those dangling web pages that have the highest rank in the uncrawled region. The system operates locally to the dangling web pages, providing efficient determination of ranks for the dangling web pages. The system explicitly discriminates against web pages on the basis of whether they point to penalty pages, i.e., pages that return an error when a link is followed. By incorporating more fine-grained information such as this into ranking, the system can improve the quality of individual search results and better manage resources for crawling.
摘要翻译： 悬挂的网页处理系统在网络上排列悬挂的网页。 该系统排列了无法爬行的高质量的悬挂网页。 此外，系统会调整排名，以惩罚悬挂在网页上的链接被抓取时返回错误的悬挂网页。 通过提供悬挂网页的排名，目前的系统允许集中爬行资源在那些悬而未决的区域中具有最高排名的悬挂网页。 系统在本地对悬挂的网页进行操作，为悬挂的网页提供有效的排名。 该系统基于是否指向惩罚页面，即在遵循链接时返回错误的页面，明确区分网页。 通过将诸如此类的细粒度信息纳入排名，系统可以提高个人搜索结果的质量，更好地管理抓取资源。
-
公开(公告)号：US20050256860A1
公开(公告)日：2005-11-17
申请号：US10847164
申请日：2004-05-15
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/30613 , Y10S707/99937 , Y10S707/99945
摘要： A dangling web page processing system ranks dangling web pages on the web. The system ranks dangling web pages of high quality that cannot be crawled by a crawler. In addition, the system adjusts ranks to penalize dangling web pages that return errors when links on the dangling web pages are crawled. By providing a rank for dangling web pages, the present system allows the concentration of crawling resources on those dangling web pages that have the highest rank in the uncrawled region. The system operates locally to the dangling web pages, providing efficient determination of ranks for the dangling web pages. The system explicitly discriminates against web pages on the basis of whether they point to penalty pages, i.e., pages that return an error when a link is followed. By incorporating more fine-grained information such as this into ranking, the system can improve the quality of individual search results and better manage resources for crawling.
摘要翻译： 悬挂的网页处理系统在网络上排列悬挂的网页。 该系统排列了无法爬行的高质量的悬挂网页。 此外，系统会调整排名，以惩罚悬挂在网页上的链接被抓取时返回错误的悬挂网页。 通过提供悬挂网页的排名，目前的系统允许集中爬行资源在那些悬而未决的区域中具有最高排名的悬挂网页。 系统在本地对悬挂的网页进行操作，为悬挂的网页提供有效的排名。 该系统基于是否指向惩罚页面，即在遵循链接时返回错误的页面，明确区分网页。 通过将诸如此类的细粒度信息纳入排名，系统可以提高个人搜索结果的质量，更好地管理抓取资源。
-
4.发明授权System, method and service for ranking search results using a modular scoring system 有权使用模块化评分系统对搜索结果进行排名的系统，方法和服务公开(公告)号：US07257577B2
公开(公告)日：2007-08-14
申请号：US10841391
申请日：2004-05-07
申请人： Ronald Fagin , Kevin Snow McCurley , Jasmine Novak , Shanmugasundram Ravikumar , Dandapani Sivakumar , John Anthony Tomlin , David Paul Williamson
发明人： Ronald Fagin , Kevin Snow McCurley , Jasmine Novak , Shanmugasundram Ravikumar , Dandapani Sivakumar , John Anthony Tomlin , David Paul Williamson
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99945
摘要： A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.
摘要翻译： 使用秩聚合的模块评分系统将搜索结果合并到使用许多不同文档特征的结果的有序列表中。 本系统的排名功能可以根据特定语料库或诸如内部网的用户集合的需要进行定制。 排名聚合独立于不同因素之间的底层分数分布，可以应用于合并任何一组排名函数。 排名聚合具有将许多不同启发式因素的影响结合在一起的优势，可以为查询产生高质量的结果。 模块化评分系统结合诸如不分级，页面排序，URL长度，与内部网的根服务器的接近度等因素，在严格遵循单个排序的网页上形成单一排序，而且还在集体智慧之间进行调解 个人启发式
-
5.发明授权Method and system for distributed autonomous maintenance of bidirectional hyperlink metadata on the web and similar hypermedia repository 失效用于分布式自主维护网络上的双向超链接元数据的方法和系统和类似的超媒体存储库公开(公告)号：US07266762B1
公开(公告)日：2007-09-04
申请号：US09523639
申请日：2000-03-10
申请人： Soumen Chakrabarti , Byron Edward Dom , David Andrew Gibson , Kevin Snow McCurley , Martin Henk van den Berg
发明人： Soumen Chakrabarti , Byron Edward Dom , David Andrew Gibson , Kevin Snow McCurley , Martin Henk van den Berg
CPC分类号： G06F17/3089 , Y10S707/99931 , Y10S707/99933 , Y10S707/99934 , Y10S707/99953
摘要： A Web server stores a table of Web page inlinks. When a Web page is accessed and a user wants to access other pages related to the accessed page, the user requests the table of inlinks, and from it generates a list of sibling links to the accessed page, the sibling links being outlinks of one or more of the inlinks in the table.
摘要翻译： Web服务器存储网页表的链接。 当访问网页并且用户想要访问与所访问的页面相关的其他页面时，用户请求链接表，并且从其生成到所访问的页面的兄弟链接的列表，兄弟链接是一个或多个 更多的在表中的链接。
-
6.发明申请System, method, and service for finding an optimal collection of paths among a plurality of paths between two nodes in a complex network 审中-公开用于在复杂网络中的两个节点之间的多个路径之间找到最佳路径集合的系统，方法和服务公开(公告)号：US20050243736A1
公开(公告)日：2005-11-03
申请号：US10827784
申请日：2004-04-19
CPC分类号： G06Q10/04
摘要： An optimal path selection system extracts a connection subgraph in real time from an undirected, edge-weighted graph such as a social network that best captures the connections between two nodes of the graph. The system models the undirected, edge-weighted graph as an electrical circuit and solves for a relationship between two nodes in the undirected edge-weighted graph based on electrical analogues in the electric graph model. The system optionally accelerates the computations to produce approximate, high-quality connection subgraphs in real time on very large (disk resident) graphs. The connection subgraph is constrained to the integer budget that comprises a first node, a second node and a collection of paths from the first node to the second node that maximizes a “goodness” function g(H). The goodness function g(H) is tailored to capture salient aspects of a relationship between the first node and the second node.
摘要翻译： 最佳路径选择系统从无向边缘加权图形实时提取连接子图，例如最佳地捕获图形的两个节点之间的连接的社交网络。 该系统将无向边缘加权图形建模为电路，并基于电图模型中的电子类似结果解决了无向边加权图中两个节点之间的关系。 该系统可选地加速计算，以在非常大的（磁盘驻留）图表上实时生成近似，高质量的连接子图。 连接子图被约束到整数预算，该整数预算包括第一节点，第二节点和从第一节点到第二节点的路径集合，其使“好”函数g（H）最大化。 为了捕获第一节点和第二节点之间的关系的显着方面，定义了善意函数g（H）。
-
7.发明授权System for encrypting broadcast programs in the presence of compromised receiver devices 失效在存在受损的接收机设备的情况下加密广播节目的系统
公开(公告)号：US6118873A
公开(公告)日：2000-09-12
申请号：US065938
申请日：1998-04-24
IPC分类号： H04H20/00 , H04L9/00 , H04L9/08 , H04N7/16 , H04N7/167 , H04N21/258 , H04N21/266
CPC分类号： H04N7/163 , H04L9/0861 , H04L9/14 , H04N21/2585 , H04N21/26613 , H04N7/1675 , G11B20/00362 , H04L2209/34 , H04L2209/606
摘要： A digital broadcast system provides secure transmission of digital programs to in-home digital devices even when some of the devices are unauthorized. A matrix of device keys S.sub.j,i is provided, wherein "i" is a key index variable indicating a position in a key dimension of the matrix and "j" is a sets index variable indicating a position in a sets dimension of the matrix. Each in-home device is assigned plural device keys from the matrix, with one and only one device key for each key index variable "i" being assigned to a device. To generate a session key for a broadcast program, session numbers x.sub.i are encrypted with all device keys S.sub.j,i to generate a session key block which is decrypted by the in-home devices and used to generate a session key for decrypting the program. If one of the devices is a compromised device, at least one of the session numbers is a dummy number that is encrypted and decrypted by the corresponding compromised device key, with the resulting session key being useless in decrypting the program.
摘要翻译： 数字广播系统提供数字节目到家庭内数字设备的安全传输，即使某些设备是未授权的。 提供了设备密钥Sj，i的矩阵，其中“i”是指示矩阵的关键维度中的位置的键索引变量，“j”是指示矩阵的集合维度中的位置的集合索引变量。 每个家庭内设备从矩阵中分配多个设备密钥，每个密钥索引变量“i”被分配给设备的仅一个设备密钥。 为了生成用于广播节目的会话密钥，会话号码xi用所有设备密钥Sj，i进行加密，以生成由家庭内设备解密并用于生成用于解密程序的会话密钥的会话密钥块。 如果其中一个设备是受损设备，则会话号码中的至少一个是被相应的受损设备密钥加密和解密的虚拟号码，结果会话密钥在解密该程序时是无用的。
-
公开(公告)号：US07010526B2
公开(公告)日：2006-03-07
申请号：US10141686
申请日：2002-05-08
申请人： Matthew Denesuk , Daniel Frederick Gruhl , Kevin Snow McCurley , Sridhar Rajagopalan , Andrew S. Tomkins
发明人： Matthew Denesuk , Daniel Frederick Gruhl , Kevin Snow McCurley , Sridhar Rajagopalan , Andrew S. Tomkins
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99936 , Y10S707/99942
摘要： In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from expert rules embodied in the miners. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers.
-
9.发明授权System for encrypting broadcast programs in the presence of compromised receiver devices 有权在存在受损的接收机设备的情况下加密广播节目的系统公开(公告)号：US06650753B1
公开(公告)日：2003-11-18
申请号：US09597600
申请日：2000-06-20
IPC分类号： H04L900
CPC分类号： H04N7/163 , G11B20/00362 , H04L9/0861 , H04L9/14 , H04L2209/34 , H04L2209/606 , H04N7/1675 , H04N21/2585 , H04N21/26613
摘要： A digital broadcast system provides secure transmission of digital programs to in-home digital devices even when some of the devices are unauthorized. A matrix of device keys Sj,i is provided, wherein “i” is a key index variable indicating a position in a key dimension of the matrix and “j” is a sets index variable indicating a position in a sets dimension of the matrix. Each in-home device is assigned plural dev ice keys from the matrix, with one and only one device key for each key index variable “i” being assigned to a device. To generate a session key for a broadcast program, session numbers xi are encrypted with all device keys Sj,i to generate a session key block which is decrypted by the in-home devices and used to generate a session key for decrypting the program. If one of the devices is a compromised device, at least one of the session numbers is a dummy number that is encrypted and decrypted by the corresponding compromised device key, with the resulting session key being useless in decrypting the program.
摘要翻译： 数字广播系统提供数字节目到家庭内数字设备的安全传输，即使某些设备是未授权的。 提供了设备密钥Sj，i的矩阵，其中“i”是指示矩阵的关键维度中的位置的键索引变量，“j”是指示矩阵的集合维度中的位置的集合索引变量。 每个家庭设备从矩阵中分配了多个开关冰钥匙，每个键索引变量“i”被分配给设备的仅一个设备密钥。 为了生成用于广播节目的会话密钥，会话号码xi用所有设备密钥Sj，i进行加密，以生成由家庭内设备解密并用于生成用于解密程序的会话密钥的会话密钥块。 如果其中一个设备是受损设备，则会话号码中的至少一个是被相应的受损设备密钥加密和解密的虚拟号码，结果会话密钥在解密该程序时是无用的。
-
公开(公告)号：US08886723B1
公开(公告)日：2014-11-11
申请号：US13529868
申请日：2012-06-21
申请人： Ullas Gargi , Sanketh Shetty , Tomá{hacek over (s)} I{hacek over (z)}o , Charles Duhadway , Kevin Snow McCurley , Nisarg Dilipkumar Kothari
发明人： Ullas Gargi , Sanketh Shetty , Tomá{hacek over (s)} I{hacek over (z)}o , Charles Duhadway , Kevin Snow McCurley , Nisarg Dilipkumar Kothari
IPC分类号： G06F15/16 , G06F15/173
摘要： A method for assessing sharing of items within a social network is provided. The method includes identifying a first sharing of a social item by a first user of a social network, determining one or more second sharings of the social item by one or more second users, the one or more second sharings being based on the first sharing. The method also includes determining a sharing score associated with the first user based on a number of the one or more second sharings, and updating a data structure based on the determined sharing score associated with the first user. The data structure stores respective sharing scores associated with the plurality of users of the social network. Systems and machine-readable media are also provided.
摘要翻译： 提供了一种用于评估社交网络内项目共享的方法。 该方法包括由社交网络的第一用户识别社交物品的第一共享，由一个或多个第二用户确定社交物品的一个或多个第二共享，所述一个或多个第二共享基于第一共享。 该方法还包括基于一个或多个第二共享的数量来确定与第一用户相关联的共享得分，以及基于与第一用户相关联的所确定的共享得分来更新数据结构。 数据结构存储与社交网络的多个用户相关联的各个共享分数。 还提供系统和机器可读介质。
-
-
-
-
-
-
-
-
-
搜索结果
15 条记录 (耗时 0.019 秒)
