In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
The Reed-Somolon code is specified by the finite field, the length
(length <= 2^m-1), the number of redundant symbols (length-k), and
the initial zero of the code, init_zero, such that the zeros are:
init_zero, init_zero+1, ..., init_zero+length-k-1
工程計算MATLAB code to calculate the reorthogonalized sine tapers
input: N = the length of the time series data to be tapered
p = the number of tapers requested
I = the gap structure a vector of length N
I(t) = 1 if there is data at time t, t=1, ..., N
I(t) = 0 if there is a gap at time t
output: X = N-by-p vector of the reorthogonalized sine taper
acm HDOJ 1051WoodenSticks
Description:
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
