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

1. 发明授权

US10296712B2 Medical imaging study retrieval system 有权
公开(公告)号：US10296712B2
公开(公告)日：2019-05-21
申请号：US14828489
申请日：2015-08-17
申请人： Radia Inc., P.S.
发明人： David Revell
IPC分类号： G06F19/00 , G06Q50/24 , G06T7/00
摘要： A programmed computer system receives an imaging study of the patient including metadata associated with the study. The metadata are analyzed to determine an anatomic region represented by the study. Additional imaging studies for the same patient are requested and the metadata associated with the additional studies are analyzed to determine relevant studies for the same or adjacent anatomic regions. Once the relevant prior studies have been identified, the computer requests the images associated with the identified prior imaging studies including the associated reports for review by a physician or other medical personnel.

2. 发明申请

US20180236420A1 PAINT MIXING DEVICE AND METHOD 审中-公开
公开(公告)号：US20180236420A1
公开(公告)日：2018-08-23
申请号：US15895489
申请日：2018-02-13
申请人： Radia
发明人： Stephen Carlson , Thomas Midas
IPC分类号： B01F11/00 , B01F15/00
摘要： A paint container holder for use in a paint mixer, the paint container holder capable of receiving a paint container with a square, tapered square or cylindrical shape.

3. 发明申请

US20150095404A1 DISTRIBUTED IN-ORDER LOAD SPREADING RESILIENT TO TOPOLOGY CHANGES 有权
标题翻译：分布式订单负载递增到拓扑变化
公开(公告)号：US20150095404A1
公开(公告)日：2015-04-02
申请号：US14040125
申请日：2013-09-27
申请人： Radia Perlman
发明人： Radia Perlman
IPC分类号： H04L29/08
CPC分类号： H04L67/1034 , H04L67/1027
摘要： Methods, apparatus, and systems for distributing network loads in a manner that is resilient to system topology changes. Distribution functions and associated operations are implemented on multiple load splitters such that if a load splitter becomes inoperative, another or other load splitters can forward packets corresponding to flows previously handled by the inoperative load splitter without requiring flow state synchronization to be maintained across load splitters. The distribution functions are implemented in a manner that distributes packets for the same flows to the same servers through system topology changes, addressing both situations when servers fail and/or are taken off-line and when such servers or replacement servers are brought back on-line. The techniques are facilitated, in part, via use of redistributed flow lists and/or Bloom filters that are marked to track redistributed flows. A novel Bloom filter recycle scheme is also disclosed.
摘要翻译：用于以与系统拓扑变化有关的方式分配网络负载的方法，装置和系统。分配功能和相关联的操作在多个负载分配器上实现，使得如果负载分配器变得不起作用，则另一个或其它负载分配器可以转发与由不可操作的负载分配器先前处理的流相对应的分组，而不需要在负载分配器之间维持流状态同步。分发功能的实现方式是通过系统拓扑变化将同一流量的数据包分发到相同的服务器，解决服务器故障和/或脱机时的这两种情况，并将这些服务器或替换服务器重新启动后，线。这些技术部分地通过使用被标记为跟踪重新分发的流的重新分发的流列表和/或布鲁姆过滤器来促进。还公开了一种新颖的Bloom过滤器再循环方案。

4. 发明申请

US20140192677A1 NETWORK ROUTING PROTOCOL POWER SAVING METHOD FOR NETWORK ELEMENTS 有权
标题翻译：网络元件的网络路由协议节能方法
公开(公告)号：US20140192677A1
公开(公告)日：2014-07-10
申请号：US13977512
申请日：2012-06-29
申请人： Yen Hsiang Chew , Radia Perlman
发明人： Yen Hsiang Chew , Radia Perlman
IPC分类号： G06F1/32 , H04L12/753 , H04L12/28
CPC分类号： G06F1/3234 , H04L12/28 , H04L41/0833 , H04L41/12 , H04L45/125 , H04L45/48 , H04L69/14 , Y02D50/30
摘要： Methods and apparatus relating to network routing protocols to support power savings in network elements. A most utilized link path network topology for a computer network is discovered using a routing protocol such as a Spanning Tree, link-state, or distance vector routing protocol. In view of the most utilized link path network topology, links are identified as candidates for power management under which a power state of the link and associated network ports are managed to save power under applicable link conditions, such as low utilization. Link power-state change conditions are detected, and in response a corresponding change to the power state of a link is effected by changing the power-state of the network ports at the ends of the link. Power state changes include putting a link into a reduced power state, taking a link offline, and powering a link back up.
摘要翻译：与网络路由协议相关的方法和设备，以支持网元的节电。使用诸如生成树，链路状态或距离矢量路由协议的路由协议来发现用于计算机网络的最有效的链路路径网络拓扑。鉴于最广泛使用的链路路径网络拓扑，链路被识别为用于电力管理的候选，其中管理链路和相关网络端口的电力状态以在适用的链路条件（例如低利用率）下节省功率。检测到链路功率状态改变状况，并且作为响应，通过改变链路端的网络端口的功率状态来实现对链路的功率状态的相应改变。电源状态改变包括将链路置于降低功率状态，使链路脱机，并为链路供电。

5. 发明授权

US08635284B1 Method and apparatus for defending against denial of service attacks 有权
标题翻译：防止拒绝服务攻击的方法和装置
公开(公告)号：US08635284B1
公开(公告)日：2014-01-21
申请号：US11255366
申请日：2005-10-21
申请人： Sunay Tripathi , Radia J. Perlman , Nicolas G. Droux
发明人： Sunay Tripathi , Radia J. Perlman , Nicolas G. Droux
IPC分类号： G06F15/16 , H04L29/06 , G06F11/30
CPC分类号： H04L69/22 , H04L49/9047 , H04L63/1458 , H04L69/161
摘要： A method for processing packets that includes receiving a packet from a network, analyzing the packet to obtain packet information used to determine to which temporary data structure to forward the packet, if a first list includes the packet information forwarding the packet to a first temporary data structure, and processing the packet from the first temporary data structure, and if the first list does not include the packet information forwarding the packet to a second temporary data structure, processing the packet, wherein processing the packet comprises: sending a first test to a source of the packet using the packet information, placing the packet information on the first list, if a successful response to the first test is received, and placing the packet information on a second list, if an unsuccessful response to the first test is received.
摘要翻译：一种处理分组的方法，包括从网络接收分组，如果第一列表包括将分组转发到第一临时数据的分组信息，则分析分组以获得用于确定哪个临时数据结构转发分组的分组信息结构，并且处理来自第一临时数据结构的分组，并且如果第一列表不包括将分组转发到第二临时数据结构的分组信息，则处理分组，其中处理分组包括：向第一临时数据结构发送第一测试如果接收到对第一测试的成功响应，则将分组信息放置在第一列表上，并且如果接收到对第一测试的不成功的响应，则将分组信息放置在第二列表上。

6. 发明授权

US08538014B2 Fast computation of one-way hash sequences 有权
标题翻译：快速计算单向哈希序列
公开(公告)号：US08538014B2
公开(公告)日：2013-09-17
申请号：US12118893
申请日：2008-05-12
申请人： Radia J. Perlman
发明人： Radia J. Perlman
IPC分类号： H04L9/28
CPC分类号： H04L9/0643 , H04L9/0869 , H04L2209/38
摘要： Some embodiments of the present invention provide a system that computes a target secret St in a sequence of secrets S0 . . . Sn. During operation, the system obtains k hash functions h1, . . . , hk, where h1 is known as the “lowest order hash function”, and hk is known as the “highest order hash function.” Associated with each hash function hi is a seed value seed comprising a pair (seedindexi, seedvaluei). Hash function hi operates on a pair (indexi, valuei) to produce a pair (newindexi, newvaluei), where newindexi>indexi. To compute target secret St, the hash functions are applied successively, starting with the highest order hash function whose associated seed's index value is largest without being greater than t, applying that hash function as many times as possible without having that hash function's output's index value become greater than t, and then applying each successive hash function in turn as many times as possible, until St has been computed. To delete the earliest computable secret in the chain, S1, the new seed for each of the hash functions is computed as follows. Let x=1+index1, (the index of the seed associated with the lowest order hash function). For each hash function hi, if x>indexi, then hi is applied to seedi. If the resulting indexi is greater than indexi+1, then (indexi+1, valuei+1) associated with hashi+1 is copied into the (index, value) associated with hashi. Otherwise, seed is replaced by hi(seedi).
摘要翻译：本发明的一些实施例提供了一种以秘密序列S0计算目标秘密St的系统。。。锡在操作期间，系统获得k个哈希函数h1，。。。，hk，其中h1被称为“最低阶哈希函数”，并且hk被称为“最高阶哈希函数”。与每个哈希函数相关联的是包括对（seedindexi，seedvaluei）的种子值种子。哈希函数hi在一对（indexi，valuei）上运行以产生一对（newindexi，newvaluei），其中newindexi> indexi。为了计算目标秘密St，哈希函数被连续地应用，从相关种子的索引值最大而不大于t的最高阶哈希函数开始，将哈希函数尽可能多地应用，而不需要哈希函数的输出的索引值变得大于t，然后依次应用每个连续的哈希函数，直到St被计算为止。要删除链中最早的可计算秘密S1，每个哈希函数的新种子计算如下。令x = 1 + index1（与最低阶哈希函数关联的种子的索引）。对于每个散列函数嗨，如果x> indexi，那么hi应用于seedi。如果所得到的indexi大于indexi + 1，则与hashi + 1相关联的（indexi + 1，valuei + 1）被复制到与hashi相关联的（index，value）中。否则，种子由hi（seedi）代替。

7. 发明申请

US20130124673A1 Policy Controlled Preload and Consumption of Software Application 有权
标题翻译：政策控制的预加载和软件应用程序的消耗
公开(公告)号：US20130124673A1
公开(公告)日：2013-05-16
申请号：US13296519
申请日：2011-11-15
申请人： Johan HJELM , Martin Svensson , Nimish Radia
发明人： Johan HJELM , Martin Svensson , Nimish Radia
IPC分类号： G06F15/16
CPC分类号： G06F8/00 , G06F8/61 , G06F9/44505 , H04L12/00 , H04L63/102 , H04L67/306 , H04L67/34
摘要： The present disclosure relates to interrelated methods in a server and in a client enabling policy controlled preload and consumption of software application in a client. The method in a server comprises receiving information pertaining to an identified user; providing the identified user's current user and/or software application usage policies to a client associated with the identified user; deriving an software application preferences context pertaining to the user; based on the derived software application preferences context recommending an unsolicited software application from a set of available software applications; and preparing for transmission a set of software application comprising the recommended unsolicited software application; and transmitting to the client the prepared set of software applications. The method further relates to a server, a client, a computer program on a carrier and a computer program product.
摘要翻译：本公开涉及服务器和客户端中的相互关联的方法，使客户端中的软件应用程序能够进行策略控制的预加载和消费。服务器中的方法包括：接收与所识别的用户有关的信息; 将所识别的用户的当前用户和/或软件应用使用策略提供给与所识别的用户相关联的客户端; 导出与用户有关的软件应用偏好上下文; 基于从一组可用软件应用程序推荐未经请求的软件应用程序的派生软件应用程序偏好上下文; 并准备传输包括推荐的非请求软件应用程序的一套软件应用程序; 并向客户端发送准备好的一套软件应用程序。该方法还涉及服务器，客户端，运营商上的计算机程序和计算机程序产品。

8. 发明申请

US20120204272A1 METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR PUBLISHING PUBLIC CONTENT AND PRIVATE CONTENT ASSOCIATED WITH THE PUBLIC CONTENT 审中-公开
标题翻译：方法，用于发布公共内容的设备和计算机程序产品以及与公共内容相关的私人内容
公开(公告)号：US20120204272A1
公开(公告)日：2012-08-09
申请号：US13020215
申请日：2011-02-03
申请人： Martin Svensson , Nimish Radia , Kristoffer Gronowski , Bo Xing , Andrew Ton
发明人： Martin Svensson , Nimish Radia , Kristoffer Gronowski , Bo Xing , Andrew Ton
IPC分类号： G06F15/16 , G06F21/24
CPC分类号： H04W12/08 , H04L63/101 , H04L67/02 , H04W4/21
摘要： A publishing method is disclosed, which process enables a publisher to publish in a simple and easy manner a set of content that includes both public content and private content. In some embodiments, this advantageous solution is achieved by implementing a multi-step publishing process. In one step, the publisher publishes a feed that contains: (1) the public content and (2) information advertising the existence of the private content and the scope of the private content. In another step, the publisher stores the private content on a server accessible to the authorized entities.
摘要翻译：公开了一种发布方法，该过程使发布者能够以简单和容易的方式发布一组包含公共内容和私人内容的内容。在一些实施例中，通过实施多步骤发布过程来实现该有利的解决方案。一步，发布者发布一个Feed，其中包含：（1）公共内容和（2）广告私人内容的存在和私人内容的范围的信息。在另一步骤中，发布者将专用内容存储在授权实体可访问的服务器上。

9. 发明授权

US08006285B1 Dynamic defense of network attacks 有权
标题翻译：动态防御网络攻击
公开(公告)号：US08006285B1
公开(公告)日：2011-08-23
申请号：US11150924
申请日：2005-06-13
申请人： Radia J. Perlman
发明人： Radia J. Perlman
IPC分类号： H04L29/06
CPC分类号： H04L63/1458
摘要： A distributed denial of service attack can be defended against by challenging requests at a machine upstream from the target of the attack. The upstream machine limits access to the victim machine in response to indication of the victim machine being attacked. The upstream machine begins trapping protocol data units destined for the victim machine and challenging requests to access the victim machine with tests that require sentient responses, such as Turing tests. The upstream machine then updates a set of rules governing access to the victim machine based, at least in part, on responses to the challenges or administered tests.
摘要翻译：可以通过在攻击目标上游的机器的挑战性请求来防御分布式拒绝服务攻击。上游机器响应受害机器受到攻击的指示，限制对受害机器的访问。上游机器开始捕获去往受害机器的协议数据单元，并挑战要求访问受害机器的请求，该测试需要有敏感的响应，如图灵测试。然后，上游机器至少部分地基于对挑战或管理测试的响应来更新一组管理对受害者机器的访问的规则。

10. 发明申请

US20110093721A1 PARAMETERIZABLE CRYPTOGRAPHY 有权
标题翻译：可参考的CRYPTOGRAPHY
公开(公告)号：US20110093721A1
公开(公告)日：2011-04-21
申请号：US12582276
申请日：2009-10-20
申请人： Radia J. Perlman
发明人： Radia J. Perlman
IPC分类号： G06F21/24
CPC分类号： G06F21/602
摘要： Some embodiments provide systems and techniques for performing parameterizable cryptography. An encryption key can be determined based at least on a string associated with an authorization policy. The encryption key can then be used to encrypt information. The decryption key can also be determined based at least on the string associated with the authorization policy. Note that the authorization policy must be satisfied to decrypt information. In some embodiments, the systems and techniques for performing parameterizable cryptography are blindable. These blindable embodiments can be used to preserve privacy.
摘要翻译：一些实施例提供用于执行可参数化密码术的系统和技术。可以至少基于与授权策略相关联的字符串来确定加密密钥。然后可以使用加密密钥来加密信息。解密密钥也可以至少基于与授权策略关联的字符串来确定。请注意，解密信息必须满足授权策略。在一些实施例中，用于执行可参数化密码术的系统和技术是盲目的。这些不确定的实施例可用于保护隐私。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式