46results about How to "Eliminate calculations" patented technology

The present invention relates to a transporting apparatus and a transporting control method for thin plates, the apparatus for transporting the thin plates such as liquid crystal display panels and glass plates into a processing chamber, comprising a rather large robot (14) having rotating arms (16) for transporting large-sized thin plates. The transporting apparatus and a thin plate transporting system can stably raise the plates up to the heights of approximately 2 m and can transporting the plates with the deflected amount of the extended rotating arms (16) compensated. A horizontal support table (13) liftably cantilevered on two upright support members (12) is provided in the apparatus, and the transporting robot (14) with the rotating arms (16) is placed on the horizontal support table (13). Also, the deflected amount of the extended rotating arms is compensated by raising the height of the horizontal support table (13) based on the deflected amount. The deflected amount can also be compensated by varying the installation angle of the robot (14) placed on the horizontal support table (13).

The present invention is to realize a data storage control method and apparatus for an external storage device using flash memories. The method and apparatus can eliminate the data erasure waiting time, eliminating the calculation of the erasure numbers of flash memories, elongating the life-time of the flash memories. Data is stored sequentially from a first flash memory for rewrite data to a third flash memory for rewrite data. When there is no vacant area in the third flash memory for rewrite data, a CPU instructs a first flash memory for garbage collection among the first and second flash memories for garbage collection to perform the garbage collection of the first flash memory for rewrite data. When a host computer issues a write access request, the write process is performed in the first flash memory for garbage collection with the first priority. When the garbage collection of the first flash memory for rewrite data has been completed, the garbage collection of the second flash memory for rewrite data is performed by the second flash memory for garbage collection. At the time of performing the garbage collection of the second flash memory for rewrite data, the data of the first flash memory for rewrite data is simultaneously erased. The first flash memory for garbage collection is changed into a flash memory for rewrite data by the CPU. Upon completion of the garbage collection of the second flash memory for rewrite data, the data thereof is simultaneously erased and the second flash memory for garbage collection is changed into a flash memory for rewrite data. Then, the garbage collection of the third flash memory for rewrite data is performed in the similar manner.

The invention provides a decoding method for compression video based on a GPU. The method utilizes point graphic element to show video block instead of square and maps decoding segments to the GPU except variable length decoding, and then the GPU organizes video data into point collection and completes decoding process by drawing point collection. The invention has the advantages of a CPU and the GPU so that the two work in parallel accelerate video decoding process; the invention has high performance of hardware decoding and flexibility of software decoding at the same time, can handle a plurality of video compression format and standard, replace a special decoding hardware of personnel computer with the GPU, a game console, a handheld mobile device, etc, and improve the utilization of hardware resources and reduce cost.

Disclosed is a LMMSE receiver that restores orthogonality of spreading codes in the downlink channel for a spread spectrum signal received over N receive antennas. The FFT-based chip equalizer tap solver reduces the direct matrix inverse of the prior art to the inverse of some submatrices of size N×N with the dimension of the receive antennas, and most efficiently reduces matrix inverses to no larger than 2×2. Complexity is further reduced over a conventional Fast Fourier Transform approach by Hermitian optimization to the inverse of submatrices and tree pruning. For a receiver with N=4 or N=2 with double oversampling, the resulting 4×4 matrices are partitioned into 2×2 block sub-matrices, inverted, and rebuilt into a 4×4 matrix. Common computations are found and repeated computations are eliminated to improve efficiency. Generic design architecture is derived from the special design blocks to eliminate redundancies in complex operations. Optimally, the architecture is parallel and pipelined.

The invention discloses a detection method for moving targets in images based on block division. At first, the size of each pixel sub-block when images to be detected are divided into a plurality of pixel sub-blocks is preset, then an area image of a present frame to be detected is divided into corresponding pixel sub-blocks, then a frame is selected as a reference frame from frame images before the present frame or pre-established background images, the absolute difference and sum of pixels of corresponding pixel sub-blocks of area images of the reference frame and the present frame are respectively calculated according to the positions of the corresponding pixel sub-blocks of the area image of the present frame, then the absolute difference and sum of the pixels is compared with a preset moving threshold to find pixel sub-blocks which possibly have moving targets, finally the pixel sub-blocks which possibly have moving targets are statistized and analyzed to judge whether moving targets exist in the area image of the present frame to be detected, thus the video coding process and the motion detection process can be organically combined to effectively decrease the total calculation quantity of video coding and motion detection.

The invention relates to a query optimization method based on a join index in a data warehouse. The method comprises the following steps: creating a fact table foreign key join index based on a dimension table surrogate key; creating a join index update strategy; when a predicate condition exists on a dimension table, making a predicate judgment after direct access to dimension table record through the join index, and performing calculation through a dynamic bitmap join index by reference to a bitmap join index to generate a join bitmap index; when the selection rate on the dimension table is very low, further compressing a dimension table bitmap in order to raise the cache level of dimension table bitmap calculation; and calculating simple memory address access by only using an array-bitmap data structure with a reference bitmap join index calculation method based on co-processor memory calculation. Through adoption of the query optimization method, the calculation performance of the bitmap index can be effectively increased. Moreover, the query optimization method can be combined with high-performance co-processors such as GPU and Intel Xeon Phi TM to accelerate the index calculation performance, and can be widely applied to the field of data warehouses.

A packaged residential fire pump system for sprinkler protection of one- and two-family dwellings. The system independently provides sufficient water pressure, and volume, for a two sprinkler flow for a period of time. An existing domestic water supply is supplemented with a dead water storage tank. The system can be combined with hydraulically sized, or scheduled, system piping and sprinkler heads.

The invention relates to a technology for eliminating mismatching points between two images and utilizing correct matching point pairs to compute an image transformation matrix, in particular to a surf algorithm based quick mismatching point eliminating method, in order to avoid the defects of large computation amount and high mismatching ration in the matching process and realize quick and efficient mismatching point pair elimination and image transformation matrix computation. The method includes: for a surf algorithm, computing each feature point including information of coordinates (x, y, S) of the feature point, wherein S represents scale space of the feature point; for two to-be-matched points extracted from the two images, screening according to the feature points of the matching points, and respectively setting a scale limit threshold value and a main direction limit threshold value for screening; performing corresponding computation and judgment for a main direction angle; after matching point pairs of a required number are found, performing a fine matching process. The method is mainly applied to elimination of the mismatching points between the two images.

A HMM modification method for preventing an overfitting problem, reducing the number of parameters and avoiding gradient calculation by implementing a weighted loss function for misclassification measure and computing a delta coefficient in order to modify a HMM weight is disclosed. The HMM modification method includes the steps of: a) performing Viterbi decoding for pattern classification; b) calculating misclassification measure using discriminant function; c) obtaining modified misclassification measure for a weighted loss function; d) computing a delta coefficient according to the obtained misclassification measure; e) modifying HMM weight according to the delta coefficient; and f) transforming classifier parameters for satisfying a limitation condition.

Disclosed is a LMMSE receiver that restores orthogonality of spreading codes in the downlink channel for a spread spectrum signal received over N receive antennas. The FFT-based chip equalizer tap solver reduces the direct matrix inverse of the prior art to the inverse of some submatrices of size N×N with the dimension of the receive antennas, and most efficiently reduces matrix inverses to no larger than 2×2. Complexity is further reduced over a conventional Fast Fourier Transform approach by Hermitian optimization to the inverse of submatrices and tree pruning. For a receiver with N=4 or N=2 with double oversampling, the resulting 4×4 matrices are partitioned into 2×2 block sub-matrices, inverted, and rebuilt into a 4×4 matrix. Common computations are found and repeated computations are eliminated to improve efficiency. Generic design architecture is derived from the special design blocks to eliminate redundancies in complex operations. Optimally, the architecture is parallel and pipelined.

Performs a code elimination by DCE (dead code elimination) more effectively in optimizing a program by compiling. In an example embodiment, a method invocation to be a processing target is determined based on a state of a use of an object reference in a method invocation in an execution program. The method invocation, which has been determined to be a processing target, is inline-expanded. The instance variable of an object in the inline-expanded method invocation is scalarized, and dead code elimination is performed for the execution program, to which an inline-expansion and a scalarization is performed.

The necessity of calculating a SaaS usage fee by a SaaS service provider is eliminated, and operation efficiency of the SaaS service provider is improved. When a SaaS user 10 uses a SaaS 14, the used volume thereof is accumulated in an operation-system database 21 through a SaaS execution infrastructure 17. When a usage-fee calculation date of the SaaS 14 comes, a business infrastructure 18 acquires used-volume information from an operation infrastructure 19 and calculates a usage fee of the SaaS 14 in accordance with application contents of the SaaS user 10 and usage cost of the SaaS execution infrastructure 17, the business infrastructure 18, and the operation infrastructure 19 used by the SaaS service provider 12 for realizing the SaaS 14. When a billing date comes, the usage fee of the SaaS 14 is billed to the SaaS user 10 and, after money is received, the usage cost of the SaaS service infrastructure 16 of the SaaS service provider 12 is subtracted therefrom, and the difference thereof is paid to the SaaS service provider 12.

Multi-user detection (MUD) performance is optimized to eliminate redundant use of power during processing. An overbuilt A-matrix, i.e., a system response matrix, is provided. The overbuilt A-matrix uses all possible codes, e.g., all codes identified in a candidate code list (CCL) provided by blind code detection (BCD). The overbuilt A-matrix is passed to the MUD which extracts only those rows or columns required for codes that have actually been received, thus eliminating the need to recompute whitening matched filter (WMF) outputs that do not correspond to the actually received code.

A decoding method for unary / kth order exponential Golomb (UEGk) codes is provided. The first step is a receiving step: receiving N bits from an input stream and updating a bit count. If the N bits are all one, the receiving step is re-performed. If the N bits includes zero, a searching step is performed to find a first value based on the bit count. Subsequently, according to the bit count and a threshold value, a remaining bit number M is calculated. A second value is generated based on M remaining bits received from the input stream. Then, the first value and the second value are added, so as to generate an index.

The present invention provides a motion estimation method using a multilevel successive elimination algorithm. The present invention includes the steps of: a) selecting an initial candidate block among a plurality of candidate blocks in an image frame for computing an initial SAD; b) selecting four vertex candidate blocks placed at vertexes of a imaginary perfect square based on the initial candidate block as the center of the imaginary perfect square; c) extracting elimination levels of the four vertex candidate blocks by performing the MSEA; d) predicting elimination levels for side candidate blocks which are located at sides of the perfect square based on a spatial correlation between elimination levels of candidate blocks and the extracted elimination levels of the four vertex candidate blocks; and e) extracting elimination levels of the side candidate blocks by performing the MSEA based on the predicted elimination level.

A software emulator for emulating a handheld video game platform such as GAME BOY®, GAME BOY COLOR® and / or GAME BOY ADVANCE® on a low-capability target platform (e.g., a seat-back display for airline or train use, a personal digital assistant, a cell phone) uses a number of features and optimizations to provide high quality graphics and sound that nearly duplicates the game playing experience on the native platform. Some exemplary features include use of bit BLITing, graphics character reformatting, modeling of a native platform liquid crystal display controller using a sequential state machine, and selective skipping of frame display updates if the game play falls behind what would occur on the native platform.

The method serves to compensates anisotropy in an inertial rotation sensor comprising a metallized vibrating bell (1) having a bias voltage applied thereto, the vibrating bell (1) having an edge (7) electrodes (5.1, 5.2), and the method comprises the steps of measuring, preferably by multiplexing, the anisotropy between the electrodes and of applying to the electrodes a fraction of the bias voltage that depends on the differences measured between the electrodes.

The invention discloses a moving target detection method with the combination of region extraction and an improved texture feature. The method comprises the steps of (1) collecting successive images in a monitoring video as a sampling frame, (2) carrying out background modeling and recovery on each pixel in the sampling frame by using its sampling information, (3) segmenting the image, extractinga foreground region by using statistical features of image blocks, judging the illumination change in the foreground region, and determining whether the second judgment of the foreground region is needed, and (4) carrying out the accurate extraction of foreground pixel points in the foreground region. By performing fast foreground region extraction, the amount of calculation for subsequent accurate judgment is greatly reduced, while the region extraction is carried out, two main interferences including a spatial displacement interference (leaf sway, etc.) and a brightness variation interference (lighting change, etc.) are eliminated, and a moving target in the image sequence is accurately and efficiently extracted.

The method serves to compensates anisotropy in an inertial rotation sensor comprising a metallized vibrating bell (1) having a bias voltage applied thereto, the vibrating bell (1) having an edge (7) electrodes (5.1, 5.2), and the method comprises the steps of measuring, preferably by multiplexing, the anisotropy between the electrodes and of applying to the electrodes a fraction of the bias voltage that depends on the differences measured between the electrodes.

Multi-user detection (MUD) performance is optimized to eliminate redundant use of power during processing. An overbuilt A-matrix, i.e., a system response matrix, is provided. The overbuilt A-matrix uses all possible codes, e.g., all codes identified in a candidate code list (CCL) provided by blind code detection (BCD). The overbuilt A-matrix is passed to the MUD which extracts only those rows or columns required for codes that have actually been received, thus eliminating the need to recompute whitening matched filter (WMF) outputs that do not correspond to the actually received code.

A system for controlling an active electronically scanned array (AESA) antenna, which enables the AESA antenna to switch rapidly between different antenna states, includes memories (38) connected to a common address bus (40). Each memory (38) is also connected to a digitally controlled RF signal transmission block (32) within the AESA antenna, and stores digital control words for the digitally controlled RF signal transmission block (32). When a new address is provided on the address bus (40), each memory (38) outputs a new digital control word to its respective digitally controlled RF signal transmission block (32), causing a change in the state of the AESA antenna.

A method for detecting color temperature and an apparatus thereof are disclosed. According to the present invention, the apparatus for detecting color temperature converts RGB color information, generated by interpolating an image signal sequentially inputted in units of pixel from an image sensor, to a three-dimensional coordinate value of luminance, R-G color difference information, and B-G color difference information, and then renews the added value per color, if included in a filtering zone corresponding to a characteristic curve of the image sensor. Then, an average value per color is generated in units of frame, and the compensation rate per color is determined such that the average value per color becomes identical to each other. With the present invention, accurate colors can be displayed by detecting the color temperature of the current light source and correcting the distorted color information.

The invention discloses an axle wire generating method of a random quadrangular curved surface for product three-dimensional data processing. Combination of a locus method and a movable Frenet frame is adopted, and a simple and quick axle wire generating algorithm is provided. A B-rep three-dimensional solid model which is frequently applied to engineering problems has specific border definition, information of top points, sides and faces of the model are specifically stored in a model file, the specific information can be used for simplifying an axle wire generating method in the traditional locus method, and therefore data size needed in generation of an axle wire is reduced. The specific border information in the B-rep model is used as conditions of the axle wire generating method, calculation of branch points is omitted through features of a bisector, and factors influencing the precision of the axle wire are reduced. Density of inserting points can be controlled to guarantee the precision of the axle wire.

A method for detecting color temperature and an apparatus thereof are disclosed. According to the present invention, the apparatus for detecting color temperature converts RGB color information, generated by interpolating an image signal sequentially inputted in units of pixel from an image sensor, to a three-dimensional coordinate value of luminance, R-G color difference information, and B-G color difference information, and then renews the added value per color, if included in a filtering zone corresponding to a characteristic curve of the image sensor Then, an average value per color is generated in units of frame, and the compensation rate per color is determined such that the average value per color becomes identical to each other With the present invention, accurate colors can be displayed by detecting the color temperature of the current light source and correcting the distorted color information.

A method of manufacturing an advertising device comprising manufacturing an advertising device describing at least one attribute of at least one product or service is disclosed. A facility address is retrieved from a database of establishment locations the address of one or more facilities offering the product or service. In a recipient address of an intended advertising device recipient is retrieved from a database of advertising device recipients. A route between the facility address and the recipient address is generated. The route is then applied to the advertising device.

A decoding method for unary / kth order exponential Golomb (UEGk) codes is provided. The first step is a receiving step: receiving N bits from an input stream and updating a bit count. If the N bits are all one, the receiving step is re-performed. If the N bits includes zero, a searching step is performed to find a first value based on the bit count. Subsequently, according to the bit count and a threshold value, a remaining bit number M is calculated. A second value is generated based on M remaining bits received from the input stream. Then, the first value and the second value are added, so as to generate an index.

The invention discloses a non-orthogonal multiple access system signal detection method with low complexity, and belongs to the technical field of wireless communication. The method includes steps: performing ranking according to SNR values of signals, performing ranking QR detection on a matrix, and obtaining an orthogonal matrix and an upper triangular matrix; switching a pair of adjacent columns with another pair of adjacent columns in the matrix by employing the symmetry between column vectors to reduce orthogonal calculation in a ranking QR decomposition algorithm; and detecting a reception signal matrix outputted by a receiving end according to an iteration formula to obtain an estimated value of a transmitting signal. According to the method, on the premise of not reducing the system performance, the complexity of the conventional algorithm is reduced, and the calculation complexity is almost 50% of that of the conventional method.

The invention discloses an image enhancement method, an image enhancement device and a computer readable storage medium. The method comprises the following steps: processing a grayscale image to obtain a first processed image; taking a preset initial scale factor as a current scale factor; processing the first processed image based on the current scale factor to construct a current filter; filtering the first processed image by using a current filter to generate a first filtered image; if the current scale factor is not greater than the maximum scale factor, taking the sum of the current scale factor and the preset scale step length as the current scale factor, and returning to the step of processing the first processed image based on the current scale factor until the current scale factor is greater than the maximum scale factor; and processing the first filtered image to obtain an enhanced image. Therefore, the image enhancement effect can be effectively improved.