173 results about "Group code" patented technology

This invention provides a data access control apparatus arranged to automatically set access right information limiting data access, in accordance with a user attribute when a user accesses a database. In setting, for a plurality of users, access right information corresponding to each user, the load on an operator can be reduced, and access right information setting errors can be prevented. An automatic setting unit reads out information from a login management information file and an employee information file on the basis of definition information of a definition files to automatically generate a user access right management file which stores a login ID, an item access right, and a record access right group code for each user. When a login ID is input in accessing the employee information file, a setting controller refers to the management file to determine a user group to which the user belongs and an access enabled / disabled state of the data on the basis of the access right made to correspond to this user group.

A robust method to compress relations close to their entropy while still allowing efficient queries. Column values are encoded into variable length codes to exploit skew in their frequencies. The codes in each tuple are concatenated and the resulting tuplecodes are sorted and delta-coded to exploit the lack of ordering in a relation. Correlation is exploited either by co-coding correlated columns, or by using a sort order that can leverage the correlation. Also presented is a novel Huffman coding scheme, called segregated coding, that preserves maximum compression while allowing range and equality predicates on the compressed data, without even accessing the full dictionary. Delta coding is exploited to speed up queries, by reusing computations performed on nearly identical records.

A method of compressing data, wherein said data is in the form of discrete units, by determining an overall code specific to the units, comprising the steps of:a) grouping the units in terms of a common behavior pattern;b) for each said group of units, assigning a group specific code, the sizes of said group code being ordered according to the probability of the unit occurring;c) assigning a unit identifier code which is specific to identify an individual character within the group,the overall code comprising of the cocatenated group specific and identifier codes, characterized whereinstep c), the identifier code is of the minimum size to allow for each unit which could occur in that group to be assigned specifically.

The embodiment of the invention firstly provides a method for coding or decoding low-density parity-check (LDPC) codes with variable code length, which comprises the steps of: obtaining a base exponent matrix of the LDPC codes, and grouping code lengths during the construction of the base exponent matrix; modifying the base exponent matrix according to the grouped modifying factor to obtain a grouping exponent matrix corresponding to the grouped modifying factor; expanding the exponent matrix according to an expansion factor corresponding to the code length in the grouping to obtain an LDPC matrix corresponding to the code length; and coding or decoding according to the LDPC matrix. By adopting the method for coding or decoding the low-density parity-check (LDPC) codes with variable code length and adopting grouping and repeatedly constructing, the obtained LDPC codes do not have short links at each required code length, and the performance is greatly improved. Meanwhile, the embodiment of the invention also provides a device for coding or decoding, a coder and decoder.

A method of palette index map coding of blocks in a picture by grouping coded symbols of the same type is disclosed for video encoder and decoder. In one embodiment, all syntax elements corresponding to the pixel index are grouped into a pixel index group, and all syntax elements corresponding to the escape pixel are grouped into an escape pixel group. All syntax elements corresponding to the run type and run length are grouped into an interleaved run type / run length group, or grouped into separate run type group and run length group. In another embodiment, the system parses from the video bitstream a last-run mode syntax element for a current block, where the last-run mode syntax element indicates whether a last run mode is a copy-index mode or a copy-above mode. Information associated with the last-run mode syntax element is used for reconstructing palette index map.

A method for transferring up signaling to intensify up signaling channel by high speed shared information channel HS-SICH in 3.84Mcps short rate time division duplexing communication system, which contains coding N bit up signaling by (N, n) group code to generate N bit sequence, generating 72 bit sequence to N bit sequence after 72-N bit cyclic redundancy check, multicomplexing generated 72-N bit sequence and coded CQI and ACK / NACK to generate HS-SICH loaded data bit. Said invention fully utilizes reserved resource in current system to realize new function with better backward compatibility and reduce the complexity of using UE end to code and Node B to decode by adopting existing standard coding mode.

Construction method and codec of invariant time low-density parity check convolutional (LDPCC) code is based on item-by-item adding edge algorithm PEG. The invention discloses new method for constructing invariant time LDPCC code, and codec for compiling the LDPCC. The method for constructing LDPCC code includes encoder and decoder. Operational steps include as following: determining parameters of checkout matrix HQT of group code of permutation unit matrix LDPC; constructing checkout matrix HQT of group code of permutation unit matrix LDPC; constructing checkout polynomial matrix HT (D) of LDPCC code; exporting generated matrix G (D) of LDPCC code. Obtaining invariant time LDPCC code, the method guarantees fine loop characteristic and code gap characteristic, and superior performance. The invention implements encoding simple invariant time convolutional code and iterative decoding through pipeline.

It is possible to issue an IC card storing unique encryption key information in such a manner that re-issuing is enabled and sufficient security can be assured. An IC card provider X delivers an IC card having a group code G(A) to a company A and an IC card having a group code G(B) to a company B. When a company staff α inputs a unique personal code P(α) and performs initialization, in the IC card, calculation is performed according to a predetermined algorithm using the P(α) and G(A). Data uniquely determined by the calculation is stored as encryption key information K(α) in the IC card. Even if the company staff α loses the IC card, it is possible to obtain the IC card having the same encryption key information K(α) as before by performing initialization again by using the IC card delivered by the IC card provider X.

A system and method for keeping ledger accounts in synchronization between a back-end procurement system and a front-end requisition and catalog system. An extract utility extracts a file of general ledger (G / L) accounts, including account code, description, and company code, from a chart of accounts in the back-end and transfers it to the front-end, where it is updated by an update utility to include company group code from a company group table and then loaded into a data store of valid general ledger accounts. Maintenance of the front end data store of valid accounts includes pushing to all companies in a company group ledger code entered with respect to any one of the companies in that group.

A dynamic group code for commodity antifalse and for monitoring goods transportation is featured as forming dynamic group code by commodity basic code and dynamic code added continuously in foods transportation course. The commodity code being only status evidence for commodity is checked by databank of antifalse service centre and antifalse system platform in order to finalize antifalse inspection and finalize monitoring work for goods transportation.

The invention discloses a cooperation diversity method based on a constellation rotation quasi-orthogonal space-time group code, which mainly solves the problem that the transmission rate of a cooperation method of an orthogonal space-time group code is low. The cooperation transmission procedure comprises: during the broadcasting phase, a source node sends broadcast signals to a relay node and a destination node, the relay node performs the coding and the cyclic redundancy check to the received signals, if the cyclic redundancy check is right, the received signals are involved in the cooperation transmission in the space-time cooperation phase, or else the received signals are not involved in the cooperation transmission; during the space-time cooperation phase, the source node and the relay node calibrated right divide transmitted information into two groups for the constellation mapping, respective transmitted information is generated according to the coding matrix of the quasi-orthogonal space-time group code, and is sent to the destination node; the destination node performs the joint maximum likelihood decoding for received signals in the broadcasting phase and the space-time cooperation phase, and divides the decoding result into two groups for the demodulation. The invention has higher space diversity gain under the condition of same spectrum effectiveness and transmission power compared with the cooperation diversity method of the orthogonal space-time group code.

An application programming interface (API) enables application programs in a multitasking operating environment to classify portions of their code and data in a group that the operating system loads into physical memory all at one time. Designed for operating systems that implement virtual memory, this API enables memory-intensive application programs to avoid performance degradation due to swapping of units of memory back and forth between the hard drive and physical memory. Instead of incurring the latency of a page fault whenever the application attempts to access code or data in the group that is not located in physical memory, the API makes sure that all of the code or data in a group is loaded into physical memory at one time. This increases the latency of the initial load operation, but reduces performance degradation for subsequent memory accesses to code or data in the group.

The invention discloses a test vector coding compression method based on vector compatibility. The method comprises test vector compression and decompression after coding and the following steps: firstly, determining the code of a test vector, and taking vector t1 from a test vector set; completing test vector grouping and test vector group coding by combining with a vector most compatible with t1 and ensuring the increase of overall compression ratio; and during the decoding, shifting the code to a tested circuit for storage and repeating the decoding of the code till restoring the vector set before compression. The test vector coding compression method has the advantages that the method realizes grouping of the test vector set according to the relation of maximal compatibility and completes combined coding of vectors in a test vector group; the method marks an incompatible position by a mark code to substantially reduce bits required during marking by address information; moreover, both ends of the code are respectively inserted with group head information and a group division code; and during the decoding, the code of the test vector group is shifted to the tested circuit for storage so as to be reused, thereby greatly reducing the bandwidth of a testing machine and the tested circuit.

A method for transmitting and receiving messages in a home appliance networking system, wherein a first home appliance connected to a network appends a unique message identification number to a header of a message and transmits the resulting message to a second home appliance connected to the network. Messages transmitted and received among a plurality of home appliances can be distinguished from one another, resulting in a reduction in message transfer errors. Moreover, as needed, a group code corresponding to a specific group of home appliances may be appended to a transmitter message for control of the specific group so that the home appliances can be conveniently and efficiently controlled at one time.

The invention discloses a cutting path generation method based on a greedy algorithm. A workpiece drawing of laser cutting is composed of a DXF format. The workpiece drawing is composed of an HEADER data segment, a CLASSES data segment, a TABLES data segment, a BLOCKS data segment, an ENTITIES data segment, an OBJECTS data segment and a file end data segment, wherein each data segment is composedof multiple pairs of group codes and group values; according to the automatic programming system, the primitive data of the workpiece drawing can be analyzed, extracted and stored; the method comprises the steps that drawing data are subjected to visual processing, offset processing is conducted on the drawing data according to an offset correction result of the visual processing, a system conducts chain connection on offset primitives, cutting paths are generated one by one, finally, the paths are optimized and sorted based on a greedy algorithm, and a machining cutting track with the shortest idle stroke is generated. The machining precision is improved, and popularization and application value is achieved.

The invention features the following points; the interception position variation state is used to calculate the rotation bits number; using the channel estimation technology with ration to make channel estimation; the phase compensation is made for the received frequency domain data according the its position in the space frequency block code; finally, the phase-compensated frequency domain data and its corresponding channel estimation value are inputted to the space frequency block coding module. When the interception position has a jump variation, the different phase shift will be generated by different subcarrier wave in same OFDM symbol, and in this case, the invention solves the problem of combining the space frequency block code with the MIMO-OFDM.

The invention is related to transmitting / receiving method in quasi-orthogonal time space group code, receiver and transmitter and corresponding comm. system. Random rotation matrix is obtained through Graham-Schmitt orthogonalized decomposing plural gauss random square matrix. After using multiplication between random rotation matrix and symbolic vector of planisphere, the transmitting terminal carries out encoding quasi-orthogonal time space group code so as to make new planisphere possess characteristic of random distribution. Thus, interferences among multiple antenna symbols at transmitting end are distributed evenly. Moreover, distribution of probability density in high power interference segment is smaller relatively so as to raise performance of system in high SNR. Accordingly, all possible symbolic vectors of planisphere at receiving end are carried out rotation same as transmitting end randomly and then maximum likelihood decoding is carried out.

An enterprise provides procurement services to a plurality of companies organized in company groups, each company group including those companies using the same accounting rules. These services are accessed by customer company employees, or users. The creation and maintenance of user profile for each user authorized by a customer company is accomplished according company groupings. Company name is passed to the enterprise in a human resource file or interface, to which a company grouping code is added. That data is loaded into employee staging tables from which an application builds a user profile table which, for new users, does not include company code and location code. These codes will be populated to the profile the first time the user logs in for service and selects from a drop down list describing all work locations for his company group a line item including a description of his work location.

The invention discloses a reed-solomon (RS) code coding parameter blind identification method. In the method, after a grouping length and a grouping starting point of equivalent binary linear grouping codes are determined in a grouping stage, a matrix is transformed, a checking matrix of the equivalent grouping codes is determined, and a generating polynomial and a component polynomial of the grouping codes are further determined by a symbol number m. By the method, the problems of reed-solomon (RS) code grouping length determination, grouping starting point determination, RS code generating polynomial determination, RS code component polynomial determination and the like are relatively better solved, and the blind identification of RS code coding parameters can be realized by communication contents; and the method has the characteristics of simple algorithm, clear process, high identification speed and the like, and is applied in the fields of intelligent communication, communication reconnaissance, information countermeasures and the like.

A method for detecting STBC of multi-user includes sequencing the receiving S - N ratio in order to find out user corresponding to maximum S -N ratio before each user is detected at receiving end, detecting the user to obtain estimation value of user transmission signal, deducting estimation value influence out from receiving signal for resetting signal, sequencing the rest signal again for confirming next user corresponding to maximum S - N ratio and carrying out detection till transmission signal of all users are detected out successively.

An apparatus is provided for remotely monitoring a plurality of amplifiers on a display device. The amplifiers are provided to process audio signals and directly or indirectly connected to a network. In the apparatus, a collecting section collects a group code from each of the amplifiers through the network. The group code is allocated to each amplifier according to a grouping system for grouping the plurality of the amplifiers. A display control section displays a tree diagram of the amplifiers according to the collected group codes on the display device as a graphical representation of the grouping system.

An enterprise provides procurement services to a plurality of companies organized in company groups, each company group including those companies using the same accounting rules. These services are accessed by customer company employees, or users. The creation and maintenance of user profile for each user authorized by a customer company is accomplished according company groupings. Company name is passed to the enterprise in a human resource file or interface, to which a company grouping code is added. That data is loaded into employee staging tables from which an application builds a user profile table which, for new users, does not include company code and location code. These codes will be populated to the profile the first time the user logs in for service and selects from a drop down list describing all work locations for his company group a line item including a description of his work location.

The invention provides a one-turn absolute encoding disc and pertains to the photoelectric inspection technology. The disc comprises transparent and non-transparent code stripes that are arranged in alternative way. The encoder taking the disc as core uses a linear array CCD as a receiving and dividing element, one CCD window contains 7-8 graduations. By an acquiring card, the signals output by CCD are sent into a computer, by two-valued processing, the number of 0 and 1 contained in each CCD window are obtained, an integral 7 numbers are combined together. The group of the current location is obtained by looking up the table of group code; program is written according to the angle-positioning arithmetic and by using advanced computer language VB. In this way, the value of the rotation angle can be obtained. Wherein, the table of group code is established based on the codes obtained.

An application programming interface (API) enables application programs in a multitasking operating environment to classify portions of their code and data in a group that the operating system loads into physical memory all at one time. Designed for operating systems that implement virtual memory, this API enables memory-intensive application programs to avoid performance degradation due to swapping of units of memory back and forth between the hard drive and physical memory. Instead of incurring the latency of a page fault whenever the application attempts to access code or data in the group that is not located in physical memory, the API makes sure that all of the code or data in a group is loaded into physical memory at one time. This increases the latency of the initial load operation, but reduces performance degradation for subsequent memory accesses to code or data in the group.

For the problems of extraction of effective pixels in a local DXF file and network transmission, a method for converting the effective pixels of the DXF file into JSON data is realized. Original DXF information is subjected to block segmentation processing; a three-layer data structure is established by utilizing key value pairs and link tables; effective pixel information is stored; the effectivepixel information is directly converted to generate the JSON data; the effective pixel information is converted to be in a JSON data form clear in structure and definite in meaning from a complex group code form; and attribute values of the pixels are converted into actual attribute specifications from numerical group codes, so that the readability of the converted data is improved. Therefore, the method is suitable for internet data transmission.

A method of palette index map coding of blocks in a picture by grouping coded symbols of the same type is disclosed for video encoder and decoder. In one embodiment, all syntax elements corresponding to the pixel index are grouped into a pixel index group, and all syntax elements corresponding to the escape pixel are grouped into an escape pixel group. All syntax elements corresponding to the run type and run length are grouped into an interleaved run type / run length group, or grouped into separate run type group and run length group. In another embodiment, the system parses from the video bitstream a last-run mode syntax element for a current block, where the last-run mode syntax element indicates whether a last run mode is a copy-index mode or a copy-above mode. Information associated with the last-run mode syntax element is used for reconstructing palette index map.

A system and method for keeping ledger accounts in synchronization between a back-end procurement system and a front-end requisition and catalog system. An extract utility extracts a file of general ledger (G / L) accounts, including account code, description, and company code, from a chart of accounts in the back-end and transfers it to the front-end, where it is updated by an update utility to include company group code from a company group table and then loaded into a data store of valid general ledger accounts. Maintenance of the front end data store of valid accounts includes pushing to all companies in a company group ledger code entered with respect to any one of the companies in that group.