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

31. 发明授权

US5303302A Network packet receiver with buffer logic for reassembling interleaved data packets 失效
标题翻译：具有缓冲逻辑的网络分组接收器，用于重新组合交错数据分组
公开(公告)号：US5303302A
公开(公告)日：1994-04-12
申请号：US900844
申请日：1992-06-18
申请人： Michael Burrows
发明人： Michael Burrows
IPC分类号： H04J3/06 , H04L12/56 , H04Q11/04 , H04L9/00 , H04J3/02
CPC分类号： H04L49/3081 , H04J3/0632 , H04Q11/0478 , H04L2012/5615 , H04L2012/5616 , H04L2012/5647 , H04L2012/5652 , H04L2012/5682
摘要： A network controller receives encrypted data packets in the form of interleaved streams of cells, and stores the received cells in a buffer until the end of each packet is received, at which time the complete packet is decrypted, error checked, and then transmitted to a host computer. The network controller's buffer includes a data storage array in which data packets are stored as linked lists, and a packet directory having a entry for each data packet stored in the buffer. Each directory entry contains a pointer to the first and last location in the buffer where a corresponding data packet is stored, as well as status information for the data packet. When free space in the network controller's buffer falls below a specified threshold, the network controller transmits selected partial packets to the host computer without decrypting or error checking, and also stores in its packet directory entry for each transmitted partial packet a "partial transfer" status flag. Additional portions of the partial packets may be sent to the host computer with an indication of the packet to which they belong. Upon receiving the end of a data packet that was partially transferred to the host computer, the remainder of the data packet in the packet buffer is transmitted to the host computer, without decrypting or error checking the partial data packet. The host computer then transmits the complete packet through a loopback path in the network controller for decrypting and error checking.
摘要翻译：网络控制器以交织的小区流的形式接收加密的数据分组，并将接收到的小区存储在缓冲器中，直到接收到每个分组的结尾，此时完整分组被解密，错误检查，然后发送到主机。网络控制器的缓冲器包括数据分组作为链表存储的数据存储阵列，以及包含存储在缓冲器中的每个数据分组的条目的分组目录。每个目录条目包含指向缓冲器中存储相应数据分组的第一个和最后一个位置的指针，以及数据分组的状态信息。当网络控制器缓冲区中的可用空间低于指定的阈值时，网络控制器将所选择的部分数据包发送到主计算机，而不进行解密或错误检查，并且还将其每个发送的部分数据包的“目录条目”存储在“分组转移”状态旗。部分分组的附加部分可以被发送到主计算机，其中包含它们所属的分组的指示。在接收到部分传送到主计算机的数据分组的结束时，分组缓冲器中的数据分组的剩余部分被发送到主计算机，而不对该部分数据分组进行解密或错误检查。然后，主机通过网络控制器中的环回路径发送完整的分组，用于解密和错误检查。

32. 发明授权

US5173939A Access control subsystem and method for distributed computer system using compound principals 失效
标题翻译：使用复合主体的分布式计算机系统的访问控制子系统和方法
公开(公告)号：US5173939A
公开(公告)日：1992-12-22
申请号：US783361
申请日：1991-10-28
申请人： Martin Abadi , Michael Burrows , Edward P. Wobber
发明人： Martin Abadi , Michael Burrows , Edward P. Wobber
IPC分类号： G06F9/46
CPC分类号： G06F9/468 , Y10S707/99939
摘要： A distributed computer system has a number of computers coupled thereto at distinct nodes and a naming service with a membership table that defines a list of assumptions concerning which principals in the system are stronger than other principals, and which roles adopted by principals are stronger than other roles. Each object in the system has an access control list (ACL) having a list of entries. Each entry is either a simple principal or a compound principal. The set of allowed compound principals is limited to a predefined set of allowed combinations of simple principals, roles, delegations and conjunctions in accordance with a defined hierarchical ordering of the conjunction, delegation and role portions of each compound principal. The assumptions in the membership table reduce the number of entries needed in an ACL by allowing an entry to state only the weakest principals and roles that are to be allowed access. The reference checking process, handled by a reference monitor found at each node of the distributed system, grants an access request if the requestor is stronger than any one of the entries in the access control list for the resource requested. Furthermore, one entry is stronger than another entry if for each of the conjuncts in the latter entry there is a stronger conjunct in the former. Additional rules used by the reference monitor during the reference checking process govern the processes of comparing conjuncts in a requestor principal with the conjuncts in an access control list entry and of using assumptions to compare the relative strengths of principals and roles.
摘要翻译：分布式计算机系统具有多个与不同节点耦合的计算机，以及具有会员表的命名服务，该成员表定义了系统中哪些主体比其他主体更强的假设列表，以及由主体采用的角色比其他主体更强角色。系统中的每个对象都具有一个具有条目列表的访问控制列表（ACL）。每个条目都是简单的主体或复合主体。允许的复合主体的集合被限制为根据每个复合主体的连接，委派和角色部分的定义的分级顺序的简单主体，角色，委托和连接的允许的组合的预定义集合。成员资格表中的假设通过允许条目仅指定允许访问的最弱主体和角色来减少ACL中所需的条目数。如果请求者比所请求的资源的访问控制列表中的任何一个条目更强，由在分布式系统的每个节点处发现的参考监视器处理的参考检查过程就会授予访问请求。此外，如果对于前一个条目中的每个连词都有一个更强的连接，则一个条目比另一个条目更强。引用检查过程中参考监视器使用的附加规则管理将请求方主体中的连接与访问控制列表条目中的连接进行比较的过程，以及使用假设来比较主体和角色的相对强度。

33. 发明授权

US07617226B1 Document treadmilling system and method for updating documents in a document repository and recovering storage space from invalidated documents 有权
标题翻译：用于更新文档库中的文档并从无效文档中恢复存储空间的文档跑步系统和方法
公开(公告)号：US07617226B1
公开(公告)日：2009-11-10
申请号：US11352025
申请日：2006-02-10
申请人： Michael Burrows , Jeffrey A. Dean
发明人： Michael Burrows , Jeffrey A. Dean
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30067 , Y10S707/99942 , Y10S707/99943 , Y10S707/99953
摘要： A tokenspace repository stores documents as a sequence of tokens. The tokenspace repository, as well as the inverted index for the tokenspace repository, uses a data structure that has a first end and a second end and allows for insertions at the second end and deletions from the front end. A document in the tokenspace repository is updated by inserting the updated version into the repository at the second end and invalidating the earlier version. Invalidated documents are not deleted immediately; they are identified in a garbage collection list for later garbage collection. The tokenspace repository is treadmilled to shift invalidated documents to the front end, at which point they may be deleted and their storage space recovered.
摘要翻译：令牌空间存储库将文档存储为一系列令牌。令牌空间存储库以及令牌空间存储库的反向索引使用的数据结构具有第一端和第二端，并允许在第二端插入和从前端删除。通过将更新后的版本插入到第二个版本的存储库并使较早的版本无效，可以更新令牌空间存储库中的文档。无效的文件不会立即删除; 它们被标识在垃圾收集列表中以供稍后的垃圾收集。令牌空间存储库能够将无效文档转移到前端，此时它们可能会被删除，并恢复其存储空间。

34. 发明授权

US07529834B1 Method and system for cooperatively backing up data on computers in a network 有权
公开(公告)号：US07529834B1
公开(公告)日：2009-05-05
申请号：US09668643
申请日：2000-09-22
申请人： Andrew David Birrell , Mark David Lillibridge , Michael Burrows , Michael Acheson Isard
发明人： Andrew David Birrell , Mark David Lillibridge , Michael Burrows , Michael Acheson Isard
IPC分类号： G06F15/173 , G06F15/16 , G06F11/00
CPC分类号： G06F11/1464 , Y10S707/99953
摘要： A method for backing up data in a plurality of computers connected via a network. The method includes forming partnerships between the plurality of computers such that each computer in a partnership commits under agreements to help backup the data of its partners. The method further includes periodically verifying that previously backed up data is being retained by the computers committed to act as backup partners in accordance with the agreements. In another embodiment, the method provides a distributed cooperative backing up of data in a system that includes a loose confederation of computers connected via a network. In this embodiment the method includes selecting computers as potential backup partners from among the loose confederation of computers connected via the network based on predetermined criteria, and negotiating a reciprocal backup partnership agreement between the computers based on predetermined requirements, including backup requirements. Once the negotiations are complete and the agreements are made, the method proceeds to form partnerships between the computers. The computers become backup partners by agreeing to cooperatively provide backup services to each other so that a distributed cooperative backing up of data can be administered in the absence of central control. The method further includes periodically backing up data at the backup partners, where the data being backed up is encoded. The method also includes periodically verifying that previously backed up data is retained by the backup partners. Another aspect of the invention is a distributed cooperative backup system that includes a network and a loose confederation of computers connected via the network. A plurality of computers from among the loose confederation of computers is configured for distributed cooperative backing up of data and for functioning as backup partners. Each computer of the plurality of computers has a storage that can be used for providing reciprocal backup services. Each computer of the plurality of computers respectively also has a computer readable medium embodying computer program code configured to cause the computer to perform functions comparable to the method steps as described above.

35. 发明授权

US07293016B1 Index partitioning based on document relevance for document indexes 有权
标题翻译：基于文档索引的文档相关性的索引分区
公开(公告)号：US07293016B1
公开(公告)日：2007-11-06
申请号：US10762823
申请日：2004-01-22
申请人： Darren Shakib , Gaurav Sareen , Michael Burrows
发明人： Darren Shakib , Gaurav Sareen , Michael Burrows
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30864 , G06F17/30622 , Y10S707/99933 , Y10S707/99937 , Y10S707/99943
摘要： Indexed documents are arranged in the index according to a static ranking and partitioned according to static ranking. Index queries reference the first partition and move to a subsequent partition when a static rank for the subsequent partition is higher than a weighted portion of the target score added to a weighted portion of a dynamic rank corresponding to the relevance of the results set generated thus far. By changing the weight of the target score and dynamic ranks in the subsequent partition score, searches can be stopped when no more relevant results will be found in the next partition.
摘要翻译：索引文件根据静态排序排列在索引中，并根据静态排名进行分区。索引查询引用第一个分区并移动到后续分区，当后续分区的静态排名高于添加到对应于迄今为止生成的结果集的相关性的动态排名的加权部分的目标分数的加权部分。通过在随后的分区分数中更改目标分数和动态排名的权重，可以在下一个分区中找不到更多的相关结果时停止搜索。

36. 发明授权

US07149801B2 Memory bound functions for spam deterrence and the like 有权
标题翻译：用于垃圾邮件威慑的内存绑定功能等
公开(公告)号：US07149801B2
公开(公告)日：2006-12-12
申请号：US10290879
申请日：2002-11-08
申请人： Michael Burrows , Martin Abadi , Mark Steven Manasse , Edward P. Wobber , Daniel Ron Simon
发明人： Michael Burrows , Martin Abadi , Mark Steven Manasse , Edward P. Wobber , Daniel Ron Simon
IPC分类号： G06F15/173 , H04K1/00
CPC分类号： H04L63/126 , H04L51/12
摘要： A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. Such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we identify moderately hard, memory bound functions that most recent computer systems will evaluate at about the same speed, and we explain how to use them for protecting against abuses.
摘要翻译：如果用户投入很少或没有成本，资源可能会被滥用。例如，电子邮件滥用是猖獗的，因为发送电子邮件对发件人的成本可以忽略不计。通过以中等昂贵的计算的形式引入人造成本，可能不鼓励这种滥用。因此，电子邮件的发件人可能需要在电子邮件被接受之前几秒计算才能付款。不幸的是，由于计算机系统之间的差异很大，对于具有高端系统的恶意用户来说，这种方法可能无效，对于具有低端系统的合法用户或者两者都是非常缓慢的。从这个观察开始，我们确定了最近的计算机系统以相同的速度评估的适度硬的记忆绑定功能，我们解释如何使用它们来防止滥用。

37. 发明授权

US07028039B2 System and method for storing connectivity information in a web database 失效
公开(公告)号：US07028039B2
公开(公告)日：2006-04-11
申请号：US09766336
申请日：2001-01-18
申请人： Michael Burrows , Keith H. Randall , Raymond P. Stata , Rajiv G. Wickremesinghe
发明人： Michael Burrows , Keith H. Randall , Raymond P. Stata , Rajiv G. Wickremesinghe
IPC分类号： G06F7/00
CPC分类号： G06F17/30864 , G06F17/3061 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943
摘要： A web crawler system includes a central processing unit for performing computations in accordance with stored procedures and a network interface for accessing remotely located computers via a network. A web crawler module downloads pages from remotely located servers via the network interface. A first link processing module obtains page link information from the downloaded page; the page link information includes for each downloaded page a row of page identifiers of other pages. A second link processing module encodes the rows of page identifies in a space efficient manner. It arranges the rows of page identifiers in a particular order. For each respective row it identifies a prior row, if any, that best matches the respective row in accordance with predefined row match criteria, determines a set of deletes representing page identifiers in the identified prior row not in the respective row, and determines a set of adds representing page identifiers in the respective row not in the identifier prior row. The second link processing module delta encodes the set of deletes and delta encodes the set of adds for each respective row, and then Huffman codes the delta encoded set of deletes and delta encoded set of adds for each respective row.

38. 发明申请

US20050210258A1 Cryptographic puzzle cancellation service for deterring bulk electronic mail messages 失效
标题翻译：密码拼图取消服务，用于阻止大量电子邮件
公开(公告)号：US20050210258A1
公开(公告)日：2005-09-22
申请号：US10806020
申请日：2004-03-22
申请人： Andrew Birrell , Michael Burrows , Edward Wobber
发明人： Andrew Birrell , Michael Burrows , Edward Wobber
IPC分类号： G06F13/00 , H04L12/58 , H04L29/06 , H04L29/08 , H04L9/00
CPC分类号： H04L63/1458 , H04L51/12 , H04L67/104 , H04L67/1065
摘要： Methods and systems are provided for a cancellation server maintaining a database of identifiers of cryptographic puzzles. A cryptographic puzzle is created from a unique identifier and a timestamp, and is attached to an electronic mail message, along with the puzzle's solution. The recipient verifies that the solution is correct and that the timestamp is current, and further queries the cancellation server with the puzzle identifier. If the identifier does not exist in the database, then the recipient knows the received message is legitimate. If the identifier already appears in the database, the received message can be automatically removed from the recipient's computer.
摘要翻译：提供了用于维护密码拼图标识符数据库的取消服务器的方法和系统。密码拼图是从唯一标识符和时间戳创建的，并附加到电子邮件消息以及拼图的解决方案。收件人验证解决方案是否正确，并且时间戳是最新的，并且进一步使用拼图标识符查询取消服务器。如果数据库中不存在标识符，则接收方知道接收到的消息是合法的。如果标识符已经出现在数据库中，则可以从收件人的计算机中自动删除接收到的消息。

39. 发明授权

US06377530B1 System and method for playing compressed audio data 有权
标题翻译：用于播放压缩音频数据的系统和方法
公开(公告)号：US06377530B1
公开(公告)日：2002-04-23
申请号：US09249182
申请日：1999-02-12
申请人： Michael Burrows
发明人： Michael Burrows
IPC分类号： G11B390
CPC分类号： G11B31/02 , G11B31/003
摘要： A portable audio player stores a large amount of compressed audio data on an internal disk drive, and loads a portion of this into an internal random access memory (RAM) which requires less power and less time to access. The audio player plays the data stored in RAM and monitors the amount of unplayed data. When the amount of unplayed data falls below a threshold, additional data is copied from the disk drive into RAM. When the portable audio player is turned off, a predetermined amount of audio data is stored in a fast-access non-volatile flash memory unit. When the audio player is turned back on, and play is resumed, a suitable portion of this data can be played while data is being loaded from the disk drive into RAM, thus reducing the amount of time a user must wait before receiving data in response to a play request.
摘要翻译：便携式音频播放器将大量的压缩音频数据存储在内部磁盘驱动器上，并将其一部分加载到需要更少功率和更少访问时间的内部随机存取存储器（RAM）中。音频播放器播放存储在RAM中的数据，并监视未播放数据的数量。当未播放数据量低于阈值时，附加数据将从磁盘驱动器复制到RAM中。当便携式音频播放器关闭时，预定量的音频数据被存储在快速访问非易失性闪存单元中。当音频播放器被重新打开并且播放被恢复时，可以在将数据从磁盘驱动器加载到RAM中的同时播放该数据的适当部分，从而减少用户在接收数据之前必须等待的时间量播放请求。

40. 发明授权

US6047286A Method for optimizing entries for searching an index 有权
标题翻译：优化用于搜索索引的条目的方法
公开(公告)号：US6047286A
公开(公告)日：2000-04-04
申请号：US138088
申请日：1998-08-21
申请人： Michael Burrows
发明人： Michael Burrows
IPC分类号： G06F17/30 , G06F12/30
CPC分类号： G06F17/30622 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
摘要： A system for indexing information includes a memory and processor. The memory stores an index to information. The processor receives a first signal representing a query for a phrase corresponding to a concatenation of adjacent portions of the information. The processor processes the first signal so as to generate a second signal representing an entry for the phrase to be stored as part of the index in the memory.
摘要翻译：用于索引信息的系统包括存储器和处理器。内存存储信息的索引。处理器接收表示对应于信息的相邻部分的级联的短语的查询的第一信号。所述处理器处理所述第一信号，以便生成表示要存储为所述索引的一部分的短语的条目的第二信号。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式