Abstract: Decoding that uses an extended Hamming code in one of the primary stages of static encoding uses a calculation of the r+1 Hamming redundant symbols for k input symbols from which Hamming redundant symbols are calculated, where r satisfies 2r?1?r?k<2r?r?1. This efficient method requires on the order of 2k+3r+1 XORs of input symbols to calculate the r+1 Hamming redundant symbols.

Abstract: The present invention relates to isolated proteases of the RP-II type and variants of RP-II proteases exhibiting improved properties in comparison to the parent RP-II protease, DNA constructs and vectors coding for the expression of said proteases and variants, host cells capable of expressing the proteases and variants from the DNA constructs, as well as a method of producing them by cultivating said host cells. The proteases may advantageously be used as constituents in detergent compositions and additives, optionally in combination with other enzymes such as proteases, lipases, cellulases, amylases, peroxidases or oxidases.

Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.

Abstract: A method for communicating the content of a live data stream to a receiver using a plurality of channels comprising two encoder channels used to encode the live data content prior to transmission. Initially a plurality of segments of a live data stream are received, wherein each segment contains segment data. A forward error correction algorithm is applied to each segment's data, thereby producing FEC-encoded segment data. The FEC-encoded segment data is contained within an FEC-encoded block, resulting in a corresponding plurality of FEC-encoded blocks being generated. Each FEC-encoded block is copied to a sub-channel on both a first encoder channel and a second encoder channel, resulting in a plurality of FEC-encoder blocks residing on the first and second encoder channels. The first and second encoder channels differ in the number of sub-channels they contain (interleaving depth), and accordingly the arrangement of the FEC-encoded blocks in the first and second encoder channels are different.

Abstract: A media object is scheduled for transmission between a server and a client. The media object is partitioned into segments of blocks, wherein each block is a unit of media for which a client will wait to receive an entire block before playing out the block, and wherein each segment includes an integer number of blocks. One or more channels on which to serve each segment are determined, and a rate at which to serve each segment is determined. Additionally, a schedule pair for each channel is determined. The schedule pair includes a time at which the client may start receiving on the channel and a time at which the client may stop receiving on the channel.

Abstract: The present invention relates to Isolated mature functional polypeptide which is at least 90% identical to and exhibits the same function of a corresponding secreted polypeptide obtainable from the bacterium Alicyclobacillus sp. deposited under accession number DSM 15716 are disclosed.

Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.

Abstract: A secreted mature polypeptide derived from an S2A or S1E protease which after maturation has protease activity, which polypeptide when expressed and before maturation comprises a heterologous pro-region.

Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.

Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.

Abstract: A secreted proteolytic polypeptide comprising at least three non-polar or uncharged polar amino acids within the last four amino acids of the C-terminus of the polypeptide, encoding polynucleotides, expression vectors comprising the polynucleotides, host cell comprising the polynucleotides, methods for producing said polypeptide, and methods for using the polypeptide

Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.

Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.

Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.

Abstract: In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender.

Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.

Abstract: Isolated polypeptides are disclosed selected from the group consisting of: (a) polypeptides comprising an amino acid sequence which has at least 90% identity with a sequence of a mature polypeptide comprised in the group of SEQ ID NO: 26 to SEQ ID NO:50; (b) polypeptides which are encoded a nucleotide sequence which hybridize under high stringency conditions with a polynucleotide probe selected from the group consisting of (i) the complementary strand to a nucleotide sequence selected from the group of regions of SEQ ID NO: 1 to SEQ ID NO: 25 encoding a mature polypeptide.

Abstract: The present invention relates to enzyme preparations consisting essentially of an enzyme which has cellulytic activity and comprises a first amino acid sequence having the following sequence (SEQ ID NO: 79) Thr Arg Xaa Xaa Asp Cys Cys Xaa Xaa Xaa Cys Xaa Trp Xaa 1 2 3 4 5 6 7 8 9 10 11 12 13 14 and a second amino acid sequence having the following sequence Trp Cys Cys Xaa Cys (SEQ ID NO: 80) 1 2 3 4 5 wherein, at position 3 of the first sequence, the amino acid is Trp, Tyr or Phe; at position 4 of the first sequence, the amino acid is Trp, Tyr or Phe; at position 8 of the first sequence, the amino acid is Arg, Lys or His; at positions 9, 10, 12 and 14, respectively, of the first sequence, and at position 4 of the second sequence, the amino acid is any of the 20 naturally occurring amino acid residues with the provisos that, in the first amino acid sequence, (i) when the amino residue at position 12 is Ser, then the amino acid residue at posit

Abstract: The present invention relates to isolated proteases of the RP-II type and variants of RP-II proteases exhibiting improved properties in comparison to the parent RP-II protease, DNA constructs and vectors coding for the expression of said proteases and variants, host cells capable of expressing the proteases and variants from the DNA constructs, as well as a method of producing them by cultivating said host cells. The proteases may advantageously be used as constituents in detergent compositions and additives, optionally in combination with other enzymes such as proteases, lipases, cellulases, amylases, peroxidases or oxidases.

Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.