1. A seed of soybean variety XB29R06, representative seed of said soybean variety XB29R06 having been deposited under ATCC Accession Number PTA-8012.
2. A soybean plant, or a part thereof, produced by growing the seed of claim 1.
3. The soybean plant, or a part thereof, of claim 2 wherein said part is pollen.
4. The soybean plant, or a part thereof, of claim 2 wherein said part is an ovule.
5. A soybean plant, or a part thereof, expressing all the physiological and morphological characteristics of soybean variety XB29R06, representative seed of said soybean variety having been deposited under ATCC Accession Number PTA-8012.
6. A tissue culture produced from protoplasts or regenerable cells from the plant of claim 2.
7. The tissue culture according to claim 6, wherein the cells or protoplasts are produced from a plant tissue selected from the group consisting of: leaf, pollen, cotyledon, hypocotyl, embryos, root, pod, flower, shoot and stem.
8. A soybean plant regenerated from the tissue culture of claim 6 having all the morphological and physiological characteristics of soybean variety XB29R06, representative seed of said soybean variety XB29R06 having been deposited under ATCC Accession Number PTA-8012.
9. A method for producing a soybean seed comprising crossing two soybean plants and harvesting the resultant soybean seed, wherein at least one soybean plant is the soybean plant of claim 2.
10. A method for producing hybrid soybean seed comprising crossing the soybean plant according to claim 2 with a second soybean plant and harvesting the resultant hybrid soybean seed.
11. A method for producing a XB29R06 derived soybean plant, comprising:
a. Crossing soybean variety XB29R06, a sample of said soybean variety deposited under ATCC Accession Number PTA-8012, with a second soybean plant to yield progeny soybean seed; and
b. Growing said progeny soybean seed to yield said XB29R06-derived soybean plant.
12. The method of claim 11, wherein the second soybean plant is transgenic.
13. A method of producing a herbicide resistant soybean plant comprising introducing a transgene conferring herbicide resistance into the plant of claim 2.
14. A herbicide resistant soybean plant produced by the method of claim 13.
15. The soybean plant of claim 14, wherein the transgene confers resistance to a herbicide selected from the group consisting of glyphosate, sulfonylurea, imidazolinone, glufosinate, phenoxy proprionic acid, cycloshexone, triazine, and benzonitrile.
16. A method of producing a pest or insect resistant soybean plant comprising introducing a transgene conferring pest or insect resistance into the soybean plant of claim 2.
17. A pest or insect resistant soybean plant produced by the method of claim 16.
18. The soybean plant of claim 17, wherein the transgene encodes a Bacillus thuringiensis (Bt) endotoxin.
19. A method of producing a disease resistant soybean plant comprising introducing a transgene into the soybean plant of claim 2.
20. A disease resistant soybean plant produced by the method of claim 19.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A sender machine in communication with a receiver machine, wherein the sender machine is operable to:
analyze a bitmask associated with a message to be sent from the sender machine to the receiver machine, wherein the bitmask comprises one or more presence bits and one or more absence bits, wherein the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the message; and
dynamically determine compression instructions to compress the bitmask, wherein determining the compression instructions comprises:
generating a tree using the presence bits and the absence bits; and
generating the compressed bitmask by traversing the tree comprising the presence bits and the absence bits; and
wherein the compression instructions reduce a size of the bitmask associated with the message to be sent to the receiver machine.
2. The sender machine of claim 1, wherein the receiver machine is further operable to determine the compression instructions, and wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
3. The sender machine of claim 1, wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
4. The sender machine of claim 1, wherein the message is compressed according to the bit mask and the bitmask of the message is compressed according to the compression instructions.
5. The sender machine of claim 1, wherein the message may have one or more fields that are sorted to group together one or more fields likely to have a value and group together one or more fields not likely to have a value.
6. The sender machine of claim 1, wherein the sender machine is further operable to invert the bitmask prior to compressing the bitmask.
7. The sender machine of claim 1, wherein the compression instructions can be used by the receiver machine to decompress the compressed bitmask by traversing the tree, reconstructing all subtrees having an absence bit, and copying a leaf node when traversed.
8. The sender machine of claim 1, wherein the sender and receiver machines can store the compression instructions for future message compression or decompression of bitmasks sent or received by the sender and receiver machines.
9. The sender machine of claim 1, wherein the sender machine is further operable to transmit the compression instructions to the receiver machine, and wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
10. A method for generating bitmask compression instructions, where the method comprises:
analyzing a bitmask associated with a message to be sent from a sender machine to a receiver machine, wherein the bitmask comprises one or more presence bits and one or more absence bits, wherein the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the message;
dynamically generating compression instructions to compress the bitmask, wherein the compression instructions comprise:
generating a tree using the presence bits and the absence bits; and
generating the compressed bitmask by traversing the tree comprising the presence bits and the absence bits; and
wherein the compression instructions reduce size of the bitmask associated with the message to be sent to the receiver machine.
11. The method of claim 10, wherein the method further comprises generating the compression instructions at the receiver machine, wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
12. The method of claim 10, wherein the message is compressed according to the bit mask, and the bitmask of the message is compressed according to the compression instructions.
13. The method of claim 10, wherein the message may have one or more fields that are sorted to group together one or more fields likely to have a value and group together one or more fields not likely to have a value.
14. The method of claim 10, wherein the method further comprises inverting the bitmask prior to compressing the bitmask.
15. The method of claim 10, wherein the compression instructions can be used by the receiver machine to decompress the compressed bitmask by traversing the tree, reconstructing all subtrees having an absence bit, and copying a leaf node when traversed.
16. The method of claim 10, wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
17. The method of claim 10, wherein the sender and receiver machines can store the compression instructions for future message compression or decompression of bitmasks sent or received by the sender and receiver machines.
18. The method of claim 10, further comprising transmitting the compression instructions to the receiver machine, and wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.
19. Logic for providing bitmask message compression instructions, the logic being embodied in a non-transitory computer-readable medium and when executed operable to:
analyze a bitmask associated with a message to be sent from a sender machine to a receiver machine, wherein the bitmask comprises one or more presence bits and one or more absence bits, wherein the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the message;
dynamically determine compression instructions to compress the bitmask, wherein the compression instructions comprise:
generating a tree using the presence bits and the absence bits; and
generating the compressed bitmask by traversing the tree comprising the presence bits and the absence bits; and
wherein the compression instructions reduce size of the bitmask associated with the message to be sent to the receiver machine.
20. The logic of claim 19, wherein the receiver machine utilizes the compression instructions to decompress the compressed bitmask of the message.