171 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 multiple protection group (MPG) erasure-resilient coding method for constructing MPG codes for encoding and decoding data. The MPG codes constructed herein protect data chunks of data in multiple protection groups and subgroups. In general, the MPG erasure-resilient codes are constructed by locating data chunks into multiple protection groups and assigning at least one parity chunk to each protection group. Basic MPG codes are constructed from existing Maximum Distance Separable (MDS) codes by splitting at least some of the parity chunks into local parities for each of the multiple protection groups and projecting local parities onto each of the groups. Generalized MPG codes have a Maximally Recoverable property that can be used to determine whether an erasure pattern is recoverable or unrecoverable. Generalized MPG codes can recover any erasure pattern that is recoverable.

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 wherein

step c), the identifier code is of the minimum size to allow for each unit which could occur in that group to be assigned specifically.

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.

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 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.

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.

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.

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.

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.

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 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.