This invention realizes an image decoding apparatus and an image decoding method capable of correctly performing a decoding process in short time with a simple construction. In an image decoding apparatus and an image decoding method for performing a decoding process under a prescribed coding method, simple playback frames comprising an I-picture and following prescribed pieces of P-pictures on the basis of the I-picture existing at a desired position in picture data encoded with the coding method are extracted in a fast playback mode.

Recently, for both information distribution of broadcasting stations and information reception of general households, such apparatuses have been proposed that treat picture information by digitizing it, and operate under the MPEG (Moving Picture Experts Group) scheme or the like to compress the information through orthogonal transformation such as discrete cosine transformation, and motion compensation, with making use of redundancy of picture information, in order to realize efficient transmission and storage of the information.
Specifically, the MPEG2 (ISO/IEC 13818-2) is defined as a general image coding method, and is widely used in various applications for professionals and consumers because both interlace images and noninterlace image, and standard resolution images and high fine images can be treated.
With the MPEG compression method, high compression rate and good picture quality can be realized by assigning a coding amount (bit rate) of 4-8 [Mbps] to standard resolution interlace images of 720×480 pixels, and a bit rate of 18-22 [Mbps] to high resolution interlace images of 1920×1088 pixels.
The MPEG2 mainly executes high picture quality coding for broadcasting, but cannot cope with a coding amount (bit rate) lower than that in the MPEG1, that is, a coding method at a higher compression rate.
The needs for such coding method may increase as portable terminals become popular. Therefore, an MPEG4 coding method was standardized. The guidelines for image coding method were approved as international standards of ISO/IEC 14496-2 in December, 1998.
Further, for image coding for video conference, standard guidelines called H. 26L (ITU-T Q6/16 VCEG) are progressing. As compared with the conventional coding methods such as MPEG2 and MPEG4, more operations are required for encoding and decoding but higher encoding efficiency can be realized.
In addition, as a part of popularization of the MPEG4, a JVT coding method which is realized based on the H. 26L and by incorporating functions that the H. 26L does not have has been standardized to realize higher coding efficiency. According to a schedule for standardization, this method would be internationally standardized in the name of H. 26L and MPEG-4 Part 10 (Advanced Video Coding) in March, 2003.
The JVT coding method will be now described. An input picture signal is digitized through the A/D conversion, and then frame pictures are rearranged according to a GOP (Group of Pictures) structure of picture compression information for output.
As to a picture to be subjected to intra coding, an input picture and differential information of pixel values created through intra prediction are subjected to an orthogonal transformation such as discrete cosine transformation and Karhunen-Loeve transformation, and then the resultant transformation coefficient is quantized.
The quantized transformation coefficient is subjected to reversible encoding such as variable length encoding and arithmetic encoding, and then is stored and output as picture compression information. The quantization process is under rate control in a feedback manner according to the storage state.
The quantized transformation coefficient is subjected to a dequantization process and inverse orthogonal transformation to create decoded picture information. From this information, block distortion is removed through a de-blocking filtering process. Then the resultant information is subjected to an intra prediction process while stored in a frame memory.
In this intra prediction process, information on an intra prediction mode which was applied to blocks/macroblocks is subjected to the reversible encoding process, and is encoded as part of header information of the picture compression information.
In addition, as to a picture to be subjected to inter coding, picture information is subjected to a motion prediction/compensation process and, at the same time, picture information to be referred is read from the frame memory. The information is subjected to the motion prediction/compensation process to create reference picture information. The reference picture information is converted to a differential signal from the picture information.
In the motion compensation/prediction process, motion vector information is simultaneously subjected to the reversible encoding process to create information to be inserted in the header part of picture compression information. The other processes are the same as those applied to picture compression information to be subjected to the intra coding.
In this JVT coding method, when picture information to be input is interlaced scanning, two macroblocks can be encoded in a field mode or a frame mode as one pair (hereinafter, referred to as macroblock pair).
An intra prediction method defined in the JVT coding method will be hereinafter described.
Parameters to be input for the intra prediction process are mb_type, prev_intra4×4 red_mode_flag (if available), rem_intra4×4_pred_mode (if available), intra_chroma_pred_mode (if available), pixel values of neighboring macroblocks (or neighboring macroblock pairs). In addition, parameters to be output are predicted pixel values for the macroblocks (or the macroblock pairs). The intra prediction is performed by using pixel values before the de-blocking filtering process.
The intra prediction method for luminance signals will be now described. As described below, the process for luminance signals is different depending on whether the macroblocks are in the intra 4×4 mode or in the intra 16×16 mode.
First, the process in the intra 4×4 mode is as follows.
This process is applied when mb_part_pred_mode (mb_type, 0) is equal to Intra—4×4. Parameters to be input are prev_intra4×4_pred_mode_flag, rem_intra4×4_pred_mode (if available), and the pixel values (if available) of neighboring luminance blocks before the de-blocking filtering process. Outputs are the prediction values of a luminance signal for the macroblocks. An order of scanning luminance signal 4×4 blocks is shown in FIG. 4.
Now, a process to determine whether the intra prediction of the blocks is "available" or "not available" when the value of adaptive_frame_field_flag is 0 will be described. Inputs for this process are the positions of the luminance blocks, and the values of luminance pixels (before the de-blocking filtering process) subjected to the decoding process, which is included in neighboring blocks. Outputs indicates whether the pixel values of A to M shown in FIG. 5 are "available". 4×4LumaBlkLoc is indicated by 4×4LumaBlkIdx. This is defined as the position of the upper left pixel value of the 4×4Luminance block. The pixel values included in the 4×4Luminance block, which is indicated by the 4×4LumaBlkIdx, are a to p in FIG. 5, and these are predicted from the neighboring pixel values A to M. The positions of the pixel values are indicated by the 4×4LumaBlkLoc. For example, the position of d is represented as follows:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]+3y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]  (1)
In addition, the position of A is represented as follows:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]−1  (2)
When at least one of the following first to third conditions is satisfied, the pixel values A to M are "not available". The first is that the pixel is out of a picture or out of a slice. The second is that the pixel belongs to a block which is processed after the block in the decoding process. The third is that constrainde_intra_pred_flag=0 and the block belongs to an inter macroblock.
When E to H are "not available" and D is "available", the E to H are taken as "available" and D is used as their values.
Next, a process when the value of mb_adaptive_frame_filed flag is 1 and the value of field_pic_flag is 0 will be described. The neighboring pixels A to M for the pixel values a to p shown in FIG. 5 are defined as follows. That is, when the macroblock is in the frame decoding mode, the same process as the case where the value of mb_adaptive_field_flag is 0 will be performed.
When the macroblock is in the field decoding mode and is the top macroblock, the neighboring pixel values are defined as follows:A:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]−2I:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]−1y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]  (3)
In addition, when the macroblock is in the field decoding mode and is the bottom field mactroblock, the neighboring pixel values are defined as follows:A:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]−1I:x: 4×4LumaBlkLoc[4×4LumaBlkIdx][0]1−1y: 4×4LumaBlkLoc[4×4LumaBlkIdx][1]  (4)
Next, a process to create intra prediction values will be described. Inputs for this process are prev_intra4×4_pred_flag, rem_intra4×4_pred_mode, the position of 4×4 luminance block specified by 4×4LumaBlkIdx, and LumaBlkLoc[4×4LumaBlkIdx]. Output is Intra4×4LumaPredMode[4×4LumaBlkIdx]. FIG. 6 shows ntra4×4LumaPredMode[4×4LumaBlkIdx] and the name of a corresponding prediction mode.
When the values of Intra4×4LumaPredMode[4×4LumaBlkIdx] are 0, 1, 3, 4, 5, 6, 7, and 8, the prediction directions are shown in FIG. 7.
When adaptive_frame_field_flag is 0, or when field_pic_flag is 1, the addresses of the neighboring macroblocks and "availability" are detected as follows. An input for this process is MbAddress (address of the macroblock) and outputs are MbAddressA (address of a macroblock locating on the left side of the macroblock), MbAddressB (address of a macroblock locating above the macroblock), and the addresses "availability" of these two macroblocks.
As to the address MbAddress of a macroblock, when any of the following first to fourth conditions is satisfied: the first is that MbAddress<0, and the second is that MbAddress>Max MbAddress−1, the third is that a macroblock specified by MbAddress belongs to a different slice, and the fourth is that the macroblock specified by MbAddress has not been decoded, the macroblock specified by this MbAddress is taken as "not available".
This process is applied to neighboring macroblocks A and B as follows. That is, in the first process, an input is that MbPairAddressA=MbPairAddress−1, and an output is whether MbPairAddressA is "available". In the second process, an input is that MbPairAddressB=MbPairAddress−(frame_width_in_mbs_minus 1+1) and an output is whether MbPairAddressB is "available".
When adaptive_frame_field_flag is 0 or when Field_pic_flag is 1, the addresses of neighboring macroblocks and "availability" are detected as follows. An input parameter for this process is MbAddressA and outputs are (four) variable numbers of "ExIntra4×4LumaPred".
First, as to a macroblock locating on the left side of the macroblock, when the macroblock specified by MbAddressA is "available" and the mb_type of the macroblock specified by MbAddressA is I—4×4 or SI, the value of ExIntra4×4LumaPredMode can be obtained as follows:for (i=0, i<4, 1i++)ExtIntra4×4LumaPreMode[(i+1)*5]=Intra4×4LumaPreMode[4×4LumaBlkScan(3,1)]  (5)
Intra4×4LumaPredMode is a value assigned to the macroblock specified by MbAddressA.
When the macroblock specified by MbAddressA is not "available" or when its mb_type is not I—4×4 nor SI, the value of ExIntra4×4LumaPredMode can be obtained by the following process:for (i=0, i<4, 1i++)ExtIntra4×4LumaPredMode[(i+1)*5]=2  (6)
Next, as to a macroblock locating above the macroblock, an input parameter is, parameters as MbAddressB outputs are (four) variable values of "ExtIntra4×4LumaPred".
When a macroblock specified by MbAddressB is "available" and the macroblock mb_type_specified by MbAddressB is I—4×4 or SI, the value of ExIntra4×4LumaPredMode can be obtained by the following process.for (i=0, i<4, 1i++)ExtIntra4×4LumaPredMode(i+1)=Intra4×4LumaPredMode[4×4LumaBlkScan(i,3)  (7)
Intra4×4LumaPredMode is a value assigned to the macroblock specified by MbAddressB.
When a macroblock specified by MbAddressB is not "available" or when its mb_type is not I—4×4 nor SI, the value of ExIntra4×4LumaPredMode can be obtained by the following process.for (i=0, i<4, 1i++)ExtIntra4×4LumaPredMode(i+1)=2  (8)
Next, a process to extract information on the intra prediction mode of a neighboring macroblock pair when the field/frame adoptive encoding is performed on a macroblock basis as described above will be described.
A process which is performed when mb_adaptive_field_flag of the macroblock is 1 and field_pic_flag is 0 will be described.
First, when the macroblock pair is in the frame mode, input information are MbPairAddressA and MbPairAddressB, and output information are (8 in total) ExIntra4×4LumaPredModeTop and ExIntra4×4LumaPredModeBottom of the macroblock for each of top macroblock and bottom macroblock.
For the top macroblock, MbPairAddress A is input as MbAddressA in the process described in the above equation (5), and ExIntra4×4LumaPredModeTop is output as a result. In addition, MbPairAddressB is input as MbAddressB described in the above equation (7), and ExIntra4×4PredModeTop is output as a result.
Next, for Bottpm Macroblock, MbPairAddressA is input as MbAddressA in the process described in the above equation (5), and ExIntra4×4LumaPredModeBottom is output as a result. In addition, MbPairAddressB is input as MbAddressB in the process described in the above equation (7), and ExIntra4×4LumaPredModeBottom is output as a result.
First, when the macroblock pair is in the field mode, input information are MbPairAddressA and MbPairAdressB, and output information are (8 in total) ExIntra4×4LumaPredModeTop and ExIntra4×4LumaPredModeBottom of the macroblock for each of top macroblock and bottom macroblock.
A process for MbPairAddressA of the neighboring macroblock is as follows. That is, MbPairAddressA is input as MbAddressA in the process described in 8. 3. 1. 2. 3. 1, and ExIntra4×4PredModeTop is output as a result. In addition, MbPairAddressA in the process described in the above equation (5) is input, and ExIntra4×4LumaPredModeBottom is output as a result.
When MbPairAddressB of a neighboring macroblock pair is in the filed mode or is not "available", the following process is applied. That is, for the top macroblock of the MB Pair, the process described in the above equation (7) is applied, and as its input, top macroblock of the MB Pair specified by MbPairAddressB is used as MBAddressB. Its output is ExIntra4×4LumaPredModeTop. In addition, bottom macroblock of MBPair specified by the MBPairAddressB is used as MBAddressB. Its output is ExIntra4×4LumaPredModeBottom.
When a neighboring macroblock pair MbPairAddressB is in the frame mode, the following process is applied. That is, for top macroblock of the MB Pair, the process described in the above equation (7) is applied, and as its input, the bottom macroblock of MB Pair specified by MBAddressB is used as MBAddressB. Its output is ExIntra4×4LumaPredModeTop. For bottom macroblock of the MB Pair, the process described in the above equation (7) is applied and as its input, the bottom macroblock of MBPair specified by MBPairAddressB is used as MBAddressB. And its output is ExIntra4×4LumaPredModeBottom.
FIG. 8 shows the above processes in a case where the macroblock pair is in the field mode.
Next, the decoding process of Intra4×4LumaPredMode for the macroblock will be described.
This process is applied when adaptive_frame_field_flag is 1, or when field_pic_flag is 1. Input information are prev_intra4×4pred_mode_flag, rem_intra4×4_pred_mode, and ExIntra4×4LumaPredMode. Output information is Intra—4×4LumaPredMode for the macroblock (specified by MbAddress). This process is described with pseudo codes as follows:for (4×4LumaBlkIdx=0,4×4LumaBlkIdx<16,4×4LumaBlkIdx++{i=4×4LumaBlkIdx+RasterTo4×4LumaBlkOffset (4×4LumaBlkIdx)Ext4×4LumaBlkIdx=5*(i/4+1)+i %4+1PredIntra4×4LumaPredMode=Min(ExIntra4×4LumaPredMode [Ext4×4LumaBlkIDX−1],ExtIntra4×4LumaPredMode [Ext4×4LumaBlkIdx−5]) if(prev_intra4×4pred_mode_flag—[4×4LumaBlkIdx]) Intra4×4LumaPredMode[4×4LumaBlkIdx]=PredIntra4×4LumaPredMode else{if(rem_itnra4×4_Pred_mode[4×4LumaBlkIdx]<PredIntra4×4LumaPredMode) Intra4×4LumaPredMode[4×4LumaBlkIdx]=rem_intra—4×4_pred_moded[4×4LumaBlkIdx] else Intra4×4LumaPredMode[4×4LumaBlkIdx]=rem_intra—4×4_pred_mode[4×4LumaBlkIdx]+1}ExtIntra4×4LumaPredMode[Ex4×4LumaBlkIdx]=Intra4×4LumaPredMode[4×4LumaBlkIde]}  (9)
Next, a decoding process of Intra4×4LumaPredMode for a macroblock pair (MB Pair) as described above will be described.
This process is applied when mb_adaptive_frame_field_flag is 1 and field_pic_flag is 0.
Prev_intra4×4_pred_mode_flag, rem_intra4×4_pred_mode, ExIntra4×4LumaModePredTop for top macroblock of the macroblock pair are inputs for the process described in the equation (8), and Intra4×4LumaPredMode which is its output is assigned to the top macroblock of the macroblock pair.
Prev_intra4×4_pred_mode_flag, rem_intra4×4_pred_mode, and ExIntra4×4LumaPredMode for bottom macroblock of the macroblock pair are inputs for the process described in the equation (8), and Intra4×4LumapredMode which is its output is assigned to the bottom macroblock of the macroblock pair.
Next the decoding process for the intra prediction in the intra 4×4 mode will be described.
A parameter to be input is Intra4×4LumaPredMode[4×4LumaBlkIdx] which is defined for neighboring pixel values A to M and the 4×4 block shown in FIG. 5, and parameters to be output are predicted pixel values for the 4×4 block specified by 4×4LumaBlkIdx. These will be now described depending on the value of Intra4×4LumaPredMode[4×4LumaBlkIdx]. Any intra prediction mode is used.
A Vertical prediction method will be hereinafter described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 0. It is applied only when A, B, C, D are "available". Their predicted values are as follows:a, e, i, m: Ae, f, g, h: Bi, j, k, l: cm, n, o. p: D  (10)
A Horizontal prediction method will be hereinafter described. Tis prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 1. It is applied only when I, J, K, L are "available". Their predicted values are as follows:a, b, c, d: Ie, f, g, h: Ji, j, k, l: Km, n, o, p: L  (11)
A DC prediction method will be hereinafter described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 2. The following value is used as a predicted value for all of the pixels a-p.
That is, when A, B, C, D, I, J, K, L are all "available", the predicted value is taken as:(A+B+C+i+j+k+l+4)>>3  (12)
When A, B, C, D are all "unavailable", the predicted value is taken as:(I+J+K+L+2)>>2  (13)
When I, J, K, L are all "unavailable", the predicted value is taken as:(A+B+C+D+2)>>2  (14)
When A, B, C, D, I, J, K, L are all "available", the predicated value is taken as 128.
Diagonal_Down_Left prediction will be hereinafter described. This prediction method is applied when Intra4×4LumapredMode[4×4LumaBlkIdx] is 3. It is applied only when A, B, C, D, I, J, K, L, M are all "available". Their predicated values are as follows:a: (A+2B+C+2)>>2b, e: (B+2C+D+2)>>2c, f, i: (C+2D+E+2)>>2d, g, j, m: (D+2E+F+2)>>2h, k, n: (E+2F+G+2)>>2l, o: (F+2G+H+2)>>2p: (G+H+2)>>2  (15)
Diagonal_Down_Right prediction will be hereinafter described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 4. It is applied only when A, B, C, D, I, J, K, L, M are "available". Their predicted values are as follows:m: (J+2K+L+2)>>2i, n: (I+2J+K+2)>>2e, j, o: (M+2I+J+2)>>2a, f, k, p: (A+2M+I+2)>>2b, g, l: (M+2A+B+2)>>2c, h: (A+2B+C+2)>>2d: (B+2C+D+2)>>2  (16)
Diagonal_Vertical_Right prediction will be hereinafter described. This prediction method is applied when Intra4×4LumaPredmode[4×4LumaBlkIdx] is 5. It is applied only when A, B, C, D, I, J, K, L, M are "available". Their predicted values are as follows:a, j: (M+A+1)>>1b, k: (A+B+1)>>1c, l: (B+C+1)>>1d: (C+D+1)>>1e, n: (I+2M+A+2)>>2f, o: (M+2A+B+2)>>2g, p: (A+2B+C+2)>>2i: (M+2I+J+2)>>2m: (I+2J+K+2)>>2  (17)
Horizontal_Down will be hereinafter described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 6. It is applied only when A, B, C, D, I, J, K, L, M are "available". Their predicted values are as follows:a, g: (M+I+1)>>1b, h: (I+2M+A+2)>>2c: (M+2A+B+2)>>2d: (M+2A+C+2)>>2e, k: (I+J+1)>>1f, l: (M+2I+J+2)>>2i, O: (J+K+1)>>1j, p: (I+2J+K+2)>>2m: (K+L+1)>>1n: (J+2K+L+2)>>2  (18).
Vertical_Left predicted values will be now described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 7. It is applied only when A, B, C, D, I, J, K, L, L, M are "available". Their predicted values are as follows:a: (A+B+1)>>1b, i: (B+C>+1)>>1C, j: (C+D+1)>>1d, k: (D+E+1)>>1l: (E+F+1)>>1e: (A+2B+C+2)>>2f, m: (B+2C+D+2)>>2g, n: (C+2D+E+2)>>2h, o: (D+2E+F+2)>>2p: (E+2F+G+2)>>2  (19)
Horizontal_Up prediction will be now described. This prediction method is applied when Intra4×4LumaPredMode[4×4LumaBlkIdx] is 8. It is applied only when A, B, C, D, I, J, K, L, M are "available". Their predicted values are as follows:a: (I+J+1)>>1b: (I+2J+K+2)>>2c, e: (I+K+1)>>1d, f: (J+2K+L+2)>>2g, i: (K+L+1)>>1h, j: (K+3L+2)>>2k, l, m, n, o, p: L  (20)
An intra prediction method when the luminance signal belongs to a macroblock which is in the intra 16×16 mode will be now described. This process is applied when mb_part_pred_mode (mb_type, 0) is equal to Intra16×16. Parameters to be input are mb_type of the macroblock and the neighboring pixel values of the macroblock before the de-blocking filtering process, and parameters to be output are predicted pixel values for the macroblock.
Hereinafter, the pixel values belonging to the macroblock are represented as P (x, y); x, y=0 . . . 15. In addition, the neighboring pixel values are represented as P(x, −1) and P(−1, y); =−1 . . . 15.
Assume that P(x, −1) and P(−1, y) are "unavailable" when any of the followings is satisfied: they does not exist in the picture or the slice; and neighboring pixel values belong to non-intra macroblocks and constrained_intra_pred_flag is 1.
In the intra 16×16 mode, the intra prediction is conducted with any of the following four methods described below.
Mode 0 is vertical prediction, and is applied only when P(x, −1); x, y=−1 . . . 15 is "available". The created predicted values are as follows:Pred(x,y)=P(x,−1); x, y=0 . . . 15  (21)
Mode 1 is horizontal prediction, and is applied only when P(−1, y); x, y=−1 . . . 15 is "available". The created predicted values are as follows:Pred(x,y)=P(−1, y); x, y=0 . . . 15  (22)
Mode 2 is DC prediction and predicted values are created as follows. That is, when P(x, −1) and P(−1, y); x, y=−1 . . . 15 are all "available",
                                                        Pred                                            (                                  x                  ,                  y                                )                                      =                          [                                                                    ∑                                                                  x                        ′                                            =                      0                                        15                                                                          P                                                              (                                                                        x                          ′                                                ,                                                  1                          -                                                                    )                                                                      +                                                      ∑                                                                  y                        ′                                            =                      0                                        15                                                                          P                                                              (                                                                        1                          -                                                ,                                                  y                          ′                                                                    )                                                                      +                16                            ]                                >>          5                                                                                With                                                                          x                    ,                      y            =                          0                                                                                …                                                                                15                                                          (        23        )
When P(x, −1); x, y=−1 . . . 15 are "not available",
                                                        Pred                                            (                                  x                  ,                  y                                )                                      =                          [                                                                    ∑                                                                  y                        ′                                            =                      0                                        15                                                                          P                                                              (                                                                        -                          1                                                ,                                                  y                          ′                                                                    )                                                                      +                8                            ]                                >>          4                                                                                With                                                                          x                    ,                      y            =                          0                                                                                …                                                                                15                                                          (        24        )
When P(−1, y); x, y=−1 . . . 15 are "not available",
                                                        Pred                                            (                                  x                  ,                  y                                )                                      =                          [                                                                    ∑                                                                  x                        ′                                            =                      0                                        15                                                                          P                                                              (                                                                        x                          ′                                                ,                                                  -                          1                                                                    )                                                                      +                8                            ]                                >>          4                                                                                With                                                                          x                    ,                      y            =                          0                                                                                …                                                                                15                                                          (        25        )
P(x, −1) and P(−1, y); x, y=−1 . . . 15 are all "not available", the predicted value is taken as 128.
Mode 3 is plane prediction. This prediction mode is applied only when P(x, −1) and P(−1, y); x, y=−1 . . . 15 are all "availeble". The predicted values are created as follows:
                              Pred                                (                          x              ,              y                        )                                                                              Clipl                                (                                          (                                  a                  +                                      b                    ·                                          (                                              x                        -                        7                                            )                                                        +                                      c                    ·                                          (                                              y                        -                        1                                            )                                                        +                  16                                )                            >>              5                        )                                                                              a          =                      16            ·                          (                                                P                                                        (                                                                  1                        -                                            ,                      15                                        )                                                  +                                  P                                                        (                                          15                      ,                                              -                        1                                                              )                                                              )                                                                                b            =                          (                                                5                  ·                  H                                +                32                            )                                >>          6                                                                                c            =                          (                                                5                  ·                  V                                +                32                            )                                >>          6                                                                    H          =                                    ∑                              x                -                1                            8                                                  x              ·                              (                                                      P                                                              (                                              7                        +                                                  x                          ,                                                -                        1                                            )                                                        -                                      P                                                              (                                              7                        -                                                  x                          ,                                                -                        1                                            )                                                                      )                                                                                v          =                                    ∑                              y                =                1                            8                                                  y              ·                              (                                                      P                                                              (                                                                                -                            1                                                    ,                          7                                                +                        y                                            )                                                        -                                      P                                                              (                                                                                -                            1                                                    ,                          7                                                -                        y                                            )                                                                      )                                                                        (        26        )            Clip1 here represents a clipping process within a range of 0 to 255.
The intra prediction for color difference signals will be now described. This process is applied to only I macroblocks and SI macroblocks. Input parameters are intra_chroma_pred_mode and neighboring pixel values before the de-blocking filtering process. Output parameters are predicted values for the color difference signal of the macroblock.
Hereinafter, the pixel values belonging to the macroblock are represented by P(x, y); x, y=0 . . . 7. In addition, the neighboring pixel values are represented by P(x, −1) and P(−1, y)=−1 . . . 7.
The intra prediction mode for color difference signals can be set independently from that for luminance signals.
Assume that P(x, −1) and P(−1, y) are "unavailable" when any of the following conditions is satisfied: they do not exist in the picture or the slice; and neighboring pixel values belong to non-intra macroblocks and constrained_intra_pred_flag is 1.
Mode 0 is DC prediction and its predicted values are as, follows. That is, when P(x, −1) and P(−1, y) are "available", the following is satisfied.
                                                                                Pred                                                        (                                          x                      ,                      y                                        )                                                                                [                                  [                                                            ∑                                              n                        =                        0                                            7                                                                                (                                                                        P                                                                                (                                                                                -                                1                                                            ,                              n                                                        )                                                                          +                                                  P                                                                                8                                                    n                          ,                                                -                        1                                            )                                                        )                                ]                            +              8                        ]                    >>          4                                                                                With                                                                          x                    ,                      y            =                          0                                                                                …                                                                                7                                                          (        27        )
When P(−1, y) is "not available", the following is satisfied.
                                                        Pred                                                                                (                                      x                    ,                    y                                    )                                                                                [                                  [                                                            ∑                                              n                        =                        0                                            7                                                                                P                                                                    (                                                                              n                            ,                                                    -                          1                                                )                                                                              ]                                ]                                      +            4                    >>          3                                                                                With                                                                          x                    ,                      y            =                          0                                                                                …                                                                                7                                                          (        28        )
When P(x, −1) is "not available", the following is satisfied.
                                                                        Pred                                                  (                                      x                    ,                    y                                    )                                                                                [                              [                                                      ∑                                          n                      =                      0                                        7                                                                          P                                                              (                                                                        -                          1                                                ,                        n                                            )                                                                      ]                            ]                        +            4                    >>                      3                                                                          With                                                                          x                          ,                  y          =                      0                                                                          …                                                                          7                                              (        29        )
When P(x, −1) and P(−1, y) are "not available", the predicted value is taken as 128.
Mode1 is horizontal prediction and is applied only when P(−1, y) is "not available". Its predicted values are shown as follows:Pred(x,y)=P(−1,y), x, y=0 . . . , 7  (3.0)
Mode2 is vertical prediction, and is applied only when P(x, −1) is "available". The predicted values are shown as follows:Pred(x,y)=P(x,−1), x, y=0, . . . , 7  (31)
Mode3 is plane prediction, and is applied only when P(x, −1) and P(−1, y) are "available". The predicted values are shown as follows:
                                                                                Pred                                                              (                                              x                        ,                        y                                            )                                                        =                                                                          Clip                                                                                1                                                              (                                              (                                                  a                          +                                                      b                            ·                                                          (                                                              x                                -                                3                                                            )                                                                                +                                                      c                            ·                                                          (                                                              y                                -                                3                                                            )                                                                                +                                                                                16                        )                                            >>                      5                                        ;                                                                                x                                    ,                  y                                                                                =                                                            0                                    ,                  …                                                                                ,                  7                                                                                a            =                          16              ·                              (                                                      P                                                              (                                                                        -                          1                                                ,                        7                                            )                                                        +                                      P                                                              (                                                                        7                          ,                                                -                        1                                            )                                                                      )                                                                                b              =                              (                                                      17                    ·                    H                                    +                  16                                )                                      >>            5                                                                                c              =                              (                                                      17                    ·                    V                                    +                  16                                )                                      >>            5                                                                                H            =                                          ∑                                  x                  =                  1                                4                                                          x                ·                                  [                                                            P                                                                    (                                                                              3                            +                            x                                                    ,                                                      -                            1                                                                          )                                                              -                                          P                                                                    (                                                                              3                            -                            x                                                    ,                          1                                                )                                                                              ]                                                                                V            =                                          ∑                                  y                  =                  1                                4                                                          y                ·                                  [                                                            P                                                                    (                                                                                -                              1                                                        ,                            3                                                    +                          y                                                )                                                              -                                          P                                                                    (                                                                                -                              1                                                        ,                            3                                                    -                          Y                                                )                                                                              ]                                                                                (        32        )
By the way, with the JVT coding method, a single macroblock can be divided into a single or plural motion predicted blocks of 16×16, 16×8, 8×8 and the motion compensation process can be performed. Each 8×8 motion predicted block, can be further divided into 8×8, 8×4, 4×8, or 4×4 sub-blocks and the motion compensation process can be performed.
Image reproduction apparatuses for DVD can perform fast playback and fast backward playback as well as normal speed playback from media. FIG. 10 shows a rough construction of the image reproduction apparatus 1.
In this image reproduction apparatus 1, reading position information S1 added to picture information of the MPEG2 format reproduced from a medium 2 is supplied to a reading position indicator 3. When a playback mode signal S2 for fast playback or fast backward playback is received from the outside, this reading position indicator 3 makes a reader 4 specify a reading position suitable for the specified playback mode on the basis of the reading position information S1. This reader 4 uncontinuously reads the bit stream of picture information of the MPEG2 format from the medium 2 according to reading positions specified by the reading position indicator 3.
An image decoding unit 5 performs decoding with the MPEG2 based on the bit stream supplied from the reader 4, so as to restore high fine images from the bit stream.
At this time, in the image reproduction apparatus 1, the reading position indicator 3 should specify reading positions so as to compatibly decode outputs from the reader 4 as a bit stream of the MPEG2 format.
That is, the bit stream of the MPEG2 format for the first I-picture (intra-coded picture, or intra-frame coded picture) and following several P-pictures (frame forward prediction coded pictures) of each GOP of normal picture compression information is extracted from the original bit stream of the picture information in the MPEG2 format. In the MPEG2 method, a P-picture uses an I-picture or a P-picture just before the P-picture as a predicted frame, so that even a stream extracted for fast playback can be compatibly decoded as a stream of the MPEG2 format.
For example, as shown in FIG. 11(A), in the bit stream of the MPEG2 format, I-pictures (I0, I1, . . . ) and P-pictures (P0, P1 . . . ) are encoded at prescribed periods on a GOP basis and then B-pictures (bidirectional prediction coded picture) (B0, B1, . . . ) are encoded and inserted therebetween. That is, as shown in FIG. 11(B), the bitstream of I0, P3, P6, . . . , In, Pn+3 is extracted for fast playback from the bitstream of I0, B1, B2, P3, B4, B5, P6, . . . , In, Bn+1, Bn+2, Pn+3 which is for normal speed playback.
The JVT coding method can use a plurality of predicted frames for a P-picture and also can use B-pictures, which can not be used in the MPEG2 method, as predicted frames. However, even if I-pictures and P-pictures are extracted, as in the case of the conventional MPEG2 method, the relationship for prediction is not fixed, so that predicted frames cannot be made simpler and therefore, the extracted stream cannot be decoded correctly, which is a problem.
That is, in the bitstream of the JVT coding method as shown in FIG. 12(A), not only I-pictures (I0, I1, . . . ) and P-pictures (P0, P1, . . . ) which appear at prescribed periods on a GOP basis but also B-pictures (B0, B1, . . . ) are inserted therebetween as predicted pictures for the P-pictures. That is, as shown in FIG. 12(B), even when the bitstream of I0, P3, P6, . . . , In, Pn+3 is extracted for fast playback from the bit stream of I0, B1, B2, P3, B4, B5, P6, . . . , In, Bn+1, Bn+2, Pn+3 which is for normal speed playback, predicted pictures for P-pictures do not exist, with the result that a problem arises in which correct decoding is difficult to be performed.

Image decoding device and image decoding method


The present invention relates to methods for treating PTEN deficient epithelial cancers using a combination of anti-PI3Kbeta and anti-immune checkpoint agents.

Breast cancer is one of the most common types of cancer, with over 230,000 new cases diagnosed annually and accounting for more than 40,000 deaths every year in the United States alone. For example, triple-negative breast cancers (TNBCs), as defined by the absence of estrogen receptor (ER), progesterone receptor (PR), and human epidermal growth factor receptor 2 (HER2) expression, account for 15 to 20% of breast cancer cases, are often clinically aggressive, and typically exhibit high rates of recurrence and mortality. In addition, they do not respond to current targeted therapies used in the clinic that are highly effective in the treatment of luminal or HER2-positive breast cancer. While standard chemotherapy can be effective for early stage TNBC, patients with advanced TNBC typically respond poorly and may progress to metastatic disease, in which cancer cells invade into other tissues. Of note, metastasis accounts for over 90% of breast cancer-related deaths and currently there are no effective treatments against metastatic TNBC. Despite the lack of a common genetic determinant, loss of phosphatase and tensin homolog (PTEN) tumor suppressor function is observed in 25 to 30% of TNBCs (Cancer Genome Atlas Network (2012) Nature 490:61-70). Since PTEN is the major negative regulator of PI3K activity in cells, PTEN-deficient cancers often exhibit oncogenic addiction to PI3K signaling. Thus, the PI3K pathway and, in particular, class I PI3K isoforms (including p110α, p110β, p110γ and p110δ) have emerged as attractive therapeutic targets (Thorpe et al. (2015) Nat. Rev. Cancer 15:7-24). Yet, clinical trials with pan-PI3K inhibitors have showed only limited efficacy and reduced therapeutic windows as monotherapies, largely due to off-target and on-target effects arising from inhibiting all PI3K isoforms (Fruman and Rommel (2014) Nat. Rev. Drug Disc. 13:140-156 and Brachmann et al. (2012) Mol. Cancer Ther. 11:1747-1757).
Pre-clinical studies and emerging clinical trial data suggest that selective targeting of individual isoforms may achieve greater efficacy with fewer side effects than using pan-PI3K inhibitors, and thus isoform-specific PI3K inhibitors are currently undergoing clinical trials as both mono- and combination therapies in multiple cancer types, including breast cancer (Fruman and Rommel (2014) Nat. Rev. Drug Disc. 13:140-156; Thorpe et al. (2015) Nat. Rev. Cancer 15:7-24). Compounds targeting PI3Kalpha (also known as p110α) have garnered much of the efforts from both academic and pharmaceutical research groups. This is largely because mutations in PIK3CA, the gene encoding PI3Kalpha, are found in a significant number of cancers (Cancer Genome Atlas Network (2012) Nature 490:61-70). Also, tumors driven by receptor tyrosine kinases, such as Her2+ breast cancers, or Ras hyperactivation, mainly require signaling via PI3Kalpha for survival (Schmit et al. (2014) Proc. Natl. Acad. Sci. USA 111:6395-400).
However, PTEN-deficient cancers often depend on the beta isoform of PI3 Kinase (PI3Kbeta; p110β) encoded by PIK3CB for survival, and pharmacological targeting of p110β can effectively decrease the growth of PTEN-deficient tumors in mouse models (Jia et al. (2008) Nature 454:776-779; Ni et al. (2012) Cancer Discov. 2:425-433; Peng et al. (2016) Cancer Disc. 6:202-216). In TNBC, activating mutations in PIK3CA encoding PI3Kalpha were found by The Cancer Genome Atlas (TCGA) in only 7% of cases, but genetic PTEN loss occurred in over 35% of cases (Cancer Genome Atlas Network (2012) Nature 490:61-70).
Aside from targeted therapies, additional modalities for treating cancer have been explored. For example, immune checkpoint blockade (ICB), whereby anti-tumor T-cell response is enhanced by blocking immuno-inhibitory signals. The two major targets of ICB agents developed to date are CTLA-4 (Cytotoxic T lymphocyte-associated protein 4) and PD-1 (Programmed death-1) receptors, which are expressed on the surface of activated T-cells and are responsible for dampening immune response. CTLA-4 blockade is thought to occur in secondary lymphoid organs, thereby affecting systemic immune function. By contrast, PD-1 ligands are often overexpressed by cancer cells. Therefore, PD-1 blockade takes place primarily within the tumor microenvironment and is associated with fewer side effects (Topalian et al. (2015) Cancer Cell 27:450-461). Although immune checkpoint blockade (ICB) immunotherapy has demonstrated promising results, ICB agents used as monotherapies have yielded therapeutic efficacy in only a limited percentage of patients. Accumulating evidence indicates that targeted therapies can synergize with immunotherapy in multiple cancer types, although which targeted therapies in combination with which immunotherapies are efficacious for treating which cancers is currently unknown and difficult to predict (Vannemann and Dranoff (2012) Nat. Rev. Cancer 12:237-251; Sagiv-Barfi et al. (2015) Proc. Natl. Acad. Sci. USA 112:e966-e972).
Accordingly, a great need exists in the art to identify particular therapeutic interventions to effectively treat cancers, such as epithelial cancers like TNBCs. Similarly, serous ovarian cancer (SOC), which has also historically been difficult to treat, has many underlying genetic similarities to TNBCs and which are quite different from those of other cancers, like melanoma. For example, both types of cancers are associated with high histologic grades and poor prognosis. At the genetic level, the two cancers contain similar types and frequencies of genomic mutations, e.g. high frequency of TP53 (encoding the p53 tumor suppressor in humans) mutations, inactivation of BRCA1, genetic and epigenetic loss of PTEN, and amplification and high expression of the cMYC oncogene. Because of the similarities between TNBC and SOC, researchers have proposed that the two cancers could possibly be targeted by similar therapies (Wang et al. (2012) Clin. Cancer Res. 18:5806-5815).

Methods for treating PTEN deficient epithelial cancers using a combination of anti-PI3KBETA and anti-immune checkpoint agents


A method and apparatus for producing simulated oil paintings by means of a variety of commercial software programs. A digital color image is created and printed on to a substrate. Also printed on to the same substrate and registered thereto, is a slow drying, clear, embossing liquid in the pattern of brush strokes derived from one or more of the colors printed on to the substrate. A thermographic powder is dusted onto the embossing liquid while still wet and excess powder removed. The substrate is then heated to dry and raise the brush stroke pattern of the embossing ink to create a three dimensional effect on the substrate. The raised brush stroke pattern in combination with printed color image creates a work that has the three dimensional effect simulating an original oil painting.

The present invention relates to system and method of producing a simulated oil painting and, more particularly, to a system and method that produces a picture having three dimensional brush strokes on a substrate, such as a canvas, to simulate authentic brush strokes in the particular picture.
Obviously, there is real market for original oil paintings created by an artist, and, depending of course upon the skill and artistry of the creator, such oil paintings can be valuable paintings to the owner. Unfortunately, such original oil paintings, such as portraits, for example, require considerable time to produce and a quality portrait can take time in the order of months to create an original portrait of a person and are therefore considerably costly as well as time consuming to the subject being painted. Certainly, such original works of art are well beyond the means of most persons.
One of the more recognizable features or characteristics of an original oil painting is the three dimensional effect that is created by the artist as the oil paint is applied, that is, the oil paint is actually raised from the flat surface of the canvas in the configuration of the original brush strokes of the artist and those brush strokes are artistically selected and applied by the artist both for color as well as quantity of the paint that is applied to the canvas to bring about a three dimensional effect created by the actual application of the paint to that canvas and which produces the artistic impression desired by the painter.
Accordingly, in order to produce a simulation of an original oil painting, one of the factors is to produce the simulation of the brush stroke effect so that the ultimate product has three dimensional brush strokes that are oriented, to the extent possible, in accordance with actual brush strokes that would be applied by an artist making an original creation.
Currently, there are various techniques that are used in order to produce a simulated oil painting, that is, to create a picture, such as a portrait, landscape or the like, by some mechanical/manual means where the final product has a three dimensional appearance with brush strokes that simulate the real painters brush strokes that would be applied by an artist creating a original oil painting.
One of such current techniques is to produce a portrait or landscape size picture by the use of commercially available painting software packages to produce, from a snapshot or other picture of the desired subject, a picture of the desired size that can be produced by a commercially available printer onto a canvas that has brush strokes that are created by means of the software package. A typical software package that can be used to produce electronically simulated brush strokes in a digitally stored picture is Painter 7™ by the Procreate Division of Corel, Inc.
With such software, the digitized pictures are simply enhanced by adding brush strokes electronically by a palette and an electronic stylus or directly on a computer screen or tablet and the picture so produced can be printed out by means of an ink jet printer to produce a picture that shows brush strokes added by the software program to make the picture look more like an original oil painting. While the brush strokes do enhance the look of the picture, the pictures so created are still two dimensional so that an additional step or steps are required to create a three dimensional effect that is more desirable and more akin to the look of an authentic oil painting.
According, one method of creating the three dimensional effect to the two dimensional computer generated print having brush strokes is to first cover the print with a protective coating. Thereafter, the picture is converted from a two dimensional picture to a three dimensional simulated oil painting by manually applying, by a brush, a gel that dries to a transparent state and which actually stands out from the canvas to give a three dimensional appearance to the picture and which therefore simulates an original oil painting having actual brush strokes. Unfortunately, the aforedescribed step of applying a gel does not necessarily create brush strokes that are aligned with the brush strokes that are simulated by the computer or which would be synchronized or registered with the strokes that would actually be applied by an artist in creating that work. In addition, the aforedescribed technique requires the manual application of the gel to the picture and therefore would be difficult to adapt to automated systems.
As such, therefore, while the aforedescribed technique produces a good simulated oil painting, it would be advantageous to have a system and method of creating a simulated oil painting having three dimensional brush strokes where the actual raised brush strokes more closely are registered or aligned with brush strokes created electronically by the software program so as to better simulate the raised brush strokes that would be created by an artist creating an original work. In other words, it would be advantageous to have a system and method where the actual electronically applied brush strokes themselves could be raised to provide the three dimensional effect rather than relying upon the manual application of a transparent gel that may or may not accurately follow those electronically created brush strokes.
It would be further advantageous to have a system and method of producing simulated oil painting that could be carried out by mechanical and electronic systems and therefore susceptible to a fully automated system approach to the production of the final product by eliminating the need to manually apply the raised portions of the ultimate painting.

System and method for producing simulated oil paintings


A method and an apparatus for reshaping a tube having an initial outside diameter, an initial wall thickness, and an initial length to form a tube have a reshaped outside diameter, a reshaped length, and a reshaped wall thickness, wherein at least one of the reshaped outside diameter, the reshaped length, and the reshaped wall thickness is different than a respective one of the initial outside diameter, the initial wall thickness, and the initial length. The method includes mounting the tube between two axially displaceable pressure rams with the ends of the tube against respective rams; applying an internal hydraulic pressure to the tube; applying an axial mechanical pressure to the tube via the rams; and simultaneously and uniformly cold-working the tube over its entire length by adjusting the internal hydraulic pressure and the axial mechanical pressure as a function of the reshaped outside diameter, the reshaped wall thickness, and the reshaped length.

1. Field of the Invention
The present invention concerns a method for reshaping tubes and a device for carrying out this method.
2. Description of the Related Art
To produce tubes, especially tubes with relatively large diameters, it is known that open seam tubes can be shaped from rolled sheet or strip and then welded along the longitudinal edges. Steel tubes of this type are suitable for very high pressures and are characterized by relatively great precision with respect to their wall thicknesses and surface finish. They are used in special applications that require high load limits such as in power plants and in the petrochemical industry. A disadvantage of this method is that precision production of the tubes is extremely time-consuming and thus cost-intensive due to the required rolling to final dimension.
Another well-known method is hydroforming, in which a tube section that serves as the starting material is used to produce complex hollow structural components of a desired geometry by cold working without a heat treatment. As a rule, an external shaping tool with an internal shape corresponding to the desired geometry of the component is used. The application of high hydraulic pressure to the interior of the tube section has the effect of bringing the tube section into the desired shape. This hydroforming method is used to produce complex hollow structural components such as housings for pipeline fittings, for example, as described in the published international patent application WO 99/52,659.
Furthermore, it is known from DE-AS 1 081 856 that relatively thin-walled tubes can be easily expanded by internal hydraulic pressure for the purpose of sizing the tubes. In this method, an external forming tool is used, which consists of a series of slit sleeves. These sleeves constitute a forming die, which tightly surrounds the tube during the expansion process. In this known method, the production of expanded tubes requires expensive actuating mechanisms for each pair of half-sleeves of the forming die. Moreover, because the wall of the tube is relatively thin to begin with, the diameter of the tube can be expanded to only limited extent by this method. It is not possible to produce tubes with significantly larger diameters.


A logical quality-of-service management method for peer-to-peer networks uses a special group service for QoS management within peer-groups. This group service determines and assigns a budget per time unit for each peer. Such time unit may be in the range of milliseconds or few seconds. It may also determine a group budget for the peer-group. While a peer uses bandwidth, i.e. while it sends or receives data, its budget is decreased. When a peer has exhausted its budget, it has to lower its priority for transferring or receiving data. Each peer is responsible for keeping its own budget. If a peer does not keep the conditions, other peers may have the right to deny the data transfer from that peer. The QoS service function is advertised in peer-group advertisement messages.

Networks of connected devices for exchanging data and sharing hardware resources can be built up not only for computers but also for consumer electronic devices. The separate devices are called nodes of the network. Networks can be classified as being based on either client-server or peer-to-peer (P2P) architectures, where a node is also referred to as a peer. While in client-server architectures each node is defined to be either client or server, peers in P2P networks include both functionalities, server and client, and can provide services or resources to other nodes in the network or use services or resources provided by other nodes in the network.
P2P networks are usually not restricted to any special applications or underlying network topologies, but can be understood as a set of nodes, or peers, which rely on certain sets of specific protocols. It is characteristic for a P2P network that the peers communicate directly with other peers, so that no central network organization is required. P2P networks may support that peers can be connected to the network or disconnected from the network at any time.
The mentioned P2P protocols are required for basic network organization, such as e.g. discovery of other connected peers, offering of services or resources to other peers (advertising), or understanding other peers' advertising messages. Also, there are protocols that enable a group of peers to cooperate, and thus form a peer-group. A method for building a home network as a peer-group based on such P2P techniques is described e.g. in the European patent application EP02027122. General P2P networks and mechanisms are in a detailed manner published e.g. in WO 02/057917.
Quality of Service (QoS) is a networking term specifying the characteristics and quality of a connection between two distinct points in a network, e.g. a guaranteed throughput level being the amount of data transferred from one place to another in a specified amount of time, a minimum bandwidth or a maximum delay of transmitted data. Usually various QoS classes are defined and network connections are categorized by the QoS class they may provide. Different network infrastructures utilize different strategies and protocols. E.g. the IEEE 1394 protocol is developed for audio-visual (AV) data handling with guaranteed throughput, while e.g. the Ethernet network uses a simple "best effort" approach. To achieve QoS functionality in Ethernet networks there exist models like assigning priorities or allocating network resources for a data transfer.
However, the known QoS strategies require special knowledge of the currently used physical network. Currently known QoS management approaches for home networks require considering QoS at all layers, also at the network layer.

Method for improving quality-of-service management in networks


A new and distinct cultivar of Gerbera plant named ‘Lekgersams’, characterized by its semi-double type, salmon-colored flowers, medium green-colored foliage, and vigorous, upright growth habit, is disclosed.

The present invention relates to a new and distinct cultivar of Gerbera plant botanically known as Gerbera×hybrida and hereinafter referred to by the cultivar name 'Lekgersams'.
The new cultivar originated in a controlled breeding program in Pijnacker, The Netherlands during May 2006. The objective of the breeding program was the development of Gerbera cultivars that are freely flowering with large flowers.
The new Gerbera cultivar is the result of cross-pollination. The female (seed) parent of the new cultivar is the proprietary Gerbera×hybrida breeding line designated HEAF 178, not patented, characterized by its double-type, salmon-colored flowers, medium green-colored foliage, and vigorous, upright growth habit. The male (pollen) parent of the new cultivar is the proprietary Gerbera×hybrida breeding line designated AF 734, not patented, characterized by its double-type, rose-colored flowers, medium green-colored foliage, and vigorous, upright growth habit. The new cultivar was discovered and selected as a single flowering plant within the progeny of the above stated cross-pollination during May 2007 in a controlled environment at Pijnacker, The Netherlands.
Asexual reproduction of the new cultivar by tissue culture propagation in a controlled environment since May 2007 at Pijnacker, The Netherlands has demonstrated that the new cultivar reproduces true to type with all of the characteristics, as herein described, firmly fixed and retained through successive generations of such asexual propagation.


A level 11 is provided comprising a base 1 having a top reference edge 2 and recession 3 wherein a slidable member 8 fits within the recession 3 of the base 1 and is slidable to extend the top reference edge 2 of the base for multiple lengths. Further embodiments of the present invention provide a level 11 having attachment means to level at various angles and additional lengths.

(1) Field of the Invention
This invention relates in general to a level, and more particularly to a level comprising a base having a top reference edge and a recession adjacent to the top recession edge; and a slidable member that fits within the recession of the base wherein the member is slidable to extend the top reference edge of the base for multiple lengths.
(2) Background Art
The present invention relates to a level used in carpentry or construction, and more particularly, to an extendible level.
A level is an instrument or indicating tool used to ascertain true vertical, horizontal or 45 degrees with regard to a given surface. Typically such levels consist of a linear framework with liquid filled tubes placed strategically within the framework. Each liquid filled tube contains an air bubble which indicates by its position in the tube whether a surface is horizontally or vertically level. Such instruments may also be used to indicate whether the surface is a true 45 degrees. When the instrument is set on a true even plane the air bubble in the tube centers itself exactly in an indication window. Conversely, the air bubble that is not centered may indicate to what degree the surface is not horizontal or vertical. Such tubes may be filled with alcohol or ether. These well known tubes may be commonly referred to as level bubbles or spirit bubbles.
Levels are used in all areas of construction and are particularly necessary with regard to installing walls, doors, panels, frames, etc. Levels used in building construction or carpentry are available in all shapes and sizes. However, if a level is not long enough for a surface and has to be moved to different places on a surface, the accuracy of the resultant indications of the level is reduced. A level becomes more susceptible to error when it moves between points on a surface. The most accurate results are for a level that can cover the exact length of the surface to be leveled. However, such levels would be too big and cumbersome at certain lengths.
Prior art levels that are extendible to different lengths are available in the industry. Such extendible levels, however, do not allow for a continuous edge or top line of the level for scribing a level line. Furthermore, such available extendible levels are complicated and not easy to use during the process of leveling. The extendible parts of the prior art levels must be put into place before placing on a surface or leveling a surface. Moreover, they do not provide for a continuous reference level line.
Furthermore, prior art extendible levels do not have a system or a method to level right angles or in a protractor type arrangement. Such arrangements would be desirable to accurately level the more intrinsic designs in the field of construction and carpentry.
Thus, there is a need to provide an extendible level that allows for a continuity of measurement of a surface. There is a further need to provide a level that extends a top reference line for accurately leveling different lengths of a surface. Such an extendible level needs to be easily and smoothly extendible so that during the process of leveling it may be extended to different lengths. Such levels need to be easy to use, accurate and uncomplicated to manufacture.


Disclosed is a vibration reduction type refrigerator including a refrigerator main body having a cooling chamber for storing foods and a mechanical chamber, a compressor disposed in the mechanical chamber, for compressing refrigerants, and a suction pipe connected to the side of the compressor, disposed in the mechanical chamber in the width direction of the refrigerator main body, and connected to an outlet pipe of an evaporator disposed at one side end of the mechanical chamber. The vibration reduction type refrigerator can prevent the vibration generated by the compressor from being transmitted to the refrigerator main body through the suction pipe and the discharge pipe connected to the compressor, by minimizing spaces occupied by the suction pipe and the discharge pipe in the mechanical chamber and increasing the length of the suction pipe and the discharge pipe.

1. Field of the Invention
The present invention relates to a vibration reduction type refrigerator, and more particularly to, a vibration reduction type refrigerator which can prevent vibration generated by a compressor from being transmitted to a refrigerator main body through pipes.
2. Description of the Background Art
In general, a refrigerator includes a refrigerator main body having a cooling chamber for storing various foods, and a refrigeration cycle for refrigerating the cooling chamber.
The application range of the refrigerator has been gradually expanded, such as a cosmetics refrigerator and a wine refrigerator for storing cosmetics and wines, respectively. As a variety of refrigerators are developed, researches have been made to reduce vibration of the refrigerators.
Especially, in the wine refrigerator, temperature, sunlight, humidity, vibration and horizontality must be taken into consideration to handle and store wines. It is quite easy to control sunlight, humidity and horizontality but difficult to maintain an optimum temperature and reduce vibration. Thus, researches have still been made on it.
FIG. 1 is a perspective view illustrating a mechanical chamber of a conventional refrigerator, and FIG. 2 is a cross-sectional view illustrating the mechanical chamber of the conventional refrigerator.
The conventional refrigerator includes a refrigerator main body 102 having a freezing chamber for storing various frozen foods and a cooling chamber for storing various cooled foods, and a mechanical chamber 106 disposed at the rear bottom portion of the refrigerator main body 102, for housing various components of a refrigeration cycle, such as a compressor 104 for compressing refrigerants.
Doors 108 for opening or closing the freezing chamber and the cooling chamber are mounted at the front portion of the refrigerator main body 102, and feet 110 for supporting the refrigerator main body 102 to control the height are mounted at the lower portion of the refrigerator main body 102.
A cover 112 for opening or closing the mechanical chamber 106 is fastened to the front portion of the mechanical chamber 106 by screws 114, a control box 116 for controlling the refrigeration cycle is installed at one side of the inside portion of the mechanical chamber 106, a water tray 118 for storing water generated from the refrigeration cycle by defrosting is installed at the upper portion of the inside portion of the mechanical chamber 106, a base plate 120 is mounted on the bottom surface of the mechanical chamber 106, and the compressor 104 is mounted on the base plate 120.
The compressor 104 is mounted on the base plate 120 by mounting brackets 122, and rubber vibration isolators 124 for preventing vibration generated by the compressor 104 from being transmitted to the refrigerator main body 102 are installed at the mounting brackets 122. The compressor 104 is connected to an evaporator (not shown) installed at the rear portion of the refrigerator main body 102 through a suction pipe 130, for sucking refrigerants from the evaporator, and also connected to a condenser (not shown) installed at the rear portion of the refrigerator main body 102 through a discharge pipe 132, for discharging the compressed refrigerants to the condenser.
The suction pipe 130 and the discharge pipe 132 are looped once and connected respectively to the evaporator and the condenser so as to prevent the vibration generated by the compressor 104 from being transmitted to the refrigerator main body 102 through the pipes 130 and 132. That is, the suction pipe 130 and the discharge pipe 132 are wound once in a loop shape.
In the conventional refrigerator, in order to increase the capacity of the cooling chamber as large as possible, the width of the mechanical chamber is set to be almost identical to the size of the compressor. In addition, the condensed water tray is installed at the upper portion of the mechanical chamber. It is thus restrictive to increase the length of the suction pipe and the discharge pipe. Even though the suction pipe and the discharge pipe are looped once to increase the length, the length of the suction pipe and the discharge pipe is so short that the vibration generated by the compressor may be transmitted to the refrigerator main body through the suction pipe and the discharge pipe. As a result, shelves of the refrigerator are shaken.
Especially, in the wine refrigerator, noise is a very important factor. The vibration transmitted to the cooling chamber badly ripens the wines.


An elevator, which includes a hoistway; and an elevator car vertically movable in the hoistway; and a counterweight vertically movable in the hoistway; and a number of upper rope wheels (in particular one or more) mounted higher than the car and counterweight, and a number of first ropes interconnecting the elevator car and counterweight, each of the more ropes passing around the one or more upper rope wheels; and a number of lower rope wheels mounted lower than the car and counterweight; and second ropes interconnecting the elevator car and counterweight, each passing around one or more of the lower rope wheels. The lower rope wheels include one or more first lower rope wheels; and one or more second lower rope wheels above the one or more first rope wheels. The second ropes include a first set of ropes forming a first U-shaped loop of ropes hanging from the car and counterweight and passing around the one or more first lower rope wheels; and a second set of ropes forming a second U-shaped loop of ropes hanging from the car and counterweight inside the first loop of ropes and passing around the one or more second lower rope wheels.

An elevator typically comprises an elevator car and a counterweight, which are vertically movable in a hoistway. These elevator units are interconnected by first ropes (later referred to as suspension ropes or upper ropes) that suspend these elevator units on opposite sides of rope wheels mounted higher than the elevator units. For providing force for moving the suspension ropes, and thereby also for the elevator units, one of the wheels is typically a drive wheel engaging the suspension ropes, which drive wheel is rotated by a motor. Additionally, the elevator may need to be provided with second ropes between the elevator car and the counterweight, which second ropes hang from the elevator car and the counterweight. This type of arrangement is normally used to provide compensation for the weight of the hoisting ropes. Particularly, in this way the unbalance, which is caused by the suspension ropes in situations where the elevator car is run to its extreme position, can be eliminated. The second ropes can be guided to pass around a rope wheel mounted stationary in some suitable position lower than said elevator units. In the prior art, the rope ends have been fixed on the bottom structures of the car side by side in one long row, and the other end to the counterweight in a corresponding array.
A drawback of the solutions according to the prior art has been that when there's a need for numerous second ropes, the overall space consumption of the ropes causes layout problems. A wide row of ropes forms an obstacle that limits positioning of other components of the elevator. The width of the bottom beam of the car frame is often problematic, for instance. Generally, in elevators in relatively narrow space must be fitted several components, such as roller guides, safety gears, safety support, buffer plates and the hanger for the ropes. These several components typically need to be placed close to the vertical guide rail plane extending across the car projection. Also in the pit, the buffers and the rope wheels must be fitted in the same narrow space between the guides. The direct disadvantages of the know solutions come apparent in high rise—solutions where the number of ropes is typically the highest. In these solutions, the width of the hardware starts to significantly reduce freedom to use layouts that are preferred to optimize positioning of other components and thereby also the other functions of the elevator. With conventional ropes there is the possibility to use larger diameter ropes so as to reduce number of ropes, but these kiunds of ropes are problematic during installation and their diverting requires rope wheels with large diameter.
The above mentioned drawbacks have been noticed to be particularly problematic if the elevator is to be manufactured with belt-shaped ropes, because these kinds of ropes are particularly space consuming in the width direction. These issues regarding space consumption have been especially relevant in elevators where not only the rope structure as such but also the lateral guidance of the ropes requires lot of space.


An apparatus includes a take-up downstream from a heating surface for advancing corrugated paperboard sheet along a path of travel adjacent the heating surface; an initial sheet feeder for initially feeding a leading portion of the corrugated paperboard sheet along the path of travel; and sliding contact assemblies positioned opposite the heating surface for slidably contacting and applying pressure to urge the advancing corrugated paperboard sheet against the heating surface. Accordingly, heat is transferred from the heating surface to the moving corrugated paperboard sheet and without a conventional conveyor belt. The pressure applied by the sliding contact assemblies may be released when the initial sheet feeder is feeding the leading portion of the corrugated paperboard sheet. The apparatus may also generate a gas cushion to thereby reduce friction between the heating surface and the corrugated paperboard sheet when initially feeding the leading portion of the corrugated paperboard sheet. Method aspects of the invention are also disclosed.

Corrugated paperboard is widely used as a material for fabricating containers and for other packaging applications. Corrugated paperboard is strong, lightweight, relatively inexpensive, and may be recycled. Conventional corrugated paperboard is constructed of two opposing liners and an intervening fluted sheet secured together using an adhesive. The adhesive is typically a starch-based adhesive applied as a liquid. Accordingly, heat is transferred to the paperboard to dry or set the adhesive during the manufacturing of the paperboard.
A conventional so-called double-facer for setting the adhesive includes a series of steam heating chests over which the paperboard is advanced. A conveyor belt engages the upper surface of the board and advances the board along the heating chests. A series of rolls is typically used to provide backing pressure to the back side of the conveyor belt. Accordingly, the paperboard is pressed into contact with the underlying steam heating chests.
Unfortunately, the steam heating chests have a tendency to bow or deflect due to temperature differences thereby producing low quality paperboard. This problem is explained in greater detail in U.S. Pat. No. 5,456,783 to Sissons. The Sissons patent discloses a significant advance in the art of corrugated paperboard manufacturing wherein a series of contact assemblies provide backing pressure to the conveyor belt rather than conventional backing rolls. The contact assemblies include independently mounted and biased contact shoes, mounted in side-by-side relation. The contact shoes can readily conform to any bowing of the steam heating chests. The contact assemblies are readily installed, and operated with greatly reduced maintenance, especially compared to conventional backing rolls and their associated bearings. Because heat transfer to the paperboard is also increased, less heating chests may be used and ambient energy losses reduced further.
U.S. Pat. No. 5,256,240 to Shortt discloses a plurality of fluid filled bladders for applying the backing pressure to a conveyor belt of a double-facer. The Shortt patent discloses that in certain applications the conveyor belt may be omitted; however, the patent fails to disclose how to advance the corrugated paperboard sheet along its path of travel against the heating chests without a conveyor belt.
Those familiar with corrugated paperboard manufacturing appreciate that the conveyor belt may absorb a significant amount of heat and moisture in operation. Accordingly, the conveyor belt contributes to energy losses. Moreover, the conveyor belt may have a relatively short life and may be relatively expensive to periodically replace. In addition, as the belt wears, the quality of the paperboard may be reduced, such as when using conventional backing rolls, for example. The drawbacks associated with a conventional conveyor belt have simply been endured for lack of a more advantageous alternative.

Corrugated paperboard manufacturing apparatus and related methods


An authentication system to authorize access to data to be protected, including a token having a memory that stores: an array containing alphanumeric information and random data; and a seal scheme vector containing information to enable access to each of the information items in their respective positions in the array. The authentication system is configured to: subject access to the token to the insertion of a password; decrypt the seal scheme vector; acquire the arrangement information and the size information of each random data from the seal scheme vector; check correspondence between the acquired arrangement information and the effective arrangement of the information in the array, and between the acquired size information and the effective size of the random data; authorize or deny access to the data to be protected on the basis of a result of the previous check.

There are known data protection methods, in particular methods for authorizing access to protected information and/or allowing the execution of computer programs (software) subject to obtaining a license to use them.
Known methods contemplate the use of a key not know to the user and obtainable by purchasing a license to use the software in question. This method has the drawback that this key can be fraudulently replicated, so that unauthorized users who learn about this key are able to use the software.
Other methods contemplate the use of a device, called a token, able to generate a password, generally in a numeric format, on the basis of an algorithm unknown to the user. Typically, in a two-factor authentication scheme, this password assumes a value, dependent on parameters that vary with time (e.g., time, date, etc.), plus a known part, chosen by the user (known as the Personal Identification Number or, more simply, the PIN) so as not to be easily replicable. This method has the drawback that everyone knows the time and the PIN is usually chosen by a user so that it is easy to remember (in practice, the PIN is often chosen as the user's date of birth, the names of dear ones, etc.). There are known attacks of various types that drastically reduce the protection provided by this type of scheme.
Other known methods include the steps of storing entire portions of software on the token, but in this way there is an impact on software's speed of execution, linked to the fact that it is necessary to access these portions, compile them and then execute them. In consequence, she check is usually carried out only in the software's start-up phase and not during all of the time period in which the software is used.


An apparatus that enables a train or trailer vehicle to communicate with other vehicles in the same train without using vehicle identifiers other than the relative positions of the two vehicles within the train. It uses short-range communication methodologies to communicate signals between a vehicle and the adjacent vehicle. Vehicles in the same train that are not adjacent intercommunicate via relay.

A train, or any string of vehicles with one or more coupled trailers, usually requires communication between the coupled vehicles. The communication may consist of commands and status report.
Examples of commands include instructions to turn on or turn off lights, brakes or refrigeration units, instructions to operate an automated uncoupling mechanism between two of the vehicles, and requests for the recipient to send a status report.
Examples of a status report include the current temperature, the identification of the next scheduled stop, and whether or not a light bulb is burnt out.
Existing methods of conveying communication include electrical signals sent over wires, changes in air pressure in air hoses, and radio signals between transmitter and receiver.
There are situations where it is infeasible or undesirable to physically connect communication wires or hoses, so radio is often used. However, it is difficult to target radio signals to a specific vehicle in the train, if it is farther away than the vehicle adjacent to the sender, without interception by other vehicles in the same or any other train, so such communication usually requires the use of an addressing or other identification technique.
There is a need to provide for communication between vehicles in a train that requires neither of the direct connection of wires or hoses between the vehicles nor the addressing of radio communication.


A secondary air control system supplies secondary air to the upstream of a catalyst purifying exhaust gas in an exhaust passage of an engine. A diagnostic device includes a secondary air detecting means that detects a secondary air information related to pressure of secondary air. An abnormality diagnostic means performs an abnormality diagnostic operation of the secondary air control system in accordance with the secondary air information. A voltage detecting means that detects a power source voltage information related to power source voltage supplied to the secondary air control system. An evaluating condition correcting means that corrects an evaluating condition, which is used for evaluating abnormality in the secondary air control system in accordance with a power source voltage information.

According to US20030061805A1 (JP-A-2003-83048) and US20040011027A1 (JP-A-2004-11585), a secondary air supply system includes an air pump that supplies secondary air to the upstream of a catalyst that purifies exhaust gas in an exhaust passage of the engine. This operation enhances purification (oxidization) of HC and CO contained in exhaust gas, and accelerates warming-up of the catalyst with heat generated by reaction (oxidization) of HC and CO.
When a malfunction occurs in the secondary air supply system, exhaust emission may be degraded. According to the secondary air supply system disclosed in US20030061805A1 and US20040011027A1, a pressure sensor is provided to evaluate abnormality of the secondary air supply system in accordance with pressure of secondary air detected using the pressure sensor in an abnormality diagnostic operation.
Variation in discharge capacity of the air pump, which supplies secondary air, is caused by variation in voltage of a power source (battery). Specifically, when voltage (power source voltage) of the power source decreases, the discharge capacity of the air pump becomes low. In this situation, it is conceivable that the abnormality diagnostic operation is prohibited not to make an erroneous determination of abnormality in the secondary air supply system.
However, in general, secondary air is supplied in a catalyst warm-up period immediately after the engine is started. When the abnormality diagnostic operation is prohibited when the power source voltage is low, the abnormality diagnostic operation cannot be performed in a normal operation, in which secondary air is normally supplied, due to undervoltage of the power source. As a result, frequency of the abnormality diagnostic operation becomes low. In particular, the air pump is supplied with a large current. Therefore, when the battery is substantially exhausted, the air pump is always in an undervoltage condition, and consequently the abnormality diagnostic operation cannot be performed at all.
A particular charge system performs a charge control when an engine is started, or the like. Specifically, the power source voltage is gradually returned to an initial voltage when an undervoltage condition is detected in the charge control, so that drivability is restricted from being degraded due to quick change in the power source voltage. In this case, the undervoltage condition continues for a long period due to the charge control, and consequently the abnormality diagnostic operation is prohibited for a long period. As a result, frequency of the abnormality diagnostic operation becomes low.
Furthermore, the discharge capacity of the air pump changes corresponding to the power source voltage. Accordingly, pressure of secondary air detected using the pressure sensor changes corresponding the power source voltage. Therefore, when the abnormality diagnostic operation of the secondary air supply system is performed in accordance with the detection signal of the pressure sensor, an erroneous determination may be made due to variation in detection signal of the pressure sensor caused by variation in power source voltage.

Diagnostic device for secondary air supply system