Abstract: A thermochemical energy storage system. The system includes a membrane-based thermochemical reactor having a solution channel having an absorbent-containing solution flowing therethrough and a refrigerant channel having a refrigerant flowing therethrough along with first and second fluid channels. A porous membrane is positioned between the refrigerant channel and the solution channel; the porous membrane permits flow of vapor molecules therethrough while restricting flow of absorbent molecules. The system further includes a solution storage repository in fluid communication with the solution channel and a refrigerant repository in fluid communication with the refrigerant channel. The system can be used in high-density, high-efficiency, and low-temperature energy storage systems. The membrane-based reactor offers a large specific surface area and integrates solution/refrigerant flows, which enables formation of a highly compact reactor exhibiting strong heat/mass transfer.

Abstract: A method of assisted mounting and error compensation for absolute grating ruler comprises: (1) when mounting a CMOS sensor and a grating ruler body, the CMOS sensor reads an upper and a lower sample windows, and due to an angle existing between the grating ruler body and the CMOS sensor, a difference exists between the numbers of the upper and lower sample windows, and by continually adjusting the grating ruler body or the CMOS sensor, the code reading difference minimized so that the angle is zeroed; (2) when mounting the grating ruler body and a mechanic housing, it is moved by a fixed displacement in a motion direction, and a grating encoding reading is recorded and an error compensating amount is obtained which serves as error compensation value in an actual motion to correct a cumulative error introduced by the angle between the grating ruler body and the motion direction.

Abstract: The present invention is a method of assisted mounting and error compensation for absolute grating ruler. It comprises the following: (1) when mounting a CMOS sensor and a grating ruler body, the CMOS sensor reads an upper and a lower sample windows, and due to an angle existing between the grating ruler body and the CMOS sensor, a difference exists between the numbers of the upper and lower sample windows, and by continually adjusting the grating ruler body or the CMOS sensor, the code reading difference is made minimal so that the angle existing between the grating ruler body and the CMOS sensor is zeroed; (2) when mounting the grating ruler body and a mechanic housing, it is moved by a fixed displacement in a motion direction, and a grating encoding reading is recorded and an error compensating amount is obtained which serves as error compensation value in an actual motion to correct a cumulative error introduced by the angle between the grating ruler body and the motion direction.

Abstract: Particular embodiments described herein provide for an electronic device that can be configured to determine that a program related to a process begins to run, trace events related to the program when it is determined that the program should be monitored, and determine a number of events to be traced before the trace is concluded. The number of events to be traced can be related to the type of program. In addition, the number of events that are traced can be related to the activity of the program. A number of child events to be traced can be determined if the program has a child program. The traced child events can be combined with the events traced and the results can be analyzed to determining if the process includes malware.

Abstract: Behavioral blocking of overlay-type identity stealers is achieved by detecting a transactional web page session, evaluating a property of a window corresponding to a process running on the computer system, and then, based on a result of the evaluation, blocking a behavior of the process for a duration of the transactional web page session. The evaluation of the property window involves determining whether the window exhibits one or more characteristics representing activity of an overlay-type identity stealer.

Abstract: A coded moving-picture signal is decoded by a resolution-converting motion compensation process and a resolution-converting inverse discrete cosine transform, both of which decrease the resolution of the picture, thereby reducing the amount of reference picture data that has to be stored and accessed. The reference picture data may also be stored in a compressed form. The resolution conversion and compression processes may also be used in the coding of the moving-picture signal. The resolution-converting inverse discrete cosine transform may be performed by output of intermediate results that have not been combined by addition and subtraction in a butterfly computation.

Abstract: A coded moving-picture signal is decoded by a resolution-converting motion compensation process and a resolution-converting inverse discrete cosine transform, both of which decrease the resolution of the picture, thereby reducing the amount of reference picture data that has to be stored and accessed. The reference picture data may also be stored in a compressed form. The resolution conversion and compression processes may also be used in the coding of the moving-picture signal. The resolution-converting inverse discrete cosine transform may be performed by output of intermediate results that have not been combined by addition and subtraction in a butterfly computation.

Abstract: A coded moving-picture signal is decoded by a resolution-converting motion compensation process and a resolution-converting inverse discrete cosine transform, both of which decrease the resolution of the picture, thereby reducing the amount of reference picture data that has to be stored and accessed. The reference picture data may also be stored in a compressed form. The resolution conversion and compression processes may also be used in the coding of the moving-picture signal. The resolution-converting inverse discrete cosine transform may be performed by output of intermediate results that have not been combined by addition and subtraction in a butterfly computation.

Abstract: A coded moving-picture signal is decoded by a resolution-converting motion compensation process and a resolution-converting inverse discrete cosine transform, both of which decrease the resolution of the picture, thereby reducing the amount of reference picture data that has to be stored and accessed. The reference picture data may also be stored in a compressed form. The resolution conversion and compression processes may also be used in the coding of the moving-picture signal. The resolution-converting inverse discrete cosine transform may be performed by output of intermediate results that have not been combined by addition and subtraction in a butterfly computation.

Abstract: A coded moving-picture signal is decoded by a resolution-converting motion compensation process and a resolution-converting inverse discrete cosine transform, both of which decrease the resolution of the picture, thereby reducing the amount of reference picture data that has to be stored and accessed. The reference picture data may also be stored in a compressed form. The resolution conversion and compression processes may also be used in the coding of the moving-picture signal. The resolution-converting inverse discrete cosine transform may be performed by output of intermediate results that have not been combined by addition and subtraction in a butterfly computation.

Abstract: A shape adaptive wavelet transform is performed on a digitized image signal representing an image. First, a shape information is obtained about the image, and the shape information is applied to a shape adaptive wavelet filter. The shape adaptive wavelet filter detects a starting point and an ending point of the image. The digitized image signal is divided into a low-frequency component and a high-frequency component. Then each frequency component is sampled, using the shape information. The shape adaptive wavelet filter then generates converted shape information indicating the shape for each sampled frequency component.

Abstract: An N-level wavelet transform is executed on an image signal representing an image having a first dimension and a second dimension. First, an N-level one-dimensional wavelet transform is executed in the first dimension, thereby generating an intermediate signal which is temporarily stored in a memory device; then an N-level one-dimensional wavelet transform is executed on the intermediate signal in the second dimension. The image signal may be accompanied by shape information describing the shape of the image, in which case each N-level one-dimensional wavelet transform is executed by a series of N one-level wavelet transforms, with alteration of the shape information when each one-level wavelet transform is performed.

Abstract: An image signal is transformed by at least two different mathematical transformations to obtain at least two different transformed signals. A selected one of the transformed signals is quantized and coded, the selection being made so as to minimize the size of the coded data. The selection is made by comparing the energy convergence rates of the transformed signals, or by quantizing all of the transformed signals and comparing the amounts of non-zero quantized data, or by quantizing and coding all of the transformed signals and comparing the coded data sizes directly.

Abstract: A digitized image is divided into blocks and a wavelet transform is performed, producing wavelet blocks which are quantized, scanned into linear sequences, and then coded. The scanning of each wavelet block starts with a purely low-frequency element. The high-frequency elements are scanned in a sequence that depends on the occurrence of non-zero elements among the high-frequency elements. When a non-zero element is scanned, this information is used to proceed quickly to related high-frequency elements. This scanning method tends to produce a linear sequence in which non-zero elements are clustered together. Such sequences can be coded efficiently.

Abstract: An image compression apparatus has a separation section for performing processing for dividing image data into a plurality of data blocks, an orthogonal transformer for orthogonal-transforming each data block, a bit allocation table for storing data representing the number of bits allocated in accordance with the frequency component of the orthogonal-transformed data output from the orthogonal transformer, an arithmetic operation circuit for calculating an amplitude probability density function of an identical frequency component of the orthogonal-transformed image data for each pixel, and calculating a quantization limit band causing a mean square error to be minimized in acordance with the calculating amplitude probability density function and the bit-number data from the bit allocation table, and a band limit table for storing the quantization limit band data.

Abstract: An image processing apparatus includes a memory for storing image data, a loss-compression circuit for loss-compressing the image data, an expansion circuit for expanding the loss-compressed image data, and a difference circuit for calculating a difference between the original image data of the image memory and the expanded image data of the expansion circuit. A lossless compression circuit lossless-compresses the difference image data obtained by the difference circuit. A multiplexer multiplexes the loss-compressed image data output from the loss-compression circuit, with the lossless-compressed difference data obtained by the lossless-compression circuit.