会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • System and method and computer program product for ranking logical directories
    • 用于对逻辑目录进行排序的系统和方法以及计算机程序产品
    • US07464076B2
    • 2008-12-09
    • US10847143
    • 2004-05-15
    • Nadav EironKevin Snow McCurleyJohn Anthony Tomlin
    • Nadav EironKevin Snow McCurleyJohn Anthony Tomlin
    • G06F17/30
    • G06F17/30958G06F17/30864Y10S707/99933Y10S707/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。
    • 2. 发明申请
    • System and method for ranking nodes in a network
    • 用于对网络中的节点进行排序的系统和方法
    • US20050256860A1
    • 2005-11-17
    • US10847164
    • 2004-05-15
    • Nadav EironKevin Snow McCurleyJohn Anthony Tomlln
    • Nadav EironKevin Snow McCurleyJohn Anthony Tomlln
    • G06F17/30
    • G06F17/30864G06F17/30613Y10S707/99937Y10S707/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.
    • 悬挂的网页处理系统在网络上排列悬挂的网页。 该系统排列了无法爬行的高质量的悬挂网页。 此外,系统会调整排名,以惩罚悬挂在网页上的链接被抓取时返回错误的悬挂网页。 通过提供悬挂网页的排名,目前的系统允许集中爬行资源在那些悬而未决的区域中具有最高排名的悬挂网页。 系统在本地对悬挂的网页进行操作,为悬挂的网页提供有效的排名。 该系统基于是否指向惩罚页面,即在遵循链接时返回错误的页面,明确区分网页。 通过将诸如此类的细粒度信息纳入排名,系统可以提高个人搜索结果的质量,更好地管理抓取资源。
    • 3. 发明申请
    • 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
    • Christos FaloutsosKevin Snow McCurleyAndrew Tomkins
    • Christos FaloutsosKevin Snow McCurleyAndrew Tomkins
    • G06Q10/00H04L1/00
    • 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)。
    • 4. 发明授权
    • System for encrypting broadcast programs in the presence of compromised
receiver devices
    • 在存在受损的接收机设备的情况下加密广播节目的系统
    • US6118873A
    • 2000-09-12
    • US065938
    • 1998-04-24
    • Jeffrey Bruce LotspiechKevin Snow McCurley
    • Jeffrey Bruce LotspiechKevin Snow McCurley
    • H04H20/00H04L9/00H04L9/08H04N7/16H04N7/167H04N21/258H04N21/266
    • H04N7/163H04L9/0861H04L9/14H04N21/2585H04N21/26613H04N7/1675G11B20/00362H04L2209/34H04L2209/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进行加密,以生成由家庭内设备解密并用于生成用于解密程序的会话密钥的会话密钥块。 如果其中一个设备是受损设备,则会话号码中的至少一个是被相应的受损设备密钥加密和解密的虚拟号码,结果会话密钥在解密该程序时是无用的。
    • 9. 发明申请
    • NETWORK INTEGRITY MAINTENANCE
    • 网络完整性维护
    • US20110238983A1
    • 2011-09-29
    • US13153603
    • 2011-06-06
    • Jeffrey Bruce LotspiechKevin Snow McCurleyFlorian Pestoni
    • Jeffrey Bruce LotspiechKevin Snow McCurleyFlorian Pestoni
    • H04L29/06
    • H04L9/0891H04L9/0822H04L2209/60
    • A device removal system securely removes an item of content or a device from a content-protected home network. An authorization table maintains a list of devices in the content-protected home network in addition to removed devices. The authorization table also maintains a list of deleted content. Through management of various cryptographic keys and techniques, devices and content will not play on a content-protected home network after they have been removed. A secret network ID reduces the possibility of unauthorized playing of content on the content-protected home network. A web server may join the content-protected home network as a device, providing backup for the secret network ID. Otherwise, the device manufacturer will provide the secret network ID in case of a device failure. Storing a verification value in each device ensures integrity of critical cryptographic values. This verification value is compared to network values to ensure network values have not been corrupted.
    • 设备移除系统从内容保护的家庭网络安全地移除内容项或设备。 除了已删除的设备之外,授权表维护受保护内容的家庭网络中的设备列表。 授权表还维护已删除内容的列表。 通过管理各种加密密钥和技术,设备和内容在被删除后不会在内容保护的家庭网络上播放。 秘密网络ID减少了内容受保护的家庭网络上未经授权播放内容的可能性。 网络服务器可以加入作为设备的内容保护的家庭网络,为秘密网络ID提供备份。 否则,设备制造商将在设备故障的情况下提供秘密网络ID。 在每个设备中存储验证值可确保关键加密值的完整性。 将此验证值与网络值进行比较,以确保网络值未被损坏。