公开(公告)号：US07764787B2

公开(公告)日：2010-07-27

申请号：US11681254

申请日：2007-03-02

Applicant: David Craft

Inventor： David Craft

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

公开(公告)号：US20050208497A1

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

申请号：US10640962

申请日：2003-08-14

Applicant: C. Wilson ,  David Craft ,  Yeyan Zhang ,  Jeffrey Stavenhagen

Inventor： C. Wilson ,  David Craft ,  Yeyan Zhang ,  Jeffrey Stavenhagen

IPC: C12N9/02 ,  C12Q1/68 ,  C07H21/04 ,  C12N1/18 ,  C12N15/74

CPC classification number: C12N9/0042

Abstract: The present invention provides modified promoters from Candida troplicalis CYP and POX4 genes. The modified promoters have various sequence motifs added, deleted, or altered in order to modulate expression of a coding sequence operably linked thereto. The sequence motifs comprise repressors of gene induction (URS sequences) and activators of gene induction (UAS sequences) as well as oleic acid response elements (ORE sequences). Yeast host cells comprising such modified promoters are also provided. Methods of altering expression of a protein of the beta or omega oxidation pathways using a subject modified promoter are also provided.

Abstract translation: 本发明提供了来自假丝酵母CYP和POX4基因的修饰的启动子。 修饰的启动子具有添加，缺失或改变的各种序列基序，以便调节与其可操作地连接的编码序列的表达。 序列基序包括基因诱导阻遏物（URS序列）和基因诱导活化剂（UAS序列）以及油酸反应元件（ORE序列）。 还提供了包含这种修饰的启动子的酵母宿主细胞。 还提供了使用受试者修饰的启动子改变β或ω-氧化途径的蛋白质表达的方法。

公开(公告)号：US20050008162A1

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

申请号：US10464891

申请日：2003-06-19

Applicant: Daniel Brokenshire ,  David Craft ,  Harm Hofstee ,  Mohammad Peyravian

Inventor： Daniel Brokenshire ,  David Craft ,  Harm Hofstee ,  Mohammad Peyravian

IPC: H04L9/06 ,  H04L9/00

CPC classification number: H04L9/0618 ,  H04L2209/08 ,  H04L2209/12

Abstract: A method and system for encrypting and verifying the integrity of a message using a three-phase encryption process is provided. A source having a secret master key that is shared with a target receives the message and generates a random number. The source then generates: a first set of intermediate values from the message and the random number; a second set of intermediate values from the first set of values; and a cipher text from the second set of values. At the three phases, the values are generated using the encryption function of a block cipher encryption/decryption algorithm. The random number and the cipher text are transmitted to the target, which decrypts the cipher text by reversing the encryption process. The target verifies the integrity of the message by comparing the received random number with the random number extracted from the decrypted cipher text.

Abstract translation: 提供了使用三相加密处理来加密和验证消息的完整性的方法和系统。 具有与目标共享的秘密主密钥的源接收消息并生成随机数。 然后，源产生：来自消息和随机数的第一组中间值; 来自第一组值的第二组中间值; 和来自第二组值的密文。 在三个阶段，使用块密码加密/解密算法的加密功能生成这些值。 随机数和密文被发送到目标，通过反转加密过程来解密密文。 目标通过将接收到的随机数与从解密的密文提取的随机数进行比较来验证消息的完整性。

公开(公告)号：US09459187B2

公开(公告)日：2016-10-04

申请号：US14003033

申请日：2012-03-02

Applicant: David Craft ,  Priyanka Apte

Inventor： David Craft ,  Priyanka Apte

IPC: C12Q1/00 ,  G01N1/28 ,  A61B5/15 ,  A61B5/154

CPC classification number: G01N1/28 ,  A61B5/1438 ,  A61B5/15003 ,  A61B5/150099 ,  A61B5/150251 ,  A61B5/150351 ,  A61B5/150389 ,  A61B5/150755 ,  A61B5/154

Abstract: Disclosed are collection devices for collecting and stabilizing whole blood or a component thereof, which include a first end and a second end and at least one interior wall defining a reservoir, wherein the reservoir contains a stabilization agent that includes a lysophospholipase (LysoPLA) inhibitor. Also disclosed are methods for making and using the devices.

Abstract translation: 公开了用于收集和稳定全血或其组分的收集装置，其包括第一端和第二端以及限定储存器的至少一个内壁，其中储存器含有包含溶血磷脂酶（LysoPLA）抑制剂的稳定剂。 还公开了制造和使用装置的方法。

公开(公告)号：US09229852B2

公开(公告)日：2016-01-05

申请号：US13615945

申请日：2012-09-14

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 maintaining versions of data within a solid state memory. 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 page. The operation is performed on the at least one logical page based on the data structure that has been identified.

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

公开(公告)号：US09122584B2

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

申请号：US13615908

申请日：2012-09-14

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

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

IPC: G06F12/02 ,  G06F17/30 ,  G06F11/14 ,  G06F3/06

CPC classification number: G06F12/0246 ,  G06F3/0643 ,  G06F3/0688 ,  G06F11/1435 ,  G06F17/30218 ,  G06F17/3023 ,  G06F2201/84 ,  G06F2212/7201 ,  G06F2212/7209

Abstract: One or more embodiments are directed to managing data in a solid state memory supporting data versioning. A file system residing at an information processing system reserves a plurality of logical pages from a solid state memory. Each logical page in the plurality of logical pages is associated with a plurality of physical pages in the solid state memory. Each logical page in the plurality of logical pages is assigned to one group in a plurality of groups. A request is sent to a flash translation layer for an operation to be performed by the flash translation layer on a group in the plurality of groups.

Abstract translation: 一个或多个实施例涉及管理支持数据版本控制的固态存储器中的数据。 位于信息处理系统的文件系统从固态存储器预留多个逻辑页面。 多个逻辑页面中的每个逻辑页面与固态存储器中的多个物理页面相关联。 将多个逻辑页面中的每个逻辑页面分配给多个组中的一个组。 向闪存转换层发送请求以进行由多个组中的组上的闪存转换层执行的操作。

公开(公告)号：US20130332657A1

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

申请号：US13615945

申请日：2012-09-14

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 maintaining versions of data within a solid state memory. 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 page. The operation is performed on the at least one logical page based on the data structure that has been identified.

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

公开(公告)号：US07770021B2

公开(公告)日：2010-08-03

申请号：US12324127

申请日：2008-11-26

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

公开(公告)号：US20090077387A1

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

申请号：US12324127

申请日：2008-11-26

Applicant: David Craft

Inventor： David Craft

IPC: H04L9/32

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

公开(公告)号：US20070233897A1

公开(公告)日：2007-10-04

申请号：US11397846

申请日：2006-04-04

Applicant: David Craft ,  Vinit Jain ,  Lance Russell ,  Edward Shvartsman

Inventor： David Craft ,  Vinit Jain ,  Lance Russell ,  Edward Shvartsman

IPC: G06F15/173

CPC classification number: H04L29/12924 ,  H04L29/12377 ,  H04L45/00 ,  H04L61/2517 ,  H04L61/6063 ,  H04L67/327 ,  H04L69/16 ,  H04L69/162

Abstract: In a computer system divided into multiple separate workload partitions, wherein at least one of the partitions contains multiple applications, and a loopback interface is made available to each partition, a method is provided for routing packets from one application to another application. In one embodiment of the invention, each packet to be routed from one application to another application in the same home partition comprises a first packet, and all other packets comprise second packets. The method comprises the steps of assigning the same pre-specified IP address to each of the first packets, and routing each of the first packets from its home partition to a loopback interface at the IP network processing layer. The method further includes marking the first packets to identify the home partition of each first packet, and directing the marked first packets to a mechanism configured to deliver each first packet only to its home partition, in response to the markings. Each second packet is assigned the IP address of its intended destination, and routed thereto over the loopback interface.

Abstract translation: 在划分成多个单独的工作负载分区的计算机系统中，其中至少一个分区包含多个应用，并且使环回接口可用于每个分区，提供了用于将分组从一个应用路由到另一应用的路由的方法。 在本发明的一个实施例中，要从一个应用路由到同一家庭分区中的另一应用的每个分组包括第一分组，并且所有其他分组包括第二分组。 该方法包括以下步骤：将相同的预先指定的IP地址分配给每个第一分组，并将第一分组中的每一个从其归属分区路由到IP网络处理层的环回接口。 该方法还包括标记第一分组以识别每个第一分组的归属分区，以及将标记的第一分组引导到被配置为将每个第一分组仅传送到其归属分区的机制，以响应于标记。 每个第二个分组被分配其预期目的地的IP地址，并通过回送接口被路由到其上。