191results about How to "Reduce memory" patented technology

The present invention is directed to methods for partial image updates. Such methods provide the display controller the ability to update selected areas of an image that require updating and leave other areas unchanged. The methods also allow for multiple waveforms to be used for specific regions, giving the display the capability of updating each region with its own waveform.

A pixel image enhancement system which operates on color or monochrome source images to produce output cells the same size as the source pixels but not spatially coincident or one-to-one correspondent with them. By operating upon a set of input pixels surrounding each output cell with a set of logic operations implementing unique Boolean equations, the system generates "case numbers" characterizing inferred-edge pieces within each output cell. A rendering subsystem, responsive to the case numbers and source-pixel colors, then produces signals for driving an output device (printer or display) to display the output cells, including the inferred-edge pieces, to the best of the output device's ability and at its resolution.

Configurable virtual output queues (VOQs) in a scalable switching system and methods of using the queues are provided. The system takes advantage of the fact that not all VOQs are active or need to exist at one time. Thus, the system advantageously uses configurable VOQs and may not dedicate memory space and logic to all possible VOQs at one time.

The present invention relates to a low density parity check (LDPC) encoding method and an apparatus thereof. In the LDPC encoding method, a matrix multiplication corresponding to ET⁻¹ and T⁻¹ is eliminated according to a structural characteristic in an encoding process. Accordingly, shift weights that are not −1 among shift weights corresponding to partial blocks A, B, and C of a parity check matrix are used to perform an encoding operation, and a cyclic shift operation of an information unit block is performed in parallel so that a first parity block and a second parity block may be simultaneously generated.

The invention discloses an intelligent home system based on voice recognition. The intelligent home system comprises a voice recognition module, home devices and a control module, wherein the voice recognition module is used for recognizing voice commands of a user and sending the voice commands to the control module; the control module is used for converting the voice commands, recognized by the voice recognition module, of the user to corresponding control commands and sending the control commands to the home devices to control the home devices. Through the utilization of prompt voice commands, voice command memorizing is reduced, and the intelligent home system based on voice recognition is convenient to use; being capable of controlling a plurality of home devices, fixing voice commands can be set in advance to control the home devices; furthermore, images of the face of the user can be acquired to judge the identity of the user and give different user permissions to solve the problem of permission assignment.

An expert system and a method of providing automated advice are described. The system is regularly updated by advice (or diagnosis, recommendation etc.) given by practitioners in the relevant field. The combination of the underlying facts and the consequent (human) advice is used to update a ruleset that is then used to provide automated advice.

An example of financial advice is given. A database contains the details for the customers of a financial institution together with advice and recommendations given previously by the institution's human advisors. This database is used to derive a ruleset which is then applied to a subsequent customer's details in an automated manner, possibly at the user's own PC via the World Wide Web. Frequent updating using data from the human advisors' work means that the database (and hence the ruleset) are kept up to date. Consistent advice can thus be provided with minimum human interaction.

A multi-dimensional blockchain protocol designed to self-fork into multiple chains, scale infinitely, achieve zero cost transactions, sub-second finality and open new markets for sharders, blobbers, developers, and content publishers, while managing a low inflation rate.

The invention comprises a method in a content routing network for reducing memory and control information transmission overhead, comprising the step of compressing a summary bit vector of a Bloom Filter used in the content routing network. The summary bit vector is compressed using a technique which allows for direct and in-place manipulation to individual bits in the vector and does not allow for direct and in-place manipulation to individual bits in the vector.

The invention relates to novel chemical compounds and methods of making and using the same. In particular, the invention provides pyridazine compounds and/or related heterocyclic derivatives, compositions comprising the same, and methods of using pyridazine compounds and/or related heterocyclic derivatives and compositions comprising the same, for modulation of cellular pathways (e.g., signal transduction pathways), for treatment or prevention of inflammatory diseases (e.g., Alzheimer's disease), for research, drug screening, and therapeutic applications.

A system and method for correcting surface height measurements for optical aberration is provided. Heights determined by an autofocus tool, which may depend on surface feature angles in a focus region of interest (ROI) and on the ROI location in the field of view, are corrected based on a novel error calibration. Error calibration data includes height corrections for different feature angles in images, and for multiple locations in a field of view. Height corrections are determined by weighting and combining the angle dependent error calibration data, e.g., based on a gradient (edge) angle distribution determined in the ROIs. When Z-heights are determined for multiple ROIs in a field of view, storage of image data from particular images of a global image stack may be efficiently controlled based on determining early in processing whether a particular image is a sufficiently focused “near-peak” focused image or not.

A method, information processing system, and computer readable medium for annotating graphs to allow for subsequent quick loading and analysis of very large graphs is described. The present invention encompasses a way to order and annotate nodes of a graph into a data stream that allows for optimization of subsequent processing of nodes in later analysis. For example, a very large reference graph representing heap snapshots may be annotated to facilitate post-processing and visualization of the heap for memory leak analysis. In such an example, the present invention reduces the number of objects and references to be modeled in memory, while still capturing the essence of the non-modeled portions. In this example, the present invention may process reference graphs on the scale of one hundred million live objects per snapshot using a computer with one gigabyte of memory.

A method and apparatus for arranging fragments in a graphics memory. Each pixel of a display has a corresponding list of fragments in the graphics memory. Each fragment describes a three-dimensional surface at a plurality of sample points associated with the pixel. A predetermined number of fragments are statically allocated to each pixel. Additional space for fragment data is dynamically allocated and deallocated. Each dynamically allocated unit of memory contains fragment data for a plurality of pixels. Fragment data are arranged to exploit modem DRAM capabilities by increasing locality of reference within a single DRAM page, by putting other fragments likely to be referenced soon in pages that belong to non-conflicting banks, and by maintaining bookkeeping structures that allow the relevant DRAM precharge and row activate operations to be scheduled far in advance of access to fragment data.

The present invention relates to a method and apparatus for performing a logged measurement in a wireless communication system. A terminal receives a measurement configuration and a terminal selection parameter from a base station. The terminal determines whether or not to apply the measurement configuration based on the terminal selection parameter. If the measurement configuration is determined to be applied, the terminal logs a measurement based on the measurement configuration.

A technique is provided for enhancing the performance of an interface device. A collection of device elements having properties including a visual representation and a functionality are instantiated in a global container. The global container includes the device elements that are required for various screen views. Device elements that are not required in a currently displayed screen view are torn off in the global container so that memory and processing requirements are reduced, while increasing the speed and performance of the interface, particularly in switching between screen views.

A scalable video coding method is provided. The scalable video coding method includes dividing an enhancement layer into macroblocks; when base_mode_flag or residual_prediction_flag of the macroblock is equal to 1, calculating a reference block coordinate value of a reference layer to refer to in the block up-sampling of the enhancement layer and up-sampling the macroblocks of the enhancement layer using the coordinate value; and coding the up-sampled macroblock. The execution speed of the scalable video codec can be raised and the memory usage required for the spatial inter-layer prediction of the scalable video can be saved.

A set of input images are acquired sequentially as image tensors. A low-tubal rank tensor and a sparse tensor are initialized using the image tensor, wherein the low-tubal rank tensor is a tensor product of a low-rank spanning tensor basis and corresponding tensor coefficients, and for each image, updating iteratively the image tensor, the tensor coefficients, and the sparse tensor using the image tensor and the low-rank spanning basis from a previous iteration. The spanning tensor basis is updated using the tensor coefficients, the sparse tensor, and the low rank tubal tensor, wherein the low rank tubal tensor represents a set of output images and the sparse tensor representing a set of sparse images.

The performance of multiple-input multiple-output (MIMO) systems, employing coding with multiple antennas depends heavily on the demapper algorithm which is used for MIMO detection. Soft-output demappers lead to better bit error rate (BER) performance compared to hard-decision demappers, but have a higher implementation complexity. The algorithm, proposed in this paper, relies on low-complexity harddecision MIMO detection. The reliability information for the received bits used to compute log-likelihood ratios is based on an estimate of the average bit error rate which is for example derived from the corresponding channel state information only. The algorithm is applicable to any hard-decision MIMO detector. As an example, we describe the application of the scheme to a linear MMSE detector and to sphere decoding with early termination.