公开(公告)号：US20050216693A1

公开(公告)日：2005-09-29

申请号：US10807552

申请日：2004-03-23

Applicant: David Craft ,  Brian Dixon ,  Yuri Volobuev ,  James Wyllie

Inventor： David Craft ,  Brian Dixon ,  Yuri Volobuev ,  James Wyllie

IPC: G06F12/12 ,  G06F12/00 ,  G06F12/08

CPC classification number: G06F12/0888 ,  G06F12/121 ,  G06F12/123

Abstract: A system for balancing multiple memory buffer sizes includes a memory partitioned into a plurality of subgroups, each subgroup containing similarly sized buffers. The system further includes a memory manager which manages requests for buffer space by storing and accessing buffer steal history records in a buffer steal history queue.

Abstract translation: 用于平衡多个存储器缓冲器大小的系统包括分割成多个子组的存储器，每个子组包含相似大小的缓冲器。 该系统还包括一个存储器管理器，其通过在缓冲器窃取历史队列中存储和访问缓冲器窃取历史记录来管理对缓冲器空间的请求。

公开(公告)号：US20050045112A1

公开(公告)日：2005-03-03

申请号：US10653110

申请日：2003-09-03

Applicant: David Craft

Inventor： David Craft

IPC: A01K5/01 ,  A01K1/10

CPC classification number: A01K5/0142

Abstract: A double level ant-proof pet food bowl includes a top food container having a first recess at a center of a bottom side of a base of the food container; bottom water container having a second recess at a center of an upper side of a base of the water container; and a central post having an upper end inserted into the first recess, and a lower end inserted into the second recess. The top food container resides on top of the central post and above the bottom water container.

Abstract translation: 双层防爆宠物食品碗包括顶部食物容器，其具有在食物容器的底部的底侧的中心处的第一凹部; 底部水容器在水容器的底部的上侧的中心具有第二凹部; 以及中心柱，其具有插入到所述第一凹部中的上端，以及插入到所述第二凹部中的下端。 顶部食物容器位于中心柱的顶部和底部水容器上方。

公开(公告)号：US20050021944A1

公开(公告)日：2005-01-27

申请号：US10601374

申请日：2003-06-23

Applicant: David Craft ,  Michael Day ,  Harm Hofstee ,  Charles Johns ,  John Liberty

Inventor： David Craft ,  Michael Day ,  Harm Hofstee ,  Charles Johns ,  John Liberty

IPC: G06F12/14 ,  G06F21/22 ,  G06F21/24 ,  G09C1/00 ,  H04L9/08 ,  H04L9/00

CPC classification number: G06F21/53 ,  H04L9/3226 ,  H04L2209/56

Abstract: The present invention provides for authenticating code and/or data and providing a protected environment for execution. The present invention provides for dynamically partitioning and un-partitioning a local store for the authentication of code or data. The local store is partitioned into an isolated and non-isolated section. Code or data is loaded into the isolated section. The code or data is authenticated in the isolated section of the local store. After authentication, the code is executed. After execution, the memory within the isolated region of the attached processor unit is erased, and the attached processor unit de-partitions the isolated section within the local store.

Abstract translation: 本发明提供了验证代码和/或数据并提供受保护的环境以供执行。 本发明提供了用于对代码或数据的认证的动态分区和分区本地存储。 本地商店被划分成一个隔离和非隔离的部分。 代码或数据被加载到隔离的部分。 代码或数据在本地存储的隔离部分进行身份验证。 认证后，执行代码。 在执行之后，附着的处理器单元的隔离区域内的存储器被擦除，并且附加的处理器单元对本地存储器内的隔离部分进行分区。

公开(公告)号：US20050010767A1

公开(公告)日：2005-01-13

申请号：US10464884

申请日：2003-06-19

Applicant: David Craft

Inventor： David Craft

IPC: G06F21/00 ,  H04L9/00

CPC classification number: G06F21/123

Abstract: A processing unit includes a read-only encryption key. Loader code image is loaded into system memory from non-volatile storage. Loader code image includes a prefix value and a suffix value. The prefix value is combined with the master key from the processing unit to create a random value that is the seed for a hashing algorithm. The hashing algorithm uses the seed value with a signature formed from the blocks of code to form a result. During the hashing algorithm, intermediate key values are generated and stored in a memory area inaccessible by the user. The intermediate key values are used by the loader code after the loader has been authenticated and loaded. The loader combines one or more of the intermediate key values with prefix and suffix values that correspond to other software modules to authenticate the software, using a hashing algorithm, and load the software upon authentication.

公开(公告)号：US06240751B1

公开(公告)日：2001-06-05

申请号：US09293349

申请日：1999-04-16

Applicant: Ricci L. Marzolf ,  Julie Houdek ,  Andrew Bools ,  David Craft

Inventor： Ricci L. Marzolf ,  Julie Houdek ,  Andrew Bools ,  David Craft

IPC: B60R2502

CPC classification number: E05B13/105 ,  E05B1/0038 ,  E05B9/08 ,  Y10T70/5757 ,  Y10T70/8541 ,  Y10T292/57 ,  Y10T292/85

Abstract: An operator for a latch system. The operator has a main body, a control unit, and a retainer. The control unit has at least a portion that is selectively repositionable relative to the main body by a user with the control unit in an operative position on the main body to change the state of a latch system with which the operator is associated. A retainer is placeable in an assembled position on the main body wherein the retainer maintains the control unit in the operative position. The main body has a first shoulder, with the retainer element having a second shoulder. The first and second shoulders face and abut each other with the retainer in the assembled position to prevent the retainer from being moved out of the assembled position such that the control unit could be moved out of the operative position. There are cooperating surfaces on the main body and retainer which guide the retainer and main body each against the other to allow the retainer to be guidingly moved against and relative to the main body from a first position relative to the main body into the assembled position. At least a part of at least one of the main body and retainer is deformable and is deformed as an incident of the retainer moving from the first position into the assembled position whereupon the first and second shoulders face and abut each other to prevent the retainer from being moved out of the assembled position.

Abstract translation: 一个闩锁系统的操作员。 操作者具有主体，控制单元和保持器。 所述控制单元具有至少一部分，所述至少一部分可由用户相对于所述主体选择性地重新定位，所述控制单元处于所述主体上的操作位置，以改变与所述操作者相关联的闩锁系统的状态。 保持器可以放置在主体上的组装位置，其中保持器将控制单元保持在操作位置。 主体具有第一肩部，保持器元件具有第二肩部。 第一和第二肩部在保持器处于组装位置时彼此面对并彼此邻接，以防止保持器移出组装位置，使得控制单元可以移出工作位置。 在主体和保持器上有配合表面，其将保持器和主体各自靠在另一个上，以使得保持器能够相对于主体相对于主体从相对于主体的第一位置引导到组装位置。 主体和保持器中的至少一个的至少一部分是可变形的并且随着保持器从第一位置移动到组装位置的入射而变形，从而第一和第二肩部面对并相互抵靠，以防止保持器 被移出组装位置。

公开(公告)号：US09122581B2

公开(公告)日：2015-09-01

申请号：US13494697

申请日：2012-06-12

Applicant: Gokul B. Kandiraju ,  Hubertus Franke ,  David Craft

Inventor： Gokul B. Kandiraju ,  Hubertus Franke ,  David Craft

IPC: G06F12/02

CPC classification number: G06F12/0246 ,  G06F2212/7201 ,  G06F2212/7207

Abstract: Embodiments are directed to maintaining versions of data within a solid state memory. One or more embodiments create at least one data structure associated with at least one logical page of a solid state memory. The logical page is associated with at least one physical page in a data block of the solid state memory. A first set of information associated with the logical page is stored in the data structure. A second set of information associated with the physical page is stored in the data structure. The second set of information includes at least versioning information identifying which version of the logical page is represented by a dataset is stored within the physical page.

Abstract translation: 实施例旨在维持固态存储器内的数据版本。 一个或多个实施例创建与固态存储器的至少一个逻辑页面相关联的至少一个数据结构。 逻辑页面与固态存储器的数据块中的至少一个物理页面相关联。 与逻辑页面相关联的第一组信息被存储在数据结构中。 与物理页面相关联的第二组信息被存储在数据结构中。 第二组信息至少包括版本信息，识别由数据集表示的逻辑页面的哪个版本被存储在物理页面中。

公开(公告)号：US20130332655A1

公开(公告)日：2013-12-12

申请号：US13615885

申请日：2012-09-14

Applicant: Gokul B. KANDIRAJU ,  Hubertus FRANKE ,  David CRAFT

Inventor： Gokul B. KANDIRAJU ,  Hubertus FRANKE ,  David CRAFT

IPC: G06F12/00

CPC classification number: G06F3/061 ,  G06F3/0604 ,  G06F3/0613 ,  G06F3/0635 ,  G06F3/0643 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0679 ,  G06F3/0688 ,  G06F12/0246 ,  G06F12/10 ,  G06F12/1009 ,  G06F17/30088 ,  G06F17/3023 ,  G06F2212/1008 ,  G06F2212/1016 ,  G06F2212/202 ,  G06F2212/2022 ,  G06F2212/65 ,  G06F2212/657 ,  G06F2212/7201 ,  G06F2212/7209 ,  G11C16/10 ,  G11C16/26

Abstract: One or more embodiments are directed a solid state storage device for maintaining versions of data. The solid state storage device comprises a processor and a solid state memory communicatively coupled to the processor. A flash translation layer receives at least one request from a file system to write at least one dataset to a logical page of the solid state memory. At least one physical page in a data block of the solid state memory associated with the logical page is identified. At least one dataset in the physical page is stored. At least one data versioning tag is associated with the dataset in a data structure associated with the logical page. The data versioning tag identifies the dataset as a given version of the logical page. The dataset is maintained as accessible from the physical page irrespective of subsequent write operations to the logical page.

Abstract translation: 一个或多个实施例涉及用于维护数据版本的固态存储设备。 固态存储设备包括通信地耦合到处理器的处理器和固态存储器。 闪存转换层从文件系统接收至少一个请求，以将至少一个数据集写入固态存储器的逻辑页面。 识别与逻辑页面相关联的固态存储器的数据块中的至少一个物理页面。 存储物理页面中至少一个数据集。 至少一个数据版本控制标签与与逻辑页面相关联的数据结构中的数据集相关联。 数据版本控制标签将数据集标识为逻辑页面的给定版本。 无论对逻辑页面的后续写入操作如何，数据集都保持从物理页面可访问。

公开(公告)号：US20130332650A1

公开(公告)日：2013-12-12

申请号：US13494796

申请日：2012-06-12

Applicant: Gokul B. KANDIRAJU ,  Hubertus FRANKE ,  David CRAFT

Inventor： Gokul B. KANDIRAJU ,  Hubertus FRANKE ,  David CRAFT

IPC: G06F12/02

CPC classification number: G06F12/0246 ,  G06F2212/7209

Abstract: One or more embodiments are directed to managing data in a solid state memory supporting data versioning. At least one request to perform an operation on at least one logical page of a solid state memory is received from a file system. A data structure associated with the at least one logical page is identified. The data structure at least identifies one or more physical pages associated with the at least one logical page, and a version of the at least one logical page represented by a dataset stored in each of the one or more physical pages. The operation is performed on the at least one logical page based on the data structure that has been identified.

Abstract translation: 一个或多个实施例涉及管理支持数据版本控制的固态存储器中的数据。 从文件系统接收至少一个对固态存储器的至少一个逻辑页执行操作的请求。 识别与至少一个逻辑页面相关联的数据结构。 所述数据结构至少识别与所述至少一个逻辑页面相关联的一个或多个物理页面，以及由存储在所述一个或多个物理页面中的每一个中的数据集所表示的所述至少一个逻辑页面的版本。 基于已经识别的数据结构，在至少一个逻辑页上执行操作。

公开(公告)号：US08489366B2

公开(公告)日：2013-07-16

申请号：US12181712

申请日：2008-07-29

Applicant: David Craft ,  Thomas Bortfeld

Inventor： David Craft ,  Thomas Bortfeld

IPC: G06F17/10

CPC classification number: G16H50/50 ,  G06F19/00 ,  G06F19/3481

Abstract: A system and method for determining a desired portion of a subject to receive a radiation dose includes iteratively choosing weight vectors to run to gradually build up a Pareto surface (PS). BY examining the current points that have been found on the PS along with the weights used to produce those points, a new vector is produced and run. This process is repeated until a geometric stop tolerance is met.

Abstract translation: 用于确定受试者的期望部分以接收辐射剂量的系统和方法包括迭代地选择权重向量以逐渐建立帕累托表面（PS）。 通过检查在PS上发现的当前点以及用于产生这些点的权重，生成并运行一个新的向量。 重复此过程，直到满足几何停止公差。

公开(公告)号：US07475254B2

公开(公告)日：2009-01-06

申请号：US10464897

申请日：2003-06-19

Applicant: David Craft

Inventor： David Craft

IPC: G06F12/14

CPC classification number: G06F21/123

Abstract: A processing unit includes a read-only encryption key. Software is loaded into a system memory area from a non-volatile storage device. Software code image that resides in the system storage area includes a prefix value and a suffix value. The prefix value is combined with the master key from the processing unit to create a random value that is the seed for a hashing algorithm. The hashing algorithm uses the seed value with a signature formed from the blocks of code to form a result. Finally, after the last block has been processed, a final result remains. The suffix value is combined with the master key, this hash result is compared with the result that was created using the hashing algorithm on the code. If the two results match, the code is authenticated and is executed. If the results do not match, the code is not loaded.

Abstract translation: 处理单元包括只读加密密钥。 软件从非易失性存储设备加载到系统内存区域。 驻留在系统存储区域中的软件代码映像包括前缀值和后缀值。 前缀值与来自处理单元的主密钥组合以创建作为散列算法的种子的随机值。 散列算法使用具有由代码块形成的签名的种子值来形成结果。 最后，在处理最后一个块之后，最终的结果仍然存在。 后缀值与主键组合，将该哈希结果与使用代码上的散列算法创建的结果进行比较。 如果两个结果匹配，则代码被认证并被执行。 如果结果不匹配，则代码未加载。