text:
|Publication number
|Publication type
|Application number
|Publication date
|Dec 26, 2000
|Filing date
|Jul 31, 1997
|Priority date
|Jul 31, 1997
|Fee status
|Publication number
|Nicholas Ian Saunders, Clive Henry Gillard
|Original Assignee
|Sony Corporation, Sony United Kingdom Limited
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (17), Referenced by (62), Classifications (39), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
1. Field of the Invention
This invention relates to apparatus and methods for image data compression.
2. Description of the Prior Art
In an image data compression system, often the output bit rate of a compressed data stream is constrained by the capacity of a transmission or storage channel. A particular example of this is when compressed video data has to be recorded on a tape channel; generally, to maintain real-time operation, a whole field or frame's worth of compressed data has to be recorded onto a predetermined number of record tracks.
In order to comply with this constraint, the bit rate of the output compressed data is controlled by controlling the degree of compression applied. In many cases, this is achieved through controlling a quantization factor applied to the video data (e.g. after transformation to the frequency domain).
The effect of varying the quantization factor on the quantity of compressed data is highly non-linear and not easily predictable. This means that a suitable quantization factor can be chosen accurately only by performing trial compressions.
One previously proposed way of performing trial compressions is the so-called binary search. This is an iterative process whereby a first trial quantization is performed using a quantization factor of, say, one half of the available range. Subsequent stages of trial quantization are performed at values which are either less than or greater than the quantization factor used in the preceding stage, depending on whether the preceding stage produced too much or too little compressed data. The increment or decrement applied between stages decreases with each stage, in order to iterate towards a correct value.
For example, if the available range of quantization values is from 1 to 64, in a binary search technique a first trial quantization might be performed at a quantization value of 32. Depending on whether this produces too much or too little output data, the second stage might use a value of either 48 or 16, i.e. 32�16. A third stage would then use one of 8, 24, 40 or 56, i.e. (48 or 16)�8, and so on. At the final stage, the most appropriate of all of the values tested (i.e. the value generating a data amount nearest to, but under, the available bit rate) is selected for use in compressing that input data.
So, in the above example, six stages of trial compression are needed to select a quantization value in the range from 1 to 64. A perceived advantage of this arrangement is that it avoids the need to perform 64 trial compressions to select a quantization value.
However, one drawback of the binary search technique is that the stages of trial compression must be performed consecutively, because the results of each stage are needed before the quantization value to be used in the next stage can be chosen. This imposes a considerable delay on the data compression system--a problem not only because of the actual time delay applied to the data, but also because substantial amounts of memory are required to store the input data for the delay period. The specific example above requires six delay periods for the binary search process. This can be difficult to implement where the apparatus is embodied, for example, as an application specific integrated circuit (ASIC).
It is an object of the invention to provide an improved technique for selecting quantization values to be used in data compression.
This invention provides image data compression apparatus in which data is encoded using a variable degree of quantization selected for areas of an image so that the quantity of encoded data for each area does not exceed a predetermined maximum quantity of data, the apparatus comprising: two or more trial encoders operable in parallel to trial encode image data using respective predetermined trial degrees of quantization; a selector for selecting one of the predetermined trial degrees of quantization in response to the quantities of data produced during the trial quantizations; and one or more further trial encoders operable to trial encode image data using degrees of quantization derived from the degree of quantization selected by the selector.
The invention addresses the problems described above by a novel hybrid or two-stage approach to selecting a suitable degree of quantization.
In a first stage of operation, two or more trial quantizations are performed in parallel. These trial quantizations preferably use degrees of quantization which are substantially evenly spaced through the available range of degrees of quantization, so that this first stage narrows down the range of values which needs to be tested by the second stage.
The second stage may preferably be a binary search type of system, but this takes as its staring point a degree of quantization derived from one of the degrees of quantization selected in response to the first stage. So, the second stage has many fewer possible degrees of quantization to test, and can therefore employ fewer trial quantizers and fewer delay circuits.
Referring to the example above, in a system where a quantization value can vary between 1 and 64, a first stage using 10 quantizers would narrow the range of quantization values needing to be binary-searched down to a range of 6, and so only three binary search stages are then required. So, in total, this example arrangement reduces the number of delay periods required for the quantization factor search technique from six (see above) to four.
Further respective aspects and features of the invention are defined in the appended claims.
The above and other objects, features and advantages of the invention will be apparent from the following detailed description of illustrative embodiments which is to be read in connection with the accompanying drawings, in which:
FIG. 1 is a schematic diagram of a bit-rate reducing encoder and a corresponding decoder for use with a magnetic tape channel;
FIGS. 2 to 4 schematically illustrate the bit-rate reducing encoder of FIG. 1;
FIGS. 5 and 6 schematically illustrate the corresponding decoder of FIG. 1;
FIG. 7 schematically illustrates a bit allocator in more detail;
FIG. 8 is a table showing the quantities of data required for different activity modes;
FIG. 9 is a table showing the effect of activity codes on the applied degree of quantization;
FIG. 10 is a schematic diagram of a quantizer;
FIG. 11 schematically illustrates a part of a bit allocator;
FIG. 12 schematically illustrates an optimization process; and
FIG. 13 illustrates the data format of a sync block.
FIG. 14 schematically illustrates the operation of a bit allocator;
FIG. 15 schematically illustrates the operation of a binary search unit;
FIG. 16 is a schematic diagram of a binary search unit;
FIG. 17 schematically illustrates on element of a backsearch unit;
FIG. 18 is a schematic diagram of a backsearch unit;
FIGS. 19 and 20 schematically illustrate the operation of the backsearch unit;
FIG. 21 schematically illustrates the way in which available bit rate can be wasted in a data compression apparatus;
FIG. 22 schematically illustrates a data packer;
FIG. 23 schematically illustrates data stored in a RAM of the data packer;
FIGS. 24a to 24c schematically illustrate encoded DCT blocks; and
FIGS. 25 to 28 schematically illustrate the packing of data into a code block for recording onto tape.
FIG. 1 is a schematic diagram of a tape recording and reproducing system comprising a subsampler and demultiplexer 5, a pair of bit-rate reducing encoders 10, 12, error correction (ECC) encoders 14, 16, a tape channel 20, tape recording and reproducing apparatus (including rotary magnetic heads A . . . D) 30, error correction decoders 32, 34, a pair of corresponding data decoders 40, 42, and a combiner and multiplexer 45.
The subsampler and demultiplexer 5 receives an input 4:2:2 format high definition video signal, subsamples it to a 3:1:1 format and divides the resulting data into two for parallel processing by the encoders 10, 12. The encoders 10, 12 are identical, and each generate a bit-rate reduced (BRR) signal for recording on the tape medium. Similarly, the decoders 40, 42 receive BRR signals reproduced from the tape medium and decode the BRR signals to form respective portions of an output 3:1:1 video signal. The combiner and multiplexer 45 recombines these portions to form the output high definition video signal.
Referring now to FIG. 2, the input video signal to the encoder, in the so-called 3:1:1 format (Y0 Y1 Y2 Cb Cr etc), a horizontal sync signal and a 46.4 MHz video clock are supplied to a field/frame adaption circuit 100, a phase lock loop 110, a video shuffler 120 and a system controller 130.
The field/frame adaption circuit 100 is used to control switching of the encoder between a frame-based mode of operation and a field-based mode of operation. This switching occurs at a scene change, so that a field-based mode of operation is used for the frame of a scene change.
In order to detect a scene change in the input video signal, the field/frame adaption circuit 100 divides each input field into 16 blocks, each being 300 pixels by 135 lines. The dc level and variance of each block for each field are then calculated as follows:
dc=Σ(pixel value)
variance=Σ(pixel value)2
The variance of the blocks is then normalized as follows:
normalized variance=Σ(pixel value)2 /Σ(pixel value)
The dc level and variance for each block of the two fields comprising a single frame are then compared (on a block-by-corresponding-block basis) to detect whether the two fields are considered to be similar. The following relationships are used to make this detection:
(a) if dcfld1 �dclower threshold >dcfld0 and dcfld1 �dcupper threshold <dcfld0 then dcfld1 is considered to be similar to dcfld0
(b) if varfld1 �varlower threshold >varfld0 and varfld1 �varupper threshold <varfld0 then varfld1 is considered to be similar to varfld0
The number of dc and variance blocks that are similar between the two fields are then compared to separate thresholds:
if number-- similardc blocks >dc block threshold
and number-- similarvar blocks >var block threshold
then the two fields are considered to be part of the same video scene.
The result of this detection is supplied on a control output 102 from the field/frame adaption circuit 100.
The PLL 110 receives the 46.4 MHz clock supplied to the encoder and derives other clock signals required by the encoder apparatus from that clock signal.
The system controller 130 controls the apparatus to operate in the manner described.
The video shuffler 120 receives pixels of the input video signal and stores them temporarily in an external shuffle RAM 140. It then reads blocks of pixels from the external shuffle RAM according to a predetermined shuffle pattern so that blocks of pixels which are adjacent in the image are not read out at adjacent positions in the shuffle pattern.
The reason for this measure is to try to alleviate the effect of data losses (e.g. due to a tape drop-out or similar) on the picture reconstructed by the decoder apparatus. Because pixel blocks which are adjacent in the image are separated from one another in the resulting bit stream (because they are shuffled by the video shuffler 120), a short duration data loss might affect a number of pixel blocks but not their immediate neighbours in the image. This allows data concealment to be used to reconstruct the missing blocks.
The current frame is written to the external RAM while the previous frame is read, in a shuffled manner, from the external RAM.
The shuffled data from the video shuffler 120 is supplied to a discrete cosine transform (DCT unit 150), an activity calculator 160 and (referring to FIG. 3) a bit allocator 170.
The DCT unit 150 transform each pixel block supplied from the video shuffler 120 into a corresponding block of DCT coefficients using known techniques. These coefficients are supplied to the bit allocator 170.
The activity calculator 160 generates so-called "activity codes" and corresponding offsets to be applied to the quantization index for each block of data. These codes specify the so-called activity of each block, assessed according to the following principles:
(i) a block containing more detail (measured for example by the variance of the pixel values within the block) has a higher activity than a block having less detail;
(ii) a block predominantly containing colours associated with skin tones is quantized less harshly (i.e. given a lower notional activity) than a block predominantly not containing such colours;
(iii) a block having a very low or a very high average luminance level is quantized more harshly (i.e. given a higher notional activity) than a block having a mid-range average luminance level (Weber's law). For example, if a block's average luminance level is above 224 or below 32 (in an eight bit system) then a constant value is added to the calculation of the block's activity. If the block's average luminance level is between 32 and 224 then the activity calculation is unaltered.
In general, the activity codes are used to control the later operation of the encoder, so that pixel blocks having a higher activity are subjected to harsher compression, since it is less likely that the viewer would spot compression artifacts in that block when the block is subsequently decompressed. Blocks having a low activity, e.g. relatively "smooth" surfaces, relatively dark areas or areas having colours corresponding to skin tones, are compressed less harshly, since the user is more likely to spot compression artifacts in those areas.
The quantization index offsets are embedded in the bitstream, whereas the activity codes (which are needed to specify the quantization offsets to be used on decoding) are supplied separately for possible "optimization"--see below.
The bit allocator 170 receives DCT data from the DCT encoder 150 and activity data from the activity calculator 160. The bit allocator 170 performs a trial quantization of the DCT data, followed by a trial part of an entropy encoding process.
Using these techniques, the bit allocator calculates the number of bits which would be required to encode each DCT block at one of ten quantization "base" values: 7, 13, 19, 25, 31, 37, 43, 49, 55 and 61, subject to each block's quantization index offset calculated by the activity calculator. Ultimately, the quantization level for each block is selected to a resolution of 1 (using the scale given above), but for the purposes of the bit allocator 170, the quantization base value is assessed to the nearest 6 on that scale.
At the output of the bit allocator, therefore, a figure derived from the nearest appropriate quantization base level from the selection given above is passed, together with a delayed version of the video data, to a further DCT unit 180, a binary search unit 190 and a backsearch unit 200. This process will be described further below, but in brief, a value 2 greater than the quantization value giving just over the required bit rate is passed by the bit allocator.
The further DCT unit 180 again calculates DCT coefficients, this time based on the delayed version of the video data.
The binary search unit 190 carries out trial quantizations at quantization levels just above or just below the base quantization level, again modified by the quantization index offsets associated with each block, to select one value within a range of -3 to +4 with respect to the base quantization level from the bit allocator.
A further trial quantization is carried out by the backsearch unit which tests the quantization level selected by the binary search unit 190, and assesses whether a higher quantization level could be used whilst still obtaining the same or fewer quantization errors.
Finally, the selected quantization level, and the DCT blocks from the further DCT encoder 180, are supplied to a quantizer 210 where they are quantized according to the selected quantization level. The quantized data are passed to an entropy encoder 220 which generates variable length output data according to the standard principles of entropy encoding, so that more commonly occurring data patterns in the quantized data are encoded using shorter code words.
The data generated by the entropy encoder is then packed into "code blocks" for recording on tape by a data packer 230. The code blocks include header data, entropy-encoded data from a number of DCT blocks, activity codes associated with those blocks and an indication of the quantization level used in forming the blocks. Error correcting codes are then applied to provide error correction when the code blocks are replayed from the tape. A code block comprises five "sync blocks", where a sync block is the smallest separately recoverable data item recorded on the tape in this system. A sync block is illustrated schematically in FIG. 13 and is described further below.
FIGS. 5 and 6 schematically illustrate the structure of the decoder 40 of FIG. 1.
The bit-rate reduced (BRR) video, an error flag indicative of a data error in the BRR signal and horizontal and frame sync pulses are supplied to an unpacker 300. This operates in a complementary manner to the packer 230 of FIG. 4, to unpack individual DCT blocks (as entropy encoded) from the code blocks recovered from the tape. The unpacker forwards the entropy encoded data unpacked from the code blocks to an entropy decoder 310 where the DCT data is recovered.
A phase lock loop 320 receives a clocking signal associated with the input data and derives other clocking signals required by other parts of the decoding apparatus.
A system controller 330 controls the operation of the apparatus as described herein.
Turning now to FIG. 6, the entropy decoded DCT blocks are supplied to an inverse quantizer 340 where an inverse quantizing operation is carried out. The output from the inverse quantizer is supplied to an inverse DCT unit 350 where an inverse DCT operation is performed.
This generates blocks of image data, but in the shuffled order (by virtue of the shuffler 120 on the encoder 10. Therefore, an unshuffler 360 is used to recreate the correct image order of the pixel blocks. This is carried out by writing the pixel data to an external shuffle RAM 370 during one field or frame, and then reading it out in the correct order during the next field or frame. The output of the unshuffler 360 forms the output video signal and an associated sync signal.
Referring now to FIG. 7, the operation of the bit allocator 170 will now be described in more detail.
The bit allocator 170 receives blocks of image data from the shuffler 120, DCT encoded data blocks from the DCT unit 150, and activity codes with an associated activity mode from the system controller. Activity modes and activity codes will be described in detail below with reference to FIGS. 8 and 9.
A delay unit 172 is provided (actually by the shuffler reading data later from the external shuffle RAM) for delaying the image data by the processing time of the bit allocator. Delayed image data is supplied for processing by later stages of the apparatus of FIG. 1, once the trial quantization process of the bit allocator has been completed.
The DCT blocks are supplied in parallel to a number of processing chains each comprising a trial quantizer 400, a length calculator 410 and a bit summer 420. Each of the processing chains carries out a trial compression of each DCT block according to one of ten quantization "base" values: 7, 13, 19, 25, 31, 37, 43, 49, 55 and 61. The results of each trial quantization are supplied to the respective length calculator 410. This carries out a part of the processing associated with entropy encoding, in that it calculates the number of bits which would be required to entropy-encode that quantized data. These numbers of bits are summed by a summer for all of the DCT blocks within a code block. As mentioned above, a code block comprises five sync blocks, and a sync block, as illustrated in FIG. 13, is a data unit for recording onto tape, and comprises 9 luminance DCT blocks and 6 chrominance DCT blocks (3 Cb; 3 Cr).
After all of the DCT blocks of one code block have been processed in this way, the summed numbers of bits from the ten respective summers 420 are supplied to a comparator 430. This adds the amount of data needed to encode the activity codes for the DCT blocks (see below) to the outputs of the summers 420, and selects that value of the base quantization level (QIbase) which gives a quantity of coded data nearest to but under the target size of a code block. That value of QIbase is passed to the binary search unit and the backsearch unit for further processing as described above.
In parallel with the above processing, the optimization of activity codes is being performed.
The apparatus can operate in one of four activity "modes", which determine the amount of data made available to specify the activity level of each DCT block. These activity modes are shown in FIG. 8, and vary from a mode in which no data is made available to specify the activity levels (AM=00) to one in which 3 bits per DCT block are made available (AM=11).
So, in AM=11, there are eight possible activity values which can be encoded by corresponding activity codes (AC). The effect of these activity values on the quantization level used for the corresponding DCT block is illustrated in FIG. 9. Referring to FIG. 9, it can be seen that in AM=11, the actual quantization applied to the DCT block can be modified by up to �14 (on a scale--before modification by image activity--of about 1 to 64).
The initially selected activity mode is set by the user. The actual quantization index offsets used in the activity mode are recorded onto tape as a look-up table, so that tapes recorded using different sets of offsets can be read by the same decoding apparatus.
In AM=10, two bits are available for each AC, so up to four values can be encoded. These values are not necessarily those shown for AC=0, 1, 2 and 3 in FIG. 9, but can be any values such as �14 and �6. Whatever the initially selected AM, a look-up table giving the correct quantization index offsets to be used under that AM is written to tape--in fact, six times per frame.
Similarly, in AM=01, the available ACs are AC=0 and 1. In AM=00, only AC=0 is available.
The initial AM value is set by the user, and is used by the activity calculator 160 in generating activity codes to be associated with each DCT block. These codes will have 0, 1, 2 or 3 bits depending on the initially selected AM.
FIG. 10 illustrates the final quantizer 210 in more detail, and shows that the quantizer 210 receives the DCT data from the DCT unit 180, a quantization base value from the backsearch unit 200 and the quantization index offset (derived from the bitstream) for a current block. The AC and the QIbase values are combined in a Q Index calculator 212, where the addition or subtraction specified for each AC by the table of FIG. 9 is carried out. The resulting quantization value Q is applied to the DCT data by a quantizer unit 214.
The ACs are not used in the trial quantization process carried out by the bit allocator 170. This allows the process of so-called AC optimization to be carried out in parallel to the trial quantizations.
The ACs and the AM are supplied to an AC optimizer 440. The AM may be supplied explicitly or may be implied from the length of the ACs.
The AC optimizer is illustrated in more detail in FIG. 11.
The AC and AM values are received by a maximum AC detector 442 and an AM selector 444. The maximum AC detector detects (for Y, Cb and Cr blocks separately) the maximum AC value for that sync block. This information is passed to the AM selector which detects whether the number of bits required to encode that maximum value is fewer than the number of bits allowed by the current AM, and in fact is within the allocated number of bits of a lower AM. If this is true then the AM selector replaces the initially selected AM for that sync block with a replacement, lower AM. Also, the n-bit ACs prepared under the initially selected AM are replaced with m-bit ACs, where m<n. Effectively this is done by the entropy encoder ignoring one or more most significant bits of the ACs.
In fact, although a lower order AM is specified, resulting in a saving of one or more bits per DCT block in recording the ACs, the look-up table used to decode the ACs into quantization index offsets will be the same as the look-up table for the initially selected AM. So, a two-bit AC under the initially selected AM=10 might well represent a quite different quantization index offset to the same two bit AC under an AM that has been optimized from AM=11 down to AM=10, because in the latter case the look-up table for AM=11 will still be used.
FIG. 12 is a table schematically illustrating the AC optimization process. The left-hand column of FIG. 12 lists the initial AM value. If the maximum AC value detected by the maximum AC detector 442 is one of the values shown in the centre column, then the AM for that sync block can be replaced by the "optimized" AM shown in the right-hand column, and the ACs encoded using fewer bits. Over a whole sync block, the savings made by this technique can provide a considerable extra amount of data capacity for encoding the image data itself.
FIG. 13 schematically illustrates a sync block, showing header information ("ID0", "ID1", "HD"), luminance DCT blocks (Y0, Y1 . . . ), chrominance DCT blocks (Cb0, Cb1 . . . Cr0, Cr1 . . . ) and an error checking byte ("CRC"). The AMs for Y, Cb and Cr are specified separately, at the beginning of respective Y, Cb and Cr data sections of the sync block. The ACs for each Y, Cb and Cr DCT block are then specified at the beginning of that DCT block's data.
FIG. 14 schematically illustrates the operation of the bit allocator 170.
As described above, the bit allocator performs trial quantizations at ten specific quantizations values 7 . . . 61. FIG. 14 is a schematic graph representing the results of this trial quantization, by plotting the number of bits generated by the trial quantization process on a vertical axis against the quantization index on a horizontal axis. (It will be appreciated that the smooth curve joining the ten points of FIG. 14 is for schematic illustration only. In the bit allocator, only the ten discrete quantization values 7 . . . 61 are tested.)
A target bit rate B-- max, representing the available data capacity on the tape channel 20, is applied to each code block in the data stream. The number of bits generated by the trial quantization processes of the bit allocator 170 are compared with the limit B-- max. This comparison highlights two of the ten trial quantization values: one which generates a number of bits which is just greater than or equal to B-- max, and the next higher test value which generates a number of bits less than B-- max. A quantization base value equal to the lower of these two numbers (the one which generated the number of bits greater than or equal to B-- max) plus 2 is passed to the binary search unit 190. In the example shown in FIG. 14, therefore, a base quantization value of 21 is passed to the binary search unit 190.
FIG. 15 schematically illustrates the operation of the binary search unit.
Starting from the base quantization value (e.g. 21 in this case) passed from the bit allocator, the binary search unit first detects the number of output bits which would result from using that base value.
Then, in a second stage, and depending on the result of the first stage test, the binary search unit assesses the number of bits resulting from a quantization value either 2 below the base or 2 above the base value.
In a third stage, the value tested at the second stage is either increased or decreased by 1.
Finally, the last stage of processing may also add 1 to the quantization index. these processes will be described in detail below.
Turning to FIG. 16, DCT data from the DCT unit 180 is passed to binary search stage one 500 and to two delay units 505, 510 which supply delayed versions of the DCT data to binary search stage two 520 and binary search stage three 530.
The output of binary search stage one 500 is detected by a test unit 540 which compares the number of bits which would be generated by using the input quantization index QI(1) (in this example, 21). The test unit 540 generates a quantization index for stage two QI(2), which is either 2 greater or 2 less than QI(1). Similarly, a test unit 550 generates QI(3), which is either 1 greater or 1 less than QI(2). Finally, a test unit 560 detects whether 1 should be added to QI(3).
The test units 540, 550 and 560 supply the respective values of QI(1), QI(2) and QI(3) (potentially modified by adding 1), together with the respective bit rates generated using the quantization indices for test quantizations, to a selector 570. The selector chooses that quantization index of the possible values presented to it, which is the smallest value producing fewer bits than the bit rate target. This value is supplied as QI(out).
The actual algorithm used in the process is as follows:
______________________________________Stage 1: use QI(1)Stage 2: If (Bits stage 1 > target) then QI(2) = QI(1) + 2 else QI(2) = QI(1) - 2Stage 3: If (Bits stage 2 > target) then QI(3) = QI(2) + 1 else QI(3) = QI(2) - 1Finally, If (Bits stage 3 > target) then QI(3) = QI(3) + 1 else QI(3) unchanged______________________________________
QI(out) is selected as the smallest of QI(1), QI(2) and QI(3) which produces fewer than the target number of bits.
FIG. 17 schematically illustrates an element of a backsearch unit. Backsearch is a process for testing the quantization index value chosen by the binary search. As described above, binary search generates the lowest quantization index which produces fewer bits than the bit rate target. Backsearch then tests the six adjacent higher quantization indices to detect which is the best value to be used from those six choices.
In FIG. 17, an element of the backsearch unit comprises a test quantizer 600, an inverse quantizer 610 using the same quantization index as the quantizer 600, a subtracter 620 and a delay element 630. So, the DCT data is subjected to a quantization and complementary inverse quantization process, then to be subtracted from a delayed version of the original DCT data. This produces an error signal at the output of the subtracter 620.
Referring to FIG. 18, a full backsearch unit comprises six elements 640 of the type shown in FIG. 17. Each of these elements 640 operates with a different quantization index, namely:
QI(out)+1 . . . QI(out)+5.
The error signals produced by each of the elements 640, representing the differences between the quantized and inverse-quantized DCT data and the original DCT data, are summed over a sync block and compared by a sum and compare unit 650. The sum and compare unit 650 selects that one of the possible quantization indices tested by the six elements 640 to be used in the final quantization stage for encoding the DCT data: QI(final).
FIGS. 19 and 20 illustrate the operation of the backsearch unit. In particular, FIG. 19 illustrates a set of backsearch test results for a first generation encoded video signal, and FIG. 20 illustrates a typical set of results for the same video signal after multiple generations of encoding and decoding.
FIG. 19 illustrates one possible set of results showing the number of bits generated for quantization indices from 19 to 25. These results show that the bit rate monotonically decreases with increasing quantization index, and are typical of a first generation encoding of a real video signal. In this case, binary search would select the quantization index 22 as being the smallest number which produces fewer bits than the bit rate target, B-- max. Backsearch would also confirm the choice of 22.
FIG. 20 illustrates a corresponding set of results for a video signal which has been subjected to multiple generations of encoding and decoding. These processes can cause plateaux in the relationship between number of bits produced and quantization index.
It has been noted experimentally that it is best to use the same quantization index at an earlier generation when multiple generation copies are being produced. So, for the signal of FIG. 20, it would be best to use a quantization index of 22. However, binary search would produce a quantization index of 20, being the lowest quantization index which produces a number of bits under the bit rate B-- max.
When the backsearch process is applied to the results of FIG. 20, the number of errors produced is compared for the different quantization indices. Assuming that the signal of FIG. 20 is a multiple generation copy of the signal of FIG. 19, backsearch would detect that the lowest number of errors is produced by the quantization index 22.
FIG. 21 schematically illustrates a feature of the apparatus which could potentially lead to a waste of the available bit rate.
Because the quantization process is not a continuous variable process, there is a minimum step size (in this example, 1) between adjacent quantization index values. A value producing fewer than the required target bit rate B-- max is always selected (in this example, 22) and so a proportion of the available bit rate, being the difference between B-- max and the bit rate obtained using the selected quantization index, is always wasted. For real pictures, this has been determined experimentally to be between 1 and 3 percent of the available bit rate on average.
Therefore, in the present apparatus, the target bit rate is deliberately set to be between 1 and 3 percent higher than the available tape capacity. On the average, this will produce a utilization of the available bit rate which is most closer to 100 percent, thereby improving the efficiency and perceived picture quality. On odd occasions when the available bit rate is actually exceeded, measures are taken to discard excess data is a reliable and non-obvious manner for the user. These measures are taken by the data packer 230 and are described in detail below.
FIG. 22 schematically illustrates the operation of the entropy encoder 220 and the data packer 230.
The data packer receives data from the entropy encoder 220 comprising entropy-encoded DCT blocks and an indication of the number of bits of entropy encoded data for each DCT block.
Under the control of a memory controller 700, the data is routed to one of two input RAMs 710 to act as a swing buffer.
Each of the input RAMs 710 is 50% larger than the size of a code block. This allows any excess data (up to 150% of the target size of the code block) to be received by the input RAM 710. The packing of the data into the output RAMs 720, described below with reference to FIGS. 25 to 28, deals with discarding any excess data from the input RAMs. However, in case a current code block gives rise to more than 150% of the target data quantity (i.e. more than the capacity of the data formatter's input RAM) farther measures are needed to truncate data blocks. These measures will be described below.
While data is being loaded into one of the input RAMs 710, data already stored (from a previous code block) in the other input RAM 710 is packed into an output RAM 720. Again, while data is being packed into one of the output RAMs 720, under the control of the memory controller 700 data is read out of the other of the output RAMs 720 to form the output code blocks.
The number of bits for each of the data blocks, and the number of blocks received so far, are detected by a counter 730, the count form which is used by the memory controller 700.
In the entropy encoder 220, a further counter 222 stores a cumulative total number of bits (nbits) and a cumulative total number of blocks (nblks). The counter 222 compares these counts with the (predetermined) size of the input RAM 710, as described below, and controls the operation of the actual encoder unit 224 of the entropy encoder.
FIG. 23 schematically illustrates the way in which received data is stored in one of the input RAMs 710.
When a first block is received, it is stored from addresses 0 to L0, where L0 is the length of that block. The second block (of length L1) is stored between addresses L0 and (L0+L1). This process continues, with the "mth" block being stored between addresses ##EQU1##
As each block is generated by the entropy encoder, the counter 222 detects whether there is sufficient space left in the input RAM 710 to store the remaining DCT blocks of the current code block. If it is determined that there is insufficient space (and this determination will be described below in more detail), then the counter 222 issues a control signal to the entropy encoder to truncate the remaining DCT data blocks and only the truncated versions stored in the input RAM 710.
FIGS. 24a to 24c schematically illustrate the truncation process applied to encoded DCT blocks.
FIG. 24a illustrates a non-truncated DCT block comprising a value indicative of the DC level of the block 760, higher spatial frequency DCT data 770 and an end-of-block (EOB) flag 780. The EOB flag is in fact optional; if the encoder produces exactly the correct amount of data to be decoded into a complete DCT block, then the EOB flag is not needed. However, where the encoder detects or determines that the remainder of a block should be padded with zeroes, the EOB flag provides a short code to signify this state. Clearly, EOB flags are needed in truncated data blocks--see below.
For luminance DCT blocks, the truncated version of this block which is used is shown in FIG. 24b, and comprises just the DC value 760, and end-of-block flag 780.
For chrominance blocks (FIG. 24c), the truncated version is even shorter, comprising only the end-of-block flag 780.
So, since the length of the DC value (for luminance blocks) and the end-of-block flags in each DCT block are known, the following algorithm can be used by the counter 222 to detect whether subsequent blocks need to be truncated in order to fit into the input RAM 710:
In other words, if the remaining RAM space after a current DCT block n is ##EQU2## added will not sufficient even for the remaining DCT blocks to be added even if they were all truncated, then the current DCT block and those following must be truncated.
The entropy encoder achieves the truncation by simply not encoding the parts of the data to be omitted. An EOB flag is inserted instead, forcing the decoder to pad the DCT block with zero-valued data.
In an alternative embodiment, a predetermined "block error" flag can be inserted by the entropy encoder in place of the truncated data block. Such a flag would force the decoder to treat that data block as erroneous, so forcing data concealment to be used.
FIGS. 25 to 28 schematically illustrate the packing of data from the output RAM 720 into a code block for recording on tape. This technique ensures that each DCT block is allocated at least an equal share of the available data capacity of the code block. Any space which is not needed out of these equal shares is re-allocated amongst other DCT blocks. DCT data is also packed in order of increasing spatial frequency, so that if any data has to be discarded as part of the packing process it would tend to be the higher frequency data; missing high frequency data tends to be less subjectively noticeable than missing low frequency data.
For schematic explanation only, the code block is considered to consist of two sync blocks 800, 810, each being arranged to store four DCT blocks. DCT blocks DCT1 to DCT4 correspond to the first sync block and blocks DCT5 to DCT8 correspond to the second sync block.
Each sync block is initially subdivided into four equal storage areas.
Referring to FIG. 26, a first pass is made to put as much as possible of each DCT block into the corresponding subdivision of the sync blocks 800, 810. In the case of block DCT1, not all of the block can be fitted into the subdivision, and a certain amount 820 of the block has yet to be packed.
Block DCT2 exactly fills the corresponding subdivision of the sync block 800. Blocks DCT3 and DCT4 can fit into the corresponding subdivisions, leaving further available space for other data to be stored.
Similarly, blocks DCT5 to DCT8 all fit into their respective subdivisions leaving further available space.
FIG. 28 illustrates the way in which the excess data from block DCT1 is packed into some of the remaining available space in the sync blocks 800, 810.
In a second pass, therefore, portions 822 and 824 of the DCT block DCT1 may be fitted into the available space within the sync block 800 (the sync block corresponding to block DCT1). However, this still leaves a further portion 826 of the block DCT1 which will not fit into that sync block 800.
So, in FIG. 28, in a third pass of the packing operation, the remaining portion 826 of the block DCT1 is fitted into remaining space in the sync block 810.
Therefore, in summary, a three-pass operation is performed to fit data from each DCT block firstly, where possible, into the corresponding subdivision of that sync block; secondly, where possible, into remaining available space within the same sync block; and thirdly, into available remaining space within other sync blocks.
The sync blocks are then concatenated to form the output code block.
Although illustrative embodiments of the invention have been described in detail herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various changes and modifications can be effected therein by one skilled in the art without departing from the scope and spirit of the invention as defined by the appended claims.
|Cited Patent
|Filing date
|Publication date
|Dec 27, 1982
|Oct 2, 1984
|At&T Bell Laboratories
|Digital code converter
|Feb 27, 1991
|Jun 16, 1992
|General Electric Company
|An HDTV compression system
|Dec 11, 1990
|Jul 28, 1992
|At&T Bell Laboratories
|Adaptive leak hdtv encoder
|Jul 31, 1990
|Sep 8, 1992
|Ampex Corporation
|Data compression using a feedforward quantization estimator
|Nov 7, 1990
|Nov 17, 1992
|At&T Bell Laboratories
|Coding for digital transmission
|Mar 11, 1993
|Apr 26, 1994
|Mitsubishi Denki Kabushiki Kaisha
|Coding apparatus
|Jun 2, 1992
|Jun 14, 1994
|Sony Corporation
|High efficiency data compressed image encoding
|May 3, 1993
|Jan 24, 1995
|Sony United Kingdom Limited
|Digital data apparatus for providing spatial multiplexing and demultiplexing of compressed data to be recorded and reproduced
|Jan 7, 1994
|Aug 22, 1995
|Canon Kabushiki Kaisha
|Image processing apparatus and method
|Mar 10, 1994
|Aug 29, 1995
|Matsushita Electric Industrial Co., Ltd.
|Apparatus for recording digital signals with associated auxiliary data
|Jun 3, 1994
|Jan 21, 1997
|Matsushita Electric Industrial Co., Ltd.
|Optical disk recorder for video signals and an optical disk for use therein
|Jun 23, 1994
|Jun 24, 1997
|Victor Company Of Japan, Ltd.
|Processing system for digital video signal
|Aug 25, 1995
|Nov 17, 1998
|Sony Corporation
|Method and apparatus for transmission of compressed picture data
|Feb 6, 1996
|Aug 10, 1999
|Asahi Kogaku Kogyo Kabushiki Kaisha
|Adaptive quantization of orthogonal transform coefficients for setting a target amount of compression
|Jul 31, 1997
|Sep 21, 1999
|Sony Corporation
|Image data compression and decompression using both a fixed length code field and a variable length code field to allow partial reconstruction
|Jul 31, 1997
|Nov 16, 1999
|Sony Corporation
|Image activity data compression and decompression method and apparatus
|Jul 31, 1997
|Nov 30, 1999
|Sony Corporation
|Image data compression
|Citing Patent
|Filing date
|Publication date
|May 31, 2000
|Apr 29, 2003
|Prediwave Corp.
|Systems and methods for providing video-on-demand services for broadcasting systems
|Apr 25, 2003
|May 25, 2004
|Nec Corporation
|Method and apparatus for adaptive bus coding for low power deep sub-micron designs
|Apr 19, 2001
|Nov 21, 2006
|Fineground Networks
|Method and system for parameterized web documents
|Mar 23, 2001
|Dec 18, 2007
|Cisco Technology, Inc.
|Methods and systems for managing class-based condensation
|Sep 13, 2004
|Jul 7, 2009
|Microsoft Corporation
|Accelerated video encoding using a graphics processing unit
|May 31, 2007
|Oct 13, 2009
|Cisco Technology, Inc.
|Method and system for class-based management of dynamic content in a networked environment
|Aug 6, 2002
|Jan 19, 2010
|Sony Corporation
|Image encoding apparatus and method
|Apr 30, 2003
|Aug 3, 2010
|Apple Inc.
|Method for implementing a quantizer in a multimedia compression and encoding system
|May 31, 2007
|Sep 21, 2010
|Cisco Technology, Inc.
|Method and system for class-based management of dynamic content in a networked environment
|Nov 17, 2003
|Sep 28, 2010
|Apple Inc.
|Method for implementing an improved quantizer in a multimedia compression and encoding system
|Oct 22, 2004
|Oct 12, 2010
|Microsoft Corporation
|Accelerated video encoding using a graphics processing unit
|Jan 25, 2007
|Jan 4, 2011
|Nikon Corporation
|Digital still camera
|Dec 24, 2003
|Feb 15, 2011
|Apple Inc.
|Method and system for video encoding using a variable number of B frames
|Feb 22, 2006
|Feb 22, 2011
|Jds Uniphase Corporation
|Framing mobile communication signals for analysis
|Nov 17, 2003
|May 10, 2011
|Apple Inc.
|Method of implementing improved rate control for a multimedia compression and encoding system
|Feb 28, 2008
|Oct 25, 2011
|Research In Motion Limited
|Method and system for decoding encoded images and reducing the size of said images
|Feb 11, 2011
|Mar 6, 2012
|Apple Inc.
|Method and system for video encoding using a variable number of B frames
|Apr 26, 1999
|Jun 12, 2012
|Hewlett-Packard Development Company, L.P.
|Method and system for maintaining a content server at safe load conditions
|Dec 8, 2005
|Nov 13, 2012
|British Telecommunications Plc
|Buffer underflow prevention
|Apr 3, 2007
|Dec 4, 2012
|British Telecommunications Public Limited Company
|Video coding
|Jun 30, 2008
|Apr 23, 2013
|Apple Inc.
|Method of performing rate control for a compression system
|Oct 21, 2011
|May 7, 2013
|Research In Motion Limited
|Method and system for decoding encoded images and reducing the size of said images
|Apr 1, 2011
|Jul 2, 2013
|Apple Inc.
|Method of implementing improved rate control for a multimedia compression and encoding system
|Dec 8, 2005
|Dec 31, 2013
|Imagine Communications Ltd.
|Distributed statistical multiplexing of multi-media
|May 6, 2013
|May 27, 2014
|Blackberry Limited
|Method and system for decoding encoded images and reducing the size of said images
|May 31, 2006
|Aug 5, 2014
|Cisco Technology, Inc.
|Method and system for parameterized web documents
|Jun 21, 2010
|Sep 15, 2015
|Apple Inc.
|Method for implementing a quantizer in a multimedia compression and encoding system
|Jul 9, 2001
|Apr 25, 2002
|Hoang Khoi Nhu
|Controlling data-on-demand client access
|Aug 20, 2001
|May 16, 2002
|Hoang Khoi Nhu
|Selective inactivation and copy-protection
|Sep 27, 2001
|May 16, 2002
|Hoang Khoi N.
|Digital data-on-demand broadcast cable modem termination system
|Nov 28, 2001
|May 30, 2002
|Khoi Hoang
|Method for providing data services for a large number of small-sized data files
|Nov 28, 2001
|Sep 26, 2002
|Khoi Hoang
|Methods and systems for transmitting delayed access client generic data-on demand services
|Oct 19, 2001
|Nov 28, 2002
|Hoang Khoi Nhu
|Data-on-demand digital broadcast system utilizing prefetch data transmission
|Jun 24, 2002
|Feb 20, 2003
|Khoi Hoang
|Systems and method for providing video-on-demand services for broadcasting systems
|Oct 25, 2001
|May 1, 2003
|Khoi Hoang
|Method and apparatus for transmitting non-VOD services
|Apr 25, 2003
|Oct 30, 2003
|Nec Corporation
|Method and apparatus for adaptive bus coding for low power deep sub-micron designs
|Mar 26, 2003
|Oct 30, 2003
|Stefan Porter Robert Mark
|Data compression
|Mar 26, 2003
|Nov 20, 2003
|Saunders Nicholas Ian
|Data compression
|Aug 6, 2002
|Apr 8, 2004
|Hidehiko Morisada
|Image encoding apparatus and method
|Jun 25, 2004
|Dec 29, 2005
|Adriana Dumitras
|Coding of scene cuts in video sequences using non-reference frames
|Oct 22, 2004
|Mar 16, 2006
|Microsoft Corporation
|Accelerated video encoding using a graphics processing unit
|Sep 13, 2004
|Mar 16, 2006
|Microsoft Corporation
|Accelerated video encoding using a graphics processing unit
|Dec 8, 2005
|Aug 31, 2006
|Imagine Communications, Ltd.
|Distributed statistical multiplexing of multi-media
|May 31, 2006
|Sep 14, 2006
|Kausik Balas N
|Method and system for parameterized web documents
|Jan 25, 2007
|Aug 2, 2007
|Nikon Corporation
|Digital still camera
|Feb 22, 2006
|Aug 23, 2007
|Ward Robert G
|Framing mobile communication signals for analysis
|May 31, 2007
|Sep 27, 2007
|Fineground Networks
|Method and system for class-based management of dynamic content in a networked environment
|Dec 8, 2005
|Jun 5, 2008
|British Telecommunications Public Limited Company
|Buffer Underflow Prevention
|Dec 8, 2005
|Jun 12, 2008
|Othon Kamariotis
|Processing Video Signals
|Jun 30, 2008
|Jan 8, 2009
|Xiaochun Nie
|Method of performing rate control for a compression system
|Feb 28, 2008
|Sep 3, 2009
|Slipstream Data Inc.
|Method and system for decoding encoded images and reducing the size of said images
|Apr 3, 2007
|Jun 17, 2010
|Michael Erling Nilsson
|Video coding
|Jun 21, 2010
|Jan 13, 2011
|Thomas Pun
|Method for implementing a quantizer in a multimedia compression and encoding system
|Feb 11, 2011
|Aug 11, 2011
|Apple Inc.
|Method and system for video encoding using a variable number of b frames
|Mar 12, 2003
|Oct 8, 2003
|Sony United Kingdom Limited
|Data compression for multi-generation images
|Mar 12, 2003
|Jan 7, 2004
|Sony United Kingdom Limited
|Data compression for multi-generation images
|Mar 17, 2003
|Oct 8, 2003
|Sony United Kingdom Limited
|Data compression for multi-generation images
|Mar 17, 2003
|Jan 7, 2004
|Sony United Kingdom Limited
|Data compression for multi-generation images
|Aug 6, 2002
|May 6, 2004
|Sony Corporation
|Image encoding apparatus and method
|Aug 6, 2002
|Oct 3, 2007
|Sony Corp
|Image encoding apparatus and method
|Dec 8, 2005
|Jun 29, 2006
|British Telecommunications Public Limited Company
|Processing video signals
|Apr 3, 2007
|Oct 11, 2007
|British Telecommunications Public Limited Company
|Video coding
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Feb 12, 1998
Owner name: SONY CORPORATION, JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SAUNDERS, NICHOLAS IAN;GILLARD, CLIVE HENRY;REEL/FRAME:008986/0054
Effective date: 19970731
Owner name: SONY UNITED KINGDOM LIMITED, UNITED KINGDOM
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SAUNDERS, NICHOLAS IAN;GILLARD, CLIVE HENRY;REEL/FRAME:008986/0054
Effective date: 19970731
|Jun 28, 2004
|Fee payment
Year of fee payment: 4
|Jun 26, 2008
|Fee payment
Year of fee payment: 8
|Aug 6, 2012
|Maintenance fee reminder mailed
|Dec 26, 2012
|Lapse for failure to pay maintenance fees
|Feb 12, 2013
|Expired due to failure to pay maintenance fee
Effective date: 20121226


text:
Breeze - A light breeze that doesn't do much damage other than mussing up your oponents hair. It's more typically used domestically for cooling houses in hot weather and for light dusting without disturbing anything delicate or breakable.
Gust - A stronger wind that can be used to hinder the movements of the opponent. This too isn't a very harmfull spell unless someone adds some kind of debris tot he wind such as gravel or small thumb tacks. It's most often used domestically for blowing leaves and pine needles off of streets, porches, and lawns. With it's high level of control it is also often used for cleaning storm gutters and rooftops.
Tornado - The most effective spell in the wind category, this powerfull spell lifts opponents off of their feet, spinning them around and carrying them up to 15 feet in the air before dissipating and dropping them abruptly. It is a particularly dangerous spell as the fall at the end of the spell can easilly result in broken limbs and even death if the happen to land the wrong way.

subset: commoncrawl


text:
UpdatePanel::UpdateMode Property
Gets or sets a value that indicates when an UpdatePanel control's content is updated.
Assembly: System.Web.Extensions (in System.Web.Extensions.dll)
public: property UpdatePanelUpdateMode UpdateMode { UpdatePanelUpdateMode get(); void set(UpdatePanelUpdateMode value); }
Property ValueType: System.Web.UI::UpdatePanelUpdateMode
One of the UpdatePanelUpdateMode values. The default is Always.
The specified type is not one of the UpdatePanelUpdateMode values.
When an UpdatePanel control is not inside another UpdatePanel control, the panel is updated according to the settings of the UpdateMode and ChildrenAsTriggers properties, together with the collection of triggers. When an UpdatePanel control is inside another UpdatePanel control, the child panel is automatically updated when the parent panel is updated.
The content of an UpdatePanel control is updated in the following circumstances:
If the UpdateMode property is set to Always, the UpdatePanel control's content is updated on every postback that originates from anywhere on the page. This includes asynchronous postbacks from controls that are inside other UpdatePanel controls and postbacks from controls that are not inside UpdatePanel controls.
If the UpdatePanel control is nested inside another UpdatePanel control and the parent update panel is updated.
If the UpdateMode property is set to Conditional, and one of the following conditions occurs:
You call the Update method of the UpdatePanel control explicitly.
The postback is caused by a control that is defined as a trigger by using the Triggers property of the UpdatePanel control. In this scenario, the control explicitly triggers an update of the panel content. The control can be either inside or outside the UpdatePanel control that defines the trigger.
The ChildrenAsTriggers property is set to true and a child control of the UpdatePanel control causes a postback. A child control of a nested UpdatePanel control does not cause an update to the outer UpdatePanel control unless it is explicitly defined as a trigger.
The following example shows how to use the UpdateMode property. The example declares two UpdatePanel controls. In the first panel, the UpdateMode property is set to Conditional. In the second panel, UpdateMode is set to Always. A button outside both panels is registered as an asynchronous postback control by calling the RegisterAsyncPostBackControl method of the ScriptManager control. In the button's Click event handler, the Update method of the first panel is called if more than five seconds have elapsed since its last update. In this scenario, the panel's content is updated only if the last panel refresh was more than five seconds ago. The content of the second panel is always updated.
Available since 3.5


text:
LinuxFest Northwest 2011 Prepares Program That Promotes Participation
The organizers of LinuxFest Northwest 2011 (LFNW) are busy making arrangements for attendees to experience outstanding open source presentations, exhibits, and fun with something for everyone on April 30 and May 1 at the Bellingham (WA) Technical College.
Attendees will have the opportunity to participate in sessions such as the comprehensive telephony/VoIP track with top Asterisk developers and users as well as enjoy the opportunity gain a greater knowledge of cloud, security; Android; multimedia; and sysadmin and dev tools. In addition the ACLU and EFF will be on hand to champion your digital rights in Bellingham during LFNW. Other sessions include Free (as in speech) brewing (as in beer), Alpha Geek: Lather, Rinse, Repeat..., Honey, I deleted the kids: preserving your digital legacy for decades and more.
In addition to the main session presentations, this year LFNW 2011 is set to include Lightning Talks, Lean startup series, Big Job Fair and Gathering (Friday prior to the event) and much more.
Registration is currently open, and more information on attending and participating in LinuxFest Northwest 2011 can be found its website.
Issue 202/2017
Buy this issue as a PDF
Gnome is Celebrating it's 20th Birthday
There has been over 33 releases since the first release of Gnome.
SQL Server Comes to RHEL, OpenShift Comes to Azure
Microsoft and Red Hat expand their partnership.
LibreOffice 5.4 Released
Comes with improved support for Microsoft Office file formats.
Red Hat to Drop Support for Btrfs
The company is building their own storage solution called Stratis.
Reinvent your network with DevOps tools and techniques:
Opportunities and Risks: Containers for DevOps
Automated Builds Using CentOS 7 and Kickstart
Elasticsearch, Logstash, and Kibana – The ELK stack
Are you ready for DevOps? Try your luck with the beta version of Linux Professional Institute's new DevOps exam.
Kolab Now Integrates Collabora Online
Kolab Now subscribers now have access to Collabora Online.
Endless OS, a Distribution Without Internet
A new version of Endless OS has been released.
GitHub Announces Open Source Friday Program
They encourage people to take time out and work on open source projects on Friday.
System76 Announces Their Own Distro, Pop!_OS
Pop!_OS is based on Ubuntu and uses the Gnome stack.
Linus Torvalds Talks About His Motivation
He never tires of working on the Linux kernel.


text:
The Chicago Bears have finally put the pads on. It may have been the weekend, but that didn't stop over 10,000 die-hard Chicago Bears fans from showing up to a little town called Bourbonnais to watch their beleoved team. Head coach Lovie Smith mentioned how impressed he was with the size of the crowd.
"Here in Chicago we have great fans," he said. "They come out. It's a perfect night to watch good football. It's the weekend here in Chicago. The crowd was into it and we like that.
"We're going to play a lot of prime-time games. Our guys need to be able to play in an environment where they hear fans talking to them, so this was a good environment and I think we put on a pretty good show for them tonight."
There are new faces in Chicago this year, and every man that takes the field, is fighting for a job that will pay them very handsomely. However, the most heated battle for a starting job at training camp comes from familiar faces. J'Marcus Webb and Chris Williams at left tackle. The two are dead even and splitting first-team reps in practice.
"It's going to be a dogfight for those two guys," said offensive coordinator Mike Tice. "I'm not going to put up with any crap as far as turning pass-rushers free and not protecting the quarterback. We have too many athletes to not be able to throw the football explosively."
Webb, a 2010 seventh-round pick from West Texas A&M, started all 16 games at left tackle last season after opening 12 games at right tackle as a rookie. Webb does have the body-style to be a consistent tackle, but he does seem to have mental lapses on the field from time-to-time.
Williams, a 2008 first-round pick from Vanderbilt, joined the Chicago Bears as a left tackle before being moved to right tackle in 2009. He returned to left tackle late that season before switching to left guard in 2010. Williams started the first nine games at left guard in 2011 before sustaining a season-ending wrist injury. Williams was drafted 4 years ago, and has been moved around so much that he may have had trouble grasping just one position. Hopefully his wrist is fully healed and the coaching staff can concentrate his skills to just the left tackle position.
Consistency and smarts will be a key factor in determining the starter at left tackle. The Chicago Bears need a legitimate pass blocker if they want Jay Cutler and his new targets to excel.
"We're going to keep the heat on both of them," Tice said. "What we want to see is who's going to block our good pass rushers. I know they can both run block, but we're not going to go out there and run the ball 50 times a game. So you've got to be able to protect. If you can't protect, you can't play for us."
Michael J. Igyarto is a featured columnist for Rant Sports
Follow Michael on twitter: @windycityiggy


text:
December is a good time to slowdown and reflect. And three short books – Seneca's On the Shortness of Life, Pico Lyer's The Art of Stillness, and Henry David Thoreau's Walking – helped put me in a good mindset. In 2015, I hope to develop routines that would give me more time to walk, meditate, and pay more attention to the little beauty in life.
Posts Tagged 'reflect'
Beauty & slowness
Posted in Uncategorized, tagged reflect, slowness, Time, walk on December 23, 2014| Leave a Comment »


text:
Helping to supply green energy for Beijing's Olympic Games
When the leading Chinese wind turbine company Goldwind was awarded the contract to supply 33 turbines for the 2008 Beijing Olympic Games, the company selected SKF as the bearing supplier for this prestigious project. The 1.5 MW turbines are Goldwind's largest turbines and, like all OEM's, Goldwind knew that the larger the turbine the more they need to be sure about the reliability of critical components, like bearings. That is because turbines producing higher energy outputs are usually physically bigger and taller than smaller energy producing units. And that results in more wind being captured which leads to higher forces on machinery at the top of the turbine where the electricity is generated, and in the case of Goldwind's 1.5 MW turbines that is 65 metres from the ground.
Most popular related searches
Customer comments
No comments were found for Helping to supply green energy for Beijing's Olympic Games. Be the first to comment!


text:
Question: A 10 year annual annuity due with the first payment occurring
A 10-year annual annuity due with the first payment occurring at date t = 7 has a current value of $85,000. If the discount rate is 9 percent per year, what is the annuity payment amount?
View Solution:
View Solution:
Answer to relevant QuestionsTake a look back at Figure 5.4 . Notice the wide range of coupon rates. Why are they so different? Wyland Co. wants to issue new 25-year bonds for some much-needed expansion projects. The company currently has 8 percent coupon bonds on the market that sell for $1,063, make semiannual payments, and mature in 20 years. What ...Osbourne, Inc., has an odd dividend policy. The company has just paid a dividend of $12 per share and has announced that it will increase the dividend by $3 per share for each of the next five years, and then never pay ...Mickelson Corporation will pay a $2.90 per share dividend next year. The company pledges to increase its dividend by 4.75 percent per year, indefinitely. If you require an 11 percent return on your investment, how much will ...In January 2008, automobile manufacturer Volkswagen announced plans to build an automatic transmission and engine plant in South Carolina. Volkswagen apparently believed it would be better able to compete and create value ...
Post your question


text:
CHARLOTTE, N.C. — Matt Ryan can't explain why he seems to own the Carolina Panthers.
He just does.
Ryan led yet another comeback victory over the Panthers, giving him six wins in his last seven starts against the division rival.
Ryan threw two of his four touchdown passes in the fourth-quarter to rookie Julio Jones and the Falcons erased a 16-point halftime deficit for a 31-23 victory on Sunday. Ryan finished with 320 yards passing and his four TDs matched a career high. Equally as important, Ryan kept the Falcons (8-5) in playoff position in the wild card race with three games left.
"We approached it as the first of four legs," Ryan said. "We've knocked the first leg out and now we've got to move on and keep going."
Atlanta closes the season with Jacksonville at home, at New Orleans and at home against Tampa Bay.
Ryan's comeback shouldn't surprise anyone — he seems to have Carolina's number.
The first time the teams met, the Falcons trailed by three points in the fourth quarter but rallied for a 31-17 win on Oct. 16.
Down 16 points at the half, Ryan earned his "Matty Ice" nickname.
He came out of the locker room poised and calm but firing on all cylinders in the second half, throwing for 232 yards and three scores.
Jones, who finished with 104 yards receiving, was quiet for most of the game but caught a 17-yard touchdown pass from Ryan to give the Falcons a 24-23 lead early in the fourth quarter. After Olindo Mare missed a field goal that would have put the Panthers up by two, Ryan went for the jugular and found Jones across this middle for a catch-and-run 75-yard touchdown with 4:17 left in the game.
Carolina's final drive ended with an incomplete pass on fourth-and-5 from the Atlanta 27.
Staying poised
"He just kept his poise," Jones said of Ryan. "He kept it positive on the sideline, encouraged us to keep it going, keep it going. Eventually, we did, and we came up with a W at the end."
Looking to push the tempo up, the Falcons went to a no-huddle offense quite a bit in the second half and tried to take advantage of a matchup with reserve cornerback Darius Butler on Jones
"We got a look where we felt we'd had a pretty good matchup on the backside with Julio (Jones)," Ryan said.
Both of Jones' touchdown catches came against Butler.
"You know, they were coming at me a few times with Julio," Butler said. "They like that matchup. I made some plays early and he made some big plays late. You've got to hold up. That's the name of the game. You got to finish it out."
For the Panthers (4-9), it was more of the same, marking the sixth time this season they've lost after being ahead or tied in the fourth quarter.
Newton fades
Cam Newton started strong, completing 9 of 14 passes for 147 yards and two touchdowns in the first half as the Panthers built a 23-7 lead. But Newton
was intercepted twice in the second half, including once on a poor decision where he tried the shovel the ball ahead to running
back Jonathan Stewart with his non-throwing left hand as he was falling to the ground. The result was a gift interception for Falcons linebacker Mike Peterson.
Ryan cashed in two plays later as running back Marquizz Rodgers beat linebacker James Anderson for a 31-yard touchdown.
A glum Newton called his decision "terrible."
"I tried to get the ball to Stew and tried to avoid the sack," he said. "I should have just ate the ball and taken the sack. Both interceptions were my fault. If you expect to win games you have to protect the football and I did a poor job of that today."
Despite their struggles in the second half, the Panthers looked poised to regain the lead midway through the fourth quarter, but Newton couldn't hook up with Greg Olsen in the back of the end zone and the Panthers settled for a 36-yard field goal attempt. But Mare, just as he'd done with a chance to tie the game late at home against Minnesota, pushed a very makeable go-ahead field goal wide left.
Coach Ron Rivera said he plans to sit down with Mare to talk about what's wrong.
"It's the second one he's hooked left, pretty much from almost the same area (on the field)," Rivera said of Mare, who was given a four-year, $12 million contract this offseason.
The Falcons seized the momentum.
Two plays later, on second-and-11, Jones caught a pass over the middle and broke through a tackle by Butler and Sherrod Martin and raced 75 yards to the end zone.
The Panthers spotted the Falcons a 7-0 lead midway through the first quarter before seizing the momentum with 23 straight points to close the first half. Newton got the Panthers on the board with a nifty Tim Tebow-style play, faking a run up the middle and stopping to throw a jump pass over the middle to a wide open Jeremy Shockey for a 6-yard touchdown.
After a Jason Baker punt pinned the Falcons at their own 2, defensive end Antwan Applewhite sacked Ryan in the end zone and suddenly the Panthers could do no wrong.
Two plays later DeAngelo Williams sprinted around the right side and raced 74 yards for a touchdown. Carolina continued to pile on its next possession when Newton faked a screen to Jonathan Stewart on one side and threw back to Olsen on the other, who raced 44 yards for a touchdown.
The Falcons outscored the Panthers 24-0 in the second half.
"We just brought a different attitude out there in the second half," said safety Thomas DeCoud. "They caught us off guard early with a couple of things they didn't show us on film. In the second half, we bit down and did what we needed to get done."
Atlanta 7 0 10 14 — 31
Carolina 7 16 0 0 — 23
First Quarter
Atl-White 5 pass from Ryan (Bryant kick), 5:29.
Car-Shockey 6 pass from Newton (Mare kick), :03.
Second Quarter
Car-Applewhite safety, 7:12.
Car-D.Williams 74 run (Mare kick), 6:51.
Car-Olsen 44 pass from Newton (Mare kick), 3:03.
Third Quarter
Atl-FG Bryant 30, 10:55.
Atl-Rodgers 31 pass from Ryan (Bryant kick), 8:55.
Fourth Quarter
Atl-Jones 17 pass from Ryan (Bryant kick), 12:42.
Atl-Jones 75 pass from Ryan (Bryant kick), 4:17.
Atl Car
First downs 18 19
Total Net Yards 394 416
Rushes-yards 28-86 23-157
Passing 308 259
Punt Returns 2-14 4-11
Kickoff Returns 1-23 5-89
Interceptions Ret. 2-33 0-0
Comp-Att-Int 22-38-0 19-39-2
Sacked-Yards Lost 3-12 2-17
Punts 6-47.8 6-42.7
Fumbles-Lost 1-0 0-0
Penalties-Yards 5-50 5-50
Time of Possession 30:43 29:17
RUSHING-Atlanta, Turner 21-76, Snelling 3-6, Rodgers 1-4, Ryan 3-0. Carolina, D.Williams 7-87, Newton 7-36, Stewart 8-29, A.Edwards 1-5.
PASSING-Atlanta, Ryan 22-38-0-320. Carolina, Newton 19-39-2-276.
RECEIVING-Atlanta, White 7-84, Gonzalez 7-82, Jones 3-104, Rodgers 2-39, Douglas 2-12, Snelling 1-(minus 1). Carolina, Smith 6-125, Stewart 4-27, Olsen 2-53, Naanee 2-29, LaFell 2-28, Shockey 2-10, D.Williams 1-4.
MISSED FIELD GOALS-Atlanta, Bryant 46 (WL). Carolina, Mare 36 (WL).


text:
Current Highlights on Broadway
Find a show or venue
Order by phone
Your independent guide to the best shows in New York
235 West 44th Street, New York, NY 10036
Now showing, Open Run
2017 Drama Desk Winner
"A sweeping adventure, romance and historical epic whose fine craftsmanship will satisfy musical-theater fans beyond the show's ideal audience of teenage girls."
Time Out New YorkBuy Tickets
A starry creative team bring the magical story of Anastasia to Broadway for the first time. Inspired by the 20th Century Fox animation from 1997, this show imagines the life of Grand Duchess Anastasia if she escaped the execution of the rest of her family in 1918, and follows her journey of self-discovery and tentative romance with charming con man Dimitri. It's a blockbuster adventure bursting with heart, set against the historical backdrop of the Russian Revolution.
Coming to The Great White Way following a Hartford tryout, this enchanting new show features a mix of songs from the movie, including the Oscar-nominated 'Journey to the Past', as well as original compositions. In the director's chair is Darko Tresnjack, who won a Tony for his work on the smash hit A Gentleman's Guide to Love & Murder, while the cast includes Ramin Karimloo (Les Mis). Anastasia also reunites the team behind the four time Tony winning musical Ragtime, with Terrence McNally providing the book and Stephen Flaherty and Lynn Ahrens scoring.
The story begins in Russia in 1916 at a lavish ball thrown by its imperial rulers The Romanovs. A dark cloud is cast over the party by the arrival of Rasputin, a sorcerer and the Romanovs' former advisor, who has been banished for treason. Hungry for revenge he curses the family and sets in motion the Russian Revolution. In the ensuing upheaval, only Empress Maria and the young Grand Duchess Anastasia escape the palace, but are then separated, with Anastasia falling and hitting her head.
A decade later, and Anastasia is a plucky 18 year old living in a rural Russian orphanage, with no memory of her true identity. One day she is spotted by rogueish conman Dimitri, who noticing her likeness to the still missing Princess, concocts a plan to pass her off as the real Anastasia to Empress Marie, who has offered a reward for her return. As they embark on their journey, a romance begins to blossom between the pair, and memories of Anastasia's past life come back to her. But her reappearance has also awakened the evil spirit of Rasputin, who is determined to snuff out the remaining Romanovs once and for all.
Up until conclusive DNA tests confirmed her death, Anastasia's purported survival was one of the great mysteries of the 20th Century. Over the years, many women came forward claiming to be the missing Grand Duchess, including Anna Anderson, who was engaged in a 40 year legal battle to try and prove her identity.
Previews from: 23 March 2017
Opening night: 24 April 2017
May be inappropriate for ages 7 and under. Children under the age of 4 are not permitted in the theatre.
Two hours and 30 minutes, including one intermission
No comments yet, be the first to write a review.
Please note: The term Broadhurst Theater and/or Anastasia as well as all associated graphics, logos, and/or other tradermarks, tradenames or copyrights are the property of the Broadhurst Theater and/or Anastasia and are used herein for factual descriptive purposes only. We are in no way associated with or authorized by the Broadhurst Theater and/or Anastasia and neither that entity nor any of its affiliates have licensed or endorsed us to sell tickets, goods and or services in conjunction with their events.


text:
The good news is - you do not have to do it alone. There are Web-based email marketing services that are inexpensive and designed to make email marketing simple for the non-technical user. Here are the top ten reasons you need an email marketing service. Coincidentally, these are also the top ten critical email marketing benefits that you will never get by using your standard email account.
Leave a Reply.
Providing "Tools/Softwares" to Grow Your Business.
Products :
EmailPush : Intelligent Email Marketing Platform
SocialPush : All-in-One Social Media Management Platform
Managed Services :
"Email Campaign Management" as a Service
"Online Reputation Management" as a Service
"Online Ads Management" as a Service
Subscribe to our Blogs
( And receive awesome offers every week )


text:
Software AG Resources
|White Papers Terracotta
BigMemory: Performance Results on Two Terabytes of RAM
A major hallmark of an effective in-memory data management system is its ability to maintain performance while handling ever-larger data sets and a range of access rates and data element sizes. Terracotta partnered with HP Labs to test BigMemory's ability to fully utilize the terabytes of RAM available on HP servers. See the test results in this white paper.


text:
Welcome to Shopping Zen ------------------------- Shoppa is pure online shopping at it's best. Featuring a stylishly-pleasant interface for the best shopping experience with the essential tools you need to shop happily :) After trying Shoppa, you can't shop without it! Shoppa is an ad free, no nonsense shopping app that removes all the no…
$1.99 Free • 44


text:
3000 El Camino Real
Palo Alto, California 94306
United States
|Areas of Practice
|1) Corporate
|Law School
|Loyola University Chicago School of Law
|Admitted Year
|B.A. ( Computer Science )
|Most recent firm
|Wilson Sonsini Goodrich & Rosati
|Relevant Jobs
Associate (Corporate & Securities - Technology)
USA-CA-Palo Alto
Associate (Corporate & Securities - Technology) The candidate must have: Broad experience in all aspects of mergers and acquisitions involving both public and private companies, including drafting a...
Apply now
Paralegal - Corporate & Securities / International
USA-CA-Palo Alto
Paralegal - Corporate & Securities / International The candidate will support specifically, with respect to the incorporation and maintenance of foreign subsidiaries of US based multinational clients....
Apply now
|+ View more jobs
A. Harrison Barnes is a well-known attorney throughout the United States. As a member of the Malibu community, Harrison is committed to serving the needs of Malibu residents and businesses in legal matters.
Alan Singer is a partner in Morgan Lewis's Securities Practice. Mr. Singer advises companies with regard to a diverse range of corporate and securities matters.


text:
- squash tennis
- noun Date: 1901 a singles racket game resembling squash played with an inflated ball the size of a tennis ball
New Collegiate Dictionary. 2001.
New Collegiate Dictionary. 2001.
Squash tennis — is an American variant of squash racquets, but played with a ball and racquets that are closer to the equipment used for lawn tennis, and with somewhat different rules. For younger players the game offers the complexity of squash racquets and the … Wikipedia
squash tennis — Singles racket game resembling squash rackets, played with an inflated ball the size of a tennis ball. Played in virtually the same court as squash rackets, squash tennis makes fewer demands on the legs in pursuing the ball but puts a greater… … Universalium
squash tennis — noun : a racket game resembling squash racquets played by two people only in a four wall court using a lively inflated ball the size of a tennis ball which bounces very fast and requires great speed in anticipation and turning though less speed… … Useful english dictionary
squash rackets — ➡ squash * * * ▪ 1995 The dominance of Jansher Khan of Pakistan and Michelle Martin of Australia continued throughout 1994. Both retained their British Open titles in April and their world championships later in the year. Khan was… … Universalium
Squash — may refer to: * Squash (plant), the fruit of vines of the genus Cucurbita * Squash (sport), an indoor racket sport formerly called squash racquets * Squash tennis, a similar game but played with equipment related more to that of tennis * Squash… … Wikipedia
squash — squash1 [skwôsh, skwäsh] vt. [OFr esquasser < VL * exquassare < L ex , intens. + quassus: see QUASH2] 1. a) to squeeze or crush into a soft or flat mass b) to press or squeeze tightly or too tightly 2. to suppress or bring to an abrupt end; … English World dictionary
Squash (sport) — For other uses, see Squash. Squash (sport) Characteristics Contact No Team members Single Categorization Racquet sport … Wikipedia
squash — squash1 squasher, n. /skwosh, skwawsh/, v.t. 1. to press into a flat mass or pulp; crush: She squashed the flower under her heel. 2. to suppress or put down; quash. 3. to silence or disconcert (someone), as with a crushing retort or emotional or… … Universalium
squash´er — squash1 «skwosh», verb, noun, adverb. –v.t. 1. to squeeze or press into a flat mass or pulp; crush: »The boy squashed the bug. The package was squashed in the mail. 2. to put an end to; stop by force; suppress; quash: »The principal moved quickly … Useful english dictionary
squash — 1. v. & n. v. 1 tr. crush or squeeze flat or into pulp. 2 intr. (often foll. by into) make one s way by squeezing. 3 tr. pack tight, crowd. 4 tr. a silence (a person) with a crushing retort etc. b dismiss (a proposal etc.). c quash (a rebellion) … Useful english dictionary


text:
Red Lentil and Aubergine (Eggplant) Curry
READY IN: 1hr
Recipe by PinkCherryBlossom
I stole this from a friend who is doing weight watchers. I didn't find much veggie inspiration in her books but this looked great. She told me I have to add this sentence in "3 weight watchers POINTS values per serving" whatever that means...
Ingredients Nutrition
- low-fat cooking spray, for frying
- 1 onion, chopped
- 2 garlic cloves, crushed
- 2 tablespoons curry powder
- 1 aubergine, diced
- 175 g dried red lentils
- 600 ml vegetable stock
- 1 pinch salt
- 100 ml low-fat coconut milk
- 2 tablespoons chopped fresh coriander
Directions See How It's Made
- Spray pan with oil and cook the onion and garlic until soft.
- Stir in curry powder and cook for a further minute.
- Add aubergine, lentils and stock to the pan.
- Bring to the boil and simmer uncovered for 30 mins - stir frequently.
- If the lentils are not tender and mushy, boil the curry vigorously for 5 minutes.
- Add salt, coconut milk and coriander.
- Stir and serve.


text:
Fat Cat Wednesday Mussel NightUptown | Website
Map | Find Parking
Enjoy fresh, Prince Edward Island mussels prepared two different ways. You get a whole pound of PEI mussels steamed fresh, and prepared in one of two chef specialty preparations that will change every week! Come for the mussels, stay for the beer.


text:
This talk traces the evolution from missionary writings to Chinese Christian texts, looking at examples of this three-stage process from the 16th and 17th centuries and at one modern example from the early twentieth century. Professor Starr argues that an understanding of Chinese literary form is central to grasping Chinese theology, and show how, and why, Chinese theology might differ from its "Western" counterparts.
Chloë Starr is Associate Professor of Asian Christianity and Theology at Yale University Divinity School. She researches Chinese Christianity, particularly Chinese theology and its literary forms, and the movement known as "Sino-Christian theology." Her latest volume is Chinese Theology: Text and Context (Yale University Press, Nov. 2016); previous volumes include a monograph on late Qing fiction, Red-Light Novels of the Late Qing (2007) and edited volumes Reading Christian Scriptures in China (2008), and The Quest for Gentility in China (2007). She holds honorary research posts in Beijing and Hong Kong.
The cultural and missionary work inaugurated by Matteo Ricci, SJ (1552-1610) in Ming China (1368-1644) offered the hope of a brand of intercultural dialogue founded on the belief of the universality of the human experience and possibility of mutual understanding between cultures. In this spirit, the "Matteo Ricci Speaker Series," extending from 2014-2018, invites leading international scholars to speak on the subject of Chinese-Christian intercultural dialogue. Our Speaker Series celebrates both the bicentenaries of the restoration of the Society of Jesus (1814) and the Foundation of Saint Louis University (1818).
馬泰奧·裡奇(漢名利瑪竇, 耶穌會, 1552-1610) 在明代中國所作之開創性的文化及傳教活動為跨文化對話帶來了希望. 人類經驗普世性之信念和異域文化可交融乃是跨文化對話之源頭. "馬泰奧·裡奇講座系列" 扱取在聖路易大學中世紀暨文藝復興研究中心, 神學,哲學及歷史學系, 跨文化研究中心, 以及國際研究中心的學術活動, 探索中國研究中的重要課題. 該講座系列始於2014 止於 2018,旨在慶賀耶穌會復會二百年 (1814) 暨聖路易大學建校二百週年 (1818).


text:
What Were They Thinking? Nursing Escorts May Be Violating Professional Ethics
Gebbie, Kristine M.
Bibliographic Citation
American Journal of Nursing 2009 January; 109(1): 11
MetadataShow full item record
Related items
Showing items related by title, author, creator and subject.
Response to "Feminism and Public Health Nursing: Partners for Health" Gebbie, Kristine M. (2001-03)
NURSING WOUNDS: NURSE PRACTITIONERS, DOCTORS, WOMEN PATIENTS, and the NEGOTIATION of MEANING by Sue Fisher Gebbie, Kristine M. (1996)
The President's Commission on AIDS: What Did It Do? Gebbie, Kristine M. (1989-07)A member of the President's Commission on the Human Immunodeficiency Virus Epidemic reviews the Commission's work. Gebbie, who represented the public health community, briefly summarizes what the Commission did and did not ...


text:
Reviews For
Elizabeth Arden PREVAGE Body Total Transforming Anti-Aging Moisturizer
View Product Details
Write a Review - Receive 50 Rewards Points!
Tell us your thoughts about Elizabeth Arden PREVAGE Body Total Transforming Anti-Aging Moisturizer so we can help you find the right products. With your review, you'll also receive 50 Rewards Points. Please note that it may take up to 72 hours for a review to appear on site. All reviews are subject to moderator approval.Write a Review
This is a nice total body moisturizing antiaging cream for the whole body.
I had a tummy tuck 3 weeks ago and I still had stretch marks, but not nearly as bad. So I decided to start using prevage and I didnt think it was working at all, until I looked back at my tummy tuck pictures that I was taking to see my progress, I noticed some of my stretch marks were gone and others were so light I could barely see them I. was excited to realize that there was a big difference, and I will buy another tube because now Im going to use it everywhere
I used this product when I was pregnant and I have only one teeny tiny stretch mark to show from it! I WILL get this again when I am pregnant again. Definitely worth the expense.


text:
|Message view
|« Date » · « Thread »
|« Date » · « Thread »
|David Crossley <cross...@apache.org>
|deployed plugins with wrong version number
|Sat, 12 Nov 2005 02:38:28 GMT
Bringing over from the user list: Re: Installation/Internal Server Error Cocoon related? ... David Crossley wrote: > Ross Gardler wrote: > > David Crossley wrote: > > > > > >Ross, i wonder if this is because of the plugins revamp that > > >we are doing today. I deployed some plugins, and they probably > > >did not have the version number bumped to 0.8 > > > > > >What do you reckon? > > > > It is possible, although I don't think so since it is reported as > > working with forrest run and site, the problem is only in webapp. We > > need to do some testing locally to confirm this though. > > > > I'm going to bed very soon. If you have the time could you install a 0.7 > > version of Forrest and try and reproduce. > > Yep, that is probably it. I can confirm the failure > that Chris reported. Thanks. > > I will report back when it is fixed. Ross, i needed to go back to 2 months ago. The projectInfo plugin started to use the locationmap at r278579 and we must have accidently deployed it as version 0.7 rather than as 0.8-dev Anyway, i redeployed that old input.projectInfo and redeployed the output.POD and output.Text plugins from yesterday. Then the site-author build worked fine using forrest-0.7 Then re-deploying the version 0.8 of the projectInfo plugins caused the error again. -David
|View raw message


text:
New Octave Band Plot for Acoustics Simulation in COMSOL 5.2
Mads Herring Jensen January 21, 2016
COMSOL Multiphysics version 5.2 introduced a number of new features and functionality, including an acoustics-specific plot type called the Octave Band plot. This plot type provides you with an easy and flexible way to represent any frequency response, transfer function, sensitivity curve, transmission loss, or insertion loss — all of which are essential plots in many acoustics applications. Let's learn a bit more about the Octave Band plot, while highlighting its various options and settings.Read More
Bridget Cunningham December 30, 2015
Mufflers are used for acoustic soundproofing in combustion engines and HVAC systems. Before achieving optimal performance, a muffler design can go through several iterations. COMSOL Multiphysics provides a flexible environment for testing different designs, saving time and costs while ensuring high performance. Now, with simulation apps, each modification no longer requires the help of a simulation expert. Instead, colleagues can run their own tests and deliver faster results to customers. Our Absorptive Muffler Designer demo app offers insight.Read More
Caty Fairclough December 10, 2015
When the loudspeaker was first introduced, it fascinated listeners by translating electricity into amplified sound. Since that time, the device continues to be recognized for its innovative properties, while undergoing improvements and finding new uses. On this day, which marks 100 years since the first public display of a loudspeaker, we explore the device's rich history and simulation's role in advancing its design.Read More
Søren Vedel December 3, 2015
When developing a new product or functionality, the first step is typically to understand the functional properties in isolation. To achieve reliable and accurate predictions via mathematical modeling, it is essential that the critical components, test setup, and boundary conditions are specified in great detail. Most engineers, however, would prefer to focus on the critical components rather than "irrelevant" boundary conditions. New impedance boundary conditions in the Acoustics Module of COMSOL Multiphysics help to close this gap.Read More
Guest Bernd Baumann November 11, 2015
Today, we introduce guest blogger Bernd Baumann, who shares insight into optimizing the performance of metal-halide lamps with simulation, with input from his colleague Joerg Schwieger. With the help of COMSOL Multiphysics, we investigated the impact of acoustic resonances and the related acoustic streaming field on the operation of metal-halide discharge lamps. To our surprise, we found that the lamps exhibit behaviors that are similar to a well-known mechanical system — the forced Duffing oscillator with a softening spring.Read More
Guest Lars Fromme November 6, 2015
Today, we welcome Lars Fromme back to the blog — this time as a guest blogger from the FH Bielefeld University of Applied Sciences. Working with loud machines is an occupational safety issue in the modern world. To keep workers safe, we can design low-cost solutions to control the noise with the help of simulation. Researchers at the FH Bielefeld University of Applied Sciences set out to do just that by simulating acoustic transfer paths with COMSOL Multiphysics simulation software.Read More
Alon Grinenko October 13, 2015
In our Acoustophoretic Force blog series, we have discussed the nature of acoustic radiation force and different ways to compute this force in the COMSOL Multiphysics® software. Today, we will introduce you to a related phenomenon, acoustic orbital angular momentum, and demonstrate how to model it.Read More
Mads Herring Jensen October 1, 2015
This past July, I had the pleasure of attending the 22nd International Congress on Sound and Vibration. In addition to running the COMSOL vendor booth with my Italian colleague Gabriele, I was also a presenter at the event. My presentation was based on a paper I wrote with Henrik Bruus and Jonas Karlsen that focuses on how to determine acoustic radiation forces including thermoviscous effects. Let's explore acoustophoretic effects in greater detail and the research findings highlighted in my presentation.Read More
Linus Andersson June 15, 2015
The acoustic diffusion equation is the quickest and easiest way to model high-frequency acoustics. In fact, this method of acoustical analysis proved particularly helpful in planning the layout of my parents' future home. I will introduce the topic of acoustic diffusion by sharing my own personal experience, while highlighting the assumptions behind this modeling approach, as well as its strengths and weaknesses.Read More
Alon Grinenko May 20, 2015
In an earlier blog post, we considered the computation of acoustic radiation force using a perturbation approach. This method has the advantage of being both robust and fast; however, it relies heavily on the theoretical evaluation of correct perturbation terms. The idea behind the method presented here is to solve the problem by deducing the radiation force from the solution of the full nonlinear set of Navier-Stokes equations, interacting with a solid, elastic microparticle.Read More
Guest René Christensen April 21, 2015
Today we welcome guest blogger René Christensen from Dynaudio A/S. When evaluating loudspeaker performance, dips and/or peaks in the on-axis sound pressure level can be a result of an unfortunate distribution of phase components. To overcome this, we use a phase decomposition technique that splits a total surface vibration into three components depending on how they contribute to the sound pressure in an arbitrary observation point; either adding to, subtracting from, or not contributing to the pressure.Read More


text:
Rockland County Sewer District No. 1 is governed by a 10 member Board of Commissioners serving at the pleasure of the Legislature of Rockland County. A Chairman and Vice Chairman are designated by the Board of Commissioners to conduct meetings, execute documents and have such other duties as may from time to time be assigned by the Commissioners.
The Executive Director is responsible for carrying out the provisions of the Sewer Use Law of 2010 as amended, the policies of the Board of Commissioners and the Legislature of Rockland County, as well as the day to day operations of the Sewer District's Facilities and the overall responsibility for the District's construction program.
Board of Commissioners
Chairman George Hoehmann, Supervisor - Town of Clarkstown
Commissioner Kevin P. Connell, Vice Chairman
Mayor Demeza Delhomme - Village of Spring Valley
Richard Diaz
Mayor Craig Flanagan, Jr. - Village of Hillburn
Michael A. Genito
Commissioner Seth Lehman, Vice Chairman
R.C. Legislator Aney Paul
Supervisor Christopher P. St. Lawrence - Town of Ramapo
Supervisor Andrew Stewart - Town of Orangetown
Board of Commissioners Meeting Schedule
The Rockland County Board of Commissioners holds monthly meetings in the County Legislative Chambers located at the Alison Paris Building, 11 New Hempstead Road, New City, NY 10956.
Meetings are held at 6:00pm on the following dates:
- January 26, 2017
- February 23, 2017
- March 23, 2017
- April 27, 2017 - MEETING CANCELLED - Next meeting 5/25/17 @ 6:00pm
- May 25, 2017
- June 29, 2017 - UPDATED - This meeting will be held @ 5:00pm
- July 27, 2017
- August 24, 2017
- September 28, 2017
- October 26, 2017
- November 16, 2017
- December 14, 2017
* Meetings are subject to cancellation.
Board of Commissioners Meeting Minutes
Documents are in pdf format.
Click here to download Adobe Reader, if it is not already installed on your computer.


text:
How To Cover Ball Shape Cake In Fondant?
Decorating By cupcakeluv Updated 24 Mar 2010 , 2:04pm by cupcakeluv
Hello cakelovers
anybody have a good link about how to cover ball shape cake in fondant?
is it the whole3-D ball using the ball pan, or only half a ball? if it's the half, i crumb coat in bc then place in the freezer for 10-15 minutes while i roll out fondant. then, place then cake ontop of a large vegetable can so when the cake is draped in fondant, i can trim it and smooth it. if you're doing the complete 3-D ball, pretty much the same, but a lot of smoothing and make the fondant thicker so it doesn't stretch as much.
its the whole 3-ball, using the wilton sports ball pan. thats a very good tip toplace the cake on a can and drape it. thank you


text:
Welcome to Pioneer
Dear Fellow Pioneer Parents/Guardians
Welcome back to our returning families. To our new families, welcome to the Pioneer community! We hope you all enjoyed the fun filled summer days, and it is with great enthusiasm that we invite you to get ready for another exciting and successful school year.
With your support we can continue to make Pioneer nurturing and challenging, also fun for our children. Pioneer is a community based on parent involvement. Your contribution, whether it is your time, knowledge, or resources make a difference. We personally invite you to become an invoiced member at Pioneer Elementary School. Thank you for helping in any way you can, and showing your children the importance you place on their education!
We are kicking off the new school year with a Scholastic Book Fair starting September 5, 2016 to September 9, 2016. We will be in need of Parent involvement to help with set-up, working during the book fair, tear down, decorations. For more information call our email our Liberian Stephanie Stefun at 916-566-1940 or email@example.com
We look forward to getting to know your family. We hope you will join us for our monthly Parent, Teacher & Community group meeting being September 12th, 2016 6pm. Please check the Pioneer Website for all up coming back to school events
Stay informed and connected to all of Pioneer current events (latest news, event calendar, lunch menu, and volunteer information, etc.) Please visit our Pioneer website and Pioneer PTC page at: https://pioneer-trusd-ca.schoolloop.com or Pioneer PTC Facebook Page: https://www.facebook.com/Pioneer.Pantherspta. 3958914
Should have any questions, please feel free to contact us at email@example.com
Please know that questions and suggestions are always welcome!


text:
Large vehicles
Oversize vehicles
If you see this sign, the vehicle ahead is wider and/or longer than normal.
Sometimes an oversize vehicle may be accompanied by Police or a pilot vehicle (vehicle with flashing lights) to warn traffic that the load following is very wide or long.
You must follow any directions given by Police. You should also follow any reasonable directions given by the occupants of the pilot vehicle provided you do not break the law.
When approaching an on-coming oversize vehicle you should:
- Be careful and reduce speed.
- Keep to the left of the centre line.
- Be prepared to move to the left side of the road if necessary.
You should use extreme care when overtaking an oversize vehicle.
Large, heavy turning vehicles
Be careful of large, heavy vehicles displaying a DO NOT OVERTAKE TURNING VEHICLE sign as they may use more than one lane when turning left or right.
In a one-way street, a long vehicle may also use two lanes to turn left or right if it displays a DO NOT OVERTAKE TURNING VEHICLE sign.
When a long vehicle is turning and displays a sign DO NOT OVERTAKE TURNING VEHICLE you must not pass on the right if it is turning right.
A driver may overtake to the left of a vehicle displaying a 'do not overtake turning vehicle' sign, only if it is safe to do so.
A driver may overtake to the left of a vehicle displaying a 'do not overtake turning vehicle' sign, only if it is safe to do so.
You need to be careful of all large, heavy vehicles that are turning.
If you put your vehicle in the path of a turning vehicle you may be crushed.
Light rail vehicles
When a light rail vehicle is coming towards you, keep to the left unless there is a barrier between you and the light rail vehicle.
Only overtake on the left to pass a light rail vehicle travelling in the centre or on the right hand side of the road.
You should overtake on the right when the light rail vehicle is on the left hand side of the road.
You must not overtake a light rail vehicle on the left if it is turning or signalling to turn left. If it is turning or signalling to turn right, you must not overtake it on the right.
Approach bridges with care as they are often narrow. If you think two vehicles cannot fit on a narrow bridge, give way to the other driver.
When you come to a bridge which is wide enough for only two vehicles, slow down and drive carefully. Sometimes you are not allowed to overtake a vehicle going in the same direction or to pass a vehicle coming towards you.
The following signs tell you what to do:
You must give way to any vehicle travelling in the opposite direction on the bridge.
You must give way to any vehicle travelling in the opposite direction on the bridge.
You must not overtake any vehicle travelling in the same direction.