Abstract: Methods, computer media encoding instructions, and that receive write requests directed to non-sequential logical block addresses and writing the write requests to sequential disk block addresses in a storage system include an overprovision of a storage system to include an increment of additional storage space such that it is more likely a large enough sequential block of storage will be available to accommodate incoming write requests.

Abstract: Embodiments of the present invention generally provide for multi-dimensional disk arrays and methods for managing same and can be used in video surveillance systems for the management of real-time video data, image data, or combinations thereof.

Abstract: Some embodiments of the present invention provide methods, computer media encoding instructions, and systems for receiving write requests directed to non-sequential logical block addresses and writing the write requests to sequential disk block addresses in a storage system. Some embodiments further include overprovisioning a storage system to include an increment of additional storage space such that it is more likely a large enough sequential block of storage will be available to accommodate incoming write requests.

Abstract: Embodiments of the present invention generally provide for multi-dimensional disk arrays and methods for managing same and can be used in video surveillance systems for the management of real-time video data, image data, or combinations thereof.

Abstract: Some embodiments of the present invention provide methods, computer media encoding instructions, and systems for receiving write requests directed to non-sequential logical block addresses and writing the write requests to sequential disk block addresses in a storage system. Some embodiments further include overprovisioning a storage system to include an increment of additional storage space such that it is more likely a large enough sequential block of storage will be available to accommodate incoming write requests.

Abstract: Embodiments of the present invention generally provide for multi-dimensional disk arrays and methods for managing same and can be used in video surveillance systems for the management of real-time video data, image data, or combinations thereof.

Abstract: A system according to an embodiment of the present invention includes at least two virtual machines running on a hardware platform using either a hosted or a bare metal hypervisor. The virtual machines may communicate with an agent-server resident in the host operating system or in one of the virtual machines to switch control of the hardware component, such as graphics hardware, from one virtual machine to another.

Abstract: Some embodiments of the present invention provide methods, computer media encoding instructions, and systems for receiving write requests directed to non-sequential logical block addresses and writing the write requests to sequential disk block addresses in a storage system. Some embodiments further include overprovisioning a storage system to include an increment of additional storage space such that it is more likely a large enough sequential block of storage will be available to accommodate incoming write requests.

Abstract: This patent application is for an apparatus to safely expose guinea pigs and other small animals to biohazardous aerosol. It is composed of three main chambers housed in an outer box which fits within a conventionally sized biosafety cabinet. The animal chamber contains a removable housing unit for four or eight guinea pigs. The aerosol chamber is separate to minimize fur contamination. The nebulizer chamber is also sealed to reduce risks from leakages. This apparatus is easily decontaminated by immersion in disinfectant. The first version of the prototype, tentatively named the AXS1, has been tested for safety, ergonomics, efficiency of rodent exposure to bacteria, airflow, access points, seal mechanisms, and size.

Abstract: A method for operating a data storage system is described. A request is issued that an ownership attribute of a logical arrangement of storage space associated with a first storage system be associated with a second storage system. In response to the request, the ownership attribute is changed to a state of unowned. In response to the request and in response to the state of unowned, the ownership attribute of the logical arrangement of storage space is changed to a new set of attributes associated with the second storage system to change ownership of the logical arrangement of storage space from the first storage system to the second storage system.

Abstract: The invention provides a method and system for re-establishing sessions between a server and its clients following a failure of the server, planned reboot of the server, or takeover by another server. At critical points within a server/client session, state is saved so as to be reliable and consistent. Upon reboot of the system, state is restored using that which was saved; returning the server to its pre-crash state and preserving sessions that were in progress prior to the reboot. Additionally, state saved by a first sever prior to failure or elective shutdown can be transferred to a second server in a takeover configuration also preserving sessions in progress.

Abstract: A system and method for a file server to allocate spare disks in a network storage system. The method determines the available spare disks and first selects those disks that satisfy one or more required rules. The method sorts the spare disks by a set of ordered policies to determine a highest-ranked disk that is then selected as the spare to be utilized. If multiple disks are equally ranked, one of the equally ranked disks is randomly chosen to be the spare disk allocated.

Abstract: An embodiment of the invention provides an apparatus that includes a primary node, a secondary node, and an intermediate node. Data is synchronously copied from the primary node to the intermediate node, and data is asynchronously copied from the intermediate node to the secondary node. The data stored in the intermediate node is a subset of the data set that is stored in the primary node. Therefore, an embodiment of the invention advantageously provides a multiple hop data replication method that allows data recovery if disaster occurs at the location of the primary node. Additionally, an embodiment of the invention advantageously provides a tolerable latency value from the time that a client device sends a write request to the primary node to the time that an acknowledgement message is received by the client device.

Abstract: A data storage system, such as RAID, upgraded dynamically including multiple stages, providing error checking data without taking the system off-line. Checksums are computed from the data and placed in block 63 of the same disk. The combination of parity bits across the parity disk, the remaining uncorrupted data in the data disks, and checksums within each disk includes sufficient information to enable restoration of corrupt data. The system is upgraded by reserving permanent checksum blocks, writing the checksums to a volume block number, and placing the checksums in permanently reserved checksum block locations after first moving data already there to unreserved blocks.

Abstract: A method for controlling a steam boiler or oil heater for maximum fuel efficiency by systematically finding the most fuel-efficient combination of input control values. A characteristic multi-dimensional look-up table is created by temporarily operating the process at all the possible functional combined settings of a plurality of input operators and recording for each combination of settings the resulting output values of a plurality of process parameters, for example, steam flow, steam pressure, and exhaust composition. Input combinations resulting in either non-functional process or unacceptable output values are eliminated. Steam flow rate is the primary output control parameter. A selected value of steam flow rate is the primary control setpoint for the process. If several combinations of input values can cause the process to meet the primary control setpoint, the combination using the minimum fuel flow is selected as optimal.

Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.

Abstract: The present invention concerns a method for determining the identity of one or more single nucleotide polymorphisms (SNP) in a genome, comprising: (i) fragmenting a sample genome; (ii) contacting the fragments with an excess of a plurality of different oligonucleotide primers under conditions that permit a primer to form a duplex with a complementary region on a fragment, each primer having a predetermined sequence complementary to a sequence on the genome that is proximal to a putative SNP site, and the resulting duplexes being immobilised on a solid support; (iii) carrying out the sequencing reaction(s) and detecting the incorporation of bases onto the oligonucleotide primers to extend the primers to at least the SNP site; and (iv) comparing the resulting sequences to those of the reference one or more SNPs.

Abstract: A data storage system, such as RAID, upgraded dynamically including multiple stages, providing error checking data without taking the system off-line. Checksums are computed from the data and placed in block 63 of the same disk. The combination of parity bits across the parity disk, the remaining uncorrupted data in the data disks, and checksums within each disk includes sufficient information to enable restoration of corrupt data. The system is upgraded by reserving permanent checksum blocks, writing the checksums to a volume block number, and placing the checksums in permanently reserved checksum block locations after first moving data already there to unreserved blocks.

Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.

Abstract: The invention provides a storage system, and a method for operating a storage system, that provides for relatively rapid and reliable takeover among a plurality of independent file servers. Each file server maintains a reliable communication path to the others. Each file server maintains its own state in reliable memory. Each file server regularly confirms the state of the other file servers. Each file server labels messages on the redundant communication paths, so as to allow other file servers to combine the redundant communication paths into a single ordered stream of messages. Each file server maintains its own state in its persistent memory and compares that state with the ordered stream of messages, so as to determine whether other file servers have progressed beyond the file server's own last known state.