1030results about How to "Save memory space" patented technology

Methods, systems, and articles of manufacture consistent with the present invention eliminate data redundancies. A first data block identifier is obtained for a first data block, the first data block identifier being calculated based on data of the first data block. It is determined whether a second data block identifier matching the first data block identifier exists, the second data block identifier being calculated based on data of a second data block. When it is determined that the second data block identifier matching the first data block identifier exists, the first data block identifier is indicated as being is redundant.

Resource constrained wireless computing devices (e.g. mobile telephones) are given a replication capability for database records (e.g. to enable backing up contacts, e-mails, photographs etc. onto a remote server). This operates without undue processing burden, using low bandwidth unreliable wireless connections. This is achieved by not including a time stamp in each database record, but instead time stamping only a change log record; this approach saves considerable memory space on the wireless device since there is no need to time stamp every database record, as is usually done in the prior art. The change log defines what data is to be replicated; it alone has to be sent to a main server which hosts a master copy of the database and hence has to be kept up to date. Because the change log is compact, far less data has to be sent for data replication purposes—typically only the field which has changed, how it was be changed and when it was changed on the wireless computing device. Prior art systems typically send an entire record, even though that will contain data that has not changed.

Disclosed is a system for caching data. After determining a sequential access of a first memory area, such as a direct access storage device (DASD), a processing unit stages a group of data sets from the first memory area to a second memory, such as cache. The processing unit processes a data access request (DAR) for data sets in the first memory area that are included in the sequential access and reads the requested data sets from the second memory area. The processing unit determines trigger data set from a plurality of trigger data sets based on a trigger data set criteria. The processing unit then stages a next group of data sets from the first memory area to the second memory area in response to reading the determined trigger data set.

The invention discloses an implementation method of skinned skeletal animation. The implementation method comprises the following steps: A, constructing a skeleton model and a skinned mesh model which constitute a role model; B, determining a skeleton which influences the mesh vertexes on the skinned mesh model, and determining the influence weight according to a geometrical relationship and a physical relationship between the skeleton and the vertexes; C, carrying out calculus of interpolation between each two adjacent key frames according to a key frame sequence of skeleton movement, which is stored in a role model file, and determining new position and new orientation of each skeleton at certain moment; and D, calculating new position and new orientation of each vertex under a world coordinate system according to skeleton index and corresponding influence weight which influence each vertex and are stored in each vertex on the skinned mesh model, and thus achieving skinned skeleton animation. According to the implementation method disclosed by the invention, the joint problem in skeletal animation is solved, the effect is real and vivid, and is more flexible compared with that of vertex animation, and little memory space is occupied while a favorable animation effect is finished; the skinned skeletal animation can be constructed more easily and rapidly.

The invention provides a method and a device for clearing progresses of a mobile terminal. The method comprises the steps of establishing a white list for the process of the mobile terminal; carrying out screen locking and monitoring service at backstage; judging whether a screen locking message is received or not, wherein if the screen locking message is received, the next step is carried out, if the screen locking message is not received, the screen locking and monitoring service is carried out continuously; reading the progress which is in running; comparing the progress with the white list and judging whether the progress belongs to the white list or whether the progress is a key progress, wherein if the progress belongs to the white list or the progress is the key progress, no processing is carried out, if the progress does not belongs to the white list or the progress is not the key progress, the progress is cleared; judging whether all progresses which is still in running are read, if all the progresses are still in running are read, the method is ended, if the all the progresses still running are not read, the name of the next progress is obtained, and the step for reading the progresses still in running is carried out again. And then automatic clearing of progresses left at the backstage of the mobile terminal is achieved, and storage space of the mobile terminal is released, and running speed of the mobile terminal is improved. In addition, the invention further provides a device for clearing the progresses of the mobile terminal.

Systems, devices and methods are provided to compress data, and in particular to code and decode data. One aspect of the present subject matter is a data structure. The data structure includes a field representing a decoding structure to decode canonical Huffman encoded data, and a field representing a symbol table. The decoding structure includes a field representing an accelerator table to provide a 2^N-deep direct-index lookup to provide high-frequency symbols for high-frequency data and to provide bracketing indices for low-frequency data. The decoding structure also includes a field for a binary search table to provide a low-frequency symbol index using a binary search bounded by the bracketing indices provided by the accelerator table. The symbol table is adapted to provide a symbol associated with the low-frequency index.

A system for server-side communication support in a distributed computing environment is provided that includes a local reference (202) to a server object (110) on a server system (104). The local reference (202) provides a location of the server object (110) and a type of the server object (110). The local reference (202) resides within a server-side object request broker (114). A type object (204) is accessible by the local reference (202) using the type of the server object (110) from the local reference (202). The type object (204) represents a class of the server object (110). One or more specialized function objects (206) are linked to the type object (204) and correspond in number to one or more methods (190) of the server object (110). The one or more specialized function objects (206) provide wrapper functionality for each method (190) of the server object (110). Each specialized function object (206) provides access to a corresponding one of the one or more methods (190) of the server object (110).

A load monitor for monitoring the load of a motor comprises a Central Processing Unit (CPU) and a memory. During normal operation of the motor, the load monitor is arranged to repeatedly measure the torque and registering the speed of the motor. In connection with each measurement of the torque and registering of the speed, the load monitor determines a load limit value valid for the registered speed, which load limit value is a function of a plurality of torques and speeds and a predetermined deviation value stored in the memory. The measured torque is then compared with the determined load limit value and if the measured torque is not within an acceptable range limited by the determined load limit value then an appropriate action is taken.

The invention discloses a three-dimensional vector real-time dynamic stacking technique based on multiple LOD (Level of Detail) transparent textures. The three-dimensional vector real-time dynamic stacking technique comprises the following steps of: firstly, drawing various vector layers on the transparent textures of corresponding plotting scales respectively in an internal memory through data pre-processing, automatically carrying out block cutting on the vector layers, then saving the vector layers in a disk as an LOD pyramid data storage structure, and establishing a mapping relation with a same-level terrain and an image data block; and secondly, in a real-time terrain rendering and roaming stage, loading the transparent textures of vectors of the corresponding layers through dynamic selection, stacking the vector layers into the same level of image data block according to an established Alpha passage, and realizing the real-time stacking of the vector layers in the three-dimensional terrain based on an internal memory multi-passage texture blending technology. According to seamless visualization of high-resolution vector map data and a digital elevation model, the effect of the high-resolution vector map data and the digital elevation model in spatial information expression and analysis can be enhanced. According to the technique, the real time stacking of multilayer vector data in the rendering and roaming stage of a large-scale three-dimensional terrain scene is realized, and the dynamic interactive screening of the vector layers is supported.

A computationally time and space efficient data structure and method and system for using the same for surface rendering. The basis for the new data structure lies in organizing a volume data set for surface rendering into a new format where the cells needed for the surface rendering can be searched and displayed more efficiently. Given a threshold t specified by the user, the present data structure is able to efficiently identify all surface cells saving valuable processing time by providing three unique beneficial characteristics. First, given a threshold t, it can directly provide all S-cells without having to check most of the 1-cells and 0-cells such that no time is wasted on visiting the intermediate nodes. Second, it facilitates significant savings in memory space where the data structure only requires N3 pointers for data storage saving memory space for all intermediate nodes, i.e. O(N3) pairs of (Min, Max). And third, it makes viable a searching algorithm which can have parallelization capabilities for finding all S-cells such that the algorithm can be efficiently used in today's workstation employing more than one processor.

In a decoder having an improved LLR (log-likelihood-ratio) update method is provided. The method comprising the steps of: providing a parity check matrix; and using merely a set of parameters on a row of the parity check matrix instead of data of the whole non-zero elements of the parity check matrix free from at least one shifting action after each row updating; thereby saving memory space and process time.

A method of updating firmware using the object push profile in the bluetooth object exchange protocol is proposed. This method first makes use of a bluetooth transmitter to connect a bluetooth electronic device whose firmware is to be updated and a host storing a new program code. Next, the bluetooth transmitter checks parameters in an EEPROM of the bluetooth electronic device to determine whether it is necessary to update the firmware. Through the object push profile (OPP) in the object exchange (OBEX) protocol of the bluetooth technology, this new program code is reprogrammed to a flash memory in the bluetooth electronic device. After the end of the reprogramming action, the bluetooth connection between the bluetooth electronic device and the host is cut off to finish firmware update of the bluetooth electronic device.

The invention provides a computing unloading scheduling method based on depth reinforcement learning, which provides a method for computing unloading to make unloading decision for Internet of Thingsequipment, including making decisions on various aspects needing to be unloaded according to the basic model of computing unloading. Based on different optimization objectives, different optimizationobjectives can be achieved by changing the value function. TheDeep-SARSA algorithm is similar to DQN algorithm, which combines reinforcement learning and depth learning. It can effectively change theunloading state and unloading action into training samples of depth learning when cooperating with experience pool. The invention can effectively carry out machine learning on an unloading state modelof an unlimited dimension, reducing the complexity of learning, this method uses neural network as the linear approximator of Q value, which can effectively improve the training speed and reduce thesample required for training. This method can effectively make the best decision through deep reinforcement learning under the given model and optimization objective.

The invention provides a stream application function interface distributing method realized on the basis of HTML5. The method comprises the specific steps that multiple function interfaces of stream application realized on the basis of HTML5 are provided; requests for calling any function interface are responded, and a function module corresponding to the function interface operates; a corresponding response result is returned through a callback function or a returned value corresponding to the function module. The invention further provides a stream application function interface distributing method realized on the basis of HTML5 through the method. The method not only can provide a simpler application development mode for developers, but also can provide new application experience for users, the application can be used only by clicking without being installed, and interaction and experience are close to those of local application.

a panoramic image producing apparatus provides an intensity image production unit which produces intensity images from input source image captured by an imaging device, a reference image data storage unit for storing a reference image which is used to compute the motion data of the intensity image and its absolute motion data, an absolute motion data calculation unit which uses the intensity image of the target image by first computing its relative motion data against the reference image and using its result to compute the absolute motion data against the target image, an image stitching unit to produce a panoramic image by using the absolute motion data computed above to stitch together input source images, and a reference image setting unit which sets target image as the new reference image under certain conditions.

The invention provides a system and a method for matching and processing sensitive words on the basis of polymerized word trees. The system comprises a sensitive word library unit, a polymerized word tree algorithm processor, a semantic analysis unit and an industry sector analysis unit. The sensitive words in a sensitive word library are polymerized in a word tree polymerizing manner, so that the word tree structure is formed, the structure of the data in the sensitive word library is ordered, the space of a memory is saved, and the matching efficiency is improved. The method is combined with the application of industrial rules and adopts a manner of filtering by combining semantic analysis and industry environments, so that key words which do not belong to a sensitive word category in certain industrial fields are eliminated, matching errors of the sensitive words are reduced and the matching accuracy is improved.

Systems and methods are provided for deploying new software application features as a dynamically-loadable executable package including one or more dynamically-linked shared dependent libraries. The dynamically-loadable executable package may be capable of being loaded into volatile memory and executed in an information handling system environment with or without the dependent shared libraries, and without duplicating the presence or use of redundant shared libraries that may be already present on the existing software stack.

The invention relates to a wind generator power optimization system based on drift correction. The system comprises a data acquisition module, a power simulation module, a wind direction offset diagnosis module and a control module. The data acquisition module is used for collecting real-time data of operation of a draught fan, and storing the real-time data to form historical data. The power simulation module is used for reading the historical data, screening the historical data, establishing a balanced data set according to the screened data and establishing a power model according to the balanced data set. The wind direction offset diagnosis module generates control information according to the received power model and the real-time data and sends the control information to the control module. The control module adjusts the drift angle of the draught fan according to the received control information. In addition, the invention further provides a wind generator power optimization method based on drift correction. According to the wind generator power optimization system and method based on drift correction, the drift angle can be diagnosed and adjusted in real time, the service life of a wind generator set is prolonged, and the operation safety factor is improved.

The invention discloses an electronic parking braking method. The method comprises the following steps of: first, parking braking, namely transferring prestored air pressure in an air reservoir to brake chambers of each wheel by controlling an active air supply electromagnetic valve to realize the parking braking; and second, releasing braking, namely when a road section is a straight road surface, simultaneously releasing a drive wheel and a driven wheel of a controlled vehicle once; and when the road section is a downhill road section or an uphill road section, adopting a corresponding control strategy according to the rotating situations of each wheel of the vehicle, and releasing the air pressure in the brake chambers of each wheel of the controlled vehicle separately by utilizing a pressure maintaining effect of an antilock brake system (ABS) electromagnetic regulating valve. The electronic parking braking method has a reasonable design, low investment cost, high intelligence degree and good use effect, is convenient to operate, and solves the practical problems of high technical requirements on drivers, brake force transfer gap of mechanical system, great difficulties in starting operation on low-adhesion coefficient road surface and ramp, poor use effect and the like in a conventional mechanical parking braking system.

Provided is an image splicing method and device. The method comprises the steps that position matching is performed on a first image and a second image based on a pyramid-structured normalized orthogonal correlation coefficient and sub-pixel estimation, and the first image and the second image are two adjacent images to be spliced; and an image splicing edge is confirmed according to the result of position matching, and splicing of the first image and the second image is completed along the image splicing edge. Rapid and high-efficiency image splicing can be realized by the technical scheme, and higher splicing precision can also be guaranteed.