Abstract: Concurrently writing an uncompressed data element, if the uncompressed data element comprises an indication that it is valid, in a main hash table using a first address generated by a first hash function, and reading a first data element from the main hash table using the first address. Introducing a first pipeline delay for maintaining the uncompressed data element in a first data path until the first data element is read. Concurrently writing the first data element to a victim hash table, if the first data element comprises an indication that it is valid, using a second address generated by a second hash function, and reading a second data element from the victim hash table using a third address generated by the second hash function. Introducing a second pipeline delay for maintaining the uncompressed data element in the first data path until the second data element is read.

Abstract: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having <len, distance> data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token.

Abstract: An output sequence of data elements is processed. The output sequence of data elements represents a sequence of input data elements in a compressed format. An output data element comprises a backward reference for each string in the input data elements that occurs again in an input data element that is used to produce the output data element. A backward reference identified in a selected output data element is used for selecting the string to which it refers in the stored input data elements. The selected string is combined with strings of one or more subsequent output data elements. A matching sequence in the stored input data elements matching at least part of one or more combined strings is found. A combined string of the one or more combined strings having the longest matching sequence is selected. The backward reference is redefined to indicate the longest matching sequence.

Abstract: A method of operating a data compression device includes analyzing data using an analyzer and generating a result of the analysis, while the data is buffered by an input buffer, and selectively compressing the buffered data according to the result of the analysis. A data compression device includes a data pattern analyzer configured to analyze data transmitted to an input buffer, and generate an analysis code based on the analysis of the data; and a data compression manager configured to selectively compress the data in the input buffer based on the analysis code.

Abstract: A system operable to: receive a request for an application unit from a first device; generating a key for the application unit; look up segment cache indices corresponding to the application unit, according to the key; and determine whether the segment cache indices are available. Where the segment cache indices are available, the system may retrieve a segment cache using the segment cache indices; and then retrieve the application unit using the retrieved segment cache. Otherwise, where the segment cache indices are not available, the system may communicate the request to a second device to receive a response from the second device including the segment indices. Further, the system may receive the response from the second device; store a segment index sequence for the application unit in an application optimizer cache based on the response; and retrieve the application unit via the segment index sequence.

Abstract: In an embodiment, a first individual image and a second individual image constituting an encoded stereoscopic image, for example in JPEG format with respective levels of encoding quality and united in a multiple-image file, for example of the Multiple-Picture Object (MPO) type. The second level of encoding quality is lower than the first level of encoding quality. During decoding, the first individual image encoded with a first level of encoding quality and the second individual image encoded with a second level of encoding quality lower than the first level of encoding quality are extracted from the multiple-image file, then using information of the first extracted individual image for enhancing the second extracted individual image.

Abstract: Computer-executed method for losslessly compressing and decompressing electronic media data. The method is executed in four phases. During the initial phase, the most significant bits are removed. During the second phase, data segments capable of occupying less space are replaced with a nominator of a fixed field of denominators, and the resultant data is hashed. In the third phase, the hashed data is compressed using an entropy reduction technique. In the fourth phase, the compressed data is stored using an arithmetic coding. Multiple passes may be performed, therefore increasing the compression ratio.

Abstract: A method of compressing digital data comprising the steps of: (i) reading digital data as series of binary coded words representing a context and a codeword to be compressed; (ii) calculating distribution output data for the input data and assigning variable length codewords to the result; and (iii) periodically recalculating the codewords in accordance with a predetermined schedule, in order to continuously update the codewords and their lengths.

Abstract: A protected querying technique involves creating shingles from a query and then fingerprinting the shingles. The documents to be queried are also shingled and then fingerprinted. The overlap between adjacent shingles for the query and the documents to be queried is different, there being less, or no overlap for the query shingles. The query fingerprint is compared to the fingerprints of the documents to be queried to determine whether there are any matches.

Abstract: Methods and apparatus for wireless communication in a mobile device that includes receiving a transmission data packet and detecting a string of bytes in the transmission data packet that matches a preset string of bytes saved in a memory component. Aspects of the methods and apparatus include replacing the string of bytes of the transmission data packet that has been determined to match the preset string of bytes saved in the memory component with a location pointer, wherein after replacing the string of bytes in the data packet with the location pointer, the data packet comprises the location pointer and a set of literal bytes. Aspects of the methods and apparatus also include generating a compressed transmission data packet by entropy coding the transmission data packet comprising the set of literal-bytes and the location pointer.

Abstract: A method includes: unifying plural types of substitution tables in each of which a substitution source string and a substitution destination string are mapped to each other into a single substitution table; constructing a prefix tree to incorporate the substitution source string registered in the single substitution table, a string in the prefix tree represented by characters of a label assigned to plural branches on route from a root node to a certain node is identical to the substitution source string mapped to the substitution source string; performing addition of a link failure directing from a first node to a second node for all nodes included in the prefix tree under a certain condition; and searching the substitution source string included in the target string by repeating migration between nodes in the prefix tree based on a certain condition to record identification information assigned to a node before migration.

Abstract: Sub-block partitioning for hash-based deduplication is performed by defining a minimal size and maximum size of the sub-block. For each boundary start position of the sub-block, starting a search, after the minimal size of the sub-block, for a boundary position of a subsequent sub-block by using multiple search criteria to test hash values that are calculated during the search. If one of the multiple search criteria is satisfied by one of the hash values, declaring the position of the hash value as a boundary end position of the sub-block. If the maximum size of the sub-block is reached prior to satisfying one of the multiple search criteria, declaring a position of an alternative one of the hash values that is selected based upon another one of the multiple search criteria as the boundary end position of the sub-block.

Abstract: There is an approach for generating a pattern-based database. The approach includes accessing a log specifying one or more strings representing data having a dynamic portion and a static portion. The approach also may include generating a pattern-based database, including one or more records representing compression of the data, by determining the dynamic portions and the static portions of the strings. The approach also may include assigning pattern values to the strings based on the determined dynamic portions and the static portions. The pattern values may be configured to provide compression of the strings within the records of the pattern-based database.

Abstract: In one aspect, a method includes marking a list of locations currently being shipped to a replica site, generating course granularity hash signatures of data for each area of memory in the snapshot volume, generating fine granularity hash signatures of data for each subarea of memory in the snapshot volume, sending course granularity hash signatures to the replica site for each area not being changed in a production volume and sending fine granularity hash signatures to the replica site for each area being changed in the production volume. The snapshot volume is a snapshot of the production volume.

Abstract: A bit allocating method is provided that includes determining the allocated number of bits in decimal point units based on each frequency band so that a Signal-to-Noise Ratio (SNR) of a spectrum existing in a predetermined frequency band is maximized within a range of the allowable number of bits for a given frame; and adjusting the allocated number of bits based on each frequency band.

Abstract: Performing a write operation or a read operation in a memory system may include compressing data of a first size unit, generating a plurality of types of Error Checking and Correction (ECC) information based on the compressed data, combining the compressed data and the plurality of types of ECC information in units of a second size, and writing the information combined in units of the second size into a memory device.

Abstract: A method and system a method for compressing and searching a plurality of strings. The method includes inputting a plurality of strings into a compression engine. The method also includes converting each of the plurality of strings into a new, prefix-preserving compressed string, using the compression engine. For every string P that is a strict prefix of a string S, P's resulting compressed string is a strict prefix of S's resulting compressed string.

Abstract: In a method of perceptual transform coding of audio signals in a telecommunication system, performing the steps of determining transform coefficients representative of a time to frequency transformation of a time segmented input audio signal; determining a spectrum of perceptual sub-bands for said input audio signal based on said determined transform coefficients; determining masking thresholds for each said sub-band based on said determined spectrum; computing scale factors for each said sub-band based on said determined masking thresholds, and finally adapting said computed scale factors for each said sub-band to prevent energy loss for perceptually relevant sub-bands.

Abstract: Systems and methods for encoding and decoding are disclosed. The systems and methods include multimedia decoder instantiation systems and multimedia processing engines which are capable of being upgraded or reconfigured to support a new or previously-unsupported compression format, without the need for platform-specific software or hardware upgrades.

Abstract: The present invention is to provide a method and system for compression and decompression text comprising: creating a redundant universal permanent reference vocabulary which include commonest symbols utilized by all application, and symbols found in thousands of books, specific, professional vocabularies and is created in advance of any information processing, own vocabulary containing during process of text compression and decompression wherein the own vocabulary includes words and symbols e.g.

Abstract: Methods and apparatuses for generating compressed test data for use by a tester, decompressing the test data during test, and routing the decompressed test data into a set of scan chains within a circuit under test are described.

Abstract: For the signal under acquisition which varies monotonically before and after the trigger time, a method for full-digital random sampling employs first sampled data before the trigger time and first sampled data after the trigger time to fit a curve, and obtains an intersection point of triggering level and the fitted curve, then, calculates the time interval between sampled data after the trigger time and the intersection point in the end, reconstructs the original signal, i.e. the signal under acquisition by a time interval of each acquisition. Thus, an analog trigger circuit and a time measurement circuit of conventional random sampling system can be eliminated, that simplifies the circuit design of data acquisition system and decreases its hardware complexity. Moreover, the higher sampling rate for the signal under acquisition is attained, and more waveform details are obtained.

Abstract: Presented is a data channel with selectable components, such as encoders or decoders. Also, data having different data signal characteristics can be processed through a data channel based on the data signal characteristics. Further, a data channel may have independent encoding path and an independent decoding path. For example, a first data transmission having first data signal characteristics may be processed via a data channel based on a first selected set of components of the data channel and a second data transmission having second data signal characteristics different than the first data signal characteristics may be processed via the data channel using a second selected set of components in the data channel. The first selected set of components may be different than the second selected set of components, but may share one or more common components.

Abstract: Detecting track information involves receiving first and second overlapping track signals from first and second read elements that read first and second tracks from a data storage medium. Information of the first and second tracks is estimated using the respective first and second track signals. An improved information estimate of the first track is obtained using the first track signal and the estimated information of the second track, and an improved information estimate of the second track is obtained using the second track signal and the estimated information of the first track. First and second track data are decoded using the respective improved information estimates of the first and second tracks.

Abstract: A first computer system calculates a first value as a function of a data block. A second computer system compares the calculated first value with each of a plurality of values in a plurality of entries, respectively. The plurality of entries include a plurality of storage location pointers, respectively, that correspond to a plurality of data blocks, respectively, that were transmitted to a storage system before the first computer system calculated the first value. If the first value compares equally to a value contained in one of the plurality of entries, a storage location pointer of the one entry is transmitted to the storage system, wherein the storage location pointer corresponds to a copy of the data block that was sent to the storage system before the first computer system calculated the first value. If the calculated first value does not compare equally with any value contained in the plurality of entries, the first computer system transmits the data block to the storage system.

Abstract: A system, method, and apparatus for compressing binary code comprising at least a processor, memory, storage, and an encoding device or decoding device or both. The methods include comparing a given binary code string having a certain size to be compressed or decompressed with a table comprising all possible combinations of zeroes and ones for any binary data of size x. The given binary code string and all possible combinations are partitioned in packets of size y and each packet assigned a value. A second value representing an assembly of all the values into a second value is performed. The assembly may be performed n times to obtain an nth value. The second or nth value is transmitted or received or both by the encoding and decoding devices, respectively, in place of the given binary code. Table comparison may be performed using pattern recognition.

Abstract: A method and apparatus for determining one or more compression parameters suitable to compress a class of signals, may include inputting a test data set, being representative of a data set to be compressed, characterizing the test data, selecting a compression algorithm, calculating a distortion level to be used in determining the compression ratio (or a compression ratio to be used in determining the distortion level), generating a computer implemented model for the test data, selecting a recommended operating point based on a computer implemented model, and determining compression parameters corresponding to the operating point. The compression parameters may subsequently be applied for configuration of compression applied to one or more production data sets that are similar to the test data. This abstract does not limit the scope of the invention as described in the claims.

Abstract: The present invention relates to a Brillouin optoelectronic measurement method comprising the step of, providing a signal (s1) in an optical fiber (100), wherein said signal (s1) is time-frequency coded. The present invention further relates to a corresponding device for use in such a method.

Abstract: In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

Abstract: A method, article of manufacture, and apparatus for processing queries, comprising performing a query with a first memory intensive allocation, receiving an indication that a memory intensive operator spilled to a first storage device, adjusting a resource queue memory allocation based on the indication, computing a second memory intensive allocation based on the adjusted resource queue memory allocation, and storing the second memory intensive allocation in a second storage device.

Abstract: A storage apparatus comprises a storage unit configured to store data which is read/written by the host apparatus, a compression/expansion unit configured to compress the data using a predetermined algorithm to generate compressed data, and expand the compressed data, and a control unit configured to control writing of data to the storage unit, wherein the control unit is configured to manage, as compression block units, divided compressed data which is obtained by dividing compressed data compressed by the compression/expansion unit into predetermined units, and padding data.

Abstract: The processing of a first data stream to generate a second stream conforming to a remote desktop protocol (RDP) is described. Operations may include facilitating storage of first data from the first stream at a first index indicated in the first stream, facilitating retrieval of second data from a second index included in the first stream, and facilitating generation of the second stream conforming to the RDP and including the first and second data. Additionally, the processing of a third data stream conforming to the RDP to stream a fourth stream is described. Operations include facilitating processing of the third stream to identify a package data unit (PDU), facilitating storing of a hash value corresponding to the PDU, and facilitating generating an altered PDU for inclusion in the fourth stream and including an index identifying a location in memory storing the hash value.

Abstract: Disclosed is a system and methods for data compression and decompression. The systems and methods discussed herein include an encoder, dictionary, decoder, literal string and control output. The discussed systems and methods encode data transmitted over a communications channel through the use of a dynamically compiled dictionary. Upon reviewing the characters within the transmitted data in view of the dictionary, an encoded/compressed output string is created. Such output string may also be decoded in a similar fashion via a dynamically compiled dictionary.

Abstract: A method of recovering a value of a symbol received through an optical communications system. A multi-bit estimate of the symbol is subdivided into a first part and a second part, each part including at least one respective bit of the estimate. A most likely value of the first part is detected. The most likely value of the first part is processed using a Forward Error Correction (FEC) decoder to generate a corrected first part value, which is used to detect a most likely value of the second part. The most likely value of the second part is then processed by the FEC decoder to generate a corrected second part, which is combined with the corrected first part to recover the value of the symbol.

Abstract: A computer program product is provided and includes a tangible storage medium readable by a processing circuit and on which instructions are stored for execution by the processing circuit for performing a method. The method includes initially verifying a presence of parameters passed to a parameter database and that a selected group of the parameters are greater than or equal to zero, parsing optional block data to validate the optional block data, determine a length thereof and a number of optional blocks contained therein and proceeding with one of a secondary info-parsing and a secondary data-parsing operation with respect to the optional block data in accordance with content of the parameters passed to the parameter database.

Abstract: A system to collect performance data and store it in a special data structure which records the metadata in the structure itself. The performance data for each day is recorded in time-series, converted into Unicode, and stored in a single directory. The performance metric data is compressed prior to transmission to a server over any data path. The data structure at the server where analysis is done has a subdirectory for every resource type. Each subdirectory contains text files each of which stores performance metric data values for a group of attributes with one section per attribute. The performance metric data values are recorded as a comma delimited list. Analysis of the performance metric data is done using regular expressions.

Abstract: A system to collect and analyze performance metric data recorded in time-series measurements, converted into unicode, and arranged into a special data structure. The performance metric data is collected by one or more probes running on machines about which data is being collected. The performance metric data is also organized into a special data structure. The data structure at the server where analysis is done has a directory for every day of performance metric data collected with a subdirectory for every resource type. Each subdirectory contain text files of performance metric data values measured for attributes in a group of attributes to which said text file is dedicated. Each attribute has its own section and the performance metric data values are recorded in time series as unicode hex numbers as a comma delimited list. Analysis of the performance metric data is done using regular expressions.

Abstract: A first value is calculated as a function of data in an nth data block of a backup copy. The first value is then compared with each of a plurality of values in a plurality of entries, respectively, of a first data structure. The plurality of entries in the first data structure include a plurality of pointers, respectively, that correspond to a plurality of data blocks, respectively, in a storage system. If the first value compares equally to a value contained in one of the plurality of entries of the first data structure, a pointer of the one entry is added to an nth entry of a second data structure. This pointer corresponds to a copy of the nth data block that is stored in the storage system. If the first value does not compare equally with any value contained in the plurality of entries of the first data structure, (1) the nth data block is stored in the storage system, and (2) a first pointer is added to the nth entry of the second data structure.

Abstract: Systems and methods for performing compression of data. A data buffer is separated into equal-sized segments of data. A frequency count is performed to determine how often each segment of data appears in the data buffer. Frequently occurring segments are encoded with unique compression codes, while all other infrequently occurring segments are encoded with a common compression code. The compressed data buffer includes the compression codes, which are all of the same bit-length, and the uncompressed segments. The compression codes and the uncompressed segments are stored in the compressed data buffer in the order in which the corresponding segments appear in the original data buffer.

Abstract: A method for accelerating time series data base queries includes segmenting an original time series of signal values into non-overlapping chunks, where a time-scale for each of the chunks is much less than the time scale of the entire time series, representing time series signal values in each chunk as a weighted superposition of atoms that are members of a shape dictionary to create a compressed time series, storing the original time series and the compressed time series into a database, determining whether a query is answerable using the compressed time series or the original time series, and whether answering the query using the compressed time series is faster. If answering the query is faster using the compressed representation, the query is executed on weight coefficients of the compressed time series to produce a query result, and the query result is translated back into an uncompressed representation.

Abstract: To detect duplicative hierarchically arranged sets of files in a storage system, a method includes generating, for hierarchically arranged plural sets of files, respective collections of values computed based on files in corresponding sets of files. For a further set of files that is an ancestor of at least one of the plural sets of files, a respective collection of values that is based on the collection of values computed for the at least one set is generated. Duplicative sets according to comparisons of the collections of values are identified.

Abstract: A compression algorithm is disclosed in which compressibility of an input frame is determined. If a frame is found to be compressible, it is input to a compression algorithm, otherwise the frame may bypass the compression algorithm. Literals of length N bits in a frame are sorted into 2^N bins such a counter Bi indicates a number of literals of value i. The maximum and minimum counter values are evaluated to estimate the compressibility of the file. For example, if Bmax is the maximum counter value and Bmin is the minimum counter value, then If Bmax<A*Bmin (A being a value greater than 1, e.g. 4), the frame may be deemed to be uncompressible, otherwise the frame may be deemed to be compressible and compressed according to the DEFLATE algorithm or some other compression algorithm.

Abstract: A player decodes and renders encoded digital data received from an encoder. During processing, the player periodically monitors dropped frames as well as time spent. If the dropped frames are below a minimum, the player determines to signal the encoder to increase bit rate or frame rate by consulting a table. If the player determines to increase bit rate, the player signals accordingly. However, if the player determines to increase frame rate, the player first verifies that the spent time is below a minimum. To the contrary, if the dropped frames are both above the minimum and a first maximum but not a second maximum, the player determines to signal the encoder to decrease bit rate or frame rate by consulting the table and signaling accordingly. However, if the dropped frames are above the second maximum, the player signals the encoder to decrease the frame rate without consulting the table.

Abstract: A computer implemented method, computer program product, and system for decompressing compressed data. The system (400) has an interface component (420) configured to access and read a compressed data set (310) encoded with a LZW based compression algorithm. The compressed data set (310) includes a sequence of elements including byte characters (B) and symbols (S1/S2), each symbol corresponding to an encoded subset of the data set, and each symbol having a first portion (S1) including a previous symbol or a byte character and having a second portion (S2) including a byte character. The system further has a decoder (410) configured to generate a decompressed data set (320) by applying a LZW based decompression algorithm to the compressed data set (310) The decoder (410) makes use of a reverse order stack (440) configured for intermediate storage of byte characters decoded by the decoder (410) from the compressed data set (310).

Abstract: An apparatus and method for providing a game service in cloud computing environment. A method may be provided for providing a streaming game service using a plurality of cloud computing servers. The method may include receiving user inputs from at least one user equipments, executing and progressing at least one game program in response to the user inputs, capturing audio and video data as progress results of the executed at least one game program, and streaming the captured audio and video data to a respective user equipment.

Abstract: The present invention is directed toward methods and systems for data de-duplication. More particularly, in various embodiments, the present invention provides systems and methods for data de-duplication that may utilize a vectoring method for data de-duplication wherein a stream of data is divided into “data sets” or blocks. For each block, a code, such as a hash or cyclic redundancy code may be calculated and stored. The first block of the set may be written normally and its address and hash can be stored and noted. Subsequent block hashes may be compared with previously written block hashes.

Abstract: A CODEC includes a transmission path between an encoder and a decoder. The encoder receives bits of data in a first form in which each bit of the data is represented by switching between first and second logic states and no voltage change between consecutive bits of the same logic state and serially transmits the bits in a second form in which the first logic state is maintained at a high voltage, the second logic state is maintained at a low voltage, and an intermediate voltage is maintained between consecutive bits. The decoder receives the bits in the second form and derives a clock from the occurrences of the intermediate voltage. The clock, repetitively, is maintained at a logic high, then switches directly from the logic high to a logic low, then is maintained at the logic low, and then switches directly between the logic low and the logic high.

Abstract: An apparatus and an article of manufacture for controlling a voice site using a haptic input modality include validating a haptic input from an instrument capable of accessing a voice site, processing the haptic input on a server to determine a voice site command corresponding to the haptic input, and processing the voice site command at the server to control an interaction with the voice site.

Abstract: Provided are techniques for detecting a mapping, by a universal convertor, of a first character set to a second character set and of the second character set to a third character set; monitoring, logging, and analyzing code set conversion (CSC) operations; generating a updated character set conversion module from the first character set to the third character set in response to the detecting and a determination that the CSC operation exceed the predefined threshold; and storing the updated character set conversion module for utilization of subsequent processing of the first character set to the third character set.

Abstract: A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed.