Patent classifications
H03M7/707
NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM FOR STORING PROGRAM, OUTPUT METHOD, AND OUTPUT SYSTEM
An output method executed by a computer includes: receiving compressed data encoded in a state in which a page break is identifiable in print data having a plurality of pages and an encoding dictionary used for the encoding; identifying the page break of the received compressed data and partially decompressing the received compressed data into the print data in units of pages, by using the encoding dictionary; and outputting the print data in order of the decompression.
METHOD FOR CONTROLLING ACTIVITY INDICATORS OF AN ELECTRONIC APPLIANCE
A method for controlling activity indicators (161-164) for indicating activity of interface drivers (230-250) of an electronic appliance, wherein the electronic appliance comprises a memory (114) with a file system (210), wherein each interface driver (230-250) has associated a corresponding directory in the file system (210) for storing files representative of an activity of the interface driver (230-250), the method comprising periodically performing a background process (270) comprising: calculating (414) a current message digest for the file corresponding to the interface driver (230-250) activity; comparing (416) the message digest with the last stored message digest; upon detecting a change of the message digest (419, 422), generating (420, 423) a state message for the activity indicator (161-164) corresponding to the interface driver (230-250); sending the state message the activity indicator (161-164).
DEVICE AND METHOD FOR PROCESSING A BINARY-CODED STRUCTURE DOCUMENT
A binary-coded structure document, (e.g., in an EXI format which is based on a structure document designed in a text-based description language, such as XML), is provided with a binary-coded index document, which is based on a structural part of the structure document. A storage representation of the binary-coded index document is stored in a working storage unit of the device, and the binary-coded structure document is stored in a background storage unit assigned to the device. A processing operation or a request by at least one processing process is carried out by accessing the storage representation of the binary-coded index document via an object interface, and in certain examples, fragments of the binary-coded structure document are loaded into the working storage unit by the object interface. By carrying out processing operations on the binary-coded index document, faster request operations are facilitated in that specific requests may already be processed using the index document BCI without the involvement of the binary-coded structure document.
Creation of hierarchical dictionary
A method of creating a hierarchical dictionary comprises, with a processor, extracting a number of symbols from a first image, constructing a number of refinement dictionary entries based on the symbols, the refinement dictionary entries forming a refinement dictionary, grouping a number of the refinement dictionary entries into clusters to form a number of refinement dictionary entry clusters, and constructing a number of direct dictionary entries for each of the refinement dictionary entry clusters, the direct dictionary entries forming a direct dictionary.
METHODS AND SYSTEMS FOR COMPRESSED FAST HEALTHCARE INTEROPERABILITY RESOURCE (FHIR) FILE SIMILARITY SEARCHING
A method (100) for generating a compressed Fast Healthcare Interoperability Resources (FHIR) file using a file compression system (200), comprising: (i) receiving (104) an uncompressed FHIR file; (ii) extracting (106), from the uncompressed file, a predetermined plurality of different resource types: (iii) generating (108), from the extracted predetermined plurality of different resource types, a fixed-length FHIR patient profile fingerprint, wherein the fixed-length FHIR patient profile fingerprint comprises a fixed-length floating point value feature vector, the fixed-length floating point value feature vector comprising a predetermined plurality of sub-feature vectors each representing a different extracted resource type, and wherein each sub-feature vector comprises a plurality of elements of the respective extracted resource type; (iv) compressing (110), using a trained compression algorithm, the generated fixed-length FHIR patient profile fingerprint to generate a compressed FHIR fingerprint; and (v) storing (112) the compressed FHIR fingerprint in a database.
Systems and methods for lossless compression of tabular numeric data
Systems and methods for lossless compression of tabular numeric data are provided. The system can include one or more data compression servers executing data compression system code to compress the tabular numeric data, a storage database to store the compressed tabular numeric data, and one or more data decompression servers to decompress the tabular numeric data for use. The one or more data compression servers, the storage database, and the one or more data decompression servers can communicate via a communication network. The system can receive the uncompressed tabular numeric data from one or more data generation systems, processes the uncompressed tabular numeric data with the data compression system code, and generate a compressed table of numeric information, which can be stored in the database, or later decompressed by the one or more data decompression servers.
DEVICE FOR AND METHOD OF DETERMINING A LENGTH OF A RELEVANT HISTORY
A device (100) for and a method of determining a length of a history of instances of a first type of data are provided. The device comprises a second data set unit (104), a first data set unit (102), a first conditional entropy unit (106), a threshold unit (108), and a length determining unit (114). The first data set unit, the second data set unit and the threshold unit obtain input data. The first conditional entropy unit determines a first conditional entropy for a second data set given a first data set. The determining unit searches for a length of the relevant history by determining a smallest length for sequences of a reduced first set of data for which a second conditional entropy for the second set of data, given the reduced first set of data, is within a maximum entropy increase threshold from the first conditional entropy.
COMPRESSION OF SEMI-STRUCTURED DATA
A method for compressing semi-structured data is discussed. The method includes accessing semi-structured data, the semi-structured data comprising a plurality of elements. The method includes determining a plurality of unique elements of the plurality of elements, each of the plurality of unique elements associated with a respective unique index of a plurality of unique indexes. Each of the unique index can indicate a position in one of a plurality of data stores. The method includes generating a sequence of encoded representations corresponding to the plurality of elements, the generating based on the plurality of unique indexes.
COMPRESSION OF JAVASCRIPT OBJECT NOTATION DATA USING STRUCTURE INFORMATION
A method for encoding and decoding a javascript object notation (JSON) document utilizing a statistical tree representing a JSON Schema. The encoded statistical tree may be optimized.
Systems and Methods for Improving Compression of Structured Data in Three-Dimensional Applications
Systems and methods for encoding and compressing structured data for rendering computer-generated graphics in three-dimensional applications are described herein. In various implementations, structured data may be encoded into an intermediate symbol stream using frequency tables specifically for a type of structured data object, field, or value being encoded. In some implementations, additional information may be incorporated into the symbols used to encode individual structured data objects. In some implementations, structured data objects may be encoded based on a context associated with the structured data object. Once structured data is encoded as an intermediate symbol stream, the intermediate symbol stream may be compressed using one or more entropy coding methods. By taking into account the underlying structure of the data, the systems and methods described herein reduce redundancies, thereby improving compression of the structured data.