Abstract: Preparing data for deduplication including in response to receiving a request to transfer data from a source storage system to a target storage system, accessing, by the source storage system, a compressed data block; generating, by the source storage system, a padded compressed data block by padding the compressed data block to conform to a fixed block size, wherein the fixed block size is greater than a size of the compressed data block; and sending, by the source storage system, the padded compressed data block to the target storage system.

Abstract: Compressing data includes hashing a first token length of an incoming data steam into a hash table, where the first token length includes a plurality of bytes. A second token length of the incoming data stream may be hashed into the hash table. The second token may be larger than the first token length and includes the plurality of bytes. The method may further include automatically comparing which token length enabled more efficient data compression, and automatically adjusting at least one of the first and second token lengths based on the comparison.

Abstract: An encoder and a decoder respectively encode and decode signal and syntax elements to/from a bitstream. In the encoding/decoding, semantics for the syntax elements are derived in accordance with previously decoded signal samples. Such encoding/decoding is applicable for instance to a video or audio signal.

Abstract: A storage device is disclosed. The storage device may comprise storage for input encoded data. A controller may process read requests and write requests from a host computer on the data in the storage. An in-storage compute controller may receive a predicate from the host computer to be applied to the input encoded data. A transcoder may include an index mapper to map an input dictionary to an output dictionary, with one entry in the input dictionary mapped to an entry in the output dictionary, and another entry in the input dictionary mapped to a “don't care” entry in the output dictionary.

Abstract: In the field of data filtering the invention discloses a method of filtering data and a data filter (1), both with optional features, which assess network data using a number of criteria to refine it to a format appropriate for a user.

Abstract: In various example embodiments, a system and method for correction of user input are presented. In one embodiment, a method includes receiving a plurality of user strings, selecting one or more string pairs from the plurality of user strings based on a character operator difference between the first string and the second string being below a threshold number, filtering the one or more string pairs to generate a filtered set of strings pairs representing corrections, and correcting user input in a different session by replacing input that matches a first string in a filtered string pair with a second string in the filtered string pair.

Abstract: A frequency encoded source imaging system includes an EEG or MEG sensor array and a processing system for analyzing the signals from the sensor array in at least two different frequency bands, where the analysis is localized with respect to a three-dimensional grid corresponding to the portion of the human body. Alternately, a frequency encoded source imaging system includes an EEG or MEG sensor array and a processing system for analyzing the signals from the sensor array in a high-definition frequency band comprising frequencies greater than 70 Hz, where the analysis is localized with respect to a three-dimensional grid corresponding to the portion of the human body.

Abstract: Partition information associated with partition(s) in a sliding window and an uncompressed value associated with a repeated sequence in the sliding window are received. A compressed value is generated using the uncompressed value, including by: generating the set indicator based at least in part on the partition information and the uncompressed value; determining, based at least in part on the partition information and the uncompressed value, whether the uncompressed value includes an extraneous bit; and generating the intra-set information, including by: in the event it is determined that the uncompressed value includes the extraneous bit, excluding the extraneous bit in the uncompressed value from the intra-set information. The compressed value is output.

Abstract: Techniques for searching a corpus of textual data using probabilistic data structures are described herein. The corpus of textual data is indexed using the probabilistic data structure on a piece-by-piece basis and the pieces are combined so that the textual data can be searched. The search results are returned, indicating a likelihood that the data item is in the textual data.

Abstract: Embodiments are generally directed to message authentication code (MAC) based compression and decompression. An embodiment of an apparatus includes one or processors to process data; and a computer memory; wherein the one or more processors are to perform compression of a fixed transmission or storage unit, the transmission or storage unit including multiple slots, the compression of the transmission or storage unit including the one or more processors to calculate a MAC for data in the transmission or storage unit, determine whether a special value is present in any slot of the transmission or storage unit, and upon determining that the special value is present in a respective slot of the transmission or storage unit, remove the special value from the transmission or storage unit, shift remaining data of the transmission or storage unit to provide room in a first slot the transmission or storage unit, and insert the MAC in the first slot to generate a compressed transmission or storage unit.

Abstract: Embodiments of the present disclosure introduce an offset-based representation for a computation graph of a neural network model. In this representation, the edges in the graph are implemented as offsets to the base address of the graph when the model is loaded into memory rather than pointers to address locations in memory. By replacing the pointer fields with offsets, the model in memory is no longer dependent on the allocation of memory. This overcomes the limitations of performance and/or power that is critical for comparing two models and copying a model to another memory location in latency sensitive applications and in mobile environments.

Abstract: Delta compression method, system and computer program product. Portions of source and target data files are hashed using a hashing function. A target data file is compared against the source data file to determine at least one delta difference between the files. A source data file hashing table is generated. The table includes hashed portions of the source and target data files stored in corresponding source file offset locations and corresponding target file offset locations, respectively. Portions of the source and target files are compared using corresponding source and target file offset locations. At least one common sequence of characters in the portions of the source and target files is determined based on the comparison. A patch file is generated based on the determined sequence of characters.

Abstract: Examples described herein relate to a decompression engine that can request compressed data to be transferred over a memory bus. In some cases, the memory bus is a width that requires multiple data transfers to transfer the requested data. In a case that requested data is to be presented in-order to the decompression engine, a re-order buffer can be used to store entries of data. When a head-of-line entry is received, the entry can be provided to the decompression engine. When a last entry in a group of one or more entries is received, all entries in the group are presented in-order to the decompression engine. In some examples, a decompression engine can borrow memory resources allocated for use by another memory client to expand a size of re-order buffer available for use. For example, a memory client with excess capacity and a slowest growth rate can be chosen to borrow memory resources from.

Abstract: In one embodiment, an apparatus includes: a compression circuit to compress data blocks of one or more traffic classes; and a control circuit coupled to the compression circuit, where the control circuit is to enable the compression circuit to concurrently compress data blocks of a first traffic class and not to compress data blocks of a second traffic class. Other embodiments are described and claimed.

Abstract: Systems, methods, and apparatuses for installing a software product using timestamp validation and system identification validation are disclosed. An example method to lock a software product in a software wrapper includes determining a unique hard drive serial number of a user device to which the software product is to be installed and generating a hash number of the unique hard drive serial number. The example method also includes determining a campaign identifier of the software product from a secure variable within the software product and generating a date-time code based on a current date and time. The method further includes assembling the date-time code and the campaign identifier into an unlock code, encrypting the unlock code using the hash number as a passphrase key to create an encrypted unlock code, and applying the encrypted unlock code to an end of a filename of an installer using a command line parameter.

Abstract: Embodiments of the present disclosure provide a data query method and apparatus, which implement a technical effect that data meeting a precision requirement is queried according to a user's requirement of for data precision. The method includes: receiving a query instruction that includes a query condition and query precision; determining a data partition that meets the query condition; determining a data sub-partition corresponding to the query precision from the data partition; and querying data in the data sub-partition to obtain a query result.

Abstract: A method for processing a vide signal according to the present invention comprises: determining a length of a current string, which is decoded on the basis of a sample string matching technique in a current block; determining a reference string on the basis of at least one between the length of the current string and a string vector for the current string; and predicting the current string using the reference string.

Abstract: A data compressor with a hash computing hardware configured to evaluate the hash value for the current hash key extracted from a source data string, obtain a hash line corresponding to the hash value from a hash table, and perform hash key comparison to find at least one matching hash key. The hash line includes a prefix address column that stores a prefix address. Each entry of the hash line is provided to store a hash key and an offset. The hash computing hardware evaluates an address of the at least one matching hash key by combining the prefix address and an offset of the at least one matching hash key, and the offset of the at least one matching hash key is obtained from an entry storing the at least one matching hash key.

Abstract: Methods, devices and computer program products facilitate the storage, access and management of log files that are associated with particular client devices. The log files provide a record of user or client device activities that are periodically sent to a data backup center. A dedicated log file server facilitates the processing and storage of an increasingly large number of log files that are generated by new and existing client devices. A storage server pre-processes the received log files to facilitate the processing and storage of the log files by the log file server. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Abstract: Techniques herein map between key spaces to generate a balanced adaptive resolution histogram for dataset partitioning. In embodiments, a computer (C) creates a mapping that associates sparse keys (SKs) with distinct dense keys. C constructs a trie by processing each item of a dataset as follows. Based on the item, C obtains an SK. C navigates from a root NT (node of the trie) to a particular NT based on a sequence of dense digits (SDD). Each dense digit of the SDD is based on the mapping. Each NT identifies a dense prefix comprising dense digits. C assigns the item to a target node based on a threshold and count of items assigned to a subtree rooted at the particular node. C determines a range of SKs for each partition of the dataset, based on: an item count for a node or subtree, dense prefixes of NTs, and the mapping.

Abstract: A method of delivering advertising items to a client at a portable device is provided. A client ID is sent to a host server. A downloaded advertising item is produced relative to a product or service from the host server. The downloaded advertising item is parsed and stored. In response to the parsing and storing, displaying the advertising item is displayed to the client at the mobile device.

Abstract: A computer-implemented method, a computer program product, and a computer system for reordering a sequence of files based on compression rates in data transfer. A host determines predicted compression rates of first files that are to be saved onto a first tape, based on a relationship between compression rates and file attributes of second files that have been saved on a second tape. The host reorders a sequence of the first files stored in host cache storage and generates a new sequence of transferring the first files from the host cache storage to the tape drive hosting the first tape, based on the predicted compression rates of the first files. The host transfers the first files to the tape drive hosting the first tape and writes the first files to the first tape, according to the new sequence.

Abstract: In one aspect, the present disclosure relates to a method of de-duplicating data in a solid state storage device. The method can include receiving a block of data to be written to a solid state storage device, wherein the block of data comprises header portion and a payload, wherein the header portion comprises context information; and determining whether the payload should be de-duplicated prior to storage, based on the context information stored within the header portion; if the payload is determined to be de-duplicated, de-duplicating the payload; and storing the de-duplicated payload to the solid state storage device.

Abstract: Techniques for genetic programming based compression determination are described herein. An aspect includes adding a first plurality of randomly generated compression algorithms to a first set of compression algorithms. Another aspect includes determining a respective mutated version of each of the first plurality of randomly generated compression algorithms. Another aspect includes adding the determined mutated versions to the first set of compression algorithms. Another aspect includes evaluating and ranking the first set of compression algorithms based on respective achieved degrees of compression.

Abstract: Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.

Abstract: A processor receives statistical information about a data set included in a column of a data table. The processor receives additional information about the data set that indicates a data format utilized by the data set and a type of information represented by the data set. The processor generates a data dictionary for compression of the data set based, at least in part, on the statistical information and the additional information. The data dictionary is created such that the data dictionary is capable of compressing data that is statistically predicted to be received at a future point.

Abstract: A system and method for a non-transient computer readable medium containing program instructions for causing a computer to perform a method for compressing data comprising the steps of receiving a data string for compression, the data string including a plurality of data elements, creating a template based on processing the data string, the template including common information across all data elements of the data string, creating one or more entries, wherein the one or more entries include information that is different to the template, and storing the template and the one or more entries.

Abstract: A procedure and installation of the same for the control of image processing devices using only the data required; thus, avoiding saturation of the memories of the components involved and/or the communications bandwidth. The procedure and installation are simple and reliable such as not to require the involvement of an expert user or a service staff member. The procedure includes the standardization of the data identifiers for each image processing device via the identification of the identifier containing a value for each data point and checking that the scale of each data point is equivalent to a predetermined scale. The installation includes a standardization system for such purpose.

Abstract: An exemplary method for intelligent compression uses a foveated-compression approach. First, the location of a fixation point within an image frame is determined. Next, the image frame is sectored into two or more sectors such that one of the two or more sectors is designated as a fixation sector and the remaining sectors are designated as foveation sectors. A sector may be defined by one or more tiles within the image frame. The fixation sector includes the particular tile that contains the fixation point and is compressed according to a lossless compression algorithm. The foveation sectors are compressed according to lossy compression algorithms. As the locations of foveation sectors increase in angular distance from the location of the fixation sector, a compression factor may be increased.

Abstract: Disclosed is a technique for providing one or more virtual machines or one or more software containers provided by cloud services to manage a horticultural operation. The techniques include transmitting, from the image dispatcher service, the image data to a first computing instance that executes a first subprocess of an image processing pipeline. Using the first subprocess of the image processing pipeline, partially processed image data is generated from the image data. The partially processed image data resulting from the first subprocess is then transmitted from the first computing instance to a second computing instance that executes a second subprocess of the image processing pipeline. Thereafter, a fully image processed image associated with the image data is produced via at least the second subprocess of the image processing pipeline.

Abstract: Techniques to provide for improved (i.e., reduced) power consumption in an exemplary neural network (NN) and/or Deep Neural Network (DNN) environment using data management. Improved power consumption in the NN/DNN may be achieved by reducing a number of bit flips needed to process operands associated with one or more storages. Reducing the number bit flips associated with the NN/DNN may be achieved by multiplying an operand associated with a first storage with a plurality of individual operands associated with a plurality of kernels of the NN/DNN. The operand associated with the first storage may be neuron input data and the plurality of individual operands associated with the second storage may be weight values for multiplication with the neuron input data. The plurality of kernels may be arranged or sorted and subsequently processed in a manner that improves power consumption in the NN/DNN.

Abstract: A data processing system (10) for compressing gamma spectroscopy data includes a data input (18) for receiving data representing counts for each of a plurality of bins. The counts represent a set of binned gamma spectroscopy data. The data processing system (10) also includes a processor (20). The processor (20) is arranged to: read the counts in each bin; calculate a measure representative of the counts using the counts in one or more of the bins; choose, using the measure, which one of at least two compression schemes to use to compress the data representing the counts; and compress the data representing the counts according to the chosen compression scheme; and write the compressed data representing the counts to a data storage device (22).

Abstract: Provided are a computer program product, system, and method for determining real-time changes to content entered into a user interface to generate results for the content. In response to determining that entry of first content in a user input field rendered in a user interface is completed, the first content is provided to a classification program to classify into a first machine classification to provide to a rules engine to determine a first machine determined proposition. The first machine determined proposition is rendered in the user interface. A determination is made of second content in the user input field from the user that differs from the first content. The second content is provided to the classification program to classify into a second machine classification to provide to the rules engine to determine a second machine determined proposition rendered in the user interface with the second content.

Abstract: One embodiment provides a method comprising receiving an input data stream, partitioning the input data stream into a plurality of data blocks, and compressing the data blocks utilizing a plurality of processor sets. Each processor set is assigned a data block to compress. The processor sets compress in parallel to exploit inter-block parallelism. Each processor set comprises one or more processors that collaborate in compressing an assigned data block to exploit intra-block parallelism. The method further comprises writing a plurality of compressed data blocks resulting from the compressing to a storage device in encoded form.

Abstract: In some implementations, a system can optimize offline map data updates. For example, a server device in the system can determine a metric for identifying map data objects based on attributes of the map data objects. The server device can then generate a quadtree that stores the map data objects in nodes of the quadtree based on the metric. When processing an update to the map data stored at the server device, the server device can generate update data describing the updates for each node in the quadtree based on a binary difference algorithm and/or a semantic difference algorithm. The server device can select the algorithm based on which algorithm results in the smallest compressed size of the update data.

Abstract: A communications system 1 has: an eNB 20 having a feedback conditions control unit 22 that controls feedback conditions in accordance with call priority and a control unit 21 that controls communications with a mobile station 10 on the basis of feedback information that includes reception quality in the mobile station 10 and decoding results for a received call, said feedback conditions being for determining whether or not transmission of the feedback information is necessary; and the mobile station 10 having a priority setting unit 13 that sets a priority level for the mobile station itself, a reception quality measuring unit 11 that measures the reception quality of reference signals from the eNB 20, and a feedback requirement determination unit 12 that determines whether or not transmission of feedback information is required, on the basis of the feedback conditions.

Abstract: A communication method (S) for communication between mobile units (10, 20), and in particular between vehicles, in which information transmitted between the mobile units (10, 20) is encoded on the transmitter side by means of an encoder (12-1, 22-1) and is decoded on the receiver side by means of a decoder (12-2, 22-2), and the mobile units (10, 20) are synchronized in communication (S3) with an external interface unit (30) outside the mobile units (10, 20) prior to communication (S5) with one another in that a codebook (Cj) defining or specifying an encoder (12-1, 22-1) and/or a decoder (12-2, 22-2) is determined (S2) by the external interface unit (30) and is communicated (S3) to the mobile units (10, 20).

Abstract: Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for verifying the correctness of the DEFLATE compression accelerator. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. A switch is communicatively coupled to the output of the input buffer and to the output of the LZ77 compressor. The switch is configured to bypass the LZ77 compressor during a compression test. The accelerator further includes a deflate Huffman encoder communicatively coupled to an output of the switch and an output buffer communicatively coupled to the deflate Huffman encoder. When the switch is not bypassed, the compressor can be modified to produce repeatable results.

Abstract: Techniques for compressing binary input data streams and files by reducing entropy of the input data prior to compression. Entropy reduction is achieved by first getting a stream of single-digit decimal pseudo random numbers and calculating the frequency of occurrence of each decimal number in the even and odd positions of the pseudo random number stream. Subsets of the frequencies of occurrence of the decimal digits are selected to best match the frequency of occurrence of “0” and “1” in the odd and even positions of the binary input data stream. The decimal digits of the subsets of frequencies of occurrence are selectively set to “0” or “1” thereby creating a binary pseudo random number (i.e. mapping) stream, which is XORed with the binary input stream and compressed. Decompression uses the same pseudo random number stream using the mapping stream and the seed number used during compression.

Abstract: Logic may implement implicit integrity techniques to maintain integrity of data. Logic may perform operations on data stored in main memory, cache, flash, data storage, or any other memory. Logic may perform more than one pattern check to determine repetitions of entities within the data. Logic may determine entropy index values and/or Boolean values and/or may compare the results to threshold values to determine if a data unit is valid. Logic may merge a tag with the data unit without expanding the data unit to create an encoded data unit. Logic may decode and process the encoded data unit to determine the data unit and the tag. Logic may determine value histograms for two or more entities, determine a sum of repetitions of the two or more entities, and compare the sum to a threshold value. Logic may determine that a data unit is valid or is corrupted.

Abstract: A communication apparatus includes a memory, and a processor coupled to the memory and the processor configured to receive communication data, measure a usable communication band width for communication with a destination apparatus, determine a parameter relating to a reduction ratio for a data amount of the communication data, based on the measured communication band width, reduce the data amount of the communication data, based on the determined parameter, and transmit the communication data of the reduced data amount to the destination apparatus.

Abstract: Systems, methods, and computer program products are provided for load balancing for processing large data sets. The method includes identifying a number of segments and a transaction data set comprising transaction data for a plurality of transactions, the transaction data for each transaction of the plurality of transactions comprising a transaction value, determining an entropy of the transaction data set based on the transaction value of each transaction of the plurality of transactions, segmenting the transaction data set into the number of segments based on the entropy of the transaction data set and balancing respective entropies of each segment of the number of segments, and distributing processing tasks associated with each segment of the number of segments to at least one processor of a plurality of processors to process each transaction in each respective segment.

Abstract: The present disclosure describes methods and systems that provide for content based dynamic data compression. During a training stage a plurality of training sets are compressed using multiple data compression techniques, and each training data set is associated with a most effective compression technique. Statistical features can be extracted from each of the training data sets with consideration of the most effective compression techniques and are saved as a compression parameters file. During a working stage, individual data blocks within a telemetry data set are compressed using a data compression technique selected for the data block in light of the statistical feature presented in the compression parameters file, and the compressed data blocks are written to a compressed data set, along with encoding tags that identify the compression technique used on each data block. During a consumption stage, the compressed data blocks are decompressed using techniques identified by the encoding tags.

Abstract: A method of compressing data in a mass storage medium of a computer system running an operating system (OS), such as Windows®, is disclosed. The computer system comprises a central processing unit (CPU), random access memory (RAM), and a non-transitory mass storage medium. The method includes accepting an operator indication of a desired degree of data compression, selecting a predefined compression method corresponding to the operator indication and the version of the operating system in use, and designating a selected predefined set of files and directories stored on the mass storage medium as uncompressible.

Abstract: According to one embodiment, a method for lossy data compression is provided. The method may also include determining a length and a plurality of bounding characters associated with each data item within the data message. The method may further include encoding each data item within the data message by replacing each data item with the determined length and the determined plurality of bounding characters. The method may also include transmitting the data message to a recipient.

Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.

Abstract: A data encoding method includes encoding an array of data values as data sets and escape codes for values not encoded by the data sets, an escape code including a prefix portion and a non-unary coded suffix portion having a length, in bits, dependent upon a value encoded by the prefix portion according to a relationship such that, for at least some values encoded by the prefix portion, the length of the non-unary coded suffix portion is greater than the length, in bits, of the prefix portion.

Abstract: Methods and apparatus are provided for processing communication traffic that includes a plurality of traffic units, each traffic unit having a header and a payload. In one embodiment, header compression is selectively applied to headers of traffic units from the communication traffic, and bit-level bulk data compression is selectively applied to the communication traffic. The bit-level bulk data compression involves accumulating blocks of bits, including headers and payloads of traffic units from the communication traffic, and operating on each block individually. In another embodiment, bit-level bulk data decompression is selectively applied to the communication traffic, and header decompression is selectively applied to headers of traffic units from the communication traffic. The bit-level bulk data decompression involves accumulating blocks of bits, including headers and payloads of traffic units from the communication traffic, and operating on each block individually.

Abstract: An image processing method and an image processing device are provided. The method includes: retrieving a first and second blocks and compressing the first and second blocks into a first and second streams; in response to determining performing a dynamic memory allocation mechanism to the first and second blocks, respectively allocating a first and second private storage spaces to the first and second blocks, and allocating a shared storage space shared by the first and second blocks and divided into multiple segments; when the first private storage space is insufficient to store the first stream, using the first private storage space and a first part of the segments to cooperatively store the first stream; when the second private storage space is insufficient to store the second stream, using the second private storage space and a second part of the segments to cooperatively store the second stream.

Abstract: A search apparatus encodes a plurality of elements, each of which is a unit of encoding, stored in a plurality of items, in a file that includes a plurality of records each including the plurality of items separated by delimiters, with use of an encoding dictionary indicating corresponding relationships between the elements and codes. Further, the search apparatus generates an index that associates the elements with positions of the respective elements in the file. Then, the search apparatus generates mask information indicating a range of a specific search target item among the plurality of items, in the file. The search apparatus searches for one or more element strings satisfying a search condition, from among search target elements that are indicated by the index as being within the range of the search target item indicated in the mask information, based on the search condition.