61results about How to "Small memory" patented technology

A method to improve the performance of rendering image data (402) by converting what would normally be considered resolution-dependent image behavior into behavior that is substantially resolution-independent. This allows significant performance improvement since the rendering (454) can be performed on the lower-resolution image data used, for example, for on-screen viewing and when the image effect is applied to a higher resolution rendering, the effect, as viewed, is substantially the same as the effect viewed at a lower resolution. This conversion of normally resolution-dependent behaviors into pseudo-resolution-independent behaviors also allows the image effects to be applied to be carried out on a lower resolution image with confidence that when the image is rendered at a higher resolution that the image effects applied will substantially have the same appearance that the effect had at the lower resolution.

A method for transforming three color-input signals (R, G, B) corresponding to three gamut-defining color primaries of a display to four color-output signals (R′, G′, B′, W) corresponding to the gamut-defining color primaries and one additional primary of the display, where the additional primary has color that varies with drive level, comprising: a) determining a relationship between drive level of the additional primary and intensities of the three gamut-defining primaries which together produce equivalent color over a range of drive levels for the additional primary; and b) employing the three color-input signals R, G, B and the relationship defined in a) to determine a value for W of the four color-output signals, and modification values to be applied to one or more of the R, G, B components of the three color-input signals to form the R′, G′, B′ values of the four color-output signals.

Systems and methods for producing an acceleration structure provide for subdividing a 3-D scene into a plurality of volumetric portions, which have different sizes, each being addressable using a multipart address indicating a location and a relative size of each volumetric portion. A stream of primitives is processed by characterizing each according to one or more criteria, selecting a relative size of volumetric portions for use in bounding the primitive, and finding a set of volumetric portions of that relative size which bound the primitive. A primitive ID is stored in each location of a cache associated with each volumetric portion of the set of volumetric portions. A cache location is selected for eviction, responsive to each cache eviction decision made during the processing. An element of an acceleration structure according to the contents of the evicted cache location is generated, responsive to the evicted cache location.

Methods for receiving data sent by a first emitter of a mobile telephony system to a first resource element of a resource, via a receiver, radiopockets being created during the reception, and data which is not received during the creation of the radiopockets being reconstructed by the receiver are provided. The data which is not received by the first emitter is received by a second emitter, in a temporarally offset manner, on the same resource element of the resource, between the radiopockets, and is used to reconstruct the sequence of data. A conversion is especially advantageous for carrying out a receiving method in UMTS compression mode during the reception of data which is sent continuously independently of the compression mode.

The present invention discloses a method for displaying a high resolution picture in a mobile communication terminal having a low resolution display means, the mobile communication terminal and a system for converting a picture file format therefor. The method for displaying the high resolution picture in the mobile communication terminal includes the steps of: dividing picture data into a plurality of unit blocks, and converting the picture data into a picture file format including the plurality of unit block picture data and indexes for access to each of the block picture data; extracting minimum unit block picture data composing a partial picture which will be initially outputted to a display unit from the picture file by using the index information of the picture file format, and outputting the initial picture; and extracting the corresponding unit block picture data from the picture file in the movement direction by using the index information of the picture file format in accordance with generation of scroll action during the display of the picture, and outputting the position-moved picture.

The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

An information retrieval system stores and retrieves documents using particles and a particle-based language model A set of particles for a collection of documents in a particular language is constructed from training documents such that a perplexity of the particle-based language model is substantially lower than the perplexity of a word-based language model constructed from the same training documents. The documents can then be converted to document particle graphs from which particle-based keys are extracted to form an index to the documents. Users can then retrieve relevant documents using queries also in the form of particle graphs.

An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node s^K_n of the second substructure K to a child node s^P_n+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.

A signature verification apparatus including a signature acquisition unit configured to acquire a digital signature including first information generated based on a pair of multi-order multivariate polynomials F=(f₁, . . . , f_m) defined in a ring K, a signature key s which is an element of a set Kⁿ, and a document M and a plurality of pieces of second information for verifying that the first information is generated using the signature key s based on the data M, the pair of multi-order multivariate polynomials F, and vectors y=(f₁(s), . . . , f_m(s)), and a signature verification unit configured to verify legitimacy of the document M by confirming whether or not the first information is restorable using the plurality of pieces of second information included in the digital signature. The pair of multivariate polynomials F and the vectors y are public keys.

A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue, which can store one or more packets to be touted. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each IO pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the now scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughout with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows.

An image processing apparatus for storing image data in a memory, reading image data stored in a memory, and generating print data, and is provided with a size designating means for designating an image size, and a memory control means for storing in memory the image data compressed by a compression method corresponding to a specified image size.

A method and a device for checking fingerprints are described. The method comprises the steps of recording in succession at least two digital images of finger areas and comparing each of the recording images with a reference image that represents at least one previously recorded reference fingerprint from a reference finger areas. The device according to the invention is arranged to carry out the method.

The invention provides a system and a method capable of controlling a display interface to inquire reports. The system comprises a plurality of query computers connected with a service computer through a communication network, wherein the service computer comprises a memory storing a report database and a graphic interface control program, a processing module and a data standardizing module; each query computer comprises a query interface, a download operation module, an integrating module and a display interface. The method comprises the following steps: inputting a query condition from the query interface; analyzing the query condition by the processing module to obtain header information; calling the graphic interface control program including the header information by the processing module and downloading the graphic interface control program by the download operation module to operate and obtain a figure line file; calling the report database by the processing module and outputting a first data corresponding to the header to the data standardizing module; converting the first data into a second data by the data standardizing module; and integrating the figure line file and the second data into an interface file by the integrating module and outputting the interface file to the display interface for operation and display.

A group key management approach based on linear geometry is disclosed. The approach includes the following steps: step 1: a group controller selects a mapping f and a finite field F; each group member selects a m-dimensional private vector over the finite field F, and sends it to the group controller via secure channel; step 2: the group controller selects a mapping parameter in the finite field F randomly, and maps the private vectors of all the group members into a new set of vectors by using the mapping f according to the mapping parameter; step 3: the group controller selects a random number k in the finite field F as a group key, and constructs a system of linear equations by using the new set of vectors and the group key; the group controller computes the central vector, and sends the central vector and the mapping parameter to all the group members via open channel; step 4: after the group members receive the central vector and the mapping parameter, the private vector of each group member is mapped to a new vector in a vector space according to the mapping parameter, and the group key is obtained by calculating the inner product of the new vector and the central vector. This invention requires small memory and little computation, has high security property, and is effective against brute-force attacks.

The invention relates to a cost matrix optimization method based on spatial constraint under a Hungary algorithm, and the method comprises the steps: firstly obtaining a stored appearance feature vector set of all tracked targets, then obtaining the detection results of all pedestrians in a frame, and combining the detection results to construct an initial cost matrix; estimating the current position of the target by utilizing Kalman filtering according to the information of the tracked target, and modifying the weight of the cost matrix according to the relative relationship between the estimated position and the detection result for subsequent assignment tasks; and finally, obtaining the optimal assignment of a cost matrix by using a Hungary algorithm, allocating a detection result according to the optimal assignment, and updating and storing the appearance characteristics of the tracked target. According to the method, the matching effect of the Hungary algorithm can be effectivelyimproved according to the video scene, and some unreasonable matches are removed.