| Patent application number | Description | Published |
|---|
| 20100191153 | PROSTHETIC LIMB MONITORING SYSTEM - Parameters related to use of a prosthesis by a patient with a limb amputation are monitored using a tool that includes one or more piezoelectric force sensors. The resulting data are processed for use both in short and long term management of amputee patients. The sensor is a small modular unit that fits within or between traditional prosthetic components, e.g., below a prosthesis socket. The data produced by the tool are collected, processed, and stored. Optionally, the data are periodically communicated to a remote site via a network, e.g., over the Internet. The device and associated software used to process the data can be used to characterize activities conducted by a prosthesis user, to determine pistoning or threatening interface stress distributions between the limb and socket, mal-alignment of the socket, use of improper components, and other possibly undesired conditions that the amputee patient using the prosthesis may be experiencing. | 07-29-2010 |
| 20110288448 | PROSTHETIC LIMB MONITORING SYSTEM - Parameters related to use of a prosthesis by a patient with a limb amputation are monitored using a tool that includes one or more piezoelectric force sensors. The resulting data are processed for use both in short and long term management of amputee patients. The sensor is a small modular unit that fits within or between traditional prosthetic components, e.g., below a prosthesis socket. The data produced by the tool are collected, processed, and stored. Optionally, the data are periodically communicated to a remote site via a network, e.g., over the Internet. The device and associated software used to process the data can be used to characterize activities conducted by a prosthesis user, to determine pistoning or threatening interface stress distributions between the limb and socket, mal-alignment of the socket, use of improper components, and other possibly undesired conditions that the amputee patient using the prosthesis may be experiencing. | 11-24-2011 |
| Patent application number | Description | Published |
|---|
| 20090095130 | METHOD FOR THE PRODUCTION OF TANTALUM POWDER USING RECLAIMED SCRAP AS SOURCE MATERIAL - A process for obtaining tantalum powder from tantalum containing scrap material is provided. The process includes selecting source material, such as from sintered anodes for capacitors, hydriding the source material, milling to desired particle size and surface area, dehydriding, deoxidizing, agglomerating, sifting, and acid treating to obtain tantalum powder of a desired size and purity. | 04-16-2009 |
| 20110214534 | METHOD FOR THE PRODUCTION OF TANTALUM POWDER USING RECLAIMED SCRAP AS SOURCE MATERIAL - A process for obtaining tantalum powder from tantalum containing scrap material is provided. The process includes selecting source material, such as from sintered anodes for capacitors, hydriding the source material, milling to desired particle size and surface area, dehydriding, deoxidizing, agglomerating, sifting, and acid treating to obtain tantalum powder of a desired size and purity. | 09-08-2011 |
| Patent application number | Description | Published |
|---|
| 20080282105 | DATA INTEGRITY VALIDATION IN STORAGE SYSTEMS - Data validation systems and methods are provided. Data is recorded in N data chunks on one or more storage mediums. A first validation chunk independently associated with said N data chunks comprises first validation information for verifying accuracy of data recorded in said N data chunks. The first validation chunk is associated with a first validation appendix comprising second validation information, wherein the first validation appendix is stored on a first storage medium independent of said one or more storage mediums. | 11-13-2008 |
| 20090055584 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - Method, system and computer program product are provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 02-26-2009 |
| 20090055688 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - Methods are provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is, changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 02-26-2009 |
| 20090177918 | STORAGE REDUNDANT ARRAY OF INDEPENDENT DRIVES - A computer implemented method, apparatus, and computer usable program product for managing redundant array of independent drives. In response to a failure of a hard disk in a first RAID array, the process calculates an amount of free capacity available across a set of remaining hard disks in the first RAID array. The set of remaining hard disks comprises every hard disk associated with the first RAID array except the failed disk. In response to a determination that the amount of free capacity is sufficient to re-create the first RAID array at a same RAID level, the process reconstructs the first RAID array using an amount of space in the set of remaining drives utilized by the first RAID array and the free capacity to form a new RAID array without utilizing a spare hard disk. | 07-09-2009 |
| 20100217752 | DATA INTEGRITY VALIDATION IN STORAGE SYSTEMS - Data validation systems and methods are provided. Data is recorded in N data chunks on one or more storage mediums. A first validation chunk independently associated with said N data chunks comprises first validation information for verifying accuracy of data recorded in said N data chunks. The first validation chunk is associated with a first validation appendix comprising second validation information, wherein the first validation appendix is stored on a first storage medium independent of said one or more storage mediums. | 08-26-2010 |
| 20100251072 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - A RAID system is provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 09-30-2010 |
| 20110208912 | FULL-STRIPE-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Information is stored as a stripe including a collection of a data strips and associated parity strips, the stripe distributed across data and parity nodes. Each data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the collection of data strips. A driver node initiates a full-stripe-write parity update protocol for maintaining parity coherency in conjunction with other nodes, to keep the relevant parity strips coherent. Parity is determined directly by computing parity strips for all data strips of a stripe. Any node may function as a driver node. | 08-25-2011 |
| 20110208994 | REBUILDING LOST DATA IN A DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Rebuilding lost data in a distributed redundancy data storage system including multiple nodes, is provided. User data is stored as a collection of stripes, each stripe comprising a collection of data strips and associated parity strips, the stripes distributed across multiple corresponding data owner nodes and multiple corresponding parity owner nodes. A data owner node maintains the associated data strip holding a first copy of data, and a parity owner node maintains a parity strip holding a parity for the collection of data strips. Upon detecting a failure condition, the owner node initiates a rebuilding protocol for recovery of lost data and/or parity it owns. The protocol includes reconstruction of lost data or parity by a computation involving data and/or parity from a recovery strip set in a stripe, wherein a recovery strip set contains at least one surviving data or parity strip. The recovery strip set for a lost data strip contains at least one surviving parity strip. | 08-25-2011 |
| 20110208995 | READ-MODIFY-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes, each node comprising a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of multiple data strips and associated parity strips, the stripes distributed across multiple corresponding primary data nodes and multiple corresponding parity nodes. A primary data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the multiple data strips. A read-modify-write parity update protocol is performed for maintaining parity coherency, the primary data node driving parity coherency with its corresponding parity nodes, independently of other data nodes, in order to keep its relevant parity strips coherent. | 08-25-2011 |
| 20110208996 | READ-OTHER PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Each node comprises a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of at least a data strip and associated parity strips, the stripes distributed across a primary data node and multiple corresponding parity nodes. A read-other parity update protocol maintains parity coherency. The primary data node for each data strip drives parity coherency with the corresponding parity nodes, independently of other data nodes, in keeping relevant parity strips for the primary data node coherent. A parity value is determined based on data other than a difference between new data and existing data. A new parity value is based on new data and dependent data, wherein with respect to one data value, dependent data comprises other data encoded in a corresponding parity value. | 08-25-2011 |
| Patent application number | Description | Published |
|---|
| 20080224100 | METHODS FOR PRODUCING COMPOSITES OF FULLERENE NANOTUBES AND COMPOSITIONS THEREOF - This invention relates generally to a method for producing composites of fullerene nanotubes and compositions thereof. In one embodiment, the present invention involves a method of producing a composite material that includes a matrix and a fullerene nanotube material embedded within said matrix. In another embodiment, a method of producing a composite material containing fullerene nanotube material is disclosed. This method includes the steps of preparing an assembly of a fibrous material; adding the fullerene nanotube material to the fibrous material; and adding a matrix material precursor to the fullerene nanotube material and the fibrous material. | 09-18-2008 |
| 20080311025 | METHOD FOR FORMING A PATTERNED ARRAY OF FULLERENE NANOTUBES - This invention relates generally to forming a patterned array of fullerene nanotubes. In one embodiment, a nanoscale array of microwells is provided on a substrate; a metal catalyst is deposited in each microwells; and a stream of hydrocarbon or CO feedstock gas is directed at the substrate under conditions that effect growth of fullerene nanotubes from each microwell. | 12-18-2008 |
| 20090004094 | METHOD FOR CUTTING FULLERENE NANOTUBES - This invention relates generally to cutting fullerene nanotubes. In one embodiment, the present invention provides for preparation of homogeneous populations of short fullerene nanotubes by cutting and annealing (reclosing) the nanotube pieces followed by fractionation. The cutting and annealing processes may be carried out on a purified nanotube bucky paper, on felts prior to purification of nanotubes or on any material that contains fullerene nanotubes. In one embodiment, oxidative etching with concentrated nitric acid is employed to cut fullerene nanotubes into shorter lengths. The annealed nanotubes may be disbursed in an aqueous detergent solution or an organic solvent for the fractionation. Closed tubes can also be derivatized to facilitate fractionation, for example, by adding solubilizing moieties to the end caps. | 01-01-2009 |
| 20090169463 | ARRAY OF FULLERENE NANOTUBES - This invention relates generally to forming an array of fullerene nanotubes. In one embodiment, a macroscopic molecular array is provided comprising at least about 10 | 07-02-2009 |
| 20100096265 | MACROSCOPICALLY MANIPULABLE NANOSCALE DEVICES MADE FROM NANOTUBE ASSEMBLIES - This invention relates generally to cutting single-wall carbon nanotubes (SWNT). In one embodiment, the present invention provides for preparations of homogeneous populations of short carbon nanotube molecules by cutting and annealing (reclosing) the nanotube pieces followed by fractionation. The cutting and annealing processes may be carried out on a purified nanotube bucky paper, on felts prior to purification of nanotubes or on any material that contains single-wall nanotubes. In one embodiment, oxidative etching with concentrated nitric acid is employed to cut SWNTs into shorter lengths. The annealed nanotubes may be disbursed in an aqueous detergent solution or an organic solvent for the fractionation. Closed tubes can also be derivatized to facilitate fractionation, for example, by adding solubilizing moieties to the end caps. | 04-22-2010 |
| 20110086781 | METHOD FOR FORMING COMPOSITES OF SUB-ARRAYS OF FULLERENE NANOTUBES - The formation of arrays of fullerene nanotubes is described. A microscopic molecular array of fullerene nanotubes is formed by assembling subarrays of up to 10 | 04-14-2011 |
