47results about How to "Quick decompression" patented technology

A compressing method of image data is carried out by a first process of dividing the image data into a plurality of blocks, a second process of linearly scanning the image data within the block by a given scan method defining a pattern of linearly scanning the image data of the block so as to arrange the image data in series, and a third process of compressing the arranged image data so as to reduce an amount of the image data of the block. The second process and the third process are repeatedly applied to the same block with using different scan methods defining different patterns of linearly scanning the image data, then an optimum one of the different scan methods is selected, which succeeds in most reducing the amount of the image data, and the compressed image data arranged by the selected scan method is outputted together with indication of the selected scan method.

Method and apparatus for compressing data representing a set of symbols such that each symbol of the set can be separately accessed and decompressed. Each symbol of the set of symbols is encoded in the form of a two-pair code wherein a first part of the code is common for all encoded symbols and a second part of the code encodes the data representing a symbol. An identifier is given for each symbol for permitting each encoded symbol to be separately accessed and decompressed. The invention is particularly useful for storing large fonts such as a Chinese or Japanese character set.

A method for compressing data comprising, selecting a dictionary, compressing data using the dictionary, and appending an indicator to the compressed data, wherein the indicator comprises an indicator value representing the dictionary. A compression algorithm may also be defined, wherein the compressing of data comprises compressing data using the selected compression algorithm and dictionary, and wherein the first indicator further comprises a second indicator value representing the compression algorithm.

A shock reduction muzzle brake 100 for the muzzle end of a gun barrel 106 (i) maintains sufficient rearward-facing surface area in the path of the expanding propellant gas to counter the recoil, while also (ii) guiding shock waves away from a path of a projectile 104 and (iii) decreasing the rate of base decompression to minimize decompression shock. The muzzle brake 100 includes (a) a tube 102 that defines a path for a projectile 104, and (b) multiple forwardly-inclined holes 122 extending through the side wall 116 of the tube 102 to divert propellant gases away from the path of the projectile 104. The forwardly-inclined holes 122 have an outlet of that is closer to the forward end 114 of the tube 102 than the inlet of the hole 122, thereby limiting the surface area that could reflect shock waves back onto the projectile 104. The holes 122 are sized to slow release of the base pressure to minimize decompression shock.

A lining panel having a panel element, a rectangular through hole and a flap is provided. The lining panel has a flap which is rotatable about a hinge integrated into the panel element in order to open and/or close the rectangular through hole. A fuselage element for an aircraft includes such a lining panel.

A host device divides original data into first to N^th stream data for N being an integer of two or more, generates first to N^th compressed stream data by sequentially compressing the first to N^th stream data with a variable length compression, divides the first to N^th compressed stream data into fixed-length blocks, and sequentially transmits the fixed-length blocks to the display driver. The display driver includes a memory storing therein the fixed-length blocks and a decompression circuitry reading out the fixed-length blocks from the memory. The decompression circuitry includes first to N^th processing circuits. The first to N^th processing circuits each perform a predetermined process on the fixed-length blocks received to generate processed data. The host device sorts the fixed-length blocks so that the fixed-length blocks are supplied in the order in which the first to N^th processing circuits require the fixed-length blocks.

The invention discloses a compression method for extensive makeup language (XML) data node coding. The compression method for the XML data node coding comprises the following steps: generating XML data into an XML document tree; encoding each node in the XML document tree; and compressing and storing the node coding. The compression method for the XML data node coding is a compression method without any damages and has the advantages of being simple and easy to use. The coding and the coding compression rules are simple, so that comprehension is easy and programming is convenient to achieve. Decompression is rapid and an encoding operation is benefited. When the coding is compressed, the structure information of the coding is still kept, so that decompression is not needed and the special structural relationship can be judged by comparing bit strings directly. By adopting sectional compression, the integers of the coding can not affect each other. When a decompression operation is conducted, the bit strings do not need to be decompressed all. The decompression can be conducted in order as needed by section, so that the performance of the coding operation is improved.

A ground-based system and apparatus useful for simulating a high altitude hypobaric environment, the system including a plurality of hypobaric test chambers of different sizes that can be quickly and efficiently evacuated by means of a depressurization apparatus further comprising a plurality of operatively connected vacuum tanks to produce, selectively adjust and sustainably control the hypobaric environment for a desired interval ranging from minutes to weeks. The subject test chambers each have at least one large viewing port providing clear interior visibility to an external observer and desirably also include apparatus for conveniently maneuvering payloads into and out of the test chambers.

The invention discloses a device and technology for reading life cycle information of an OFD layout file. According to the method, the binary stream content in the OFD layout file is directly read through a decompression technology, and the life cycle file in the OFD layout file is obtained through step-by-step searching. By means of the method, people can read the content of the OFD file through the device and the technology, and the life cycle information of the OFD layout file can be effectively looked up; the binary stream content in the OFD layout file is directly read through the decompression technology, the process and time for decompressing the binary stream content to a temporary directory can be effectively omitted, and the reading efficiency of the OFD layout file is improved. No matter whether the file is in the application environment or leaves the application environment, the main process information and behavior information of the life cycle of the file in the original application system can be quickly and efficiently seen.

The invention relates to an infrared forwarding system, an infrared repeater and a data learning method thereof, and belongs to the field of smart home control. The method comprises the steps: receiving infrared code waveform data composed of N high and low levels, recording the duration of each level, and obtaining level duration data; learning the infrared code waveform data: encoding each levelduration in the level duration data, compressing the encoded level duration into an encoded sequence composed of a plurality of code values, recording at least one code value in the sequence as a high level or a low level, wherein each code value is code of duration of the corresponding level ; and obtaining a compressed code of the infrared code waveform data, and storing the compressed code. Compared with an existing directly collected and stored infrared code waveform data volume, the converted compressed coded data volume is greatly reduced, a required storage space is small, storage costof an infrared transponder can be reduced, and economy is higher.

The invention relates to a DMD-based photoetching machine 3D gray level image exposure optimization method. The method comprises the following steps of (1) performing gray level image preprocessing onimage data to obtain to-be-processed data; (2) determining a proper thread count and the number of thread blocks according to a formulas that B is equal to (((J+N-1)/N)+T-1)/T, wherein B represents the number of thread blocks, J represents the number of bytes of to-be-processed data, N represents the number of bytes processed by each thread, and T represents the thread count; (3) performing segment processing on the to-be-processed data; and (4) performing recombination on the segment processed data, and sub-ducting invalid data. The DMD gray level exposure image is subjected to pixel compression by CUDA through an upper computer, and the compressed data is transmitted by a network interface, so that the bandwidth limitation of data transmission is lowered, and the gray level scanning exposure efficiency of the photoetching machine is improved.

The invention discloses a safe computer network communication system. The system comprises a sending end sandbox isolation system, a file transmission unit and a receiving end; the sending end sandboxisolation system comprises an analog signal copy output module, an analog signal storage module, a file compression system, a security encryption system, a key file conversion unit, a file decryptionprogram, a signal key binding module and a firewall protection system. The invention relates to the technical field of communication systems. The invention discloses the safe computer network communication system. A secret key is divided into two parts according to a specified coding sequence, wherein the two parts are bound to a transmitted compressed packet and a transmitted file decryption program respectively and are transmitted twice, wherein the secret keys in one time are incomplete, and files cannot be cracked even if one group is stolen, so the safety of data is further guaranteed, and the method is suitable for transmission of confidential files; meanwhile, a file decryption program is attached to the method, after all the data are completely received, the decryption and decompression can be rapidly and automatically conducted, and manual step-by-step operation is not needed.

The invention discloses a capability negotiation-based file compression algorithm selection method, which comprises the following steps of: compressing a test file by using all compression algorithms in a first compression module to generate a test file compression package, and recording compression time as first duration; all the generated test file compressed packages are sent to a file receiving end, and the file receiving end decompresses the related test file compressed packages by adopting corresponding compression algorithms in a second compression module and records respective decompression time as second duration; the second duration is sent to the file sending end, the file sending end adds the first duration and the second duration corresponding to the same compression algorithm, and the sum is recorded as the total duration; and selecting the compression algorithm with the minimum total duration as the compression algorithm for subsequent file compression and decompression. According to the method, the optimal compression algorithm can be selected according to the specific processing capacity of the file sending end and the file receiving end, and rapid compression and decompression of the file are achieved.