679 results about "Code table" patented technology

A method and apparatus for updating video graphics changes of a managed server to a remote console independent of an operating system. The screen (e.g. frame buffer) of the managed server is divided into a number of blocks. Each block is periodically monitored for changes by calculating a hash code and storing the code in a hash code table. When the hash code changes, the block is transmitted to the remote console. Color condensing may be performed on the color values of the block before the hash codes are calculated and before transmission. Compression is performed on each block and across blocks to reduce bandwidth requirements on transmission. Periodically, the configuration of a video graphics controller and a pointing device of the managed server are checked for changes, such as changes to resolution, color depth and cursor movement. If changes are found, the changes are transmitted to the remote console. The method and apparatus may be performed by a separate processor as part of a remote management board, a "virtual" processor by causing the processor of the managed server to enter a system management mode, or a combination of the two.

Entropy coding and decoding techniques are described, which may be implemented separately or in combination. For example, a video encoder uses two-layer run level coding to reduce bitrate for frequency transform coefficients in a quick and efficient manner, and a video decoder uses corresponding two-layer run level decoding. This two-layer coding/decoding can be generalized to more than two layers of run level coding/decoding. The video encoder and decoder exploit common patterns in run level information to reduce code table size and create opportunities for early termination of decoding. Using zoned Huffman code tables helps limit overall table size while still providing a level of adaptivity in encoding and decoding. Using embedded Huffman code tables allows the encoder and decoder to reuse codes for 8×8, 8×4, 4×8, and 4×4 blocks.

A block transform-based digital media codec more efficiently encodes transform coefficients by jointly-coding non-zero coefficients along with succeeding runs of zero-value coefficients. When a non-zero coefficient is the last in its block, a last indicator is substituted for the run value in the symbol for that coefficient. Initial non-zero coefficients are indicated in a special symbol which jointly-codes the non-zero coefficient along with initial and subsequent runs of zeroes. The codec allows for multiple coding contexts by recognizing breaks in runs of non-zero coefficients and coding non-zero coefficients on either side of such a break separately. The codec also reduces code table size by indicating in each symbol whether a non-zero coefficient has absolute value greater than 1 and whether runs of zeros have positive value, and separately encodes the level of the coefficients and the length of the runs outside of the symbols.

A n-gram statistical analysis is employed to acquire frequently appearing character strings of n characters or more, and individual character strings having n characters or more are replaced by character translation codes of 1 byte each. The correlation between the original character strings having n characters and the character translation codes is registered in a character translation code table. Assume that a character string of three characters, i.e., a character string of three bytes, "sta," is registered as 1-byte code "e5" and that a character string of four characters, i.e., a character string of four bytes, "tion," is registered as 1-byte code "f1." Then, the word "station," which consists of a character string of seven characters, i.e., seven bytes, is represented by the 2-byte code "e5 f1," so that this contributes to a compression of five bytes.

An image data compression and decompression technique applies one or more compression code tables to optimally compress an image data stream. The compression code tables are established in accordance with anticipated image characteristics, and to accommodate different levels of variation or entropy in the image data. The image data may be divided into blocks or subregions for analysis of which of the candidate compression code tables provides the optimal compression of each subregion. The appropriate code table is selected for each subregion. The evaluation of the compression performance based upon application of each compression code table may include analysis of prediction differences or errors between predicted values for pixels of an image and the actual values for the pixels.

Techniques and tools for code table selection and joint coding/decoding of macroblock mode information for macroblocks of interlaced forward-predicted frames are described. For example, a video decoder decodes a variable length code that jointly signals macroblock mode information for a motion-compensated macroblock. The jointly signaled information includes a macroblock type, whether a coded block pattern is present or absent, and whether motion vector data is present or absent for the motion-compensated macroblock. A video encoder performs corresponding encoding.

In some preferred embodiments, a language identification apparatus, comprises a storing means 32 configured to store undefined character code lists of a plurality of languages to which no character is allotted in a character code table of each language, a collating means 34 configured to collate a character code of each character contained in a character string of a language identification target with the undefined character code list of each language stored in the storing means, and an identification means 34 configured to identify a language in which a character corresponding to the undefined character code is not contained in the character string as a language of the character string among the plurality of languages as a result of collation by the collating means.

In a method for coding an audio signal to obtain a coded bit stream, discrete-time samples of the audio signal are transformed into the frequency domain to obtain spectral values. The spectral values are coded with a code table having a limited number of code words of different lengths to obtain spectral values coded by code words, the length of a code word assigned to a spectral value being that much shorter the higher the probability of occurrence of the spectral value is. A raster is then specified for the coded bit stream, the raster having equidistant raster points and the distance between the raster points depending on the code table(s) used. In order to obtain error-tolerant Huffman coding, priority code words, which represent particular spectral values which are psychoacoustically more important than other spectral values, are so arranged in the raster that the start of each priority code word coincides with a raster point.

The present invention is a method and apparatus for compressing and decompressing data. In particular, the present invention provides for (de-)compressing naturalistic color-image and moving-image data, including high-precision and high-definition formats, with zero information loss, one-sample latency and in faster than real time on common computing platforms, resulting in doubled transmission, storage, and playback speed and doubled transmission bandwidth and storage capacity, and hence in doubled throughput for non-CPU-bound image-editing tasks in comparison with uncompressed formats. The present invention uses a nearly symmetrical compression-decompression scheme that provides temporal, spatial, and spectral compression, using a reversible condensing/decondensing filter, context reducer, and encoder/decoder. In the preferred embodiment of the invention, the compression filter is implemented as a cascade of quasilinear feedforward filters, with temporal, multidimensional spatial, and spectral stages, where appropriate, in that order, whose support consists of adjacent causal samples of the respective image. The decompressor cascades quasilinear feedback inverse filters in the reverse order. The filters can be implemented with mere integer addition, subtraction, and either one-dimensional table lookup or constant multiplication and binary shifting, depending on the computing environment Tables permit the data precision to be constrained throughout to that of the image samples. The encoder uses a table of prefix codes roughly inversely proportional in length to their probability, while the decoder uses chunked decode tables for accelerated lookup. In the fastest and simplest mode, the code tables are context-independent. For greater power, at the cost of a reduction in speed, the code tables are based on the temporal, multidimensional spatial, and spectral adjacent causal residue samples, where contexts with similar probability distributions are incoherently collapsed by a context reducer using one-dimensional lookup tables followed by implicitly multidimensional lookup tables, to minimize the overall table size. The invention's minimal resource requirements makes it ideal for implementation in either hardware or software.

The motion vector decoder includes a parameter delay block which delays transmissions of various input signals necessary for motion vector decoding; a motion vector residual block which extracts a motion residual value and outputs a positive number of the motion residual value; a motion vector code table block which searches for a motion code, a condition of a sign of the motion code, and a zero condition of the motion code using a variable length decoding table and outputting the searched values; a motion vector delta block which calculates a difference of motion vectors from the motion vector residual block and the motion vector code table block; a MV adder which adds the difference value received from the motion vector delta block and a motion vector of a preceding macroblock to output a new motion vector; and a register which updates a flip-flop corresponding to a current (r, s, t) of a new motion vector. The circuit blocks each have at least one flip-flop to allow processing of each block within a single clock.

The invention relates to a detection method for software vulnerability, and belongs to the technical field of information security. The detection method comprises the following specific steps of: (1) collecting a software source code program containing known vulnerability; (2) obtaining a vulnerability code table; (3) obtaining a control flow graph CFG and an assembly code of the program to be tested; (4) determining key analysis code segments in the assembly code of the program to be tested and obtaining all paths of passing through nodes corresponding to the key analysis code segments through the control flow graph CFG of the program to be tested; and (5) for each suspicious path, an improved Fuzzing test method is used for detection to obtain the test results of the program to be tested. In the invention, when a fitness function is determined, the dependence on the source code of the tested program is eliminated, and the availability of information is kept; and the redundant information in an abstract syntax tree is eliminated and the integrity of useful information is kept, therefore, the practicality is better, and the efficiency is higher.

A video encoding method for encoding a plurality of images as a video image. The method includes a reference parallax data setting step of setting reference parallax data which indicates a viewing difference between a first image and an already-encoded second image, in order to encode target encoding data assigned to a predetermined position in the first image; a corresponding position setting step of setting a corresponding position in the second image, which can correspond to the predetermined position, by using the reference parallax data; a code table setting step of setting a code table corresponding to target encoding data assigned to the corresponding position; and a target encoding data encoding step of encoding the target encoding data in the first image by using the code table.

The invention discloses an image coding method for improving coding efficiency. The method comprises the following steps: searching a 4-bit CBP code table for the code number corresponding to a 4-bit luminance CBP code and carrying out luminance coding according to the obtained code number; and searching the 4-bit CBP code table for the code number corresponding to a 4-bit chroma CBP code and carrying out chroma coding according to the obtained code number. The invention also discloses a device for realizing the method.

This invention discloses an implementation of audio codec, which has low computational complexity, small memory footprint and high coding efficiency. It can be used in handheld devices, SoC or ASIC products and embedded systems. At the encoder side: first, apply time-to-frequency transform to audio signals, obtaining un-quantized spectrum data; second, based on the un-quantized spectrum data and target bit count, calculate the corresponding information of optimal scale factor, frequency band group, code table index and quantized spectrum by iteration; third, calculate and format bit-stream; fourth, output formatted bit-stream. At the decoder side: parse the formatted bit-stream, apply decoding and inverse quantization to the spectrum of each frame, reconstruct temporal audio data by frequency-to-time transform, and reconstruct the time-domain signals of each channel.

The invention discloses a smartphone address book fuzzy search method including preprocessing data of contacts recorded in a smartphone address book, acquiring spelling of names of the contacts and corresponding digital sequences of a thumb keyboard according to a spelling code table, writing the key information including the spellings, the digital sequences, phone numbers and the like into a memory while backing up the key information to a designed buffer, respectively matching different fields of the contacts in the memory on the basis of three classifications by judging whether including Chinese characters, letters or numbers according to the given search keywords, and finally realizing fuzzy matching of the keywords and the spellings of the names by a modified character string sequence matching algorithm. By the smartphone address book fuzzy search method, the address book can be searched globally according to optional keywords, the digital search of the thumb keyboard is supported, names, full spellings, shorthand spellings, part spellings, phone numbers, mailboxes of the contacts can be in fuzzy search, the search results can be output in a weighted ranking manner according to specific matching reasons, and accordingly, the smartphone address book fuzzy search method is a convenient and efficient diversified operating method for users.

The invention relates to a multilevel and multidimensional method and a device for analyzing data attributes, wherein the method comprises the following steps: building a public code platform for maintaining the public basic data, wherein the public basic data comprises basic data and/or a public code table; building a data relationship model for the basic data analysis as the basic data analysis platform; performing the multilevel and multidimensional analysis on the data attributes according to the data relationship of the basic data analysis platform. The multilevel and multidimensional method and the device for analyzing data attributes achieve a tree-shaped hierarchy show for the multidimensional analysis on the data attributes through the analysis dimensionalities of the basic data analysis types and the tree-shaped hierarchy expansion, and fast achieve the building and flexible expansion for the public basic data through the public code platform. The method and the device fast achieve the building of the data attribute analysis types and analysis dimensions based on the basic data analysis platform, and achieve the multilevel and multidimensional analysis on the data attributes and dynamic expansion of the analysis dimensions in a tree-shaped hierarchy expansion way. The dimensional data analysis rules are arranged to flexibly achieve the statistics summary of the analysis data.

The present invention provides a compression method of Chinese text and a corresponding decompression method, which support ANSI codes. The compression method comprises the following steps: according to the position of the characters of the Chinese text to be compressed in the character code table, the characters of the Chinese text to be compressed are encodes by 1 or more than 1 bytes; the number of the bytes is marked in the generated code word; wherein, the character code table comprises the characters which are arranged in the descending order according to the frequency of occurrence of the characters of the Chinese text to be compressed; the generated code word is written into a compressed file. The compression method maintains the semantic characteristics of Chinese data flow to the greatest extent, and can be used with various compression algorithms and compression software.

Methods and systems for JPEG encoding and decoding are disclosed. In the encoding method, an image is split into 8×8 pixel blocks and the 8×8 pixel blocks are grouped into a number of minimum coded units (MCU's), such that each MCU consists of a constant number of 8×8 pixel blocks. The MCU's are then scanned to forward discrete cosine transform, quantization, zigzag scanning and entropy encoding processes and are subsequently converted into bitstreams according to entropy encoding coding tables. In the entropy encoding process, AC coefficients are run-length encoded, while DC coefficients are not subjected to differential pulse-code modulation. The bitstreams are byte-aligned by stuffing zeroes and compression data for a special JPEG file are generated from the byte-aligned bitstreams. A position table is established, recording positions of the bitstreams in the compression data. The method enables fast positioning of bitstreams corresponding to an image region of interest.

The invention provides a method for compressing or decompressing name data, and equipment thereof, wherein the method comprises the steps of: for aiming at a preset name database which comprises a plurality of name data, generating a compressed character string set which covers all name data in the name database, wherein the character strings in the compressed character string set are generated based on total or partial characters of each name data; according to the frequency of the character strings in the compressed character string set, establishing a Huffman tree which corresponds with the compressed character string set, and generating a compression code table which comprises compression codes of all character strings in the compressed character string set; and in performing compression coding on one name datum, according to the character string contained in the name datum, obtaining the compression code which corresponds with each character string from the compression code table, and obtaining the compression codes of the name datum through combination. The method of the invention can improve compressing/decompressing efficiency for the name data.

A fault code memory management apparatus stores a permanent fault code in different places of a non-volatile memory, and restore the fault code when an error is detected in the fault code stored in the different places in a manner that, in case that discrepancy between the fault codes in different places is found, the fault code matching with data in a code table stored in a read-only memory is determined to be correct. If two fault codes have matching data in the code table, the fault code is compared with data in a standby random access memory that stores an original fault code data. Further, the data in the random access memory and the data in the code table are compared if the comparison between the code and the data in the random access memory is not sufficient.