公开(公告)号：US09455992B2

公开(公告)日：2016-09-27

申请号：US12483338

申请日：2009-06-12

Applicant: John R. Douceur ,  David M Levin ,  Jacob R. Lorch ,  Thomas Moscibroda

Inventor： John R. Douceur ,  David M Levin ,  Jacob R. Lorch ,  Thomas Moscibroda

IPC: G06F15/16 ,  H04L29/06 ,  H04L9/32

CPC classification number: H04L63/123 ,  H04L9/3247 ,  H04L29/06 ,  H04L2209/127

Abstract: Techniques for utilizing trusted hardware components for mitigating the effects of equivocation amongst participant computing devices of a distributed system are described herein. For instance, a distributed system employing a byzantine-fault-resilient protocol—that is, a protocol intended to mitigate (e.g., tolerate, detect, isolate, etc.) the effects of byzantine faults—may employ the techniques. To do so, the techniques may utilize a trusted hardware component comprising a non-decreasing counter and a key. This hardware component may be “trusted” in that the respective participant computing device cannot modify or observe the contents of the component in any manner other than according to the prescribed procedures, as described herein. Furthermore, the trusted hardware component may couple to the participant computing device in any suitable manner, such as via a universal serial bus (USB) connection or the like.

Abstract translation: 在此描述了利用可信硬件组件来减轻分布式系统的参与者计算设备之间的混淆效应的技术。 例如，采用拜占庭故障弹性协议的分布式系统 - 即旨在减轻（例如，容忍，检测，隔离等）拜占庭故障的影响的协议 - 可以采用这些技术。 为了这样做，这些技术可以利用包括非递减计数器和密钥的可信硬件组件。 该硬件组件可能是“可信赖的”，因为如本文所述，相应的参与者计算设备不能以除了根据规定的过程之外的任何方式修改或观察组件的内容。 此外，可信硬件组件可以以任何合适的方式，例如经由通用串行总线（USB）连接等耦合到参与者计算设备。

公开(公告)号：US08209741B2

公开(公告)日：2012-06-26

申请号：US11856362

申请日：2007-09-17

Applicant: Jeremy Eric Elson ,  Jonathan Ryan Howell ,  John R. Douceur

Inventor： Jeremy Eric Elson ,  Jonathan Ryan Howell ,  John R. Douceur

IPC: G06F7/04

CPC classification number: G06F21/36 ,  G06F2221/2133

Abstract: A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs a partial credit algorithm in order to allow a user to make one or more mistakes during consecutive HIP challenges and still be identified as a human. The algorithm assigns a user partial credit based upon getting part of the challenge incorrect. The partial credit is tracked and if during one or more consecutive subsequent challenges the same user gets a portion of the challenge incorrect again, they can still be identified as human.

Abstract translation: 促进和实现将人与非人类用户区分开的系统和方法。 人类交互式证明（HIP）采用部分信用算法，以允许用户在连续的HIP挑战期间发生一个或多个错误，并且仍然被识别为人。 该算法基于获得部分挑战而分配用户部分信用不正确。 跟踪部分功劳，如果在一个或多个连续的后续挑战中，同一用户再次获得挑战的一部分不正确，则仍然可以将其识别为人。

公开(公告)号：US20120137167A1

公开(公告)日：2012-05-31

申请号：US12956342

申请日：2010-11-30

Applicant: Garrett Leischner ,  Andrew J. Lagattuta ,  Matthew Jeremiah Eason ,  Landy Wang ,  John R. Douceur ,  Baskar Sridharan ,  Edmund B. Nightingale

Inventor： Garrett Leischner ,  Andrew J. Lagattuta ,  Matthew Jeremiah Eason ,  Landy Wang ,  John R. Douceur ,  Baskar Sridharan ,  Edmund B. Nightingale

IPC: G06F11/07 ,  G06F11/22

CPC classification number: G06F11/0793 ,  G06F11/073 ,  G11C29/04 ,  G11C29/42 ,  G11C29/44 ,  G11C29/76 ,  G11C2029/0409

Abstract: A system and method for mitigating memory errors in a computer system. Faulty memory is identified and tested by a memory manager of an operating system. The memory manager may perform diagnostic tests while the operating system is executing on the computer system. Regions of memory that are being used by software components of the computer system may also be tested. The memory manager maintains a stored information about faulty memory regions. Regions are added to the stored information when they are determined to be faulty by a diagnostic test tool. Memory regions are allocated to software components by the memory manager after checking the stored information about faulty memory regions. This ensures a faulty memory region is never allocated to a software component of the computer system.

Abstract translation: 用于减轻计算机系统中的内存错误的系统和方法。 存储器故障由操作系统的存储器管理器识别和测试。 内存管理器可以在计算机系统上执行操作系统时执行诊断测试。 计算机系统的软件组件正在使用的内存区域也可以被测试。 存储器管理器维护有关存储器区域的存储信息。 当诊断测试工具被确定为故障时，将区域添加到存储的信息中。 在检查存储的有关存储器区域的信息之后，存储器管理器将内存区域分配给软件组件。 这确保了错误的存储器区域从不分配给计算机系统的软件组件。

公开(公告)号：US08104070B2

公开(公告)日：2012-01-24

申请号：US11856371

申请日：2007-09-17

Applicant: John R. Douceur ,  Jeremy Eric Elson ,  Jonathan Ryan Howell

Inventor： John R. Douceur ,  Jeremy Eric Elson ,  Jonathan Ryan Howell

IPC: G06F7/04

CPC classification number: H04L63/10 ,  G06F21/36 ,  H04L63/08

Abstract: A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs images from a large private database of manually categorized images to display as part of a Turing test challenge. The private database contains a sufficient quantity of images, such that the more economical manner to pass the HIP is to employ a human to take the challenge. The owner of the private database makes the database available to the presenter of the HIP due to an alignment of interests between both parties. The HIP is displayed with ads on behalf of the owner of the private database and the presenter of the HIP gains access to a large quantity of private manually categorized images.

Abstract translation: 促进和实现将人与非人类用户区分开的系统和方法。 人类交互式证明（HIP）使用来自手动分类图像的大型私人数据库的图像作为图灵测试挑战的一部分显示。 私人数据库包含足够数量的图像，以便通过HIP的更经济的方式是采用人类来应对挑战。 由于双方之间的利益一致，私人数据库的所有者使数据库可供HIP主持人使用。 HIP与私人数据库的所有者一起显示广告，并且HIP的主持人可以访问大量私人手动分类的图像。

公开(公告)号：US07868786B2

公开(公告)日：2011-01-11

申请号：US10968861

申请日：2004-10-19

Applicant: Kentaro Toyama ,  Ramaswamy Hariharan ,  Ross G. Cutler ,  John R. Douceur ,  Nuria M. Oliver ,  Eric K. Ringger ,  Daniel C. Robbins ,  Matthew T. Uyttendaele

Inventor： Kentaro Toyama ,  Ramaswamy Hariharan ,  Ross G. Cutler ,  John R. Douceur ,  Nuria M. Oliver ,  Eric K. Ringger ,  Daniel C. Robbins ,  Matthew T. Uyttendaele

IPC: G08G1/123

CPC classification number: G06Q30/02

Abstract: A location history is a collection of locations over time for an object. A stay is a single instance of an object spending some time in one place, and a destination is any place where one or more objects have experienced a stay. Location histories are parsed using stays and destinations. In a described implementation, each location of a location history is recorded as a spatial position and a corresponding time at which the spatial position is acquired. Stays are extracted from a location history by analyzing locations thereof with regard to a temporal threshold and a spatial threshold. Specifically, two or more locations are considered a stay if they exceed a minimum stay duration and are within a maximum roaming distance. Each stay includes a location, a starting time, and an ending time. Destinations are produced from the extracted stays using a clustering operation and a predetermined scaling factor.

Abstract translation: 位置历史记录是对象的一段时间内的位置集合。 逗留是在一个地方花费一些时间的对象的单个实例，目的地是一个或多个对象经历了逗留的任何地方。 使用停留和目的地解析位置历史记录。 在描述的实现中，将位置历史的每个位置记录为空间位置和获取空间位置的对应时间。 通过相对于时间阈值和空间阈值分析其位置，从位置历史中提取静止。 具体来说，如果两个或多个位置超过最小停留持续时间并处于最大漫游距离内，则将其视为停留。 每个住宿包括一个位置，一个起始时间和一个结束时间。 使用聚类操作和预定缩放因子从所提取的逗留中产生目的地。

公开(公告)号：US07716672B2

公开(公告)日：2010-05-11

申请号：US11009655

申请日：2004-12-10

Applicant: John R. Douceur ,  William J. Bolosky

Inventor： John R. Douceur ,  William J. Bolosky

IPC: G06F9/46

CPC classification number: G06F9/4881

Abstract: A method and system for regulating tasks of background processes so as to reduce interference with foreground processes. The progress rate of a background task (e.g., amount of work performed per unit time) is measured and evaluated against a target amount. If the progress rate appears degraded, the background task is suspended for a computed time interval so as to back off from its interference with a foreground process. Each time the progress rate appears degraded, the time interval is exponentially increased from its previous value up to a maximum, however if the performance appears normal, the time interval is reset to a minimum. Evaluation of the work is statistically based so as to eliminate variations in measurements, and automatic calibration of the target amount is provided, as is a mechanism for prioritizing multiple background tasks.

Abstract translation: 一种用于调整后台进程任务的方法和系统，以减少对前台进程的干扰。 根据目标量测量和评估后台任务的进度（例如，每单位时间执行的工作量）。 如果进度速率出现降级，则后台任务将暂停计算的时间间隔，以避免其与前台进程的干扰。 每次进度出现退化时，时间间隔从先前的值到最大值都呈指数级增长，但是如果性能出现正常，则时间间隔被重置为最小值。 工作的评估是统计学的，以便消除测量中的变化，并且提供目标量的自动校准，以及用于优先考虑多个后台任务的机制。

公开(公告)号：US20090216903A1

公开(公告)日：2009-08-27

申请号：US12035652

申请日：2008-02-22

Applicant: Jonathan Ryan Howell ,  John R. Douceur ,  Jeremy Eric Elson

Inventor： Jonathan Ryan Howell ,  John R. Douceur ,  Jeremy Eric Elson

IPC: G06F15/16

CPC classification number: H04L29/12132 ,  H04L29/12066 ,  H04L29/12301 ,  H04L29/12811 ,  H04L61/1511 ,  H04L61/1552 ,  H04L61/2076 ,  H04L61/6009

Abstract: Domain name caching mechanisms are provided to address cache-defeating approaches. Domain name lookup requests are processed and cached information associated with a non-identical domain name returned in response. Cache-defeating behavior including nonce injection can be detected or inferred and employed to map domain name requests to previously cached information thereby exposing the benefits of caching.

Abstract translation: 提供域名缓存机制来解决缓存失败的方法。 处理域名查找请求并与响应中返回的不相同的域名相关联的缓存信息。 可以检测或推断使用缓存消除行为，包括随机数注入，以将域名请求映射到先前缓存的信息，从而暴露缓存的好处。

公开(公告)号：US07574598B2

公开(公告)日：2009-08-11

申请号：US11150801

申请日：2005-06-10

Applicant: John R. Douceur ,  William J. Bolosky ,  Marvin M. Theimer

Inventor： John R. Douceur ,  William J. Bolosky ,  Marvin M. Theimer

IPC: H04L29/06

CPC classification number: H04L9/3236 ,  H04L9/3247 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: Cryptographic protocols and methods of employing the same are described. The described protocols advantageously enable two or more identical encryptable objects that are coded for encryption with different keys to be identified as identical without access to either the unencrypted objects or the keys that are used in the encryption process. Additionally, the protocols enable two or more identical encryptable objects to be processed with different encryption keys, yet be stored in a manner so that the total required storage space is proportional to the space that is required to store a single encryptable object, plus a constant amount for each distinct encryption key. In various embodiments, the encryptable objects comprise files and the cryptographic protocols enable encrypted files to be used in connection with single instance store (SIS) systems.

Abstract translation: 描述了使用它们的密码协议和方法。 所描述的协议有利地使得被编码用于具有不同密钥的加密的两个或更多个相同的可加密对象被识别为相同，而不访问加密过程中使用的未加密对象或密钥。 另外，这些协议允许使用不同的加密密钥来处理两个或多个相同的可加密对象，但是以一定的方式存储，使得所需的总存储空间与存储单个可加密对象所需的空间成正比，加上常数 每个不同加密密钥的数量。 在各种实施例中，可加密对象包括文件，并且加密协议使加密文件能够与单实例存储（SIS）系统相关联使用。

公开(公告)号：US20090077629A1

公开(公告)日：2009-03-19

申请号：US11856371

申请日：2007-09-17

Applicant: John R. Douceur ,  Jeremy Eric Elson ,  Jonathan Ryan Howell

Inventor： John R. Douceur ,  Jeremy Eric Elson ,  Jonathan Ryan Howell

IPC: G06F7/04

CPC classification number: H04L63/10 ,  G06F21/36 ,  H04L63/08

Abstract: A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs images from a large private database of manually categorized images to display as part of a Turing test challenge. The private database contains a sufficient quantity of images, such that the more economical manner to pass the HIP is to employ a human to take the challenge. The owner of the private database makes the database available to the presenter of the HIP due to an alignment of interests between both parties. The HIP is displayed with ads on behalf of the owner of the private database and the presenter of the HIP gains access to a large quantity of private manually categorized images.

Abstract translation: 促进和实现将人与非人类用户区分开的系统和方法。 人类交互式证明（HIP）使用来自手动分类图像的大型私人数据库的图像作为图灵测试挑战的一部分显示。 私人数据库包含足够数量的图像，以便通过HIP的更经济的方式是采用人类来应对挑战。 由于双方之间的利益一致，私人数据库的所有者使数据库可供HIP主持人使用。 HIP与私人数据库的所有者一起显示广告，并且HIP的主持人可以访问大量私人手动分类的图像。

公开(公告)号：US20080293474A1

公开(公告)日：2008-11-27

申请号：US11971541

申请日：2008-01-09

Applicant: John R. Douceur ,  Thomas Moscibroda

Inventor： John R. Douceur ,  Thomas Moscibroda

IPC: A63F9/24

CPC classification number: G07F17/329 ,  G07F17/32

Abstract: The described implementations relate to networked or distributed systems and more particularly to providing motivation for deployment of networked systems. One technique gathers a solicitation hierarchy in a distributed system. This technique also tracks contribution to the distributed system of participants within the hierarchy. This technique further probabilistically determines a participant as a lottery winner based at least in part on the solicitation hierarchy and the contribution.

Abstract translation: 所描述的实现涉及网络或分布式系统，并且更具体地涉及提供用于部署联网系统的动机。 一种技术在分布式系统中收集招标层次。 这种技术还追踪对层次结构中参与者的分布式系统的贡献。 该技术进一步概率地将参与者确定为至少部分基于招标层次和贡献的彩票获胜者。