Abstract: In an embodiment of the present invention, the computational efficiency of decoding of block-sorted compressed data is improved by ensuring that more than one set of operations corresponding to a plurality of paths through a mapping array T are being handled by a processor. This sequence of operations, including instructions from the plurality of sets of operations, ensures that there is another operation in the pipeline if a cache miss on any given lookup operation in the mapping array results in a slower main memory access. In this way, the processor utilization is improved. While the sets of operations in the sequence of operations are independent of another other, there will be an overlap of a plurality of the main memory access operations due to the long time required for main memory access.

Abstract: A client stores a first set of workspace data, and is coupled via a computer network to a global server. The client may be configured to synchronize portions of the first set of workspace data with the global server, which stores independently modifiable copies of the portions. The global server may also store workspace data which is not downloaded from the client, and thus stores a second set of workspace data. The global server may be configured to identify and authenticate a user seeking global server access from a remote terminal, and is configured to provide access to the first set or to the second set. Further, services may be stored anywhere in the computer network. The global server may be configured to provide the user with access to the services. The system may further include a synchronization-start module at the client site (which may be protected by a firewall) that initiates interconnection and synchronization with the global server when predetermined criteria have been satisfied.

Abstract: The present invention provides sequences and reagents for preparing microarrays with internal controls. Specifically, the present invention defines and provides sequences that are not present in the hybridizing mRNA or cDNA, and therefore can be used both as hybridization controls and for inter-spot normalization.

Abstract: The present invention provides sequences and reagents for preparing microarrays with internal controls. Specifically, the present invention defines and provides sequences that are not present in the hybridizing mRNA or cDNA, and therefore can be used both as hybridization controls and for inter-spot normalization.

Abstract: Data storage techniques particularly well-suited for use in archival data storage are disclosed. In one aspect of the invention, a data block is processed to generate an address as a function of the contents of the data block, and the data block is then stored in the system in a memory location identified by the address. The processing operation is configured to provide write-once archival storage of the data block, in that the contents of the data block are not modifiable without also altering the address of the data block determinable in the processing operation. In an illustrative embodiment, the processing of the data block involves determining a substantially unique identifier of the data block by applying a collision-resistant hash function to the contents of the data block, and the address is subsequently determined from the substantially unique identifier by utilizing the identifier to perform a lookup of the address in an index.

Abstract: Aspects of the invention provide for information to be synchronized in an asynchronous manner among two or more computing devices.

Abstract: Data storage techniques particularly well-suited for use in archival data storage are disclosed. In one aspect of the invention, a data block is processed to generate an address as a function of the contents of the data block, and the data block is then stored in the system in a memory location identified by the address. The processing operation is configured to provide write-once archival storage of the data block, in that the contents of the data block are not modifiable without also altering the address of the data block determinable in the processing operation. In an illustrative embodiment, the processing of the data block involves determining a substantially unique identifier of the data block by applying a collision-resistant hash function to the contents of the data block, and the address is subsequently determined from the substantially unique identifier by utilizing the identifier to perform a lookup of the address in an index.

Abstract: A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios without the deleterious effects, e.g., the effect of packet loss multiplying, of prior compression schemes. More particularly, a so-called acknowledgment scheme is employed in conjunction with the specific compression algorithm such that the transmitter, i.e., sender, can limit the history used by the compression algorithm to those packets that are correctly received. In particular, a vector identifying the packets used as the history is included in the compressed packet thereby enabling the receiver to reconstruct the packet history state necessary to decompress the packet. Advantageously, increased robustness and greater compression ratios are achieved independent of any particular one compression scheme.

Abstract: A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios. More particularly, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. Further, the per-packet hash table indexes particular byte strings in the packet but does not index data in any other packet(s). That is, a respective separate hash table for each packet is employed wherein such hash table is constructed as the particular packet is compressed. As such, the respective hash table is encoded with the particular packet. Employing a per-packet hash table in combination with variable history state inter-packet compression provides for efficient and robust overall compression of the packets.