Abstract: A method is provided for decompressing wide word data compressed in parallel. The method includes creating an instance of memory structure for a wide word in the wide word data, where the instance of memory structure is an inverse of a compression dictionary for the wide word; retrieving multiple compressed codes iteratively from a gap-free compressed output stream of the wide word data using the instance of memory structure, where each compressed code includes at least one character code and a reverse-pointer, and where at least one compressed code includes a multi-symbol string having a multiple character codes; forming an intermediate decompressed output stream by iteratively following the reverse-pointers for the multiple compressed codes, respectively; and forming decompressed output stream by reversing an order of the character codes in the multi-symbol string of the at least one compressed code.

Abstract: Disclosed is an arithmetic encoding method based on a semantic source, which is applied to an encoder. In this method, a preset encoding interval of the semantic source and a syntax symbol sequence containing syntax symbols are obtained. For each syntax symbol of the syntax symbols, a target synonymous subset of the syntax symbol is determined from preset synonymous subsets of the syntax symbol. The target synonymous subset of the syntax symbol is encoded according to the preset encoding interval through an arithmetic encoding algorithm to obtain an encoded result sequence corresponding to the syntax symbol sequence. After obtaining a sequence length of the syntax symbol sequence, the sequence length and the encoded result sequence are sent to a decoder for decoding.

Abstract: A system and methods for bandwidth-efficient data encoding comprising a sequence analyzer configured to: analyze a received sequence dataset to determine a sequence dataset file type, scan the sequence dataset to maintain a count of unique characters contained therein, identify positions where the unique character count increases by a power of two, deconstruct the sequence dataset into a plurality of sourceblocks at the identified positions, and encode the plurality of sourceblocks using a data deconstruction engine and library management module to assign each sourceblock a reference code.

Abstract: Computer systems and computer-implemented methods for forensically investigating a target dataset including a target file by comparing the target file to a source file are provided. The method includes performing a preliminary matching operation. The preliminary matching operation includes performing at least one of a file size matching operation, in which a target file size is compared to a source file size, and a sub-hash matching operation, in which a target file sub-hash is compared to a source file sub-hash. A sub-hash is a hash value calculated using a subset of data from the file. The method further includes performing a full hash matching operation if the preliminary matching operation identifies a preliminary match. The full hash matching operation includes generating a target file full hash value and comparing the target file full hash value to a source file full hash value.

Abstract: A method for decoding a video according to the present invention may comprise: decoding information indicating whether illumination compensation is performed for a current block, determining an illumination compensation parameter of the current block when the information indicates that the illumination compensation is performed for the current block, obtaining a prediction block by performing inter prediction for the current block, and performing the illumination compensation on the current block using the illumination compensation parameter.

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: A minimization method for minimizing the size of a file is provided, the minimization method including preparing an absolute value length that is equal to or larger than the largest data length among the data lengths of the data of a plurally of coordinates, and a plurality of relative value lengths equal to or less than the absolute value length, and identifying a relative value length causing minimization of the size among a plurality of relative value lengths.

Abstract: Methods and apparatuses for encoding and decoding motion information are provided. In an embodiment, a method of decoding motion information includes obtaining, from a bitstream, a resolution index indicating a motion vector resolution for inter-predicting a current block, a reference index of the current block, and prediction direction information of the current block. The method further includes determining a reference picture of the current block. The method further includes determining whether a prediction direction of the current block is unidirectional prediction in an L0 or L1 direction or bidirectional prediction. The method further includes determining a motion vector resolution set including one or more selectable motion vector resolutions. The method further includes determining a motion vector based on the prediction direction, according to the motion vector resolution indicated by the resolution index from among the motion vector resolution set.

Abstract: The present disclosure provides a data processing system and method. The method may include obtaining preliminary data. The method may also include generating first encoded data by compressing the preliminary data in a first encoding procedure. The method may further include determining whether a compression ratio of the first encoded data is below a compression threshold. The method may still further include generating second encoded data by compressing the preliminary data in a second encoding procedure in response to determining that the compression ratio of the first encoded data is below the compression threshold, wherein the first encoding procedure and the second encoding procedure are lossless compressions.

Abstract: An amount of memory needed to hold prime data elements during reconstitution may be determined by examining the creation and usage of prime data elements and their spatial and temporal characteristics during data distillation.

Abstract: Methods of encoding and decoding for video data are describe in which significance maps are encoded and decoded using non-spatially-uniform partitioning of the map into parts, wherein the bit positions within each part are associated with a given context. Example partition sets and processes for selecting from amongst predetermined partition sets and communicating the selection to the decoder are described.

Abstract: This application provides a method for decoding an unmatched pixel performed by an electronic device. The method includes: obtaining a bit stream of a target video sequence and decoding the bit stream of the target video sequence by at least two entropy decoding methods, to obtain a binary symbol string of an unmatched pixel in a target picture block, the target picture block being obtained by dividing a target picture frame in the target video sequence; inversely binarizing the binary symbol string, to obtain a component value of the unmatched pixel; and obtaining the target picture block based on the component value of the unmatched pixel. This method can improve the flexibility of coding and facilitate equalization between the coding performance and the coding overhead of the unmatched pixel.

Abstract: A computer-readable storage medium storing a program for causing a computer to perform processing including: dividing a sequence indicating a rational formula of a compound, into a character string of a minimum unit of the sequence and a branch symbol indicating a branched portion of the compound; generating a first coded sequence by using a group dictionary indicating a relationship between the sequence and the compression code, the generating including assigning a compression code to the character string of the minimum unit, and assigning the compression code according to a type of the branched portion to the branch symbol; and generating a second coded sequence by using a primary structure dictionary indicating a relationship between a group primary structure of the sequence and the compression code, the generating of the second coded sequence including encoding the compression code in the first coded sequence in units of the group primary structure.

Abstract: This application provides a displacement vector prediction method and apparatus in video encoding/decoding and a device and relates to the field of video codec technologies. In this application, candidate displacement vectors are constructed by combining displacement vectors related to a plurality of prediction modes, and then a predicted displacement vector of a current unit is derived from the candidate displacement vectors. Information about an encoded/decoded unit having a same prediction mode as the current unit can be used and information about an encoded/decoded unit having different prediction modes from the current unit is also allowed to be combined to derive the predicted displacement vector of the current unit, so that the candidate displacement vector has a higher possibility to be selected as the predicted displacement vector, thereby improving the encoding performance of the displacement vector.

Abstract: At a first time, a system identifies a set of data files which are stored in a part of a data storage system. At a second time, the system identifies each newly encoded data file based on identifying each data file in the set of data files which is encoded and created and/or updated since the first time. The system identifies each compressed data file based on identifying each newly encoded data file which is reduced in size since the first time. The system determines a file compression success rate based on a total count of each compressed data file relative to a total count of each newly encoded data file. If the system determines that the file compression success rate does not satisfy the file compression success rate threshold, the system outputs an alert about an unauthorized encryption in the data storage system.

Abstract: A method includes, storing a set of valid codewords including: a first valid functional codeword representing a functional state of a controller subsystem; a first valid fault codeword representing a fault state of the controller subsystem and characterized by a minimum hamming distance from the first valid functional codeword; a second valid functional codeword representing a functional state of a controller; and a second valid fault codeword representing a fault state of the controller; in response to detecting functional operation of the controller subsystem, storing the first valid functional codeword in a first memory; in response to detecting a match between contents of the first memory and the first valid functional codeword, outputting the second valid functional codeword; in response to detecting a mismatch between contents of the first memory and every codeword in the first set of valid codewords, outputting the second valid fault codeword.

Abstract: This disclosure provides methods, devices, and systems for data compression and decompression. The present implementations more specifically relate to entropy encoding and decoding techniques for keeping a state variable within upper and lower bounds using a noniterative process. The entropy encoding uses a fixed state threshold to determine a number of bits to remove and removes the bits from a current state prior to encoding a symbol with the current state. The entropy decoding decodes encoded data in a bitstream based on a current state to obtain the symbol and a new state and determines a number of bits to read from the bitstream and to add to the new state to update the current state.

Abstract: A plurality of objects that comprise an input to a cryptographic signing function. For each object in the plurality of objects, an output value yi of a hash function is calculated, where the value i is equal to an index value of the object, a compressed output value xi of a compression function is calculated, the output value yi from the computer readable memory, and the compressed output value xi is stored. For each object in the plurality of objects, an output value y?i of the hash function is calculated, where the value i is equal to the index value of the object, a compressed output value x?i of the compression function executed on the output value y?i is calculated, the output value x?i is determined to be equal to the output value xi, and the output value y?i is transmitted in an output data stream.

Abstract: A method for subdividing an interval during entropy decoding for a bitstream representing a set of video pictures is provided. A sub-interval value is computed by (i) performing an initial right bit-shifting operation on a probability estimator value to reduce a length in bits of the probability estimator value, (ii) multiplying the right bit-shifted probability estimator value by a range value representing the interval, (iii) performing another right bit-shifting operation on a result of the multiplication, and (iv) adding a constant value to a result of the other right bit-shifting operation, wherein the probability estimator value is associated with a probability of a bin having a particular value. The sub-interval value computed based on the right bit-shifted probability estimator value is used to update the interval.

Abstract: A server includes: a memory; and a processor coupled to the memory and configures to: receive a frame image of a moving image compressed by an information processing device; detect a sign of deterioration in analysis accuracy based on accuracy information that represents certainty of an analysis result by artificial intelligence for the frame image; transmit, to the information processing device, instruction information of controlling a compression rate in compression of the moving image by the information processing device between an upper bound and a lower bound; and change the upper bound and the lower bound according to stability of the analysis accuracy based on the detection of a sign of deterioration in the analysis accuracy.

Abstract: A system and method for data compaction and encryption of anonymized data records. A dataset may be pre-processed by dividing into a plurality of sourceblocks at all reasonable sourceblock lengths, and then counting how many times each sourceblock occurs in the dataset, resulting in a tally record of tokens and their count value. This tally record may then be anonymized and transmitted to a data deconstruction engine which combined with a library manager creates a codebook and performs optimization techniques on the codebook. The received anonymized tally record may be parsed into individual tokens by identifying the tokens with the highest count value. The tokens may then be sent, in descending order of count value, to the library manger where each token may be assigned a codeword. A half-backed codebook is then created using the tokens and each token's unique codeword, before sending the half-backed codebook to a system user.

Abstract: According to one embodiment, a code table generation device includes a table generation unit, a merge unit and a tree generation unit. The table generation unit generates a frequency table including symbols and frequencies of occurrence respectively associated with the symbols, based on a frequency of occurrence for each symbol of input symbols. The merge unit acquires top K symbols in descending order of the frequencies of occurrence and remaining symbols from the symbols, divides the remaining symbols into one or more symbol sets, and determines a frequency of occurrence associated with a root node of each of subtrees correspond to the respective symbol sets. The tree generation unit generates a Huffman tree using the K symbols and the root node of each of the subtrees.

Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: A system and method for extracting data from a compressed and encrypted data stream employing lossless compression and a codeword-to-byte mapping enables selective random extraction from compressed and encrypted data. Initially, data is compressed to reduce its size without information loss. A codeword-to-byte mapping table is created, associating codewords with specific positions in the compressed data. When a request for a specific byte range is received, the system uses the mapping to identify the codewords linked to that range within the compressed data. The system then selectively decompresses the identified codewords and subsequently decrypts the decompressed data. This process ensures that only the relevant data is processed, eliminating the need to decompress and decrypt the entire dataset.

Abstract: An aspect of the present invention is a communication system including: an encoding unit configured to transform an input symbol sequence into an output symbol sequence, the input symbol sequence being a sequence of first symbols, the output symbol sequence being a sequence of second symbols; and a decoding unit configured to transform the output symbol sequence into the input symbol sequence in accordance with a decoding-side transformation mapping for transforming the output symbol sequence into the input symbol sequence that is a transformation source for the output symbol sequence, wherein the encoding unit transforms the input symbol sequence into the output symbol sequence in accordance with encoding-side transformation destination candidate information, the input symbol sequence, and a transformation probability, the encoding-side transformation destination candidate information being information indicating candidates of a transformation destination for the input symbol sequence, the transformation pro

Abstract: A method of maintaining a probabilistic filter includes, in response to receiving a key K1 for adding to the probabilistic filter, generating a fingerprint F1 based on applying a fingerprint hash function HF to the key K1, identifying an initial bucket Bi1 by selecting between at least a first bucket B1 determined based on a first bucket hash function H1 of the key K1 and a second bucket B2 determined based on a second bucket hash function H2 of the key K1, and inserting the fingerprint F1 into the initial bucket Bi1; and resizing the probabilistic filter. Resizing the probabilistic filter includes incrementing a resize counter value, determining a bucket B? for the fingerprint F1 based on a value of the fingerprint F1 and the resize counter value, and inserting the fingerprint F1 into the bucket B? in the probabilistic filter.

Abstract: A method of cataloging data integrity is herein disclosed. In certain embodiments, the method includes performing a checksum check. The checksum check is performed by selecting a file that includes a first checksum result, selecting a checksum type, determining a processor L1, L2, and L3 cache size, storing the cache size in a variable, breaking the file into a plurality of chunks based on the variable, generating a checksum result for each chunk, storing each checksum result in the variable, and combining the checksum results to return a second checksum result.

Abstract: Certain aspects of the present disclosure provide techniques for measurement encoding and decoding using neural networks to compress and decompress measurement data. One example method generally includes: generating, via each of a plurality of neural network encoders operating on measurement data, a compressed measurement based on a respective portion of the measurement data, wherein each of the neural network encoders is based on the same neural network model; generating at least one message indicative of the measurement data based on the compressed measurements; and transmitting the at least one message.

Abstract: Disclosed and systems, methods and devices for video processing. An exemplary method for video processing includes: determining for a current video block, an indication which indicates that an affine merge with motion vector difference (MMVD) mode is applied to the current video block; performing a conversion between the current video block and a bitstream representation of a current video block based on the indication, the indication being activated based on the usage of at least one merge list for the current video block.

Abstract: According to one embodiment, a dictionary buffer stores dictionary data including a first substring and data before the first substring. A substring generator generates, from second input data, second substrings. A transformer transforms each of the second substrings into a hash value. A read processor reads the dictionary data, using a hash value transformed from a third substring among the second substrings. An acquisition unit compares a data string including the third substring and data before the third substring with the read dictionary data, and acquire first and second match lengths of the third and fourth substrings. A coded data generator generates coded data based on the acquired first and second match lengths.

Abstract: A method comprises: accessing animation graphics files and a mask graphics file; generating first binary sequences corresponding to the animation graphics files, and generating a second binary sequence corresponding to the mask graphics file; and outputting the first binary sequences and the second binary sequence to hardware controlling an array of electrical components.

Abstract: A network system that facilitates financial transactions. A software defined network may operate to provide a variety of trading related services to a variety of customers with a low latency. Core or processor affinity for routing processes may improve speeds of routing. Data capture through a shared memory space may allow for a variety of analytics without introducing unacceptable delay.

Abstract: An example embodiment may involve obtaining an input pixel map of a digital image containing an array of a×b pixel macro-cells; classifying each of the a×b pixel macro-cells as P class cells for substantially lossless compression or Q class cells for lossy compression; creating a first intermediate pixel map representing: the P class cells as is, and the Q class cells with all zero values; creating a second intermediate pixel map representing: the P class cells with all zero values, and the Q class cells as is; encoding the first intermediate pixel map into a first output stream by using substantially lossless compression; and encoding the second intermediate pixel map into a second output stream by: downsampling the P class cells and the Q class cells therein, and serializing representations the downsampled cells.

Abstract: An image decoding method executed by a decoding apparatus according to the present document comprises the steps of: deriving an intra prediction mode of the current chroma block by means of cross-component linear model (CCLM) mode; deriving downsampled luma samples on the basis of the current luma block; deriving downsampled neighboring luma samples on the basis of neighboring luma samples of the current luma block; and deriving the CCLM parameter on the basis of the downsampled neighboring luma samples and neighboring chroma samples of the current neighboring chroma block, wherein the number of downsampled neighboring luma samples and number of neighboring chroma samples are equal to the previously set thresh-hold value, and the thresh-hold value is derived on the basis of the width and height of the current chroma block.

Abstract: A technique for performing data deduplication operates at sub-block granularity by searching a deduplication database for a match between a candidate sub-block of a candidate block and a target sub-block of a previously-stored target block. When a match is found, the technique identifies a duplicate range shared between the candidate block and the target block and effects persistent storage of the duplicate range by configuring mapping metadata of the candidate block so that it points to the duplicate range in the target block.

Abstract: The present disclosure relates to an information processing device, an information processing method, and a program capable of suppressing labor and cost for generating a unique identifier. According to the present disclosure, provided is an information processing device provided with software in which first identification information having uniqueness is registered, and an application that obtains the first identification information from the software, converts the first identification information into second identification information having uniqueness for communication, and registers the second identification information in the software. With this configuration, it is possible to suppress labor and cost for generating a unique identifier.

Abstract: A lossless data compressor of an aspect includes a first lossless data compressor circuitry coupled to receive input data. The first lossless data compressor circuitry is to apply a first lossless data compression approach to compress the input data to generate intermediate compressed data. The apparatus also includes a second lossless data compressor circuitry coupled with the first lossless data compressor circuitry to receive the intermediate compressed data. The second lossless data compressor circuitry is to apply a second lossless data compression approach to compress at least some of the intermediate compressed data to generate compressed data. The second lossless data compression approach different than the first lossless data compression approach. Lossless data decompressors are also disclosed, as are methods of lossless data compression and decompression.

Abstract: Methods, systems, and devices for wireless communications are described. A network node may transmit, to a plurality of user equipment (UE), a set of network encoded packets generated using a set of packets. A UE of the plurality of UEs may receive a subset of the set of encoded packets and may decode the subset to determine a first set of decoded packets. The UE may receive a second set of decoded packets from the plurality of UEs. The UE may transmit feedback to the network node that indicates the successfully decoded packets of the first and second sets. The network node may receive the feedback and may determine a subset of the set of packets that was successfully decoded for each UE providing the feedback. The network node may transmit an updated set of network encoded packets to the plurality of UEs.

Abstract: To reduce a calculation processing load as a whole while realizing a small amount of data loss for at least one of compression and decompression. For each of a plurality of pieces of data, a storage system determines a compression operation scale of the data based on a feature of the data, executes a lossy compression operation according to the determined compression operation scale to covert the data into encoded data, and stores the encoded data or compressed data thereof into a storage device.

Abstract: A system and method for compacting data that uses mismatch probability estimation to improve entropy encoding methods to account for, and efficiently handle, previously-unseen data in data to be compacted. Training data sets are analyzed to determine the frequency of occurrence of each sourceblock in the training data sets. A mismatch probability estimate is calculated comprising an estimated frequency at which any given data sourceblock received during encoding will not have a codeword in the codebook. Entropy encoding is used to generate codebooks comprising codewords for data sourceblocks based on the frequency of occurrence of each sourceblock. A “mismatch codeword” is inserted into the codebook based on the mismatch probability estimate to represent those cases when a block of data to be encoded does not have a codeword in the codebook. During encoding, if a mismatch occurs, a secondary encoding process is used to encode the mismatched sourceblock.

Abstract: Disclosed is a system and method for the monitoring and authorization of an optimization device in a network. In exemplary embodiments, an optimization device transmits an authorization request message to a portal to receive authorization to operate. The portal transmits an authorization response message to the optimization device with capability parameters for operation of the device, including at least one expiration parameter for the authorization. The optimization device sends updated authorization request messages to the portal with its device usage information, such that the portal can dynamically monitor the optimization device and continue to authorize its operation.

Abstract: A compression method, system, and computer program product include creating compressed data via a first system from input data, sending information to a second system detailing a compression strategy for the compressed data, and learning, via the second system, from the information how to recreate the input to the first system using the compressed data.

Abstract: In one embodiment, a device includes a data compression engine configured to process data packets of multiple network flows received from a network, and compress respective groups of the received data packets into respective compressed packets for sending over the network, each respective compressed packet including respective ones of the received data packets from different ones of the network flows, wherein the network interface is configured to send the compressed packets over the network.

Abstract: An image encoding/decoding method and apparatus are provided. The image decoding method comprises obtaining, from a bitstream, video coding layer (VCL) network abstraction layer (NAL) unit type information of a current picture and first flag information specifying whether a subpicture included in the current picture is treated as one picture, determining a NAL unit type of each of a plurality of slices included in the current picture, based on the obtained VCL NAL unit type information, and decoding the plurality of slices based on the determined NAL unit type and the first flag information. The current picture may comprise two or more subpictures based on at least some of the plurality of slices having different NAL unit types, and the first flag information may have a predetermined value specifying that each of the two or more subpictures is treated as one picture based on at least some of the plurality of slices having different NAL unit types.

Abstract: Embodiments of this application disclose example data compression methods and example base stations. One example method includes obtaining, by a base station, identification information of at least one of a data compression device or a data decompression device. A dictionary can then be generated based on the identification information. The dictionary can then be sent to the data compression device and the data decompression device to enable the data compression device and the data decompression device to perform data compression and data transmission based on the dictionary.

Abstract: Provided is a non-transitory computer-readable recording medium that stores a control program causing a computer to execute a process, the process including determining whether first microcode stored in a first area of a storage device supports a processor, and when the first microcode does not support the processor, decompressing one of multiple sets of compressed second microcode stored in a second area of the storage device into the first area.

Abstract: A method includes determining a data set for storage that includes a plurality of uncompressed data slabs in accordance with a serialized data slab ordering. A storage data set that includes a plurality of compressed data slabs is created based on the data set in accordance with the serialized data slab ordering. Each compressed data slab of the plurality of compressed data slabs is generated from at least one corresponding uncompressed data slab of the plurality of uncompressed data slabs that includes a plurality of values based on generating compressed data for each compressed data slab based on the at least one corresponding uncompressed data slab, and generating compression information for each compressed data slab. The storage data set is stored via a plurality of computing devices.

Abstract: The present disclosure provides systems and methods that include or otherwise leverage use of a multiscale quantization model that is configured to provide a quantized dataset. In particular, the multiscale quantization model can receive and perform vector quantization of a first dataset. The multiscale quantization model can generate a residual dataset based at least in part on a result of the vector quantization. The multiscale quantization model can apply a rotation matrix to the residual dataset to generate a rotated residual dataset that includes a plurality of rotated residuals. The multiscale quantization model can perform reparameterization of each rotated residual in the rotated residual dataset into a direction component and a scale component. The multiscale quantization model can perform product quantization of the direction components of the plurality of rotated residuals, and perform scalar quantization of the scale components of the plurality of rotated residuals.

Abstract: According to the disclosure of the present document, a luma mapping with chroma scaling (LMCS) process may be simplified, and a linear LMCS may be applied. Accordingly, the complexity of the LMCS may be reduced and video/image coding efficiency may be increased.

Abstract: According to one embodiment, a compression device includes a first storage unit, a second storage unit, a calculation unit, and a comparison unit. The first storage unit stores addresses associated with hash values, respectively. The second storage unit includes storage areas specified by the addresses, respectively. The calculation unit determines a hash function to be used for first data in accordance with at least a part of the first data, and calculates a hash value using the hash function and at least a part of second data included in the first data. The comparison unit acquires third data from a storage area in the second storage unit specified by a first address, and compares the second data with the third data. The first address is stored in the first storage unit and is associated with the hash value.