Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for a high efficiency data decoder. The high efficiency data decoder accesses an encoded data input including an ordered set of individual values and determines whether the encoded data input maps to any of a set of predetermined data outputs. If the encoded data input does not map to any of the predetermined data outputs, the high efficiency data decoder modifies at least one individual value from the ordered set of individual values, yielding a modified encoded data input. The high efficiency data decoder then determines whether the modified encoded data input maps to any predetermined data outputs. If the modified encoded data input maps to one of the data output, the high efficiency data decoder decodes the encoded data input into the identified data output.

Abstract: Various methods and apparatuses are described for performing high speed format translations of incoming data, where the incoming data is arranged in a delimited data format. As an example, the data in the delimited data format can be translated to a fixed field format using pipelined operations. A reconfigurable logic device can be used in exemplary embodiments as a platform for the format translation.

Abstract: A scalable hierarchical coreference method that employs a homomorphic compression scheme that supports addition and partial subtraction to more efficiently represent the data and the evolving intermediate results of probabilistic inference. The method may encode the features underlying conditional random field models of coreference resolution so that cosine similarities can be efficiently computed. The method may be applied to compressing features and intermediate inference results for conditional random fields. The method may allow compressed representations to be added and subtracted in a way that preserves the cosine similarities.

Abstract: The disclosure is directed at a method of data compression. The method includes creating a set of single composite data structures and then calculating a set of bit probabilities based on the set of single data structures. The bit probabilities are then used to create a set of intermediate buffers which are then sorted and traversed for data compression.

Abstract: Embodiments include a method, system, and computer program product for encoding data while it is being processed as part of a query is provided. The method includes receiving a query request and determining a set of values associated with data to be encoded for completing the query request. The method also includes encoding those values such that any subsequent processing operations can be performed on the encoded values to complete the requested query. After performing the subsequent processing operations to complete the requested query, each value is decoded back to its original value.

Abstract: A novel system and computer-implemented method for quickly and efficiently finding and reporting all clones with a large corpus of text. This is achieved by tokenizing the corpus, computing a rolling hash, filtering for hashes that occur more than once, and constructing an equivalence relation over these hashes in which hashes are equated if they are part of the same instance of duplication. The equivalence relation is then used to report all detected clones.

Abstract: Systems, apparatus and methods are provided for compressing data. An exemplary method may comprise interleaving one or more literal length fields with one or more literal fields to an output. The literal fields may contain a first data segment literally copied to the output, and each of the one or more literal length fields may contain a value representing a length of a succeeding literal field. The method may further comprise determining a second data segment being matched to a previously literally copied sequence of data and a match position and writing to the output one or more match length fields and a match position field containing the match position. The literal length fields may contain a total length of the first data segment and the match length fields may contain a total length of the second data segment.

Abstract: Syndrome calculation circuitry for a decoder of codewords having a first number of symbols, where the decoder receives a second number of parallel symbols, and where the first number is not evenly divisible by the second number, includes multipliers equal in number to the second number. Each multiplier multiplies a symbol by a coefficient based on a root of a field of the decoder. The multipliers are divided into a number of groups determined as a function of a modulus of the first number and the second number. Adders equal in number to the groups add outputs of multipliers in respective ones of the groups. Accumulation circuitry accumulates outputs of the adders. Output circuitry adds outputs of the adders to an output of the accumulation circuitry to provide a syndrome. Selection circuitry directs outputs of the adders to the accumulation circuitry or the output circuitry, and resets the accumulation circuitry.

Abstract: A method of performing embedded compression (EC) on image data includes receiving decoded image data; determining a block size of image data waiting for embedded compression from among the received image data; and comparing the determined block size of the image data waiting for embedded compression with an EC block size that is an embedded compression unit, the method further including: if the determined block size of the image data waiting for embedded compression is equal to or greater than the EC block size, embedding and compressing the received image data; and if the determined block size of the image data waiting for embedded compression is smaller than the EC block size, storing tag information of the received image data.

Abstract: Method and device of increasing downloading speed in a network are disclosed. The method includes: a server receiving a download request from a first client device, the download request identifying a first compressible resource; obtaining a network quality assessment score of the first client device, the network quality assessment score indicating a projected download speed of the first client device; in accordance with the network quality assessment score, determining a first compression level of the first compressible resource for the first client device; searching for the first compressible resource at the determined first compression level locally at the first server; and sending a request for at least one of the one or more second segments that are not pre-stored locally at the first server to a second server of the network.

Abstract: A computer-implemented method according to one embodiment includes identifying genomic data within a system, dividing the genomic data into a plurality of partitions, creating a plurality of groups of different data types within each of the plurality of partitions, independently compressing, within each of the plurality of partitions, each of the plurality of groups of different data types to create a plurality of independently compressed partitions, validating each of the plurality of independently compressed partitions to create a plurality of validated independently compressed partitions, and saving the plurality of validated independently compressed partitions within the system.

Abstract: A system and method stores a database file into Flash memory or other write-constrained storage. The system and method can decompress the data to use to process a request by only decompressing data it determines, via metadata, might correspond to a criteria in the request.

Abstract: Systems and methods may be provided for masking data on public networks. At a publishing node, the system may monitor data input fields in a webpage, and intercept and encode content, such as text, images, and video input at the data input fields, prior to the content being posted online on a public service provider's website. A policy may be defined to control which users are permitted access to a key to decode the encoded content. The policy may defer to a third party policy node in determining key access. An account for a controlling entity, such as a guardian or employer, may be configured to control the encoding status of posts made by another. The controlling entity may control who has key access to decode posts made by the other account. The guardian account may be configured to have preemptive rights over posting decisions made by the minor.

Abstract: A code decompression engine reads compressed code from a memory containing a compressed code part and a dictionary part. The compressed code part contains a series of instructions being either an uncompressed instruction preceded by an uncompressed code bit, or a compressed instruction having a compressed code bit followed by a number of segments field followed by segments, followed by a directory index indication a directory location to read. Each segment consists of a mask type, a mask offset, and a mask.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Recording a memory address includes identifying a first subset of high bits of the memory address, determining that a first value of the first subset equals a second value of a group of high bits already recorded, recording a second subset of low bits of the memory address while refraining from recording the first subset, and setting one or more flag bits to indicate that only the second subset were recorded. Also, recording a memory value includes identifying a plurality of groups of consecutive bits of the memory value, determining that a first group contains bits having a defined pattern and that a second group contains bits lacking the defined pattern, recording the second group while refraining from recording at least a portion of the first group, and setting one or more flag bits to indicate that the first group was not recorded.

Abstract: Methods and apparatus for determining whether a media presentation device is in an on state or an off state are disclosed. A disclosed example method comprises determining contribution values from at least one of a signal measured from a sensing device or an output signal accessed from the presentation device, wherein the contribution values are indicative of a state of a presentation device. Summing, via a logic circuit, a first plurality of the contribution values corresponding to a first measurement cycle to generate a first intermediate fuzzy score for the first measurement cycle. Storing the first intermediate fuzzy score in a buffer including a plurality of intermediate fuzzy scores corresponding to respective measurement cycles. Combining, via the logic circuit, the intermediate fuzzy scores corresponding to a first time period to form a final fuzzy score.

Abstract: Certain implementations of the disclosed technology may include methods and computing systems for memory-assisted compression of network packets using packet-level clustering. According to an example implementation, a method is provided. The method may include vectorizing a plurality of data packets stored in a memory, calculating respective distances between each of the respective vectorized data packets, clustering the plurality of data packets into a plurality of data packet clusters, obtaining a sample data packet to be compressed, identifying a training data packet cluster from among the plurality of data packet clusters, and compressing the sample data packet using a compression algorithm.

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: A computing device (100), comprising a memory (240) and a controller (210), wherein said controller (210) is configured to encrypt a file (410) by transforming at least a portion of said file (410) to a number (X) and transforming the number (X) to an exponent vector (exp) comprising at least one exponent, wherein each exponent corresponds to a base in a base vector (base), and wherein the controller (210) is further configured to determine a scaling factor for the current base by dividing the number (X) with the current base raised to the power of the exponent and thereafter determine the residual number (Xres) by reducing the number (X) by the base raised to the power of the exponent multiplied with the scaling factor.

Abstract: A method for compressing a short message includes receiving a short message that includes a plurality of text strings for compression, dividing the short message into one or more sub-blocks, where a number of text strings in each of the one or more sub-blocks is less than or equal to a predetermined number. The method also includes compressing each of the one or more sub-blocks by identifying a type of a first text string, identifying a code representing the type, determining whether the first text string exists in a library, upon determining that the first text string exists in the library, determining an index corresponding to the first text string, extracting a predetermined number of least significant digits of the index, and replacing the first text string in that sub-block with the code and the extracted predetermined number of least significant digits of the index.

Abstract: Techniques for data processing may include: determining a data layout for a configuration of counters stored in registers, wherein each of the registers is configured to store at least two counters, and each counter is associated with a particular data item allowable in the data set and denotes a current frequency of the particular data item; receiving data items of a data chunk of the data set; for each data item received, performing processing including: determining a first of the counters corresponding to the data item, wherein the first counter is stored in a first of the registers and denotes a current frequency of the data item; and incrementing the first counter stored in the first register by one; and determining, in accordance with the counters stored in the registers, an entropy value for the data chunk.

Abstract: Recording a memory address includes identifying a first subset of high bits of the memory address, determining that a first value of the first subset equals a second value of a group of high bits already recorded, recording a second subset of low bits of the memory address while refraining from recording the first subset, and setting one or more flag bits to indicate that only the second subset were recorded. Also, recording a memory value includes identifying a plurality of groups of consecutive bits of the memory value, determining that a first group contains bits having a defined pattern and that a second group contains bits lacking the defined pattern, recording the second group while refraining from recording at least a portion of the first group, and setting one or more flag bits to indicate that the first group was not recorded.

Abstract: The present application discloses video data encoding and decoding methods and apparatuses, so as to conveniently perform data encoding and decoding on video data. The method includes: arithmetic encoding, where the arithmetic encoding includes: obtaining a binary symbol of image data; and if the binary symbol is a most probable symbol (MPS), updating a first encoding interval corresponding to the MPS in a logarithm domain, and if the first updated encoding interval is less than a preset range of an arithmetic encoding interval, performing normalization processing on the first encoding interval in the logarithm domain; or if the binary symbol is a least probable symbol (LPS), updating a second encoding interval corresponding to the LPS in an original number domain, and performing normalization processing on the second encoding interval in the original number domain.

Abstract: A method of data nibble-histogram compression can include determining a first amount of space freed by compressing the input data using a first compression technique, determining a second amount of space freed by compressing the input data using a second, different compression technique, compressing the input data using the compression technique of the first and second compression techniques determined to free up more space to create compressed input data, and inserting into the compressed input data, security data including one of a message authentication control (MAC) and an inventory control tag (ICT).

Abstract: According to one aspect of the present application, a method for data compression comprises: creating a first trie for a first set of strings, the first set of strings comprising a plurality of raw data strings, wherein a trie consists of a plurality of nodes linked through parent-child relation, and wherein each edge of the trie is of at least one character and the edge corresponds to a state transition from a parent node of the edge to a child node of the edge; collecting edges of the first trie longer than a predetermined length and making these edges a first subset of strings of the first trie; segmenting a string in the first subset of strings into two or more fragments when the string satisfies a predetermined condition and collecting all segmented fragments and all un-segmented strings in the first subset of strings as a segmented set of strings; and storing the first set of strings using the first trie and the segmented set of strings so as to compress the raw data strings.

Abstract: Techniques for handling data compression in which metadata that indicates which portions of data are compressed are which portions of data are not compressed are disclosed. Segments of a buffer referred to as block groups store compressed blocks of data along with uncompressed blocks of data and hash blocks. If a block group includes a block that is a hash of another block in the block group, then the other block is considered to be compressed. If the block group does not include a block that is a hash of another block in the block group, then the blocks in the block group are uncompressed. The hash function to generate the hash is selected to prevent “collisions,” which occur when the data being stored in the buffer is such that it is possible for a hash block and an uncompressed block to be the same.

Abstract: A system and method for high-speed transfer of small data sets, that provides near-instantaneous bit-level lossless compression, that is ideal for communications environments that cannot tolerate even small amounts of data corruption, have very low latency tolerance, where data has a low entropy rate, and where every bit costs the user bandwidth, power, or time so that deflation is worthwhile. Where some loss of data can be tolerated, the system and method can be configured for use as lossy compression.

Abstract: Systems and methods for Polar encoding with a blockwise checksum are provided. The method involves processing a set of K information blocks to produce a blockwise checksum with u blocks, where K>=2, and u>=1, and where each information block or checksum block contains P bits. The blockwise checksum may, for example, be a Fletcher checksum. The Polar code may be based on an m-fold Kronecker product matrix. Then, an N-bit input vector is produced with P×K information bits and the P×u blockwise checksum bits, and with N?PK?Pu frozen bits, where N=2m where m>=2. The N-bit input vector is processed to produce a result equivalent to multiplying the input vector by a Polar code generator matrix to produce a codeword. The codeword is then transmitted or stored.

Abstract: Methods, devices and systems enhance compression and decompression of data blocks of data values by selecting the best suited compression method and device among two or a plurality of compression methods and devices, which are combined together and which said compression methods and devices compress effectively data values of particular data types; said best suited compression method and device is selected using as main selection criterion the dominating data type in a data block by predicting the data types within said data block.

Abstract: Compressing data of a storage device includes selecting a portion of data for data compression that is predicted to be unlikely to be accessed, selecting a particular one of a plurality of data compression algorithms to apply to the portion according to a frequency value associated with each of the data compression algorithms, and adjusting the frequency value of the particular one of a plurality of data compression algorithms according to performance of the particular one of a plurality of data compression algorithms. The performance may vary according to a ratio of amount of compression achieved to processing cycles of a processor used to compress the portion of data. The processor may perform storage device functions that are separate from data compression. The portion of data may be selected from a plurality of logical devices used in connection with a single application that accesses the storage device.

Abstract: An encoder for compressing input data to generate corresponding encoded data is provided. The encoder is operable to process the input data to identify reoccurrence of mutually similar multi-dimensional patterns of data bits and/or data symbols therein. The encoder is then operable to represent one or more duplicate reoccurrences of the mutually similar multi-dimensional patterns of data bits and/or data symbols by way of one or more duplication symbols uniquely identifying the mutually similar patterns.

Abstract: Embodiments of the present invention include a compression system including one or more compressibility inputs; a compression predictor configured to predict the compressibility of data based on the one or more compressibility inputs; a compressor configured to compress the data; and one or more compression inputs. At least one of the compression predictor or the compressor is configured to determine how to compress the data based on the one or more compression inputs. The one or more compressibility inputs comprise at least one of an object extension dictionary, an object signature dictionary, and an entropy estimation algorithm library. The one or more compression inputs comprise at least one of a quality of service profile, a device performance profile and a compression algorithm performance chart.

Abstract: An arithmetic decoding method is a method in which a context variable specifying a probability of a possible value of each of elements included in a binary string corresponding to a value of a given variable is initialized and arithmetic decoding is performed, using the context variable. The method includes: determining, from among a plurality of initialization methods as a method of initializing the context variable, an initialization method corresponding to the given variable or a group which includes the given variable; and initializing the context variable using the determined initialization method.

Abstract: A hardware compression system is provided. The system includes a hardware pipeline having a plurality of stages arranged to receive pre-compression data into a data buffer, populate a first hash table and a second hash table, supply the pre-compression data to a hash lookup module to access the first hash table and the second hash table in parallel, supply a string match module with results from the hash lookup module so that the string match module compares pre-compression data from multiple locations in the data buffer in parallel, supply a match merge module with results from the string match module so that the match merge module generates literals and metadata for compression data, and supply an output encoding module with results from the match merge module so that the output encoding module encodes the compression data.

Abstract: The invention provides a method of verifying a computer readable file for use in a gaming machine, comprising reading at least one portion of the computer readable file and compressing the at least one file portion to reduce its file size into a compressed file portion. A compressed computer readable file is assembled using the compressed file portion and is then processed through a verification algorithm to verify that the compressed computer readable file is authorised for use in the gaming machine. A system for verifying a computer readable file for use in a gaming machine is also provided.

Abstract: A computing device may select a plurality of data sets, determine a set of strings that are included in at least two data sets of the plurality of data sets, and select a particular string of the set of strings. The computing device may replace each occurrence of the particular string in the plurality of data sets to create a modified plurality of data sets such that the modified plurality of data sets is smaller in size than the plurality of data sets. The computing device may assign a reference to the particular string and replace each occurrence of the particular string in the plurality of data sets to create a plurality of modified data sets. The computing device may replace may store the reference and the particular string in a table.

Abstract: Systems and processes for natural language processing using vocabularies with compressed serialized tries are described in the present disclosure. In one example process, natural language input is received. The natural language input is parsed, using a vocabulary, to determine a corresponding user intent. The parsing includes using a data structure of the vocabulary to map a first word of the natural language input to first semantic information and a second word of the natural language input to second semantic information. The data structure includes pointers that map to a same semantic data object of the vocabulary. The first semantic information and the second semantic information are determined using the same semantic data object. The user intent is determined based on the first semantic information and the second semantic information. Performance of a task corresponding to the determined user intent is initiated.

Abstract: A data condenser and method provides lossless condensation of numbers, letters, words, phrases, and other indicia to data object values which results in reduction of file size. The data condenser and method classifies data as individual data objects or groups of data objects and distinguishes terms which repeat (e.g. recur). A reference library is optimized according to the quantity of classified data to minimize storage requirements. The classified data is assigned a unique value which populates the reference file. An output file is created by the data condenser using the reference library to achieve optimal lossless condensation. A data reverter and method provides for reversion of condensed data objects such as numbers, letters, words, phrases and other indicia to uncondensed data objects for efficient and accurate use without loss of data objects.

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: Techniques for performing predicate-based data compression are provided. The techniques include specifying a predicate, wherein the predicate is specified by a user, and using the predicate to filter data compression, wherein using the predicate to filter data compression comprises compressing one or more subsets of data that satisfy the predicate.

Abstract: A compression circuit includes a buffer, a selection circuit, a compare circuit, and a control circuit. The buffer stores uncompressed data. The selection circuit generates a read pointer value to the buffer. The control circuit contains a programmable configuration register. The configuration register stores a depth value for reading uncompressed data from the history buffer. The control circuit generates control signals to the selection circuit to cause the selection circuit to iteratively increment the read pointer value from an initial value to a second value that corresponds to the depth value. Responsive to the second value corresponding to the depth value, the control circuit resets the read pointer value to the initial value. The compare circuit compares input symbols from a data source to uncompressed data from the buffer history to thereby generate output compressed data.

Abstract: Systems and methods for decoding compressed data are described herein. A memory may receive a data stream comprising a string of encoded symbols encoded using an arithmetic coding based coding technique. The string of encoded symbols represents a series of one or more decoded symbols. Each of the one or more decoded symbols comprises one of a most probable symbol and a least probable symbol. A processor may determine a number of consecutive most probable symbols in the series of one or more decoded symbols by performing a plurality of parallel mathematical comparisons based on one or more of the encoded symbols. The processor may further decode a group of symbols of the series of one or more decoded symbols based on the plurality of parallel mathematical comparisons. The group of symbols comprises the number of consecutive most probable symbols.

Abstract: A method is provided for comparing a usage of a mobile communications device to a stored pattern of usage. When a measure associated with a difference between the usage and the stored usage pattern exceeds a threshold, the mobile communications device is caused to emit a sound encoded with information that may be decoded by another electronic device.

Abstract: A method and a system for encrypting data by a data protection system are provided. The data protection system may receive one or more dataset and calculate the number of binary digit ‘1’ in each byte of the one or more dataset. Further, it may determine a slot value for each byte of the one or more dataset based on location of the each byte in a table of the plurality of tables. And, it may identify a pattern index for the each byte based on the location of the each byte in the one or more slots and generates an encrypted byte for the each byte of the one or more dataset. The data protection system may further decrypt the encrypted dataset by receiving one or more encrypted byte.

Abstract: In embodiments, secure compression algorithms are provided that may be employed as a single operation on raw data to produce compressed and encrypted data. In embodiments, the algorithms described herein may be performed using any type of dictionary based encryption. In one embodiment, upon adding a new prefix to a dictionary table, the dictionary table may be permuted to randomize the entries into the table. The randomization may be based upon a permutation value generated by a deterministic pseudo-random generator and/or pseudo-random function. Other embodiments of randomization may be employed to provide secure compression. For example, instead of permuting the entire table upon adding a prefix, the prefix may be randomly added to the table.

Abstract: A processing device is provided which includes a plurality of encoders each configured to compress a portion of data using a different compression algorithm. The processing device also includes one or more processors configured to cause an encoder, of the plurality of encoders, to compress the portion of data when it is determined that the portion of data, which is compressed by another encoder configured to compress the portion of data prior to the encoder in an encoder hierarchy, is not successfully compressed according to a compression metric by the other encoder in the encoder hierarchy. The one or more processors are also configured to prevent the encoder from compressing the portion of data when it is determined that the portion of data is successfully compressed according to the compression metric by the other encoder in the encoder hierarchy.

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: A zero detection circuit includes a chain of masked OR circuits. Each masked OR circuit includes data inputs. Each data input is configured to receive a respective data input bit. Each masked OR circuit further includes an input mask input to receive one or more input masking bits, an output mask input to receive an output masking bit and a data output. The zero detection circuit is configured to output a bit equal to an OR combination, masked with the output masking bit, of the data input bits, each demasked with an input masking bit of the one or more input masking bits. One of the inputs of each masked OR circuit except the first masked OR circuit of the chain of masked OR circuits is coupled to the data output of the masked OR circuit preceding the masked OR circuit in the chain of masked OR circuits.

Abstract: A secure element and method for backup of data stored in a non-volatile memory of the secure element. The method for backup of data includes de-fragmenting an area of the non-volatile memory so as to form, in the area, an occupied region and a free region. The method further includes compressing the portion of data contained in the occupied region, after de-fragmentation, and compressing the contents of the free region using a compression algorithm that is different from the one used for compressing the portion of data contained in the occupied region. In one embodiment, the occupied region is compressed using a dictionary, and the free region is compressed by applying run-length encoding (RLE). The method also includes generating a backup image containing the compressed portion of data and the compressed contents of the free region, and writing the backup image into the nonvolatile memory. The area may contain objects to be handled by a program coded in an object language.