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: 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: 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: 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: 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: 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: 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.

Abstract: A method of integrated circuit includes: providing a non-volatile memory circuit for securely and permanently recording and protecting key data content having Y bits; providing a programmable memory circuit for storing user configuration data content having X bits greater than Y bits; converting the user configuration data content having X bits into user configuration key content having Y bits; comparing the user configuration key content having Y bits with the key data content having Y bits; selecting fallback configuration data content having X bits as output data when the user configuration key content does not match the key data content; selecting the user configuration data content having X bits as the output data when the user configuration key content matches the key data content; and receiving the output data of the decision circuit and performing at least one corresponding capability operation according to the output data.

Abstract: A method of and system for gate-level masking of secret data during a cryptographic process is described. A mask share is determined, wherein a first portion of the mask share includes a first number of zero-values and a second number of one-values, and a second portion of the mask share includes the first number of one-values and the second number of zero-values. Masked data values and the first portion of the mask share are input into a first portion of masked gate logic, and the masked data values and the second portion of the mask share are input into a second portion of the masked gate logic. A first output from the first portion of the masked gate logic and a second output from the second portion of the masked gate logic are identified, wherein either the first output or the second output is a zero-value.

Abstract: Embodiments of the disclosure are drawn to apparatuses and methods for determining extremum numerical values. Numerical values may be stored in files of a stack, with each bit of the numerical value stored in a content addressable memory (CAM) cell of the file. Each file may be associated with an accumulator circuit, which provides an accumulator signal. An extremum search operation may be performed where a sequence of comparison bits are compared in a bit-by-bit fashion to each bit of the numerical values. The accumulator circuits each provide an accumulator signal which indicates if the numerical value in the associated file is an extremum value or not. Examples of extremum search operations include finding a maximum of the numerical values and a minimum of the numerical values.

Abstract: A lossless data compression method that comprises the receiving of a series of data segments of a known length and a known characteristic and the pre-processing of the series of data segments to generate a series of differential data, which comprises a first value, one or more differential values and a last differential value. The method further comprises the dividing of the series of differential data into at least two blocks of differential data and the encoding of at least one block of differential data using Rice encoding, thereby providing at least one block of encoded differential data. In addition, the method comprises the generating of a data packet that comprises said at least one blocks of encoded differential data and any blocks of differential data not having been encoded.

Abstract: Systems, methods, and machine-readable media are disclosed for enabling high-performance programming via a composite programming language that gives programmers complete control over the compilation process. The composite programs include two language levels: an object program level (source code), and a metaprogram level that describes how a compiler should be customized in order to optimize the source code for a target hardware environment. When an augmented compiler receives a composite program, it recognizes the metaprogram and implements the one or more parameters specified within the composite program to optimize the compiler for a given target. Once the augmented compiler has been, it proceeds with compiling the source code included in the composite program. The compiled code is then output as machine language and may be executed by one or more computing systems.

Abstract: In various examples, metadata may be generated corresponding to compressed data streams that are compressed according to serial compression algorithms—such as arithmetic encoding, entropy encoding, etc.—in order to allow for parallel decompression of the compressed data. As a result, modification to the compressed data stream itself may not be required, and bandwidth and storage requirements of the system may be minimally impacted. In addition, by parallelizing the decompression, the system may benefit from faster decompression times while also reducing or entirely removing the adoption cycle for systems using the metadata for parallel decompression.

Abstract: A method for text compression comprises recognizing a prefix string of one or more text characters preceding a target string of a plurality of text characters to be compressed. The prefix string is provided to a natural language generation (NLG) model configured to output one or more predicted continuations each having an associated rank. If the one or more predicted continuations include a matching predicted continuation relative to the next one or more text characters of the target string, the next one or more text characters are compressed as an NLG-type compressed representation. If no predicted continuations match the next one or more text characters of the target string, a longest matching entry in a compression dictionary is identified. The next one or more text characters of the target string are compressed as a dictionary-type compressed representation that includes the dictionary index value of the longest matching entry.

Abstract: The present invention provides a computer-implemented method, computer system and computer program product for data compression. According to the computer-implemented method, one or more data blocks on a data source to be replicated to a data target may be detected. Then, compression performance of a first compression dictionary may be evaluated. The first compression dictionary may be previously used to compress existing data on the data target. If the compression performance is lower than a preset performance threshold, a second compression dictionary may be generated based on the existing data on the data target. The data target may be updated based on the existing data and the one or more data blocks using the second compression dictionary.

Abstract: Systems and methods may be provided for masking data on public networks, such as social networking sites. 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 privacy agent may process input field content to try to detect encoding markers in the input field content, which define portions of the content that are to be encoded. A third party key server may be used to store decoding keys. A URI reference to the decoding key may be used to access the decoding key by a node attempting to view the decoded version of the input field content.

Abstract: The disclosure relates to a modified NFC framing is used by a reader and selected devices during at least a part of the communication between the reader and the selected devices. The reader and the selected devices store modification rules for modifying the frames. Devices not storing those modification rules will discard the received modified frames.

Abstract: A system and method for encoding anonymized dataset. 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 as an anonymized tally record 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. Then a half-backed codebook is created using the tokens and each token's unique codeword, before sending the half-backed codebook to a system user.

Abstract: The present disclosure relates to a search technology using a data structure for supporting multi-search in a blockchain-based IoT environment, and a method for providing a search function for blockchain includes receiving block data via a network, verifying transactions included in the received block data, and adding the block data as a node to an index tree of multidimensional index structures based on information about each transaction in the transaction verification.

Abstract: An encoding method includes traversing a to-be-encoded string, searching for a preset string in the to-be-encoded string, and deleting the preset string in the to-be-encoded string if the preset string is found, to obtain a target string.

Abstract: Systems and methods may be provided for masking data on public networks, such as social networking sites. At a publishing node, the system may monitor data input fields in a webpage that are processed by an internet browser. The system may intercept data, such as text, images, and video input at the data input fields, prior to the data being posted online on a public service provider's website. The publishing node may control which users are permitted access to the posted data by defining a policy associated with the data input field. The posted data may be transformed or tokenized to ensure that it is inaccessible to a user (or group of users) unless that user/group is granted access to the decoding key under the policy. In this way, data security and data control may be provided to a publishing user node. Data that has already been posted may be destroyed, for example, by deleting the decryption key or a token.

Abstract: A method for processing a video 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: Examples of the disclosure describe systems and methods for implementing a file compression system. In an example method, a source string to be compressed is received. The source string comprises a plurality of characters. A first frequency is determined for each character of the plurality of characters of the source string. A first tree corresponding to the source string is determined based on the first frequencies. The source string is encoded using the first tree to generate a first encoded string. It is determined whether a total number of bits in the first encoded string is a multiple of eight. In accordance with a determination that the total number of bits in the first encoded string is not a multiple of eight, the first encoded string is appended with zeroes so that a new total number of bits in the first encoded string is a multiple of eight.

Abstract: A device of executing a cryptographic operation on bit vectors, the execution of the cryptographic operation includes the execution of at least one arithmetic addition operation between a first operand and a second operand. Each operand comprises a set of components, each component corresponding to a given bit position of the operand. The device comprises a set of elementary adders, each elementary adder being associated with a given bit position of the operands and being configured to perform a bitwise addition between a component of the first operand at the given bit position and the corresponding component of the second operand at the given bit position using the carry generated by the computation performed by the elementary adder corresponding to the previous bit position. Each elementary adder has a sum output corresponding to the bitwise addition and a carry output, the result of the arithmetic addition operation being derived from the sum outputs provided by each elementary adder.

Abstract: The present disclosure provides an integrated circuit chip device and a related product. The integrated circuit chip device includes: a primary processing circuit and a plurality of basic processing circuits. The primary processing circuit or at least one of the plurality of basic processing circuits includes the compression mapping circuits configured to perform compression on each data of a neural network operation. The technical solution provided by the present disclosure has the advantages of a small amount of computations and low power consumption.

Abstract: The present disclosure relates to a method and apparatus for recording mileage data of a vehicle on a blockchain. A method for recording mileage data of a vehicle on a blockchain is provided, including: providing a vehicle database and a mileage database, where the vehicle database is configured to store an identification number that uniquely identifies a vehicle, and the mileage database is configured to store mileage data about vehicle kilometers of travel (VKT); obtaining a vehicle identification number (VIN) from the vehicle database; obtaining the mileage data of the vehicle from the mileage database according to the VIN; and storing data related to the mileage data in the blockchain.

Abstract: An example device for coding video data includes a memory configured to store video data; and one or more processors implemented in circuitry and configured to: code a first codeword representing a selected transform scheme of a set of transform candidates of a multiple transform selection (MTS) scheme for a current block of video data, the selected transform scheme being a secondary transform of a set of available secondary transforms to be applied in addition to a primary transform; code a second codeword representing the secondary transform from the set of available secondary transforms; and apply the primary transform and the secondary transform during coding of residual data for the current block. The second codeword may be a value for a low-frequency non-separable transform (LFNST) syntax element.

Abstract: A method is performed by a network element (NE) in a network implementing an Interior Gateway Protocol (IGP). The method comprises generating a message comprising a header and data, wherein the header comprises a length of the data prior to compressing the data, a length of the data after compressing the data, and a compression identifier, compressing the data based on a compression scheme identified by the compression identifier to obtain compressed data, and forwarding a compressed message comprising the header and the compressed data to another NE in the network.

Abstract: Disclosed techniques include deduplication. Techniques include determining whether a file is unique, and depending on whether the file is unique, deduplicating only part of the file or the entire file. The techniques include processing the first chunk of a file to determine whether the hash of the chunk hash is already within a chunk hash table, and if not, then a percentage of chunks of the file is similarly processed. If any of the hashes of chunks are already in the chunk hash table, then at least some of file has been previously deduplicated, and file is not unique the storage system. If none of the processed chunks have a hash that is already in the chunk hash table, then the file is considered to be unique within chunk store and only a partial percentage of the file's chunks are deduplicated. Not all of a unique file's chunks are deduplicated.

Abstract: Techniques are disclosed relating to detecting matching datasets using encode values. In various embodiments, a data monitoring system may perform encoding operations on a first dataset to generate a first encode value that corresponds to a particular one of one or more fields included in the first dataset. The data monitoring system may then determine whether the first dataset matches a previously analyzed dataset. For example, in some embodiments, data monitoring system may compare the first encode value to a previous encode value that corresponds to a second field of the previously analyzed dataset. Based on this comparison, the data monitoring system may generate an output value that is indicative of a similarity between the first encode value and the previous encode value. The data monitoring system may then determine whether the first dataset matches the previously analyzed dataset based on this output value.

Abstract: Embodiments are directed to managing character encoding. A plurality characters that are each encoded as code units based on a character code may be provided such that the code units for each character represents a code point of a character encoding scheme. An encoding model may be determined based on the character code, one or more processor features, and a target character code. Process features may be employed to transform the code units into target code units based on the encoding model such that the target code units are based on the target character code and such that the target code units encode the code point for each character. The plurality of target characters may be provided to a target stream such that each target character may be encoded as the target code units.

Abstract: Representative embodiments are disclosed for a rapid and highly parallel decompression of compressed executable and other files, such as executable files for operating systems and applications, having compressed blocks including run length encoded (“RLE”) data having data-dependent references. An exemplary embodiment includes a plurality of processors or processor cores to identify a start or end of each compressed block; to partially decompress, in parallel, a selected compressed block into independent data, dependent (RLE) data, and linked dependent (RLE) data; to sequence the independent data, dependent (RLE) data, and linked dependent (RLE) data from a plurality of partial decompressions of a plurality of compressed blocks, to obtain data specified by the dependent (RLE) data and linked dependent (RLE) data, and to insert the obtained data into a corresponding location in an uncompressed file.

Abstract: One or more units of decompressed data of a plurality of units of decompressed data is written to a target location for subsequent writing to memory. The plurality of units of decompressed data includes a plurality of symbol outputs and has associated therewith a plurality of decompression headers. A determination is made that the subsequent writing to memory of at least a portion of another unit of decompressed data to be written to the target location is to be stalled. A symbol start position of the other unit of decompressed data and a decompression header of a selected unit of the one or more units of decompressed data written to the target location are provided to a component of the computing environment. The decompression header is used for the subsequent writing of the other unit of decompressed data to memory.

Abstract: To provide a data compression/decompression system that can appropriately decompress compressed data. A first computer generates first identification information that can identify a first execution environment; and stores the first identification information on a storage device in association with compressed data of data. A second computer generates second identification information that can identify a second execution environment; and determines whether or not the first identification information, and the second identification information match.

Abstract: A method, an electronic device, and a computer program product for managing a file system are provided. For example, the method comprises causing multiple data blocks to be written to a storage space of the file system, the size of each of the multiple data blocks being not lower than a threshold size, and creating at least one space fragment in the storage space, the size of each of the at least one space fragment not exceeding the threshold size. Therefore, this solution can quickly and efficiently age a file system.

Abstract: A decompression system has a plurality of decompression devices in an array or chain layout for decompressing respective compressed data values of a compressed data block. A first decompression device is connected to a next decompression device, and a last decompression device is connected to a preceding decompression device. The first decompression device decompresses a compressed data value and reduces the compressed data block by extracting a codeword of the compressed data value and removing the compressed data value from the compressed data block, retrieving a decompressed data value out of the extracted codeword, and passing the reduced compressed data block to the next decompression device. The last decompression device receives a reduced compressed data block from the preceding decompression device and decompresses another compressed data value by extracting a codeword of the other compressed data value, and retrieving another decompressed data value out of the extracted codeword.

Abstract: The disclosure relates to compressing strings by reducing the number of string characters that are stored. For example, a system may generate a first radix tree for a set of strings and a second radix tree for a reverse of each of the set of strings. The system may merge nodes of the first radix tree and/or second radix tree based on a tuning parameter. The system may identify, based on the first radix tree, beginning portions of at least two strings that match and identify, based on the second radix tree, ending portions of at least two strings that match. The system may use the matching beginning portions, the unique portions, and/or the matching ending portions to generate a pattern that matches the two or more strings. The system may store the two or more strings in association with the generated pattern without their matching beginning and/or ending portions.

Abstract: Apparatuses and methods related to tracking unauthorized access commands for memory. Identifying unauthorized memory access can include verifying whether an access command is authorized to access a protected region of a memory array. The authorization can be verified utilizing a key and a memory address corresponding to the access command. If an access command is authorized to access a protected region, then a row of the memory array corresponding to the access command can be activated. If an access command is not authorized to access the protected region, then an access count can be incremented to signify the unauthorized access command.

Abstract: To speed up decoding of a range code. A decompression circuit calculates a plurality of candidate bit values for each bit of the N-bit string based on a plurality of possible bit histories of a bit before a K-th bit in parallel for a plurality of bits, and repeatedly selects a correct bit value of the K-th bit from the plurality of candidate bit values based on a correct bit history of the bit before the K-th bit to decode the N-bit string.

Abstract: An image decoding method, according to the present document, comprises a step of generating residual samples for a current block on the basis of residual information, wherein the residual samples are generated on the basis of information on a transform kernel set and transform coefficients for the current block, the transform coefficients are derived on the basis of the residual information, and the information on the transform kernel set represents a transform kernel set to be applied to the current block from among transform kernel set candidates. At least one bin from among bins of a bin string of the information on the transform kernel set is derived on the basis of context coding, and the context coding is performed on the basis of at least one context model.

Abstract: An apparatus that operates in a first mode of operation to enable performance of a first predetermined task to transfer data via a transmitter device to a receiver device across a first communication channel using a first artificial neural network, wherein the first artificial neural network is partitioned to the transmitter device and the receiver device, and operate in a second mode of operation to enable performance of a second predetermined task to transfer data via the transmitter device to the receiver device across a second communication channel using a second artificial neural network, wherein the second artificial neural network is partitioned to the transmitter device and the receiver device, and determine to operate the apparatus in the first mode or the second mode.