Abstract: An image-guided system and method for performing needle biopsy on a moving lung nodule of a body is provided. CT images of the lung nodule are obtained to generate a motion model, based on which an optimal needle advancing path is determined. The motion of the lung nodule and the motion of a fiducial marker attached to the body are correlated. The motion of the fiducial marker is tracked and monitored by a camera to determine a position of the lung nodule based on the correlation. A time for advancing the needle is determined based on a motion attribute of the reference. The needle is advanced by a robotic needle manipulator at the predetermined time along the path to accomplish the needle placement.

Abstract: A processing device may generate a data encryption key configured to encrypt unique data within a clone of an encrypted data set and associated with a set of transaction identifiers of a transaction based file system. The processing device may further wrap the data encryption key with a wrapping key, create a cloned encrypted data set with the data encryption key, and store the wrapped data encryption key with the cloned encrypted data set indexed by at least one of the set of transaction identifiers.

Abstract: Provided are an apparatus and method for fast and adaptive computer-aided detection of pulmonary nodules and differentiation of malignancy from benignancy in thoracic CT images using a hierarchical vector quantization scheme. Anomalous pulmonary nodules are detected by obtaining a two-dimensional (2D) feature model of a pulmonary nodule, segmenting the pulmonary nodule by performing vector quantification to expand the 2D feature model to a three-dimensional (3D) model, and displaying image information representing whether the pulmonary nodule is benign, based upon the 3D model expanded from the 2D feature model, with duplicate information eliminated by performing feature reduction performed using a principal component analysis and a receiver operating characteristics area under the curve merit analysis.

Abstract: Provided are an apparatus and method for fast and adaptive computer-aided detection of pulmonary nodules and differentiation of malignancy from benignancy in thoracic CT images using a hierarchical vector quantization scheme. Anomalous pulmonary nodules are detected by obtaining a two-dimensional (2D) feature model of a pulmonary nodule, segmenting the pulmonary nodule by performing vector quantification to expand the 2D feature model to a three-dimensional (3D) model, and displaying image information representing whether the pulmonary nodule is benign, based upon the 3D model expanded from the 2D feature model, with duplicate information eliminated by performing feature reduction performed using a principal component analysis and a receiver operating characteristics area under the curve merit analysis.

Abstract: A method for processing a first input/output (I/O) request on a network attached storage (NAS) device that includes receiving the first I/O request from a source by the NAS device, placing the first I/O request in an I/O queue associated with the NAS device, wherein the first I/O request is placed in the I/O queue based on a priority of the first I/O request using a remote storage access protocol, and when the first I/O request is associated with the highest priority in the I/O queue, determining whether a bandwidth associated with the source of the first I/O request is exceeded, processing the first I/O request if the bandwidth associated with the source of the first I/O request is not exceeded, and placing the first I/O request in sleep mode if the bandwidth associated with the source of the first I/O request is exceeded.

Abstract: An image-guided system and method for performing needle biopsy on a moving lung nodule of a body is provided. CT images of the lung nodule are obtained to generate a motion model, based on which an optimal needle advancing path is determined. The motion of the lung nodule and the motion of a fiducial marker attached to the body are correlated. The motion of the fiducial marker is tracked and monitored by a camera to determine a position of the lung nodule based on the correlation. A time for advancing the needle is determined based on a motion attribute of the reference. The needle is advanced by a robotic needle manipulator at the predetermined time along the path to accomplish the needle placement.

Abstract: A method for resilvering a storage pool includes determining whether any of a first plurality of blocks in the storage pool, comprising metadata, require resilvering, determining whether any of a second plurality of blocks in the storage pool, comprising data, require resilvering, resilvering all of the first plurality of blocks that require resilvering, and resilvering all of the second plurality of blocks that require resilvering, wherein all of the first plurality of blocks that require resilvering are resilvered prior to resilvering any of the second plurality of blocks.

Abstract: A nonwoven filter media comprising: polyphenylene sulfide fibers, an inorganic fibers wherein said filter media exhibits physical properties taken from the group consisting of: (a) a clean gas concentration of less than 0.1 mg/m3, (b) an average cycle time of greater than 125 seconds when the media at 16.0 ounces per square yard is tested per ASTM-D6830-02, (c) residual pressure drop of less than 350 Pa as measured by ASTM-D6830-02; (d) weight of between 5.0 and 20.0 ounces per yard2 and a thickness between 0.020 and 0.100 inches, (e) air permeability of between 10 and 60 cubic feet per minute, (f) Mullen Burst strength of 225 lbs/inch2, (g) less than 50% strength loss according to a tensile test after being submerged in sulfuric acid according to test ASTM-D461-93, (h) total mass removal efficiency of 99.99% and (i) resists burn-through by a stainless steel ball bearings heated to 800° C.

Abstract: A system and method for clients, a control module, and storage modules to participate in a unifed address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from the client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Abstract: A system and method for clients, a control module, and storage modules to participate in a unifed address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from the client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Abstract: A computer readable medium includes executable instructions for resilvering a hierarchical block tree in a storage pool. Resilvering the hierarchical block tree involves traversing a branch of the hierarchical block tree only if a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL). Resilvering the hierarchical block tree further involves resilvering a child block in the branch only if the DTL comprises a birth time of the child block.

Abstract: A system and method for clients, a control module, and storage modules to participate in a unified address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Abstract: A system and method for clients, a control module, and storage modules to participate in a unified address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Abstract: A method for writing a data block to a storage pool. The method including receiving a write operation for a block, determining whether the block comprises metadata, and if the block comprises metadata: determining a first replication type for the block, and writing the block to the storage pool in accordance with the first replication type. If the block does not comprise metadata: determining a second replication type for the block and writing the block to the storage pool in accordance with the second replication type.

Abstract: A system and method for clients, a control module, and storage modules to participate in a unified address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Abstract: A method for storing data including receiving a request to write data and in response the request, selecting a RAID grid location in a RAID grid to write the data. The method further includes writing the data to memory, updating a data structure to indicate that the RAID grid location is filled, identifying a parity value in the RAID grid to update, where the parity value is associated with a second RAID grid location in the RAID grid, updating the parity value using the data and the parity value to obtain an updated parity value and storing the updated parity value in the memory. Prior to the first data grid being filled determining a physical address in persistent storage corresponding to the RAID grid location and writing the data to the first physical address.

Abstract: A method for writing data to persistent storage. The method includes receiving a first request to write a first datum to persistent storage including NAND dies, identifying a first NAND die in which to write a first copy of the first datum and a second NAND die in which to write a second copy, generating a second request to write the first copy of the first datum to the first NAND die and a third request to write the second copy to the second NAND die, and waiting until the first NAND die and second NAND die not are busy. Based on a determination that the first NAND die and the second NAND die are not busy: issuing the second request to the first NAND die, and issuing the third request to the second NAND die after the second request is complete.

Abstract: A computer readable medium having software instructions that, when executed, perform a method for preserving data stored in a file system with a plurality of files. The method involves determining whether storage capacity of the file system has reached a threshold level, wherein the threshold level is stored in at least one of a plurality of size-reducing policies, obtaining a criterion from the at least one size-reducing policy, identifying a subset of the plurality of files that match the criterion, accessing metadata of each of the identified subset of files, wherein the metadata of each of the identified subset of files comprises at least one option for reducing a size of the file, and performing a size-reducing action to reduce a size of each of the identified subset of files based on the option for reducing the size of each of the identified subset of files and the criterion.

Abstract: A method for wear level-based allocation in a storage pool. The method includes receiving a first request to write a first data item in a storage pool, where the storage pool includes a number of physical locations associated with the storage devices, and where each of the storage devices includes metadata regarding a level of wear of the storage device. The method further includes determining a first target physical location selected from the plurality of physical locations by using a wear-level selection policy and a wear cost for each of the storage devices, where the wear cost is determined based on a type of the storage device. The method further includes allocating a first data block to the first target physical location writing the first data block to the first target physical locations, wherein the first data block comprises a first portion of the first data item.

Abstract: A method for retrieving a logical block, including receiving a request to read the logical block, and obtaining metadata associated with the logical block, wherein the metadata includes a replication type used to store the logical block and physical block locations in a storage pool for each physical block associated with the logical block. The method further includes obtaining power state information including a power state for the storage devices specified in the physical block locations, selecting a first set of physical block locations using the metadata, the power state information, and a power-usage selection policy, and generating I/O requests, where each I/O request specifies one of the first set of physical block locations. The method further includes issuing the I/O requests, receiving physical blocks in response to the I/O requests, and constructing the logical block using the physical blocks.