text:
|Publication number
|Publication type
|Application number
|Publication date
|May 7, 1985
|Filing date
|Feb 26, 1982
|Priority date
|Feb 26, 1982
|Fee status
|Publication number
|James A. Kenemuth
|Original Assignee
|Prentice Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (3), Non-Patent Citations (4), Referenced by (25), Classifications (8), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
1. Field of the Invention
The present invention relates generally to data communication techniques and more particularly to new data compression techniques for use in improving the efficiency of data transmission.
2. Discussion of the Prior Art
Numerous techniques and systems have been developed heretofore for improving the efficiency of data storage or transmission of data between remote points. Notable among such systems are those which represent "characters" (letters, numerals, symbols) by codes, such as that developed by the American Standards Code For Information Interchange (ASCII), which generally are of equal length to all characters. In a character based data communications environment, however, not all possible characters appear with equal frequency. It is therefore inefficient to assign codes of equal length to all characters (like ASCII codes) in such an environment. A communications processor cannot in general known ahead of time what the frequency distribution of characters to be transmitted will be. It cannot make a preliminary pass through a data stream in order to determine the frequency distribution by which to assign codes. Moreover, since it must be ready to transmit the code or a particular character with minimal delay, this rules out the possibility of allowing the processor to accumulate data and encode it before beginning transmission. Therefore, in order to be highly efficient, a compression technique for use in a data communications environment must be predictive and adaptive. It should be able to predict the best code assignments for all possible characters based upon the distribution of characters which have already been transmitted. It should be able to detect changes in the frequency distribution of characters in a data stream and adapt its coding scheme accordingly. Furthermore, these functions must be accomplished with minimal down loading of coding information to the receiving processor which must decode the encoded transmission. The technique should be simple enough that it can be implemented on a eight bit microprocessor and it must work with sufficient speed that it can operate in a real time data communications environment.
It has been proposed, therefore, to compress character based and like data by one of two basic techniques. The first is known as "run length coding" as exemplified by the U.S. Pat. Nos. 4,124,870, issued Nov. 7, 1978, to B. R. Shatz, et al and 4,150,400, issued Apr. 17, 1979, to K. Y. Wong, while the latter is known in the art as the delta encoding technique as exemplified by U.S. Pat. No. 3,524,926, issued Aug. 18, 19790 to A. T. Starr, et al. Another example of data bit compression in conjunction with the facsimile transmission of alphanumeric characters can be found in U.S. Pat. No. 4,151,562, issued Apr. 24, 1979, to J. L. Tregay, while U.S. Pat. No. 4,131,915, issued Dec. 26, 1978, to Y, Nakagome, et al, discloses a facsimile signal transmission system which uses dummy codes to increase the number of bits of variable length codes to make the codes longer than a reference bit number predetermined in consideration of the subscanning time at the receiving side of the system.
It is also known in digital message transmission systems in which an analog speech or video signal is converted to a digital pulse train by a technique known as differential pulse code modulation (DPCM). This technique periodically samples the incoming signal and quantize the difference between each pulse sample and a prediction of it based on past samples' values prior to coding the pulse train for transmission. Examples of this technique can be found in U.S. Pat. Nos. 3,772,682, issued Nov. 13, 1973, to J. L. Flanagan, 3,931,596, issued Jan. 6, 1976, to A. Gersho, and 4,206,447, issued June 3, 1980, to Y. W. Ching, et al.
It is a principal objective of the present invention to provide a new data compression scheme which is both predictive and adaptive and which substantially reduces the volume of data which must be transmitted between synchronized remote transmitted and receiver or source and storage media.
Briefly, in accordance with the present invention, a technique is provided for encoding data which can be used in conjunction with a transmitter which creates codes as a function of a character based input data stream, such that the encoding of the characters is of a bit length which is an inverse function of the frequency of appearance of the characters in a sample of characters preceding a specific character being encoded. A data link can be employed in a conventional manner for receiving the characters thus encoded and carrying the codes to a receiver connected to the data link wherein the codes will be decoded back to a character based stream. In order to generate codes of each character of a bit length which is an inverse function of the frequency of appearance of the character in a sample of preceding characters, a histogram is compiled based on the characters in the sample and is used as a basis for determining the probability of occurrence of a particular character and subsequently generating a variable length code based on such probability.
Among the advantages of the present invention is that it provides a compression technique which can operate on a real time basis.
Another advantage of the present invention is that it can be implemented using presently available micro-processing equipment.
These and other objects and advantages of the present invention will no doubt become apparent to those of ordinary skill in the art after having read the following detailed description of the preferred embodiments which are illustrated in the several figures of the drawing.
FIG. 1 is a block diagram showing a data transmission system in which encoders and decoders according to the present invention may be employed;
FIG. 2 is a block diagram showing an encoder according to the present invention;
FIG. 3 is a block diagram showing a portion of the encoder of FIG. 2;
FIG. 4 is a block diagram showing a portion of FIG. 3 which compiles a histogram of a sample of proceeding characters in accordance with the present invention;
FIG. 5 is a block diagram showing another portion of the part of the encoder shown in FIG. 3;
FIG. 6 is a schematic diagram showing a gating circuit which can be used in the part of the encoder shown in FIG. 3;
FIG. 7 is a block diagram showing another portion of the encoder as illustrated in FIG. 2;
FIG. 8 is a block diagram showing still another portion of the encoder as illustrated in FIG. 2;
FIGS. 9a and 9b are block diagrams showing a decoder according to the present invention;
FIG. 10 is a block diagram showing a part of the decoder of FIGS. 9a and 9b; and
FIG. 11 is a block diagram showing another portion of the decoder of FIGS. 9a and 9b.
In accordance with the present invention, a method in provided wherein codes are assigned to each character to be transmitted such that the more frequently a character appears in the data the shorter its code will be. As a result the data is effectively compressed and consequently can be transmitted more quickly than would otherwise be possible. Moreover, the compression reduces the channel bandwidth required for transmission; a characteristic which is important in the case where a channel's bandwidth is shared by several data streams as in, for example, a statistical multiplexer system. The system works by being able to detect changes in the frequency distribution of characters in the data stream to be transmitted and adapting its coding scheme accordingly. In accordance with the present invention, a "sample window" is established by dynamically storing the last M characters appearing in the input data stream. Thereafter, as each character is received, a code representative thereof is generated on the basis of the characters already appearing in the sample window. This approach is based upon the assumption that the frequency distribution of characters in the sample window at a given time is probably a good prediction of the distribution of characters which will follow in the data stream. Accordingly, the larger the sample window the more accurate the prediction is likely to be and consequently the better the coding efficiency. After the code for the most recent character has been generated, the character is added to the end of the sample window and the first character in the window, i.e., the character which appeared in the data stream M characters ago is removed. The sample window is thus updated on a character-by-character basis. This allows the coding scheme to adapt quickly to changes in the character frequency distribution since characters representing the old distribution are continuously replaced by new characters. This process also avoids the problem of having to transmit coding information to the decoder at the channel's receiving end. This is possible because the decoder can always decode the next character on the basis of its current sample window and then update the window so that it looks like the encoder's window by simply including the decoded character. In accordance with the present invention, a sample window of length M is selected. If then k is used to represent an element in the set of all possible data characters to be transmitted, a histogram table n(k) is defined which contains for every possible character, the number of times the character appears in the sample window. Thus, ##EQU1##
The probability p(k) of a character appearing in the data stream is defined as the ratio of the number of occurrences of the character to the total number M of characters in the sample window. Thus, ##EQU2##
For a character k appearing in the sample window (for which n(k)≠0) if p(k) is greater than or equal to 1/2 a one bit binary code can be assigned since there can be at most two such characters. If p(k) is greater than or equal to 1/4 then a two bit binary code can be assigned since there can be at most four such characters. If p(k) is greater than or equal to 1/8 then a three bit binary code can be assigned since there can be at most eight such characters, and so on. In general, therefore, a character k is assigned a code of bit length β(k) where β(k) is the smallest possible integer such that: ##EQU3##
From equation 3, the above gives the condition: ##EQU4##
This is a condition which must be satisfied by any instantaneous binary prefix code; that is, a code which may be decoded one bit at a time.
Because of the inperfect ability of the sample window to predict subsequent characters in the incoming data stream, a code may need to be generated for a character which does not appear in the sample window. In this case, n(k)=0. Thus, the probability of such a character appearing, as defined in equation 3, is: p(k)=0. So, equation 5 may be satisfied only by a code of infinite length, since ##EQU5##
This problem may be avoided by noting that it arises from the possibility that for all characters which do appear in the sample buffer, the condition set forth in equation 6 may be satisfied in the equality: ##EQU6##
This will leave no "coding resources" with which to generate codes for characters not appearing in the sample window. Therefore, now redefine the probability set forth in equation 3 as: ##EQU7##
For fairly large values of M, this represents a small change in the sample window's predictive capability. But, it guarantees that: ##EQU8##
Thus, there can be at most one character with p(k)>1/2, at most 3 characters with p(k)>1/4, at most 7 characters with p(k)>1/8, and so on. So, if for characters appearing in the sample window we continue to assign codes of length β(k) according to equation 5, then equation 10 gives: ##EQU9##
This guarantees that some coding resources are left over with which to generate codes for characters not appearing in the sample.
Next, a "power of two frequency" q(k) can be defined for a given character k as follows:
If p(k)≠0, define q(k) as the largest fraction<p(k) which is an integer power of two. Thus: ##EQU10##
If p(k)=0, define q(k) as q(k)=0.
Now define a table that is a function of q which contains, for each possible value of q(k), a count of the number of distinct characters with that q(k). Note that: ##EQU11## where Rk is the radix of the character set.
Next, define Ω(k) as the fractional coding resources taken by all characters with a power of two frequency greater than q(k) for a given character. Thus, ##EQU12##
Now, define a character index i(k) as follows:
Let the set of η(q) characters with power of two frequencies=q(k) be an ordered set, alphabetically, for example. Define i(k) to specify the position of the character k in this ordered set such that the index i(k) is an integer value of modulo η(q). The range of i(k) is defined to be:
0≦i(k)≦η(q)-1 (15)
The bit length β(k) for a code is defined as follows:
If q(k)≠0, define (k) as:
β(k)=-log2 q(k) (16)
If q(k)=0, define β(k) to be the smallest integer such that:
η(0)�2-β(k) +Ω(k)≦1 (17)
Note that this is equivalent to the condition set forth in equation 6.
Lastly, define the code for the character k to be the first β(k) bits to the right of the decimal point in the fractional sum:
σ(k)=i(k)�2-β(k) +Ω(k) (18)
Since from equation 15 we have i(k)<η(g), the conditions set forth in equation 6 insures that σ(k)<1. This means that all bits to the left of the decimal point are 0 are thus unnecessary. From equation 14, all bits less significant than 2 to the minus β(k) power in σ(k) are always 0, and therefore they are also unnecessary.
The decoding procedure is basically the reverse of the encoding. Recall that the code generator updates the sample window only after a character has been encoded. Therefore, when the decoder begins to receive a code its sample window is identical to the one used by the encoder to generate the code. Accordingly, if we know the β(k) of a code σ(k) we may regenerate the encoded character as follows:
First, compute the power of 2 frequency q(k) by reversing the process used in equation 16 and 17. This will specify which power of 2 frequency set the encoded character is in. Next, use equation 14 to compute the corresponding value of Ω(k). Then the index of the character may be obtained by using equation 18 as follows:
i(k)=[σ(k)-Ω(k)]2.sup.β(k) (19)
In general, however, the decoder cannot know ahead of time the length of an incoming code. So, it is necessary to make a guess of a code length of β' (k') bits. From this, the hypothetical power of 2 frequency q'(k') may be computed. In turn, Ω' (k') may be computed from q'(k'). So, the hypothetica index i'(k') may be computed as in equation 19 as follows:
i'(k')=[σ(k)-Ω'(k')]2.sup.β'(k') (20)
Substituting equation 18, this gives a result of:
i'(k')=i(k)2.sup.[β'(k')-β(k)] +[Ω(k)-Ω'(k')]s.sup.β'(k') (21)
If the above guess is correct, then β'(k)'=β(k), and q'(k')=q(k), giving Ω'(k')=Ω(k). Equation 21 then reduces to i'(k')=i(k), and the encoded character may be regenerated as an equation 19.
Suppose however, that the guess is incorrect, such that β'(k') is less than β(k). Then, q'(k') is greater than q(k), with the minimum value of q(k) being zero. Therefore, q'(k') is not equal to zero, and from equation 16 is obtained:
q'(k')=2-β'(k') (22)
From equation 14:
Ω(k)-Ω'(k')≧q'(k')�η'(q') (23)
and so, in this case:
Ω(k)-Ω'(k')≧η'(q')2-β'(k') (24)
Equation 21 thus reduces to:
i'(k')≧i(k)2.sup.[β'(k')-β(k)] +η'(q') (25)
and, since the smallest value of i(k) is, from equation 15, i(k)=0, this may be written:
i'(k')≧η'(q') (26)
but, from equation 15, i'(k') must satisfy the condition:
i'(k') η'(q'), which contradicts the result in equation 26 above. Thus, no character may be regenerated by an incorrect guess, so long as β'(k')<β(k). In this manner, the decoder can detect when it has made an incorrect guess and then make another guess with a longer code length, and so on, until the condition i'(k')<η'(q') is satisfied, indicating the end of the code.
The general procedure for decoding an incoming code is, thus to start with β'(k')=1, this being the shortest possible code, and then computing i'(k') from the β'(k'). If i'(k') satisfies the condition i'(k')<η'(g'), then the end of the code has been reached and the encoded character may be regenerated. Otherwise, let β'(k')=β'(k')+1, and repeat the computation of i'(k') from β'(k') either until the correct β'(k') is found, or until the power of 2 frequency corresponding to β'(k') goes to q'(k')=0. If q'(k') goes to 0, the correct code length may immediately be computed using the condition:
η'(0)�2-β'(k') +Ω'(k')≦1, (27)
for characters not in the sample window, as set forth in equations 16 and 17. If it happens that i'(k')<η'(g') is still not satisfied, then this is a fatal error indicating that a transmission error has caused the decoder to lose syncronization with the encoder; that is, their sample windows are no longer identical.
We turn now to considerations in the implementation of the present invention. Specifically, a discussion shall be set forth regarding the suitability of the above theoretical considerations for use with a conventional 8 bit microprocessor.
Suppose we choose a sample window length of M=255 characters. Then the sample window may conveniently be represented in a 256 byte block, with one byte serving as a pointer to the beginning of the sample window. In addition, from equation 9, the probability becomes: ##EQU13##
The probability may, therefore, be represented as an 8 bit byte simply containing n(k), with the decimal point moved to the left of the most significant bit of the byte. This means the probability may be taken directly from the histogram n(k) without the need for any cumbersome fixed point division operations. The power of 2 frequency q(k) corresponding to p(k) is then simply the value n(k) with all bits following the most significant non-zero bit set to zero.
For q(k) not equal to zero, the bit length ##EQU14## may be obtained from the count of +1 of the number of zero bits to the left of the most significant non-zero bit of n(k). So, the maximum bit length of a code, when q(k)≠0, is β(k)=8. Note too, that with an ASCII character set, allowing for all possible parity types, the radix is Rk =256. So, from equation 13 we are guaranteed that all n(g) fit into 8 bits. Further, from the discussion following equation 10 and from equation 14 we see that the value Ω(k) will always fit into 8 bits as well. Therefore, it is concluded that this data compression technique is fairly well suited to implementation using an 8 bit microprocessor with only simply logic and data manipulation operations.
The principle exception to the above arises in the case q(k)=0. In this instance, β(k) must be determined by
η(0)�2-β(k) +Ω(k)≦1 (30)
Which may give bit lengths β(k) greater than 8, and thus involve fractions with more than 8 significant bits. In this case, some 16-bit operations would be desirable. Note that since η(g) and Ω(k) both fit into 8 bits, the expression above indicates that no code for a character not in the sample window ever needs to be more than 16 bits in length.
The discussion will now direct itself to the suitability of the present invention to real-time environments.
The limit to the speed at which the instant data compression technique can be used is determined primarily by three processes. First, Ω(k) is calculated by summing several terms. For example, if a sample window length of M=255 is used as set forth above, then the worst case number of terms is 8. Each term involves a table look up and suitable scaling operations to form a product of the form q�η(q). Second, β(k) is calculated for the condition q(k)=0. This involves repeated scaling and test operations. As discussed above in conjunction with equation 30, these operations may require more than 8 bits of precision, and may be time consuming if not efficiently implemented on a 8 bit microprocessor.
Lastly, i(k) is calculated by counting the number of characters preceding k in the ordered set of characters that have power of 2 frequencies equal to q(k). If all Rk possible characters have equal probability, this calculation would require Rk operations. Within an ASCII character set, allowing for all possible parity types as discussed above, could in the worst case involve 256 operations to determine i(k). Each operation would involve the computation and comparison of a character's power of 2 frequency. Therefore, this calculation is potentially the most time consuming. As discussed above, however, most of these calculations can be performed with simple logic and data manipulation operations capable of being executed quickly by a conventional microprocessor. Accordingly, although it may require a significant portion of a microprocessor's computing power, the present technique is relatively well suited to the real-time environment. All that need be determined are speed limitations of a particular implementation, the speed versus cost tradeoffs involved, and a determination of actual coding efficiency improvements.
The construction and operation of a preferred embodiment of a system capable of carrying out the instant technique in a real-time environment will now be discussed.
Referring more particularly to FIG. 1 of the drawings, there is shown a transmitter 110 incorporating an encoder 112 according to the present invention. The output from tranmitter 110 goes to a data link 114 which in turn carries the data to a receiver 116 incorporating a decoder 118 according to the present invention. While transmitter 110, data link 114 and receiver 116 are generally of conventional construction which will not be described in great detail herein, the details of construction of encoder 112 and decoder 118 will be described below.
Referring now to FIG. 2, encoder 112 is illustrated as comprising a code generator 210 and a bit length determining unit 212 arranged in parallel so as to receive a common character base input data stream 214 representing a plurality of characters k. Code generator 210 is disposed for performing calculations on stream 214 so as to develop a code for each character the length of which is an inverse function of the frequency of the character in a sample of preceding characters. Bit length determining unit 212 is arranged for determining the number of bits of a code for each character as developed by code generator 210 that will form an actual code for a specific character k.
Included in code generator 210 is a fractional coding resources unit 216 and a character index unit 218 connected in parallel with respect to stream 214 for receiving a data input therefrom. The output of character index unit 218 is connected to a scaler 220 to which also is fed the output 222 from bit length determining unit 212. The output from scaler 220 together with the output from fractional coding resources unit 216, which also goes into bit length determining unit 212, are fed in parallel to a summing unit 224.
The output 226 from summing unit 224 which output represents the code per character [σ(k)], is fed in parallel into a shift register 228, the enable input to which is the output from a down counter 230 and a comparator 232. Down counter 230 receives the output from bit length determining unit 212 and outputs it as β'(k) and then successively decrements the output value while comparator 232 compares this function β'(k) with an input 234 signal representing zero to determine if β'(k) is greater than zero and permitting only signals in the latter category to enable shift register 228. The serial output of shift register 228 is a code for a particular character k.
FIG. 3 illustrates schematically the details of fractional coding resources unit 216. Receiving the incoming data stream 214 is a histogram forming unit 310 to be described below and the output of which is fed into a divider 312 which determines the probability of occurrence of a given character k. The output from divider 312 is fed into a power of 2 frequency determining unit 314. As will be discussed below, the effect of divider 312 is to form a binary fractional frequency of the histogram determined in unit 310, while unit 314 merely changes to zero all bits to the right of the most significant "1" bit appearing in such binary fraction.
The output of unit 314 is fed into a comparator 316, the output 318 of which is enabled only for those power-of-2 frequencies q' greater than q(k) fed into comparator 316 from unit 314. This is accomplished by feeding the output 318 to enable a divide-by-2 shift register 320 having an input 322 representing qmax =1/2. The output from register 320 represents q' and is fed via line 324 to the other input of comparator 316, such that the latter can enable output 318 only for q' greater than q(k) as received from unit 314. The line 324 also forms an input to a table forming unit 326, the output of which is fed to a scaler 328. The latter also receives the output of register 320, that is q', so as to form an output q'�η(q') which is fed to one of the inputs of a summing unit 330. The output of unit 330 goes to a latch 332 so that the outputs of scaler 328 are successively summed by unit 330 until the condition q'>q(k) is no longer satisfied and comparator 316 no longer enables output 318. Latch 332 permits the successive summing of the outputs of 328, with latch 332 being enabled by 318. Following disablement of 318, latch 332 outputs a signal Ω(k), which is alse fed via line 334 to the other input of summing unit 330.
Line 336, which is designated "initialize," is typical for initializing circuits of encoder 112 in a known manner and in this case is in response to a request from data stream 214 indicating the presence of a character.
Referring now to FIG. 4, histogram forming unit 310 has a sample window unit 410 formed by a conventional serial and parallel shift register 412. The data stream 214 is fed serially into register 412, with the first-in character being designated 414 and the last-in character being designated 416. Register 412 is shifted after a code for each character in stream 214 is determined. The latter are fed to parallel comparators 418', 481", . . . 418n. There will be one such comparator 418, and sequence, for the number of different characters which are possible in data stream 214. Thus, if the last-in character 416 is a k2, for example, it will be gated through comparator 418". In a like manner, the serial output from the register 412, representing the content of the first-in character 414 when register 412 was last shifted serially, are fed to a plurality of parallel comparators 420', 420", . . . 420n. The output from each of these comparators 418 and 420, and sequences, are fed to respective up and down sides of an associated one of a plurality of up/down counters 422' , 422", . . . 422n. The output from these counters 422, and sequence, is fed into a conventional multiplexer or data selector 424 which in effect forms a table of the frequency history of the sample contained in shift registers 412. This data can be gated out of data selector 424 by use of a control 426 which selects a certain character "x" as desired.
FIG. 5 illustrates schematically the details of table forming unit 326. This circuit forms a table for look up purposes which is defined above an η(y), where Y is a set of all possible power-of-2 frequencies [1/2, 1/4, 1/8, . . . , .0.].
Unit 326 comprises an up counter 510 arranged for successively outputting the set of all possible characters beginning with the first character in the set k1. The output 512 of counter 510 is branched, with one fork going to one input of a comparator 514, and the other input of which is the radix character of the set. The output 518 from comparator 514, being K'<KR.sbsb.k, is returned to counter 510 for enabling same. Counter 510 and comparator 514 cooperate to form a character sequence generator 520. The other fork of output 512 goes to data selector 424 wherein data for the particular character in counter 510 is selected from that compiled by unit 310. Divider 312' and 314' are duplicates of divider 312 and unit 314 and perform the same operations on the output of data selector 424.
The output from unit 314' is fed to a parallel set of comparators 520', 520", 520'", . . . , and 520n. One connection to these comparators is made by the line 522 leading from unit 314', while the other inputs, designated 524', 524", 524'", . . . , 524n, represent the members of the set Y as defined above. The output from these comparators 520' and sequence, such ouput representing the members of the set Y, are connected to respective counters 526', 526", 526'", . . . , 526n. The latter are up counters which are only gated by the presence of a signal for the member of the set Y with which the specific counter is associated, and which feed their output signals to a multiplexer or data selector 528. Control 530 of this data selector 528 represents the selecting member of set Y, with the output 532 being η(y).
FIG. 6 discloses a circuit for the power of 2 frequency determining unit 314. As illustrated, this circuit includes, for example, four input lines, although the number may vary, ranging from the most significant bit line 610 through lines 612 and 614 to the least significant bit line 616. The output includes the line 610 as well as three lines extending from the outputs of AND gates 618', 618", and 618'". The line 612, 614 and 616 form one input to each of these gates, while the other input to gate 618' is a NOT gate 620 connected to line 610. The other input to gate 618" is a NOR gate 622' having inputs connected to line 610 and 612, and in a similar manner a NOR gate 622" forms the other input to gate 618'" and has its inputs connected to lines 610, 612 and 614. As will be appreciated, this circuit requires that as soon as one of the four bits ranging from 610 to 616 is a "1", all subsequent, or less significant, bits will be made zero.
FIG. 7 illustrates schematically the character index unit 218. The input to this unit is the character data stream 214 which divides into two branches. One branch cooperates with the output 710 of an up counter 712 to form the inputs to a comparator 714. The output of comparator 714, which represents k' less than k, enables the counter 710, the input to which is the same as that to counter 510 and the output of which is k'. The output of counter 712 and the other branch of the input stream 214 are fed to the control 426 of data selector 424 and to the unit 310, respectively, so as to obtain the respective outputs q(k') and q(k). The latter outputs form the inputs to a comparator 716, whose output in turn is the equality q(k') equals q(k) and forms the input to an up counter 718 the output of which is the character index i(k).
Finally, we come to the bit length determining unit 212 as illustrated in FIG. 8. The signal representing Ω(k) is fed from unit 216 to one input of a summing unit 810 the other input to which is the output of a divider/shift register 812. The latter has as its input the signal representing η(.0.) received from 526". The output of the summing unit 810 forms one input to a comparator 814, to other input 816 of which represents the value 1. Accordingly, the output 818 of comparator 814 enables shift register 812 and an up counter 820, the output of which is β'(k). The latter output forms one of the inputs to a multiplexer or data selector 822, the other input to which is the output of unit 314 fed through a priority encoder 824 so as to give a signal as defined by equation 16 set forth above. The output from unit 314 also is connected by line 826 to data selector 822 to form a control therefore, with the output of selector 822 being β(k).
Priority encoder 824 can be of a conventional construction, similar to those TTL encoders designated type SN 54147, and the like, which insure that only the highest-order data line is coded.
The operation of the encoder 112 will now be discussed.
For simplicity, this discussion will be based on a character set of 16 possible characters A-P, and shall refer to the following table:
______________________________________k n(k) p(k) q(k) Ω (k)______________________________________A 3 ..0..0.11 ..0..0.1.0. ..0.1.0..0.B .0. ..0..0..0..0. ..0..0..0..0. .1.0.11C .0. ..0..0..0..0. ..0..0..0..0. .1.0.11D .0. ..0..0..0..0. ..0..0..0..0. .1.0.11E 6 ..0.11.0. ..0.1.0..0. ..0..0..0..0.F 1 ..0..0..0.1 ..0..0..0.1 .1.0..0..0.G .0. ..0..0..0..0. ..0..0..0..0. .1.0.11H .0. ..0..0..0..0. ..0..0..0..0. .1.0.11I .0. ..0..0..0..0. ..0..0..0..0. .1.0.11J 1 ..0..0..0.1 ..0..0..0.1 .1.0..0..0.K .0. ..0..0..0..0. ..0..0..0..0. .1.0.11L .0. ..0..0..0..0. ..0..0..0..0. .1.0.11M 3 ..0..0.11 ..0..0.1.0. ..0.1.0..0.N 1 ..0..0..0.1 ..0..0..0.1 .1.0..0..0.O .0. ..0..0..0..0. ..0..0..0..0. .1.0.11P .0. ..0..0..0..0. ..0..0..0..0. .1.0.11______________________________________k β(k) i(k) σ(k) code______________________________________A 3 .0. ..0.1.0..0..0. .0.1.0.B 5 .0. .126.96.36.199. 220.127.116.11.C 5 1 .1.0.111 1.0.111D 5 2 .11.0..0..0. 11.0..0..0.E 2 .0. ..0..0..0..0..0. .0..0.F 4 .0. .1.0..0..0..0. 1.0..0..0.G 5 3 .11.0..0.1 11.0..0.1H 5 4 .220.127.116.11. 188.8.131.52.I 5 5 .11.0.11 11.0.11J 4 1 .1.0..0.1.0. 1.0..0.1.0.K 5 6 .111.0..0. 111.0..0.L 5 7 .111.0.1 111.0.1M 3 1 ..0.11.0..0. .0.11N 4 2 .22.214.171.124..0. 126.96.36.199.O 5 8 .1111.0. 1111.0.P 5 9 .11111 11111______________________________________
The histogram forming unit 310 creates a histogram table n(k) which contains the number of times each possible character appears in the sample window unit 410. Note that the sum of all elements of n(k) gives the sample window length M; in this case M=15.
Since M=15, the probability, p(k), associated with a character is: ##EQU15## which is simply the binary representation of n(k) with the decimal point shifted left four places in unit 312. Next, the power of 2 frequency q(k) is obtained from p(k) by simply setting to zero in unit 314 all bits to the right of the most significant non-zero bit. Recall that the table η(q) contains the counts of the number of characters with each of the possible power of 2 frequencies q(k):
______________________________________TABULATE______________________________________η(.1000) = 0η(.0100) = 1η(.0010) = 2η(.0001) = 3 η(.0000) = 10______________________________________
The value of Ω(k), determined in unit 216, is obtained from the sum: ##EQU16## for characters with q(k)=0.0100 this becomes: ##EQU17## for characters with q(k)=0.0010: ##EQU18## for characters with q(k)=0.0001: ##EQU19## for characters with q(k)=0.0000: ##EQU20##
For characters with q(k)≠0 the code bit length (k) as determined in unit 212 is obtained from: ##EQU21##
For q(k)=0, (k) is obtained from the condition ##EQU22##
Note that multiplying η(0) by 2-β(k) is equivalent to shifting the binary value η(0.0000)=1010β(k) places to the right. Using Ω(k)=0.1011, we see that for β(k)=5: ##EQU23## which satisfies the condition above exactly; therefore, β(k)=5 for q(k)=0.0000. Note that if β(k)=4, the result is: ##EQU24## which does not satisfy the condition set forth above. So, β(k)=5 is the smallest code bit length for characters not appearing in the sample.
The character index i(k) is obtained in unit 218 by dividing the character set into the subsets of characters with the same q(k), ordering them alphabetically, in this case, and numbering the elements of each subset beginning with .0.:
______________________________________ char. i(k)______________________________________q(k) = .0.1.0..0. { E .0. A .0.q(k) = ..0..0.1.0. M 1 F .0.q(k) = ..0..0..0.1 J 1 N 2 B .0. (41) C 1 D 2 G 3q(k) = ..0..0..0..0. H 4 I 5 K 6 L 7 O 8 P 9______________________________________
The value of the code per character σ(k) is obtained form the equation
σ(k)=i(k)�2-β(k) +Ω(k) (42)
This may be computed by shifting the binary value i(k) to the right β(k) places in scaler 220 and then adding Ω(k). For example, for the character k=M, the result is: ##EQU25##
Shifting i(k) three places to the right gives 0.001, and adding Ω(k) in unit 224 gives σ(k)=0.01100.
The actual code for a character is finally obtained by taking the β(k) most significant bits of the result σ(k) in register 228; that is, the first β(k) bits to the right of the decimal point. For example, for the character M, taking the first β(k)=3 bits of σ(k)=0..0.11.0..0. gives the code .0.11.
Note that no code is a prefix in any other code; therefore, the codes may be decoded "instantaneously", or one bit at a time.
A decoder 118, according to the invention, will be described with references to FIGS. 9a and 9b. In FIG. 9a, an encoded bit stream is received from data link 114 and fed into a shift register 910. The parallel output 912 of register 910, which represents σ', is fed into a character index unit 914 which computes a hypothetical index based on output σ' from register 910, with a signal received from a counter 916, which is a hypothetical bit length, and a decoder 918, which provides a hypothetical power-of-2 frequency. Counter 916 increments one each time same is enabled in a manner to be described below so as to cause the appropriate number of bits to be shifted into register 910 and cause all hypothetical signals to assume their correct values.
The output of decoder 918 is fed to a look-up unit 920, similar to unit 326, which gives a hypothetical η(q'), with the outputs of units 914 and 920 forming inputs to a comparator 922. A scaler 924 receives the output from counter 916 so as to cooperate with a signal representing η(.0.), from 526", to give an output to a summing unit 926 which is combined with an input 928 representing Ω'(0), derived as described below, to give a combined output which forms one of the inputs to a comparator 930. The other input 932 to comparator 930 is the value "1", with the output of this comparator 930 being true when the output of 926 is less than or equal to one. The outputs of comparators 922 and 930 form the inputs to a multiplexer or data selector 934 which is controlled by the output of decoder 918 and the output of which enables register 910 and counter 916.
The outputs of unit 914 and decoder 918, once stable, from the inputs to the portion of decoder 118 shown in FIG. 9b. The output from unit 914, that output representing the character index i(k), is fed into a down counter 936 the output of which forms one input to a comparator 938. The other input 940 to comparator 938 represents zero, such that the output of comparator 938 represents i' not equal to zero and forms the enabling input to an up counter 942. The input 944 to counter 942 is the first character in the character set, k1, and the output of counter 942 represents k'. Although not shown in detail, the decoder 118 includes a histogram forming unit 310" similar to that designated 310 for the encoder and including a data selector 424', as well as a probability determining divider 312" similar to 312 and a power-of-2 frequency unit 314" similar to 314. The output of counter 942 forms input 426' to selector 424'. The other input 948 of comparator 946 receives the output of decoder 918, with the output 950 of the comparator 946 being the equality q(k')=q(k) and forming the enabling signal for down counter 936.
The output of up counter 942 also represents the decoded character k whenever comparator 946 no longer enables down counter 936.
Referring now to FIG. 10, the construction of a character index unit 914 is illustrated wherein a coding resources unit 1010 receives a signal from the decoder 918 and is gated by same to send a signal to one of the inputs of a subtract unit 1012. The other input to unit 1012 is the output, σ', from shift register 910 as represented by line 912. The output from subtract unit 1012 is sent to a scaler 1014 together with the output β' from up counter 916.
FIG. 11 illustrates schematically the coding resources unit 1010. A comparator 1110 receives an input from 918 and has its output 1112 enabling a divider/shift register 1114. The input 1116 to the latter represents qmax =1/2, with the output representing q' and being fed via line 1118 to the other input of comparator 1110. The output of shift register 1114 is also fed into table forming unit 920 and to a scaler 1120 which also receives the output of unit 920. The output 1122 of scaler 1120 represents q' η(q') and forms one input to a summing unit 1124 the output of which is fed to a latch 1126. The output 1128 of latch 1126 is both the other input to summing unit 1124 and is the output of the unit representative of Ω(k).
Although the above description has been directed to a single preferred embodiment of the present invention, it is contemplated that numerous alterations and modifications thereof will become apparent to those skilled in the art after having read this disclosure. It is therefore intended that the following claims be interpreted as covering all such alterations as fall within the spirit and scope of the invention.
|Cited Patent
|Filing date
|Publication date
|Oct 3, 1966
|Feb 2, 1971
|Xerox Corp
|Cascade run length encoding technique
|Sep 12, 1977
|Sep 18, 1979
|Xerox Corporation
|Regenerative decoding of binary data using minimum redundancy codes
|Jun 20, 1978
|Oct 14, 1980
|Compagnie Industrielle Des Telecommunications Cit-Alcatel
|Reduced redundancy facsimile transmission installation
|Ismail et al., "Facsimile Compression Using a Classified Adaptive Block/Run-Length Coding Scheme", Conference NTC '80, IEEE National Telecommunications, Houston, TX, USA, Nov. 30-Dec. 4, 1980, p. 3638.
|Ismail et al., Facsimile Compression Using a Classified Adaptive Block/Run Length Coding Scheme , Conference NTC 80, IEEE National Telecommunications, Houston, TX, USA, Nov. 30 Dec. 4, 1980, p. 3638.
|Usubuch et al., "Adaptive Predictive Coding for Newspaper Facsimile", Proceedings of IEEE, vol. 68, No. 7, Jul. 1980, pp. 807-813.
|Usubuch et al., Adaptive Predictive Coding for Newspaper Facsimile , Proceedings of IEEE, vol. 68, No. 7, Jul. 1980, pp. 807 813.
|Citing Patent
|Filing date
|Publication date
|Sep 17, 1985
|Jul 21, 1987
|Compusonics Video Corporation
|Audio and video digital recording and playback system
|Oct 30, 1985
|May 31, 1988
|Microcom, Inc.
|Data telecommunications system and method for transmitting compressed data
|Aug 12, 1986
|Jul 5, 1988
|Compusonics Video Corporation
|Audio and video digital recording and playback system
|Jun 19, 1989
|Jan 29, 1991
|Chevion Dan S
|Data string compression using arithmetic encoding with simplified probability subinterval estimation
|May 31, 1988
|Jun 25, 1991
|Microcom Systems, Inc.
|Data telecommunications system and method for transmitting compressed data
|Feb 1, 1991
|Oct 8, 1991
|Bell Communications Research, Inc.
|High-speed feedforward variable word length decoder
|Nov 20, 1992
|Oct 18, 1994
|International Business Machines Corporation
|Adaptive computation of symbol probabilities in n-ary strings
|Jul 21, 1994
|Oct 31, 1995
|Stac Electronics, Inc.
|Data compression apparatus and method
|Dec 6, 1994
|Apr 9, 1996
|Stac Electronics, Inc.
|Data compression apparatus and method
|Jul 7, 1995
|Jul 2, 1996
|Stac Electronics, Inc.
|Data compression apparatus and method using matching string searching and Huffman encoding
|Mar 3, 1997
|May 5, 1998
|Fujitsu Limited
|Data processing apparatus and data processing method
|Mar 23, 1995
|Aug 11, 1998
|Intel Corporation
|Ordering corrector for variable length codes
|Nov 28, 1995
|Sep 1, 1998
|Canon Kabushiki Kaisha
|Decoding apparatus and method
|Dec 4, 1997
|Nov 24, 1998
|Canon Kabushiki Kaisha
|Huffman coding/decoding using an intermediate code number
|Nov 26, 1997
|May 9, 2000
|Sony United Kingdom Limited
|1-bit signal processing system
|Feb 26, 1998
|Jun 13, 2000
|Research In Motion Limited
|Block-wise adaptive statistical data compressor
|Dec 24, 1997
|Apr 17, 2001
|Telefonaktie Bolaget L M Ericsson
|Method for encoding data
|Sep 9, 1998
|Jun 18, 2002
|Canon Kabushiki Kaisha
|Encoding/decoding device
|Jun 25, 1999
|May 6, 2003
|Microsoft Corporation
|Arithmetic coding and decoding methods and related systems
|May 21, 2001
|Jun 29, 2004
|International Business Machines Corporation
|Method and system for compression of a set of mostly similar strings allowing fast retrieval
|Oct 21, 2002
|Aug 23, 2005
|Agilent Technologies, Inc.
|Waveform complexity detector
|Jan 24, 2011
|Apr 29, 2014
|Harlan J. Brothers
|Data-conditioned encryption method
|May 21, 2001
|Nov 28, 2002
|International Business Machines Corporation
|Method and system for compression of a set of mostly similar strings allowing fast retrieval
|Oct 21, 2002
|Apr 22, 2004
|Allen Montijo
|Waveform complexity detector
|Aug 11, 2011
|Brothers Harlan J
|Data-conditioned encryption method
|U.S. Classification
|375/259, 375/257, 375/240, 341/107, 341/67
|International Classification
|Cooperative Classification
|European Classification
|Feb 26, 1982
Owner name: PRENTICE CORPORATION, 266 CASPIAN DRIVE, SUNNYVALE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:KENEMUTH, JAMES A.;REEL/FRAME:003978/0417
Effective date: 19810826
|Jun 18, 1986
Owner name: BANK OF AMERICA NATIONAL TRUST AND SAVINGS ASSOCIA
Free format text: SECURITY INTEREST;ASSIGNOR:PRENTICE CORPORATION;REEL/FRAME:004567/0317
Effective date: 19860430
|Jun 20, 1986
Owner name: BANK OF AMERICA NATIONAL TRUST AND SAVINGS ASSOCIA
Free format text: SECURITY INTEREST;ASSIGNOR:PRENTICE CORPORATION;REEL/FRAME:004562/0868
Effective date: 19860430
|Dec 6, 1988
|Maintenance fee reminder mailed
|May 7, 1989
|Lapse for failure to pay maintenance fees
|Jul 25, 1989
|Expired due to failure to pay maintenance fee
Effective date: 19890507


text:
- Horoscopes
- Dear Abby
- Games & Puzzles
- Lifestyle
- Events & Exhibits
- Food & Drink
- Arts & Music
- Movies & TV
Stonington - Pine Point School announced Thursday that Head of School Stephen Bennhoff has stepped down, effective immediately.
The board said Thursday that it and "Mr. Bennhoff agreed that it was in the best interest of the school at this point in time for Mr. Bennhoff to step down from his role. This joint decision was an amicable one between the Board and Mr. Bennhoff. The Pine Point School appreciates deeply Mr. Bennhoff's efforts at the School during his tenure, and we wish him well in his future professional endeavors."
Bennhoff, who came to Pine Point three years ago from Rowland Hall School in Salt Lake City, Utah, could not be reached for comment. He replaced Paul Geise, who resigned after 12 years to be the headmaster of the Stanwich School in Greenwich.
Bennhoff's departure comes one week after the school announced the controversial firing of Susan Kozel, a 35-year staff member who was the head of Pine Point's Lower School. The decision angered some parents and staff members. The board said Thursday the two decisions were not connected.
Middle School Head Diana Owen, who will assume Kozel's duties, has now been named acting head of school. The school said it will immediately begin a search to name an interim head of school and then a permanent head of school, which has 62 staff members and 236 students from preschool to ninth grade.
A Thursday letter co-signed by Bennhoff and Board of Trustees President Jennifer Schwindt, and addressed to the "Pine Point School Community," stated that it was their charge to always act in the short and long-term interests of the school.
They wrote that the past three years have been "a dynamic period in the life of Pine Point" with retirements and hirings, ratification of a strategic plan and the earning of a 10-year reaccreditation from the Connecticut Association of Independent Schools.
The letter said there had also been "the unfortunate yet necessary" elimination of some part-time teaching positions because of smaller number of students, but school finances had stabilized and it can now be proud to offer the highest faculty salaries in the school's history.
"It has been a challenging yet inspiring period in the life of the school, resulting in the increased health of the school and a future that could only be described as bright," the letter states.
"We both believe in Pine Point's current and future strength. Pine Point's commitment to intimate classroom settings, rigorous curriculum, and a robust academic program of arts and athletics makes it the first choice of preschool - 9th grade for students in our region. Whoever is Head of School, our school remains committed to nurturing ethical global citizens who will be positive change-agents of tomorrow," it states.
Sun's Kelsey Bone uses the floor to speak about Olympic 'slight' of Candace Parker
Millstone guards plan vote of no confidence over equipment complaints
Waterford police: Man stole baby formula from two Target stores in past week
UPDATED: Animal rights activists denied access to Kofkoff chicken coop
Sanders, Trump win primary votes in southeastern Connecticut
Accused heroin dealer fails to appear in court after state returns his passport
Maine governor: Workers from India 'worst ones' to understand
UPDATED: Animal rights activists denied access to Kofkoff chicken coop

subset: commoncrawl


text:
Place an Order
24 hours a day / 7 days a week
Customer Service
Monday thru Saturday
5am to 9pm (PT)
6am to 6pm (PT)
Technical problems
Monday thru Friday
7am to 4pm (PT)
Order Status
Returns and Exchanges
Double click on above image to view full picture
Recently Viewed
(based on 118 reviews)
Ratings Distribution
5 Stars
4 Stars
3 Stars
2 Stars
1 Stars
of respondents would recommend this to a friend.
Best Uses
Most Liked Positive Review
very good sander
I bought this sander to refinish a wood floor 8x12 because $30 is cheaper than renting. I had done my living room 12x18 5 years ago so i knew what i was doing. This...Read complete review
I bought this sander to refinish a wood floor 8x12 because $30 is cheaper than renting. I had done my living room 12x18 5 years ago so i knew what i was doing. This sander was very good. The belt tracked perfect out of the box. It is loud so i had to use ear plugs. I thought the belt speed should be a little faster but it did the job fine. Way better than renting. FYI i used 6 120 grit belts, finished with an orbital. good tool, great value
Most Liked Negative Review
Not Bad
Got this during the X-mas Holidays while at my Daughters in San Diego to sand an Old Picnic Table with many layers of paint on it. It has pleanty of power and took off...Read complete review
Got this during the X-mas Holidays while at my Daughters in San Diego to sand an Old Picnic Table with many layers of paint on it. It has pleanty of power and took off all the paint to bare wood with no problems at all and very quickly as well. The Dust bag might as well not even be there so you might want to use it outside only. And toss the sanding belt that came with it and get some good 3M or other brand. It is a bit loud and kind of heavy for it's size but for the price it did a very good job.
Reviewed by 118 customers
Displaying reviews 1-10
Back to top
Previous | Next »
Long lasting
By Bates
from Highland, md
About Me Professional
Comments about Chicago Electric Power Tools 6.5 Amp 3 in. x 21 in. Heavy Duty Belt Sander:
I'm a licensed home improvement contractor and I'm a little hard on tools. I purchased this model sander over 6 years ago. I have sanded everything with this, it's been dropped, it got rained on in my truck and I've ran the thing hours at a time. It still works.
Bottom Line Yes, I would recommend this to a friend
Was this review helpful? Yes / No
- You may also flag this review
Comment on this review
Wow. This little sander is great!
By CRS
from Spartanburg SC
I'm surprised with this sander. Great power. Spent hours leveling/sanding an Oak table top. Never missed a beat.
Great Product
By littlewille
from Dumas Tx.
About Me Avid Do-It-Yourselfer
I have had really good luck with the Chicago Products. I will keep buying them
Great tool for cost
By John
from Littleton, CO
Did everything I hoped it would.
By Jim
from Orlando Fl.
About Me Casual Do-It-Yourselfer
Works great on my coffee table project. Some said the dust bag doesn't work good but I found it to be fine.
Works as advertised!
By Mike
from Clinton Township, MI
Bought the sander to clean up old glue buildup on the back of a white oak board too rough to put through my planer. Even if it fit, I was concerned on the effect on my blades. Sander cut through the glue buildup cleanly, with no grabbing or digging an edge into the board. It took about 10 minutes to finish sand 10 board feet of the oak board. My disk sander with 60 grit sandpaper would not cut through the glue. The only negative was that the sander did not catch must dust. That said, I have never known a sander to catch much dust without connecting to a dust collector or vacuum.
fine tool works well
By cloudy heavens the silversmith
from conchas n.m.
great job sanding, cant ask for a better tool
3in x 21in Belt Sander
By BillyD
from Boston, MA
Works great! Did the job for sanding a dresser. Worth the money.
By Joster
from Pocatello. Idaho
I have used this to sand laminated pine ,seems to cut good no over heating .collects the dust OK . works great for the $27 I paid.
great machine
By the beeman
from northern. va
The staff were very informed on which product to purchase. Also which sanding belts to have on hand for a variety of jobs. Thanks and will return
Most orders will be processed and leave our warehouses within 1-2 business days from the time your order is placed. Orders placed on Saturday or Sunday will be processed on Monday.
*Overweight items are shipped via freight delivery, please allow up to 15 business days for shipping. Standard Ground Shipping rates apply to deliveries within the continental Unites States.
© Copyright 2016 Harbor Freight Tools. All Rights Reserved. MATERIAL AND PHOTOS ON THIS SITE ARE THE COPYRIGHTED PROPERTY OF HARBOR FREIGHT TOOLS AND MAY NOT BE USED WITHOUT THE PRIOR WRITTEN PERMISSION OF HARBOR FREIGHT TOOLS.
Harbor Freight Tools does not endorse any other business or organization or any technique in any customer and/or fan video. Always follow all of the instructions and warnings included with our products. We make no representation or warranty of any kind by including any customer and/or fan video on our website.
LIFETIME WARRANTYLifetime Warranty on Hand Tools! We guarantee our Hand Tools to be free from defects in material and workmanship for the life of the product. Limitations apply.
ABOUT HARBOR FREIGHT TOOLSFounded in 1977, Harbor Freight Tools is the leading discount tool retailer in the U.S. selling great quality tools at "ridiculously low prices" in over 650 stores nationwide and on its website www.harborfreight.com. Harbor Freight Tools stocks over 7,000 items in categories including automotive, air and power tools, shop equipment and hand tools. With a commitment to quality and a lifetime guarantee on all hand tools, Harbor Freight Tools is a favorite of automotive and truck repair shops, government agencies, schools, manufacturers, contractors and tool enthusiasts who want top-quality and great selection and value. The results speak for themselves - with over 30 million customers and thousands of people switching to Harbor Freight Tools every day.


text:
Gerald Stortz
Thursday, August 28, 2008
PERRYVILLE, Mo. — Gerald F. Stortz, 77, of Perryville passed away Aug. 26, 2008, at independence Care Center in Perryville.
He was born Dec. 18, 1930, the son of Fred F. and Pearl C. Smith Stortz.
He is survived by three daughters, Kay (Larry) Schindler, Linda (Jerry) Baughman and Sue Stortz; a sister, Sheila Martens; four grandchildren, Doug and Chris Schindler, Nicole Bilek, Tara Bruckerhoff; and five great-grandchildren. He was preceded in death by his parents; his beloved wife, Betty; and a grandson, Eric Bruckerhoff.
Mr. Stortz was a retired Missouri National Guardsman, serving over 20 years. He was employed by Roziers in their grocery department for over 19 years, following which he purchased the Big Star supermarket and operated it for 11 years. After leaving the retail grocery business he was a real estate agent with Kassel Realty for five years, following which he was affiliated with Miller Brokerage Co. of St. Louis as an account executive calling on major grocery buyers in parts of six states until retiring in 1992. Shortly thereafter he was employed by ConAgra Retail Companies as a prime time executive calling on key accounts in Missouri, Illinois and Arkansas until 1998, when he again retired permanently. He was also grand lodge master at St. Mary Masonic Lodge.
Mr. Stortz was one of the founders of the Perry County Sportsmans Club in 1959 and maintained his membership until his death. He was also a member of the Retired National Guard Association and the American Legion. He also was certified lay speaker in the Methodist Church and filled the pulpit on many occasions.
Mr. Stortz and his wife, Betty, loved to travel and did a lot of it during their younger years. They were in all 50 states and traveled in Europe several times and also to North Africa.
Visitation will be from 4 to 8 p.m. on Friday, Aug. 29, at Miller Family Funeral Home. A Masonic ceremony will be held at 7 p.m.
On Saturday, Aug 30, the family will be receiving friends at the United Methodist Church in Perryville from noon until service at 1 p.m.
Burial will follow in Home Cemetery with graveside military honors courtesy of the American Legion.


text:
The site you are connecting to () is not published by YellowPages.ca™, so we cannot guarantee its availability or take responsibility for its content.
Do you wish to continue?
Were you looking for:Chiropractors DC Clinics Cold & Heat Insulation Contractors Baked Goods Wholesalers Insurance Brokers
Do you wish to continue?


text:
Halloween: Resurrection (2002)
Tickets & Showtimes
Halloween: Resurrection Trailers & Photos
Movie Info
|R (for strong violence, language, some sexuality and brief drug use)
|Directed By:
|Rick Rosenthal
|Written By:
|Larry Brand, Sean Hood
|In Theaters:
|Jul 1, 2002 Wide
|On DVD:
|Dec 10, 2002
|Box Office:
as Freddie Harris
as Nora Winston
as Laurie Strode
as Michael Myers
as Sara Moyer
as Bill Woodlake
as Myles Barton
as Rudy Grimes
as Donna
as Jen
as Jim
as Scott
as Harold
as Nurse Wells
as Nurse Phillips
as Franklin
as Willie
as Aron
as Charley
as Officer
as Officer
as Letter Sweater Guy
as Teen Girl No. 2
as French Maid
as Teen Party Guy
as Professor
as Bob Green
as Fireman
as Oderly
as Coroner
News & Interviews for Halloween: Resurrection
Critic Reviews for Halloween: Resurrection
All Critics (62) | Top Critics (17) | Fresh (7) | Rotten (52) | DVD (6)
[Seems] even more uselessly redundant and shamelessly money-grubbing than most third-rate horror sequels.
While the production values here are more cool than crappy, there's nothing really new about Resurrection.
Myers shows up and slaughters almost everyone until martial-artist Harris and Sara Moyer team up to shock him in the nuts and say things like: "Trick or treat, motherf***er!"
It's a ridiculous, absurd slasher film with a concept that is so bad that it's undoubtedly good and makes for some wicked entertainment.
Provides the Halloween franchise with a clear, objective Worst Movie Of The Series...a virtually flawless collection of all the things that can make a slasher film unwatchable.
A pretty funny comedy starring the one, the only, the incomparable...Busta Rhymes.
Audience Reviews for Halloween: Resurrection
Certainly better than some of the awful films this series has produced along the way, but still a kick in the face to everything Carpenter was trying to accomplish with the original. This time we have the director of Halloween II back at the helm (Rick Rosenthal, the first person to tarnish the series with the first sequel) and even though it doesn't feel as amateurishly made as some of the others, it still doesn't come close to the tense and atmospheric original. The characters are all incredibly dumb and the premise itself starts off intriguing (not the online crap, the real story with Laurie Strode), but lasts a total of 5 minutes and ends awkwardly. Not that I think this movie has the right to continue the story in the first place because the twist to keep the story going from H20 is stupid and annoying. I think Halloween, Halloween II (unfortunately), and H20 are the true story of the series. Although the original one is all I really care about honestly.
Super Reviewer
Freddie Harris: Michael Myers is a killer shark. In baggy ass overalls who gets his kicks from killing everyone and everything he comes across.�
"Michael's work in Haddonfield is not done yet."
Not only is Halloween: Resurrection the second worst film in the franchise, and the worst one that actually has Michael Myers in it; but it also has the worst twist ever, to keep a franchise going. It is a joyless attempt at to make more money because of the moderate success of H2O. The cast is shit and the story is shit, which more than not makes the movie shit.
The movie starts off with that horrible twist I was talking about. Then we go to an insane asylum where Laurie Strode is now. Myers comes back and kills some people. Then we jump to Haddonfield University where three friends are cast in an Internet reality show. They, along with three others will spend a night in Michael Myers home, with cameras broadcasting it for the whole world to see. It that isn't bad enough, the leaders of this show are played by Busta Ryhmes and Tyra Fucking Banks. Horrible!
Good thing the movie doesn't even make it to the hour and a half mark because if it was any longer I would have had to put a bullet through my head. This is down there with slashers like Jason X. It is that bad.
Super Reviewer
Well this wasn't very fun at all. It's nowhere near as bad as Halloween 6.....but it sure can compete with Halloween 2. The beginning part with Jamie Lee Curtis was just stupid. And there was a lot of bad actors....especially Busta Rhymes...Although I have to admit...he did deliver the best quote of 2002.
Super Reviewer
Halloween: Resurrection Quotes
Discussion Forum
Discuss Halloween: Resurrection on our Movie forum!


text:
Grammy-Winning Vocal Group All-4-One, With Color Me Badd
* Additional fees apply. No coupon or promo codes necessary to enjoy the displayed discount price.
The last date listed for '90s Boy Band Concert Reunion Featuring All-4-One and Color Me Badd was Saturday November 16, 2013 / 8:00pm.
Currently at Queensborough Performing Arts Center
A Night to Remember: A Tribute to Four of Rock 'n' Roll's Finest
- Full Price:
- $37.00
- Our Price:
- $20.00
On December 4, 1956, an event occurred that become known as one of the most historic "jam sessions"… More
Venue Details
Reviews & Ratings
Featured review from Goldstar Member
view more less of this review
I had an amazing time. The performances and singing was superb. Both groups put on a great show.
star this review starred report as inappropriate
I had a great time listening to the old and new hits of All for One and Color Me Bad! There vocals are still crisp and tight! Loved it.
About the Ticket Supplier: Queensborough Performing Arts Center
The Queensborough Performing Arts Center, located on the campus of Queensborough Community College, provides accessible and affordable celebrity and world-class entertainment locally through inclusive and diverse programming. The performances are of the highest quality, and QPAC strives to offer multi-cultural entertainment that mirrors the diversity of the borough: pop, opera, rock, Broadway, dance, comedy and more.


text:
Flap Pocket Destroyed Skinny Crop Jeans (Medium Tint) (Juniors)
Product not available
Have questions?
Chat with us or call 1.888.282.6060.
HideDetails & Care
Light tears and fading add personality to a pair of carefree skinny jeans with a summertime cropped length and fun flap pockets in the back.
- 29 1/2" unrolled inseam; 8 1/2" front rise; 13" back rise (size 29).
- Zip fly with button closure.
- Five-pocket style.
- Cotton/spandex; machine wash.
- By Vigoss; imported.
Flap Pocket Destroyed Skinny Crop Jeans (Medium Tint) (Juniors)
Write a Review0 Reviews
Enter a valid first name.
Enter a valid last name.
Enter a valid email address in the format: email@example.com.
Close modal


text:
King_Penguin May 25, 2012 12:04 PM
in response to Joesgota?
The function that isn't being controlled via the side switch is controlled by the left-hand end of the taskbar instead : double-click the home button to open the taskbar and then slide that to the right, and it's the icon at the far left (http://support.apple.com/kb/HT4085)
trrlightning May 25, 2012 12:05 PM
in response to Joesgota?
You can use the option in general to Mute, and doble tap the home button and swipe to the right until you see the music controls. At the far left tap the circle with the arrow on it and you should see a lock appear in the center of the circle. This locks the orientation. Simply tap again to remove the orientation lock.
Joesgota? May 25, 2012 10:46 PM
in response to Joesgota?
So I check marked lock screen option, then went into the side bar at the bottom of the screen. I swiped to the right and saw that the square option box... Then I saw it had a lock on it, I tapped it and unlocked it. I then opened up a game and the sound was gone. I then went back into general and check marked the mute option. Before I left the screen a circle on the top of the screen went around the battery percentage. Then I exited out and again went to the Side bar Dubbie clicking the home button I then swiped right and there was a lock of the square button that showed the mute option locked backed out the auto rotation was locked open the game and the sound worked. Why is it either one or the other? P.s. tried this with 7 games so far. Hmmmm
Joesgota? May 25, 2012 10:49 PM
in response to Joesgota?
Sorry dozeing off at the end but what do I have to do to keep both unlocked?
Diavonex May 25, 2012 10:57 PM
in response to Joesgota?
Set the Side Switch to control rotation
Use the Task Bar to control mute; double-click the Home button and swipe to the right
FlyinBlueTARDIS Jul 21, 2012 9:30 AM
in response to Joesgota?
Hello, I am having the same problem. I want mute AND orientation lock OFF.
When I go to general settings, I have to choose whether I want to have the side control be orientation lock or mute. Whichever one I choose, it will automatically enable the other.
I select orientation lock to disable orientation lock, and then mute is enabled.
I select mute to disable mute, and then orientation lock is enabled.
Is there a way to have both orientation lock and mute disabled at the same time?
It was like that before when I first got the iPad a few months ago.
Please advise.
Thank you!
FlyinBlueTARDIS Jul 22, 2012 2:39 PM
in response to FlyinBlueTARDIS
Never mind, figured it out. There is a switch on the side, next to the volume control, that affects the orientation lock.
ariesashish Jan 15, 2013 8:08 AM
in response to FlyinBlueTARDIS
Tks ....I had the same problem....got it figured!!! : - ))


text:
4 Item(s)
WHEY PROTEIN 80 (concentrate)
Whey Protein 80 is our award-winning premium grade whey protein concentrate. Winner of the highly coveted, "Best Protein Award" in the industry-leading FSN Product Awards, TPW™ whey protein is known for its exceptional purity. It contains no thickeners or fillers and is available in a wide range of exclusive natural flavours. Whey Protein 80 is undenatured and has the highest biological value (BV) of any known protein.Price From:More info£8.99 Per Serving = 1.00
ALL DAY PROTEIN - Tapered Release Protein
All Day Protein is a multi-timed release protein designed to drip feed an effective supply of nutrients to the muscles over a sustained period of time. This unique protein blend is formulated with premium grade ingredients and natural flavours for a totally pure protein shake. With 47g of protein per serving, it is the ideal protein shake for anyone looking to achieve growth in muscle mass.Price From:More info£12.99 Per Serving = 1.00
BREAKFAST FUEL i-SHAKE™
Breakfast Fuel is the ultimate morning protein shake specifically formulated for your morning nutrient window. Designed to restart and fuel your body at the start of the day, Breakfast Fuel is an innovative formula engineered with premium grade ingredients. It is designed to help promote your physical and mental performance throughout the day.Price From:More info£2.99 Per Serving = 1.00
Whey Protein 80 SF+ is a ground-breaking whey protein powder, formulated exclusively from premium grade whey protein concentrate and guarantees unparalleled levels of purity. What makes Whey Protein 80 SF+ so unique is that it's manufactured using sunflower lecithin, instead of the commonly used soy lecithin. The result is a next-generation pure whey protein, ideal for anyone looking for a totally soy-free whey protein shake.Price From:More info£8.99 Per Serving = 1.00
4 Item(s)


text:
Top Photos
Top Stories
- Vicky denies being married to the actress
- Read on to find out
Editor's Pick
- The competition, held at Top Chef Studios in Jumeirah, saw some very...
- We kick-start a series on all that you need to be fit, fab and healthy with...
- Grabbing a quick bite will also cost you 12 black points
- The city is all set to break its own record!
- The actress takes on body-shamers
- Find out how this could affect Aamir Khan
- The couple is relaxing in an exotic location!
- We are confused!
- The actor has bagged a role in Persepolis director Marjane Satrapi's...
- The Airlift actor is excited to turn bad in Rajnikanth's Robot sequel
Telly World
- ...or so it seems from her social media posts
- Someone in Mouni's life is apparently responsible for the rift
Watch Tonight
Sapne Suhane Ladakpan ke
7.30pm, Zee TV
- 2016-03-04 12:00Save the date
- 2016-05-06 18:30MusicHead to this musical event that is celebrating Mohamed Rafi
- 2016-05-26 12:15foodSave the date
- If you love your seafood, then this is where you should be headed
- Find out how you can challenge wrongful fines
- Masala! gets up close and personal with the host of the new TV series Body...
- Mitun De Sarkar tells you why it's essential to cleanse your system...
Latest Issue - Out Now
Get your favourite celebrity and fashion mag in all good shops every week.Get it now!
Popular on
- What made Kat say that?
- Get your hands on the gadget!
- Will the Tiger Shroff and Shraddha Kapoor-starrer pack a punch? Read City...


text:
I Opted My Kids Out of Standardized Tests
Then I learned a thing or two.
But just like the school couldn't let it go, neither could I. I really wanted to understand what was provoking this reaction. And so, feeling very Michael Moore about the whole thing, I set out to find exactly what the schools' resistance might be about. (It's here that I will admit that, while my husband and I definitely thought through our decision to opt our kids out, we consulted our guts, not research.)
I started by posting on Facebook, admittedly not the best place to gather facts. Some of the reactions were what you might think: "I applaud you and your stance," said one Facebook friend. "Good for you," said another. "Fight the power! Stick it to the man! Up with kids, down with standardized tests!" said one more, only partially facetiously.
But then some others offered perspective. One commented, "My kids certainly don't stress about standardized tests anymore, which I suppose may be useful." Another asked, "Could this be budget related? Or perhaps they fear that when the professor's child opts out, others will follow?" Several said, "They want your kids' scores to up their averages." Maybe.
And then, bravely, some friends went against the grain of the conversation. "Teachers' continued job security and pay can depend on how the students perform on the test—hence the panic." "There is enormous pressure on the school. The school is not choosing to inflict these tests—it is forced to."
These friends were posting from all over the country. In fact, I'd gotten more responses on the two or three Facebook statuses about opting out than I had on pretty much anything else, ever— including the blockbuster "I got tenure!" post. But what I didn't know was how the responses applied to Colorado.
Time to call the Colorado Department of Education. Joyce Zurkowski, the executive director of assessment, explained to me that, in Colorado, as long as a school has 95 percent participation, a kid's opting out has no effect at all on school funding. And as of right now, the test results don't affect teacher evaluation at all—although they will next year. But here's the most important thing she told me: Despite the fact that the middle-school principal herself told me I had a legal right to opt out (and none of the players in this morality play ever told us otherwise, whether explicitly or implicitly), that's not actually true. In Colorado, kids are required by law to test. The "refuse testing" option on the enrollment forms? It's "being phased out" because it's "confusing." If kids don't show up for school on testing days? Zurkowski told me that some districts have sent truant officers to their homes.
We're on our second day of opting out of TCAPs as I write this, and nothing else has happened, except that one high-school friend of my older daughter's told her that his mom tried to opt him out on the same day I did it, but the school said it was "too late." We've still got several days to go. I'm bracing myself. Screening calls. Telling my kids that I'm proud of them. They're proud of themselves because they've taken a stand on something they think is important. It's a great feeling.
Except: What started as a personal, family decision carries so much more weight for me now, and it's frustrating to know that our actions aren't making a bit of difference, beyond our household. As a school administrator friend wrote to me, "I applaud parents who opt out and I really wish more would. However, to make a true impact on the system, thousands of parents (especially of high-achieving students) would have to opt out."
In other words, my decision to opt my kids out might have no real effect at all here in Colorado, but on the other hand if I support friends in other states in opting their kids out, I might cause teachers to be downgraded and schools to lose funding. How does any parent weigh those very real consequences against her commitment to doing what's best for her kids? As my friend Maria McKenna, the senior associate director of the education, schooling, and society program at the University of Notre Dame, said to me last night, "It renders parents powerless when we hear about the crushing impact that opting out has on teachers and schools. But of course, teachers and administrators are powerless, too. It's insidious." Do I stand on my principles, both personal and political? Or do I put the interests of the very important people and institutions that educate my children above those of my kids? And how can I help ensure that more parents, teachers, administrators, and, yes, policymakers recognize the craziness that is our "accountability above all else" mentality?
For now, I'm opting out of making any permanent decision about my kids' participation in high-stakes testing. But for those who say that these tests have no educational value, I disagree, at least to this extent: Opting out of them has been a real learning experience for me.


text:
Top Definition
Its when you take your partner tip them in butter, roll them in flour and then have sex with them while eatting it.
Yo man i hear the ho got a nasty white carpet in the janitors closet
by Rasheedpoopynose November 07, 2010
Type your email address below to get our free Urban Word of the Day every morning!
Emails are sent from email@example.com. We'll never spam you.×


text:
What about the possibility that AFCI will come in around breakeven this quarter? WHY ? They were overly optimistic three months ago, and with contract wins. Possibly Rev's have not increased to offset the increased costs.Any thoughts?
Here comes the big dump. I just hope this time it doesn't also dump after the earnings release.


text:
Green Thumbs in Cold Temps: The Art of Fall and Winter Gardening
The gardening season doesn't have to end when it gets cold. There are plenty of gardening opportunities for the autumn and winter, especially if you know where to look. With the right planning, you can grow vegetables throughout the entire year.


text:
|Δ vs. prior year
|EBITDA Margin
|Δ vs. prior year
|Food & Beverage
|+410 bps
|Home, Health & Beauty
|+410 bps
|-210 bps
|Specialty Chemicals
|+50 bps
MWV Reports Second Quarter Sales And Earnings Growth
MWV), a global leader in packaging and packaging solutions, reported improved results and EBITDA margin expansion in the second quarter of 2014 (see table below). The company generated particularly strong performance improvement in the Food & Beverage and Home, Health & Beauty segments, as well as record sales and earnings in the Specialty Chemicals segment. As a result, total company EBITDA ex-items increased 26% to $257 million, or 17.5% of sales. Refer to the "Use of Non-GAAP Measures" section of this release for further information.
"The profitable growth we generated this quarter is the result of continued strong execution of our strategy," said John A. Luke, Jr., chairman and chief executive officer, MWV. "We are generating above-market growth and improving our bottom-line financial performance, even against the backdrop of a challenging global economy. Across the global packaging and specialty chemicals markets we have targeted, we are driving higher pricing, share gains and product mix improvement – and delivering returns from our major investments and cost reduction initiatives as well."
Check Out Our Best Services for Investors
Action Alerts PLUS
Portfolio Manager Jim Cramer and Director of Research Jack Mohr reveal their investment tactics while giving advanced notice before every trade.
Product Features:
- $2.5+ million portfolio
- Large-cap and dividend focus
- Intraday trade alerts from Cramer
Quant Ratings
Access the tool that DOMINATES the Russell 2000 and the S&P 500.
Product Features:
- Buy, hold, or sell recommendations for over 4,300 stocks
- Unlimited research reports on your favorite stocks
- A custom stock screener
Stocks Under $10
David Peltier uncovers low dollar stocks with serious upside potential that are flying under Wall Street's radar.
Product Features:
- Model portfolio
- Stocks trading below $10
- Intraday trade alerts
Dividend Stock Advisor
David Peltier identifies the best of breed dividend stocks that will pay a reliable AND significant income stream.
Product Features:
- Diversified model portfolio of dividend stocks
- Updates with exact steps to take - BUY, HOLD, SELL
Trifecta Stocks
Every recommendation goes through 3 layers of intense scrutinyquantitative, fundamental and technical analysisto maximize profit potential and minimize risk.
Product Features:
- Model Portfolio
- Intra Day Trade alerts
- Access to Quant Ratings
Real Money
More than 30 investing pros with skin in the game give you actionable insight and investment ideas.
Product Features:
- Access to Jim Cramer's daily blog
- Intraday commentary and news
- Real-time trading forums


text:
- Sunday, May 8, 2016
- By Alan A. Vernon
- By Alan A. Vernon
- Top brunch spots
- By Alan A. Vernon
- By Stephanie Dickison
- By Various Contributors
- By Stephanie Dickison
- This week's events in Toronto
Reserve online at your favourite restaurants in Toronto and across the GTA. Our real-time reservation system allows you to book available tables instantly from the restaurant's electronic reservation book.
Lunch Rosedale / Summerhill Restaurants
Rosedale / Summerhill Area passes through the most sought-after real estate, the affluent Rosedale and Summerhill neighbourhood. It also passes through the Rosedale Valley Ravine, a natural environment within city with its glorious parks and green-space, trails and bicycle paths.
2 listing found
Previous | Next
895 Yonge St.
(647) 490-2460
1366 Yonge St
(416) 921-3141
2 listing found
Previous | Next


text:
911 Syndrome: Acura NSX May Add Convertible, Type R VariantsMarch 9, 2016 at 1:13 pm by Joseph Capparella
Acura desperately wants its new NSX to be taken seriously in the supercar realm, and one measly variant won't do when Porsche offers upwards of 20 versions of the 911. To that end, both a convertible NSX and a track-ready NSX Type R might be in the cards, according to a report in Autocar.
Wind Damage: Quantifying Convertible Weight and Noise Compromises [Infographic]October 26, 2015 at 12:56 pm by Jared GallFrom the November 2015 issue
Lay the old rooster on the chopping block and he'll be a little lighter after the hatchet falls. It's a sad fact that the opposite is true of cars. Subtract the top and you've got to add a bunch of stuff back in. But, while convertibles consistently weigh more than their coupe counterparts, by how much is hardly a constant. Here, we've compiled their manufacturers' quoted weights for 25 current coupe/convertible pairs. The true heavyweights are not the ones you'd expect. Clever automakers anticipate that both open and closed body styles will spring from a common platform and engineer their cars to minimize the convertible's weight gain and added manufacturing complexity. Case in point: Porsche's Cayman and Boxster weigh the same. READ MORE ››
Rejoice, Miami! Mercedes to Unveil S-Class Cabriolet at Frankfurt Auto ShowAugust 24, 2015 at 6:01 pm by Davey G. Johnson
Two years ago at the Frankfurt auto show, Mercedes-Benz unveiled the S-class Coupe Concept, a ridiculously lovely thing meant to bring back the glory days of the personal luxury coupe. We'd say it succeeded. Blessed with all the goodness of today's excellent Sonderklasse and wrapped in the sort of skin one might find in a high-end Berlin adults-only establishment, the S-coupe was one of the most talked-about machines at the 2013 show. This year, Mercedes is hoping to repeat the magic with the S-class cabriolet. READ MORE ››
Rule the Beach with This Classic Off-RoaderJuly 15, 2015 at 1:54 pm by Nicholas Wallace
There's something special about vintage sport-utes. In the past we've featured classic Jeeps, Broncos, and a bad-ass Dodge Power Wagon. Today, we bring you this beautiful 1967 International Harvester Scout. READ MORE ››
2015 Ferrari California T Tested: The T Is for TurboMay 25, 2015 at 10:16 am by Aaron Robinson
Suntanned California has always been a place where people come to experiment with their identity. Thus, the name is perfect for Ferrari's lowest-priced model, which has been an experiment since it first hit the streets in 2009. It was the first roadgoing Ferrari to put a V-8 in front of its driver and the first with a power-retractable hardtop, and its price and daily practicality took Ferrari on a low pass through the market. It probably should have been a Maserati, as it would have done far more to elevate that brand than it does for Ferrari, but the ball didn't bounce that way. READ MORE ››
Underground Garage: Land Rover Confirms Production of Convertible EvoqueMarch 2, 2015 at 1:54 pm by Rusty Blackwell
Land Rover has confirmed that it isn't afraid of following in the tire tracks of the salesproof but gutsy Nissan Murano CrossCabriolet by announcing that the Range Rover Evoque convertible (which we recently spied) will go on sale sometime in 2016. READ MORE ››
2015 BMW 2-series Convertible Debuts with Two Turbo Engines, Available AWDSeptember 9, 2014 at 6:04 pm by Jens Meiners
With the introduction of the 2-series convertible, BMW's rear-wheel-drive 1-series is history in the U.S. (The Euro-market hatchback is still available.) But despite the new moniker, the 2-series very much adheres to the formula of its predecessor. Like the 1-series, it is built atop a chassis closely related to that of the 3-series and it is available in this country as both a ragtop convertible and a fixed-roof coupe. READ MORE ››
Happy 25th, MX-5 Miata! Three Generations of Mazda's Sports Car Compared—Plus Our Original Reviews!September 2, 2014 at 6:43 pm by Alexander Stoklosa
With Mazda's pokey little MX-5 Miata sports car celebrating its 25th birthday this year and the new, fourth-generation car's arrival just around the corner (tomorrow!), we called a staff meeting to determine how best to celebrate. Cross-country trip? Already done (thanks, Road & Track). Take one racing? Also not exactly a new concept for the easy-to-race Miata, plus—shockingly—no one in the office has a race-prepped Mazda. Ultimately, we figured that the most appropriate course of action involved simply driving the thing. READ MORE ››


text:
Was wondering if any have had experience buying second hand from LBS
Has there been a warranty or once you are out the shop that is it.
We all tend to take the bike for a test ride but inevatibly it tends to be on the longer rides half way up the hill when things tend to go sideways.
What was the chances of taking it back to fix any problems and how long did they allow after service care? Other than guilt and doing the right thing are they legally bound?
News & Reviews on BNA
If you visit Melbourne, Sydney, Brisbane, Perth or Adelaide, you stand a good chance of spotting a Reid bike somewhere in these cities. The Australian company can still be described as a new-comer to the market, but they have expanded swiftly and are now selling in Europe and the USA as well. Reid's strategy is […]
Buying second hand
Return to "Buying a bike / parts"
Jump to
- General Australian Cycling Topics
- Info / announcements
- Buying a bike / parts
- General discussion
- The Bike Shed
- Cycling Health
- Cycling Safety and Advocacy
- Women's Cycling
- Bike & Gear Reviews
- Cycling Trade
- Stolen Bikes
- Bicycle FAQs
- Serious Biking
- Audax / Randonneuring
- Retro biking
- Commuting
- Recumbents
- Fixed Gear/ Single Speed
- Track
- Electric Bicycles
- Cyclocross
- Dragsters / Lowriders / Cruisers
- Children's Bikes
- Road Racing
- Road Biking
- Training
- Time Trial
- Triathlon
- International and National Tours and Events
- Cycle Touring
- Touring Australia
- Touring Overseas
- Touring Bikes and Equipment
- Australia
- Western Australia
- New South Wales
- Queensland
- South Australia
- Victoria
- Tasmania
- Northern Territory
- Country & Regional
- The Market Place
- Member to Member Bike and Gear Sales
- Want to Buy, Group Buy, Swap
- My Bikes or Gear Elsewhere
- Cycling Brands
- Azzurri
- Bianchi
- Campagnolo
- Cannondale
- Cell Bikes
- Cervélo
- Colnago
- Focus
- Fuji
- Garmin
- Giant
- Kona
- Malvern Star
- Merida
- Santa Cruz
- Scott
- Shimano
- Specialized
- Surly
- Trek
- Vivente
- Custom Builders
- Generic Carbon
Who is online
Users browsing this forum: No registered users
- All times are UTC+10:00
- Top
- Delete all board cookies
About the Australian Cycling Forums
The largest cycling discussion forum in Australia for all things bike; from new riders to seasoned bike nuts, the Australian Cycling Forums are a welcoming community where you can ask questions and talk about the type of bikes and cycling topics you like.
Bicycles Network Australia
Forum Information
Brought to you by Bicycles Network Australia | © 1999 - 2016 | Powered by phpBB ®


text:
Keanu is fun, and even sometimes outright hilarious, but it doesn't live up to the skills of its central performers.
Keanu is fun, and even sometimes outright hilarious, but it doesn't live up to the skills of its central performers.
Term Life is just a generic, run-of-the-mill, poorly made thriller that doesn't thrill.
"The Ballad of Narayama" is a Japanese film of great beauty and elegant artifice, telling a story of startling cruelty. What a space it opens…
Patrice Leconte's "Monsieur Hire" is a tragedy about loneliness and erotomania, told about two solitary people who have nothing else in common. It involves a…
A table of contents for all of our "My Favorite Roger" entries, in which we ask our contributors which review or blog post by Roger…
A response from Chaz Ebert regarding the News-Gazette's April 10 article about Ebertfest.
A report from a panel at Los Angeles Asian Pacific Film Festival about diversity in the light of the 2015 Oscar ceremony.
An article about the upcoming reissue of "Two Weeks in the Midday Sun."
A report from a panel at Los Angeles Asian Pacific Film Festival about diversity in the light of the 2015 Oscar ceremony.
FFC Seongyong Cho on Paul Weitz's "Grandma."
A review of FOX's new series "Houdini & Doyle," premiering May 2, 9/8c.
Writer/director Lorene Scafaria on "The Meddler."
"Corrina, Corrina'' has its heart in the right place, and its characters are some of the nicest people I've met at the movies lately, but the movie seems to exist under a cloud of gloom, and I kept hoping for sunshine.
The story involves Manny Singer (Ray Liotta), a jingle writer for an advertising agency, whose wife has died, leaving him with a 7-year-old daughter named Molly (Tina Majorino). He desperately needs a nanny, and interviews several applicants, all deeply flawed in the ways Movie Reject Nannies always are, before settling on Corrina Washington (Whoopi Goldberg).
The time is 1959, and the movie implies that Corrina, a recent college graduate, can't find any other job because she is black. She is overqualified for this one, but has many qualifications for being Manny's partner in life, one of them being her suggestion to take the "t'' off of "shouldn't,'' so it rhymes with "puddin,'' and he wins the Jell-O account.
The Singer household is a cavern of gloom when Corrina first enters it. Molly has decided to stop talking, and Manny spends most of his time looking dazed and confused, and smoking too many cigarettes. Corrina smokes, too, and this leads to a lot of intimate cigarette behavior, in which the two adults, shy about communicating in other ways, light up together. They also spend a lot of time discussing jazz. (There is a running gag about how Molly is stealing their cigarettes because she heard a government health warning on TV; the movie would have been improved by the elimination of this subplot, with its cutsey payoff.) The opening hour of the film is morose and sad, as the two adults and the child create a series of small social embarrassments, awkwardnesses, and apologies. But Corrina is slowly able to win the little girl's trust, and soon she is talking again. The plot contrives for Corrina to find herself staying over for dinner on several occasions, and Manny is surprised at her comments about music and literature. There are also well-written philosophical discussions between Corrina and Molly, who blames herself for her mother's death. A family unit is obviously being formed here, and there's a nice little moment when Manny is hurrying out the door and Corrina gives Molly instructions, and Manny blurts out, "Listen to your mother!'' Molly smiles secretly at that, because she has determined that Corrina should, indeed, marry her daddy and move in full-time.
It takes the adults longer to figure that out, and the screenplay, by director Jessie Nelson, seems sort of shy about the emotional details. Liotta plays Manny as closed-off and absent, and Goldberg plays Corrina as prescient and tactful, and eventually the two find themselves in each other's arms-but more through a logical decision, somehow, than because of love or passion.
The movie has a lively subplot involving Corrina's home life; she lives with her sister and her sister's kids, who become Molly's playmates. The energy in this household provides some needed sunshine, but the movie also supplies the usual obligatory scenes in which Corrina's sister, Manny's mother and a nosy neighbor all express their disapproval of interracial romance. Those scenes seem almost pro forma; there's no real emotional confrontation over the subject, and indeed the whole movie seems kind of muted.
There's a lot I liked in the film, including the intelligence of some of the dialogue, but "Corrina, Corrina'' seemed to be trying to do both too much, and too little. It deals with death, loss, healing, romance and communication, but in ways that are predictable, however well-handled. And it seems almost as shy as the characters about the charged issues of race and romance. After it was over I felt that, yes, it was warm and good-hearted, but there was more of a story there to be told.
FFC Gerardo Valero reexamines the 2015 James Bond film "Spectre" after the dust has settled.
Reflections on a marriage, and what came after.
This message came to me from a reader named Peter Svensland. He and a fr...
A piece on two recent Dario Argento re-releases, "Deep Red" and "Tenebrae."


text:
Call us 7 days a week
Lift Safety Option Glove
These all purpose general utility gloves with synthetic leather palms are constructed out of an air mesh material for a vented design for ultimate breathability and TPR Guard. Lightweight air mesh maximizes air flow to minimize heat build up Synthetic leather palm and side finger panels increases protection. Perforated synthetic leather between fingers improves air flow Fully washable materials - will not stretch, shrink or harden. Sizes Are S, M, L, XL and XXL.
Give Us Your Feedback On This Page
* Help us continuously improve by reporting any errors or omissions on this page including: