会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • CONTENT IDENTIFICATION FOR PEER-TO-PEER CONTENT RETRIEVAL
    • 用于同侪内容检索的内容标识
    • US20110295948A1
    • 2011-12-01
    • US13207925
    • 2011-08-11
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 4. 发明授权
    • Content identification for peer-to-peer content retrieval
    • 内容识别用于对等内容检索
    • US08019882B2
    • 2011-09-13
    • US12163024
    • 2008-06-27
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 5. 发明授权
    • Content identification for peer-to-peer content retrieval
    • 内容识别用于对等内容检索
    • US08112477B2
    • 2012-02-07
    • US13207925
    • 2011-08-11
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 6. 发明申请
    • Content Identification for Peer-to-Peer Content Retrieval
    • 内容识别用于对等内容检索
    • US20090327505A1
    • 2009-12-31
    • US12163024
    • 2008-06-27
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 9. 发明授权
    • Client side deferred actions within multiple MAPI profiles
    • 客户端在多个MAPI配置文件中执行延迟操作
    • US5978566A
    • 1999-11-02
    • US679129
    • 1996-07-12
    • Darrell Alan PlankRamesh Babu PabbatiR. Scott Briggs
    • Darrell Alan PlankRamesh Babu PabbatiR. Scott Briggs
    • H04L29/06H01J13/00
    • H04L29/06
    • A user-defined rule that specifies a condition and an action to be performed is processed in an electronic messaging system that includes a server and a client by determining at the server whether the condition is satisfied upon an occurrence of an event. Once the condition is satisfied, the action is performed at the server if all resources for performing the action are resident on the server. If one or more of the resources for performing the action are resident on the client, a deferred action message representative of the action is generated. The deferred action message is processed by the client, either immediately if the client is presently logged in to the server, or later when the client next logs in to the server, and the action is performed at the client based on the deferred action message.
    • 指定条件和要执行的动作的用户定义规则在包括服务器和客户端的电子消息系统中通过在服务器处确定事件发生时是否满足条件来处理。 满足条件后,如果执行操作的所有资源都驻留在服务器上,则会在服务器上执行该操作。 如果用于执行动作的一个或多个资源驻留在客户端上,则生成表示该动作的延迟动作消息。 延迟操作消息由客户端处理,如果客户端当前登录到服务器,或者稍后当客户端登录到服务器时立即进行处理,并且基于延迟动作消息在客户端执行该动作。