Abstract: Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate, the heuristic computed by, for each one of the data classes, calculating an expected number of characters to be in a data class, calculating an expected number of characters that will not belong to a predefined set of the data classes, and calculating an actual number of the characters for each of the data classes and the non-classifiable data.

Abstract: An information processing apparatus encodes text data by using a word dictionary that allocates each of a plurality of words in a word group to a corresponding code and generates a count map indicating an appearance frequency of the plurality of words in the word group in the text data. The information processing apparatus associates the count map with encoded text data and stores it to a storage unit.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: Systems and methods for compressing a raw logical data object (201) for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimizatic in and restoring thereof. Compressing the raw logical data object (201) comprises creating in the storage device a compressed logical data object (203) comprising a header (204) and one or more allocated compressed sections with predefined size (205-1-205-2); compressing one or more sequentially obtained chunks of raw data (202-1-202-6) corresponding to the raw logical data object (201) thus giving rise to the compressed data chunks (207-1-207-6); and sequentially accommodating the processed data chunks into: said compressed sections (205-1-205-2) in accordance with an order said chunks received, wherein said compressed sections serve as atomic elements of compression/decompression operations during input/output transactions on the logical data object.

Abstract: A method for storing data of an image frame into a frame buffer includes at least the following steps: dividing the image frame into a plurality of access units, each having at least one encoding unit, wherein each encoding unit is a unit for data compression; and performing the data compression upon each encoding unit of the image frame, and generating an output bitstream to the frame buffer based on a data compression result of the encoding unit. A processing result of each access unit includes each output bitstream of the at least one encoding unit included in the access unit; a plurality of processing results of the access units are stored in a plurality of storage spaces allocated in the frame buffer, respectively; and a size of each of the storage spaces is equal to a size of a corresponding access unit.

Abstract: Methods and apparatus are described by which data is compressed using semi-dynamic Huffman code generation. Embodiments generate symbol statistics over a portion of data. The symbol statistics are expanded to include all possible literals that could appear within the data. Any literal or reference added to the statistics may be given a frequency of one. The statistics are used to generate a semi-dynamic Huffman code. The entire data is then compressed using the semi-dynamic Huffman code.

Abstract: Described herein are hash table structures and system and methods for creating and storing data in the hash table structures. Hash tables and input buffers associated with same are configured in several arrangements, including multi-level hash tables and nested multi-level hash tables. The hash table structures described herein are well suited for being configured in the memory blocks of field-programmable gate arrays.

Abstract: An information processing apparatus encodes text data by using a word dictionary that allocates each of a plurality of words in a word group to a corresponding code and generates a count map indicating an appearance frequency of the plurality of words in the word group in the text data. The information processing apparatus associates the count map with encoded text data and stores it to a storage unit.

Abstract: Disclosed is an online system that generates a density map of a particular location based records received from one or more reporting devices. To this end, the online system determines a relationship between time and a raster density for each unit area in a density map. The determined relationship between time and a raster density may be used to store, and transmit records as parameters of a parametrized function.

Abstract: A data conversion apparatus may include: a receiver suitable for receiving input data; and a controller suitable for selectively converting the input data based on a distribution of a preset bit value included in the input data, and outputting any one of the input data and the converted data as output data, the converted data having a smaller size than the input data.

Abstract: A method comprises receiving by a control system a sequence of symbols, translating the received sequence of symbols into a batch of commands parsable by an electronic controller of the electromechanical medical device, sending the batch of commands from the control system to the electromechanical device, and causing by the electronic controller the electromechanical medical device to execute the batch of commands on the electromechanical medical device.

Abstract: Described is a system for identifying data that may differ between files used as part of a replication process. The system may determine a type of segmentation used for segmenting data such as a variable size segmentation or a fixed size segmentation is used. Based on the segmentation of a file, the system may identify segments that may be modified. For example, the system may identify only the particular modified segments within a boundary when a fixed size segmentation is used identify all of the segments within a boundary as modified when a variable segmentation is used. Accordingly, depending on the scenario, the system may determine an efficient mechanism for identifying data to send to a target storage as part of a replication process.

Abstract: A method of accelerating copy operations is performed by a data storage appliance. The method includes (a) in response to receiving a copy command to copy from a source extent to a target extent, issuing a buffered read command to read from the source extent down a storage stack of the data storage appliance by a driver running on the data storage appliance, the source extent being part of a first logical disk backed by non-volatile storage of the data storage appliance and the target extent being part of a second logical disk backed by non-volatile storage of the data storage appliance, (b) in response to issuing, receiving at the driver an indication from the storage stack that the source extent is empty, and (c) in response to receiving, issuing a zero-fill command to fill the target extent with zeroes down the storage stack by the driver.

Abstract: Systems, apparatuses, and methods for compression of frequent data values across narrow links are disclosed. In one embodiment, a system includes a processor, a link interface unit, and a communication link. The link interface unit is configured to receive a data stream for transmission over the communication link, wherein the data stream is generated by the processor. The link interface unit determines if blocks of data of a first size from the data stream match one or more first data patterns and the link interface unit determines if blocks of data of a second size from the data stream match one or more second data patterns. The link interface unit sends, over the communication link, only blocks of data which do not match the first or second data patterns.

Abstract: A data storage device includes at least one data storage medium and a controller that is operably coupled to the at least one data storage medium. The controller receives the bit stream in a data storage device and performs a first level of compression on the received bit stream to obtain a symbol frame including a plurality of symbols. The controller encodes an initial portion of the plurality of symbols contained in the symbol frame by a fixed encoding scheme. The controller also collects statistics for the initial portion of the symbol frame. The controller then selects at least one data compression algorithm based on the collected statistics. The controller then performs compression encoding on a remaining portion of the symbol frame with the selected at least one data compression algorithm.

Abstract: Aspects of the present disclosure involve a transform domain regression convolutional neural network for image segmentation. Example embodiments include a system comprising a machine-readable storage medium storing instructions and computer-implemented methods for classifying one or more pixels in an image. The method may include analyzing the image to estimate one or more transform domain coefficients using a multi-layered function such as a convolutional neural network. The method may further include generating a segmented image by applying a change of basis transformation to the estimated one or more transform domain coefficients.

Abstract: A system for decoding a video bitstream includes receiving a frame of the video that includes at least one slice and at least one tile and where each of the at least one slice and the at least one tile are not all aligned with one another.

Abstract: A computing system includes a network interface, a processor, and a decompression circuit. In response to a compression request from the processor the decompression circuit compresses data to produce compressed data and transmits the compressed data through the network interface. In response to a decompression request from the processor for compressed data the decompression circuit retrieves the requested compressed data, speculatively detects codewords in each of a plurality of overlapping bit windows within the compressed data, selects valid codewords from some, but not all of the overlapping bit windows, decodes the selected valid codewords to generate decompressed data, and provides the decompressed data to the processor.

Abstract: A method may include receiving an extensible markup language schema definition (XSD) including a first element having a first simple datatype and a second element having a second simple datatype different from the first simple datatype. A grammar may be generated based on the XSD. The grammar may be associated with encoding and decoding an extensible markup language (XML) document based on the XSD to and from efficient XML interchange (EXI) streams. The grammar may be associated with the first simple datatype and with the second simple datatype.

Abstract: A data processing device includes a data selector circuit that divides a plurality of types of data into another plurality of types of data in accordance with a classification of the data, a plurality of compression circuits that respectively compress the plurality of types of data in parallel with each other in accordance with each of the plurality of types of data, and a data transmission circuit that transmits the plurality of types of compressed data to a terminal.

Abstract: The present invention relates to system, methods and computer programs for image/video encoding and compression suitable for various image/video types as indexed-color, grayscale and true color (red, green, blue (RGB) and cyan, magenta, yellow, black (CMYK image)) images/video of any bit depth. More particularly, the invention consists of dividing the image/video into plurality of partitions and encoding and compressing each image partition; image partition lines or video stream separately to provide plurality of compressed units. The invention is referring to regularities found in the structure of (grayscale and) color images: the regularities are found for the encoded stream(s) by the empiric way, analyzing statistical data of the encoded streams. It becomes possible to exploit the regularities (natural properties) of the image/video and make compression rate more efficient. Besides increasing lossless or lossy compression rate, they can be used for photo correction (for having more accurate images).

Abstract: In at least one embodiment, a history data structure of a Lempel-Ziv compressor is preloaded with fixed predetermined history data typical of actual data of a workload of the Lempel-Ziv compressor. The Lempel-Ziv compressor then compresses each of multiple data pages in a sequence of data pages by reference to the fixed predetermined history data.

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: Methods and system are disclosed that optimize attribute vectors to search for data. In one aspect, a reordering optimization model is executed to reorder the attribute vectors. The attribute vectors may include value identifiers associated with data. The attribute vectors are assigned priorities, sequence score corresponding to each attribute vector is computed and the attribute vectors are reordered based on the computed sequence score. The reordered attribute vectors are logically partitioned into attribute vector blocks by executing a partitioning optimization model. The attribute vector blocks may be generated upon executing the partitioning optimization model. The value identifiers in the attribute vector blocks may be rearranged to optimize the attribute vectors to search for data.

Abstract: An embodiment provides a method, including: detecting, via a wearable information handling device, a user motion; processing, via the wearable information handling device, the user motion into user motion data; determining, using a processor, that the user motion data is handwriting input; and converting, using the processor, the user motion data into a digital handwriting input. Other aspects are described and claimed.

Abstract: Data matches are calculated between input data and repository data via a digest based matching algorithm where in a first step digest matches, anchored at already verified matching positions in the input data and in the repository data, are extended to produce data matches. In a second step the remaining unmatched input digests are matched with repository digests and extended to produce further data matches.

Abstract: A decoding device is implemented on an integrated circuit, for decoding a market data input stream received in a given data representation format. The decoding device comprises an engine built around a finite state machine, the engine being generated from at least one description file and configured to perform the following steps, in a current state of the finite state machine: i) dividing the market data input stream into a number of tokens and reading a set of tokens, ii) accumulating the set of read tokens in internal registers, iii) generating output commands from the tokens accumulated in the internal registers depending on a condition related to the tokens accumulated in the internal registers, and iv) selecting the next state of the Finite State Machine state based on a triggering condition.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for training and deploying machine-learned communication over radio frequency (RF) channels. One of the methods includes: determining first information; using an encoder machine-learning network to process the first information and generate a first RF signal for transmission through a communication channel; determining a second RF signal that represents the first RF signal having been altered by transmission through the communication channel; using a decoder machine-learning network to process the second RF signal and generate second information as a reconstruction of the first information; calculating a measure of distance between the second information and the first information; and updating at least one of the encoder machine-learning network or the decoder machine-learning network based on the measure of distance between the second information and the first information.

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

Abstract: A method for RDO (Rate-Distortion Optimization) based on fit-curves contains at least the following steps: calculating a first fit-curve and a second fit-curve according to information regarding a first frame; carrying information regarding a second frame into the first and second fit-curves to calculate fit distortions and fit bit counts; calculating costs according to the fit distortions and the fit bit counts; determining the best block-division mode for the second frame according to the costs; and dividing the second frame into blocks according to the best block-division mode and encoding the second frame.

Abstract: A storage system is able to perform an operation of remote copy from a first storage apparatus to a second storage apparatus. A first control unit transfers summary information of copy target data stored in the first storage apparatus from the first storage apparatus to the second storage apparatus. A second control unit checks the summary information against information stored in the second storage apparatus. The second control unit transfers the checked result from the second storage apparatus to the first storage apparatus. If the checked result indicates matching discrepancy, the first control unit transfers the copy target data to the second storage apparatus and completes the remote copy operation.

Abstract: A system or method for processing a variable bit rate representation of an image sequence can include segmenting a variable bit rate representation of an image sequence into a plurality of segments and creating a second representation of the image sequence where a block of information from a first segment of the plurality of segments is interlaced with blocks of information of a second segment of the plurality of segments. The second representation of the image sequence can include a fragment header indicating the block of information of the first segment of the plurality of segments interlaced with the blocks of information of the second segment of the plurality of segments.

Abstract: The disclosed embodiments provide a system for detecting and managing memory inefficiency in a software program. During operation, the system obtains a first snapshot of a heap for a software program, wherein the first snapshot includes a first set of objects stored in the heap at a first time. Next, the system applies a compression technique to the first snapshot to obtain a first set of inefficiency metrics for the first set of objects, wherein each inefficiency metric in the first set of inefficiency metrics represents a memory inefficiency of an object in the heap at the first time. The system then outputs the first set of inefficiency metrics with additional attributes of the first set of objects to improve identification of the memory inefficiency in the software program.

Abstract: Technologies for flexibly compressing data include a computing device having an accelerator complex that is to receive a compression job request and schedule the compression job request for one or more hardware compression resources of the accelerator complex. The accelerator complex is further to perform the compression job request with the one or more hardware compression resources in response to scheduling the compression job request and to communicate uncompressed data and compressed data with an I/O subsystem of the computing device in response to performing the compression job request. Other embodiments are described and claimed.

Abstract: In one embodiment, a device receives data regarding a plurality of heterogeneous computing environments. The received data comprises measured application metrics for applications executed in the computing environments and indications of processing capabilities of the computing environments. The device generates a training dataset by applying a machine learning-based classifier to the received data regarding the plurality of existing heterogeneous environments. The device trains a machine learning-based configuration engine using the training dataset. The device uses the configuration engine to generate configuration parameters for a particular heterogeneous computing environment based on one or more system requirements of the particular heterogeneous computing environment. The device provides the configuration parameters to the particular heterogeneous computing environment.

Abstract: Computer processor hardware receives a first set of adjustment values. The first set of adjustment values specify adjustments to be made to a predicted rendition of a signal generated at a first level of quality to reconstruct a rendition of the signal at the first level of quality. The computer processor hardware processes the first set of adjustment values and derives a second set of adjustment values based on the first set of adjustment values and a rendition of the signal at a second level of quality. The second level of quality is lower than the first level of quality.

Abstract: A computer-implemented method for data-deduplication of genome data that is in different file formats is described. Representative data from different genome file formats is conformed to a selected file format and compared. Duplicate files are identified and duplicate files are released, with at least one file copy being retained.

Abstract: A system, method, and computer-readable medium for detecting malicious computer code are provided. A dataset may be accessed and converted to a binary dataset according to a predefined conversion algorithm. One or more cycles in the binary dataset may be identified. Statistical analysis may be performed on the identified one or more cycles. A determination that the set of dataset includes malicious software code may be made based on the performed statistical analysis.

Abstract: In accordance with the exemplary embodiments of the invention there is at least a method and apparatus to determine a shortest code length of at least one category of a publish-subscribe system such that a length requirement of prefix code system for the at least one category is not exceeded; and assign a prefix code of the shortest code length to each of the at least one category of the publish-subscribe system.

Abstract: A data compression apparatus is described which has an encoder configured to receive an input data item and to compress the data item into an encoding comprising a plurality of numerical values. The numerical values are grouped at least according to whether they relate to content of the input data item or style of the input data item. The encoder has been trained using a plurality of groups of training data items grouped according to the content and where training data items within individual ones of the groups vary with respect to the style. The encoder has been trained using a training objective which takes into account the groups.

Abstract: A mechanism is provided in a stream computing platform for data stream change detection and model swapping. The mechanism builds a model for each input data stream in a stream computing platform. Each tuple of each given input data stream is tagged with a key corresponding to the given input data stream. The mechanism performs an operation on each input data stream using its corresponding model. The mechanism detects a misdirected input data stream, which is tagged with a key that does not correspond to the misdirected input data stream. The mechanism pauses the misdirected input data stream swaps a model corresponding to the misdirected input data stream with another model corresponding to another paused input data stream.

Abstract: Methods and apparatus are provided for content-aware compression of data using multiple prediction functions.

Abstract: A mechanism is provided in a stream computing platform for data stream change detection and model swapping. The mechanism builds a model for each input data stream in a stream computing platform. Each tuple of each given input data stream is tagged with a key corresponding to the given input data stream. The mechanism performs an operation on each input data stream using its corresponding model. The mechanism detects a misdirected input data stream, which is tagged with a key that does not correspond to the misdirected input data stream. The mechanism pauses the misdirected input data stream swaps a model corresponding to the misdirected input data stream with another model corresponding to another paused input data stream.

Abstract: An apparatus and method for predicting a brand name of a product are disclosed herein. A product identification number for the product is converted into a normalized global trade item number (GTIN). For each of a plurality of GTIN prefixes corresponding to the normalized GTIN, brand names and counts of each of the brand names using product information stored in a product catalog are identified. A probability distribution of the brand names is determined in accordance with the brand names and the counts of the brand names for the plurality of the GTIN prefixes. A predicted brand name for the product is identified from among the brand names for the plurality of the GTIN prefixes, the predicted brand name having a highest probability score in the probability distribution of the brand names.

Abstract: Aspects for generating compressed data streams with lookback pre-fetch instructions are disclosed. A data compression system is provided and configured to receive and compress an uncompressed data stream as part of a lookback-based compression scheme. The data compression system determines if a current data block was previously compressed. If so, the data compression system is configured to insert a lookback instruction corresponding to the current data block into the compressed data stream. Each lookback instruction includes a lookback buffer index that points to an entry in a lookback buffer where decompressed data corresponding to the data block will be stored during a separate decompression scheme. Once the data blocks have been compressed, the data compression system is configured to move a lookback buffer index of each lookback instruction in the compressed data stream into a lookback pre-fetch instruction located earlier than the corresponding lookback instruction in the compressed data stream.

Abstract: Systems and techniques for losslessly reducing input data using a distributed system comprising multiple computers that maintain portions of a data structure that organizes prime data elements based on names of the prime data elements. During operation, a first computer can determine a first name for the element, and send the element to a second computer based on the first name. The second computer can losslessly reduce the element by determining a second name for the element, and using the second name to navigate through a portion of the data structure maintained at the second computer.

Abstract: A method for compressing a data structure generated for a computing system includes: generating a table comprising block values of a set of blocks in the data structure, where a block size of each block in the set of blocks is determined by an architecture of the computing system and the values are a threshold number of the most frequently occurring values; determining whether a first value of a block is stored in the table, where the block occurs; storing, in response to determining that the first value is stored in the table, a table index of the first value in a first data structure; storing, in a second data structure, a second value indicating whether the first value is stored in the table; generating a compressed data structure, where the compressed data structure comprises the table, first data structure and the second data structure.

Abstract: Methods and apparatus are described by for compressing data using LZ77 compression. Embodiments determine an initial run from input data. The initial run includes repeating data at a first location and has a first length. A hash chain is updated with a proper set of hashes from prefixes from the initial run. A first search engine determines a second run that includes the repeating data at a second location. The second run has a second length less than the first length. A first matching location is determined within the input data having the repeating data using the hash chain and the second run. The first matching location is the first location. The first matching location, the second location, and the second length are written to an output buffer. The output buffer includes a compressed version of the input data.

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: A method of rendering an image in a display apparatus includes acquiring information about a repeated shape that represents at least a part of one or more geometric shapes included in the image and repeatedly occurs in the one or more geometric shapes; acquiring rendering information representing a method of rendering the one or more geometric shapes based on the information about the repeated shape; and rendering the one or more geometric shapes based on the information about the repeated shape and the rendering information.