Author: claimsbot

1. A seed of the hybrid corn variety CH956311, produced by crossing a first plant of variety I294213 with a second plant of variety I217345, wherein representative seed of said varieties have been deposited under ATCC Accession numbers PTA-7859 and PTA-8211, respectively.
2. A plant of the hybrid corn variety CH956311 grown from the seed of claim 1.
3. A plant part of the plant of claim 2.
4. The plant part of claim 3, further defined as an ear, ovule, pollen or cell.
5. A tissue culture of cells of the plant of claim 2.
6. The tissue culture of claim 5, wherein cells of the tissue culture are obtained from a leaf, pollen grain, embryo, root, root tip, anther, silk, flower, kernel, ear, cob, husk, stalk or meristem.
7. A method of producing hybrid corn seed comprising crossing a plant of variety I294213 with a plant of variety I217345, wherein representative seed of variety I294213 and variety I217345 have been deposited under ATCC Accession numbers PTA- 7859 and PTA-8211, respectively.
8. The method of claim 7, wherein said crossing is carried out by pollinating a plant of inbred variety I294213 with pollen from a plant of variety I217345.
9. The method of claim 7, wherein said crossing is carried out by pollinating a plant of inbred variety I217345 with pollen from a plant of variety I294213.
10. A method for producing corn grain comprising growing the plant of claim 2 until grain is produced and collecting the grain.
11. A method of introducing a heritable trait into hybrid corn variety CH956311 comprising the steps of:
(a) crossing a first plant of a first inbred corn variety selected from the group consisting of variety I294213 and variety I217345 with another corn plant that heritably carries the trait to produce progeny plants, at least some of which heritably carry the trait, wherein representative samples of seed of variety I294213 and variety I217345 have been deposited under ATCC Accession numbers PTA-7859 and PTA-8211, respectively;
(b) selecting progeny plants that heritably carry the trait;
(c) crossing selected progeny plants with another plant of the first inbred corn variety to produce next-generation progeny plants at least some of which heritably carry the trait;
(d) selecting next-generation progeny plants that heritably carry the trait and exhibit morphological and physiological characteristics of the first inbred corn variety;
(e) repeating steps (c) and (d) three or more times to produce at least a first selected progeny plant that heritably carries the trait and exhibits essentially all of the morphological and physical characteristics of the inbred corn variety; and
(f) crossing a progeny plant of step (e) with a plant of the other inbred corn variety of the group consisting of I294213 and I217345 to produce a seed that produces a plant comprising the trait and essentially all of the characteristics of hybrid corn variety CH956311 when grown under the same environmental conditions.
12. The method of claim 11, wherein the trait is selected from the group consisting of male sterility, herbicide tolerance, insect resistance, disease resistance, waxy starch, modified fatty acid metabolism, modified phytic acid metabolism, modified carbohydrate metabolism and modified zein content.
13. The method of claim 12, further comprising repeating steps (a)\u2013(f) at least once to introduce at least a second trait into hybrid corn variety CH956311, wherein the second trait is selected from the group consisting of male sterility, herbicide tolerance, insect resistance, disease resistance, waxy starch, modified fatty acid metabolism, modified phytic acid metabolism, modified carbohydrate metabolism and modified zein content.
14. A seed produced by the method of claim 11.
15. A plant grown from the seed of claim 14.
16. A method of introducing a desired trait into hybrid corn variety CH956311 comprising the steps of:
(a) introducing a transgene conferring the trait into a variety selected from the group consisting of I294213 and I217345 to produce a transgenic plant heritably carrying the trait; and
(b) crossing the transgenic plant or an isogenic progeny plant thereof with a plant of the other inbred corn variety to produce seed that heritably carries and expresses the transgene and otherwise has essentially all of the morphological and physiological characteristics of hybrid corn variety CH956311 when grown under the same environmental conditions.
17. The method of claim 16, wherein the desired trait selected from the group consisting of male sterility, herbicide tolerance, insect resistance, disease resistance, waxy starch, modified fatty acid metabolism, modified phytic acid metabolism, modified carbohydrate metabolism and modified zein content.
18. The method of claim 16, further comprising repeating steps (a) and (b) at least once to introduce at least a second trait into hybrid corn variety CH956311, wherein the second trait is selected from the group consisting of male sterility, herbicide tolerance, insect resistance, disease resistance, waxy starch, modified fatty acid metabolism, modified phytic acid metabolism, modified carbohydrate metabolism and modified zein content.
19. A seed produced by the method of claim 16.
20. A seed produced by the method of claim 16.
21. A plant grown from the seed of claim 19.
22. A method of producing an inbred corn plant derived from the hybrid corn variety CH956311, the method comprising the steps of:
(a) preparing a progeny plant derived from hybrid corn variety CH956311 by crossing the plant of claim 2 with a second corn plant;
(b) crossing the progeny plant with itself or a second plant to produce a seed of a progeny plant of a subsequent generation;
(c) growing a progeny plant of a subsequent generation from said seed and crossing the progeny plant of a subsequent generation with itself or a second plant; and
(d) repeating steps (b) and (c) for an addition 3\u201310 generations to produce an inbred corn plant derived from the hybrid corn variety CH956311.

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. An evaluating system for the reliability of a deterioration-effect multi-state flow network which comprises a plurality of nodes and a plurality of arcs deteriorated during data transmission, the plurality of nodes connected by the plurality of arcs, and the evaluating system being used to evaluate a reliability of transmitting M units of data from a source node of the plurality of nodes via at least one of the plurality of nodes and at least one of the plurality of arcs to a sink node of the plurality of nodes and the sink node receiving at least N units of data from a plurality of paths, and N and M being positive integers and M being greater than N, the evaluating system comprising:
a candidate path computing unit, adapted to generate a plurality of first candidate paths that transmit the M units of data from the source node via at least one of a plurality of first arcs to the sink node receiving the M units of data under the assumption that there is no deterioration for each arc, and to obtain a plurality of invalid paths that transmit the M units of data from the source node of the plurality of first candidate paths to the sink node of the plurality of first candidate paths, and to generate a plurality of second candidate paths by removing the plurality of invalid paths from the plurality of first candidate paths, wherein each of the plurality of invalid paths comprises at least one of second arcs whose quantity of the input flow is greater than or equal to a maximum unit of data which can be carried by the second arc; and
a reliability computing unit, adapted to divide the quantity of the output flow of each arc of the plurality of second candidate paths by a deterioration-effect rate of each arc of the plurality of second candidate paths correspondingly to obtain the quantity of the input flow of each arc of the plurality of second candidate paths, and the quantity of the input flow being applied by a ceiling function to generate an integral quantity of the input flow, and the reliability of the plurality of second candidate paths being evaluated according to the integral quantity of the input flow of each arc of the plurality of second candidate paths and a probability distribution corresponding to the integral quantity of the input flow, wherein the quantity of the input flow being a positive rational.
2. The evaluating system of claim 1, wherein the deterioration-effect rate is a ratio of the quantity of the input flow transmitted stably by each of the plurality of arcs to the maximum quantity of the input flow transmitted by each of the plurality of arcs correspondingly.
3. The evaluating system of claim 1, wherein the reliability computing unit computes a sum of first reliabilities of the plurality of second candidate paths and subtracts the sum by second reliabilities of intersected paths of the plurality of second candidate paths according to the principle of inclusion-exclusion, so as to obtain the reliability.
4. An evaluating method for the reliability of a deterioration-effect multi-state flow network which comprises a plurality of nodes and a plurality of arcs deteriorated during data transmission, the plurality nodes connected by the plurality of the arcs, and the evaluating method being used to evaluate a reliability of transmitting M units of data from a source node of the plurality of nodes via at least one of the plurality of nodes and at least one of the plurality of arcs to a sink node of the plurality of nodes and the sink node receiving at least N units of data from a plurality of paths, and N and M being positive integers and M being greater than N, the evaluating method comprising the following steps of:
generating a plurality of first candidate paths that transmit the M units of data from the source node via at least one of the plurality of first arcs to the sink node receiving the M units of data under the assumption that there is no deterioration for each arc;
obtaining a plurality of invalid paths that transmit the M units of data from the source node of the plurality of first candidate paths to the sink node of the plurality of first candidate paths, and generating a plurality of second candidate paths by removing the plurality of invalid paths from the plurality of first candidate paths, wherein each of the plurality of invalid paths comprises at least one of second arcs whose quantity of the input flow is greater than or equal to a maximum unit of data which can be carried by the second arc;
dividing the quantity of output flow of each arc of the plurality of second candidate paths by a deterioration-effect rate of each arc of the plurality of second candidate paths correspondingly to obtain the quantity of the input flow of each arc of the plurality of second candidate paths;
generating an integral quantity of the input flow by applying a ceiling function to the quantity of the input flow; and
evaluating the reliability of the plurality of second candidate paths according to the integral quantity of the input flow of each arc of the plurality of second candidate paths and a probability distribution corresponding to the integral quantity of the input flow, wherein the quantity of the input flow is a positive rational.
5. The evaluating method of claim 4, wherein the deterioration-effect rate is a ratio of the quantity of the input flow transmitted stably by each of the plurality of arcs to the maximum quantity of the input flow transmitted by each of the plurality of arcs correspondingly.
6. The evaluating system of claim 4, wherein a sum of first reliabilities of the plurality of second candidate paths is computed and the sum is subtracted by second reliabilities of intersected paths of the plurality of second candidate paths according to the principle of inclusion-exclusion, so as to obtain the reliability.

1. A polyester resin composition for profile extrusion molding comprising an amorphous polyester resin, and a reactive compound having a weight average molecular weight of 1000 to 500,000, wherein said polyester resin has an acid value of 100 eq.1066 grams or less, and comprises an acid component containing at least 50% by mole of an aromatic dicarboxylic acid having 8 to 14 carbon atoms, and an alcohol component containing at least 50% by mole of at least one glycol selected from the group consisting of ethylene glycol, diethylene glycol, neopentyl glycol, cyclohexanedimethanol, 1,3-propanediol and 2-methyl-1,3-propandiol, and wherein said reactive compound has at least two glycidyl groups per molecule.
2. The polyester resin composition for profile extrusion molding according to claim 1 wherein an amount of said reactive compound is from 0.1 to 20% by weight per 100 parts of said polyester.
3. The polyester resin composition for profile extrusion molding according to claim 1 wherein said aromatic dicarboxylic acid having 8 to 14 carbon atoms is at least one carboxylic acid selected from the group consisting of terephthalic acid and isophthalic acid.
4. A profile shape obtained by profile extrusion molding a polyester resin composition according to claim 1.

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 computer-implemented method, comprising:
receiving, at a data network communication device having a shared data buffer for queuing received data, respective data backlog information for a plurality of sending network devices operationally coupled with the data network communication device, the respective data backlog information for a given sending network device including an indication of an amount of queued data at the given sending network device for transmission to the data network communication device;
determining an amount of aggregate data backlog for the data network communication device based on the respective data backlog information for the plurality of sending network devices;
comparing the aggregate data backlog amount with a threshold;
in the event the aggregate data backlog amount is less than or equal to the threshold, allocating, at the data network communication device, respective data transmission windows to the plurality of sending network devices, wherein respective sizes of the respective data transmission windows are based on the respective data backlog information for each sender;
in the event the aggregate data backlog amount is greater than the threshold, allocating, at the data network communication device, fixed size data transmission windows to each of the plurality of network sending devices, wherein the fixed size data transmission windows are based on a fixed number of packets; and
receiving, at the data network communication device, data from the sending network devices in accordance with at least one of the respective data transmission windows and the fixed size data transmission windows.
2. The computer-implemented method of claim 1, wherein determining the amount of aggregate data backlog comprises determining a sum of the respective data backlogs.
3. The computer-implemented method of claim 1, wherein determining the amount of aggregate data backlog comprises determining a sum of the respective data backlog information, and the method further comprises:
receiving a data packet from a one of the sending network devices, the data packet including a data backlog amount of the one of the sending network devices;
reducing the sum by a previously received data backlog amount of the one of the sending network devices; and
increasing the sum by the received data backlog amount of the one of the sending network devices.
4. The computer-implemented method of claim 1, further comprising:
maintaining a list of the sending network devices, the sending network devices each having a respective data backlog to be sent to the data network communication device, the list including respective previously received data backlog amounts of each sending network device;
receiving a data packet from a one of the sending network devices, the data packet including a data backlog amount of the one of sending network devices;
reducing a sum of the amount of aggregate data backlog by the previously received data backlog amount of the one of the sending network devices; and
increasing the sum by the received data backlog amount of the one of the sending network devices.
5. The computer-implemented method of claim 1, wherein the threshold is a fixed multiple of a queue size of the shared data buffer.
6. The computer-implemented method of claim 1, wherein the threshold is a multiple of a queue size of the shared data buffer, the multiple being variable based on at least one of a number of sending network devices communicating data to the data network communication device and a volume of data traffic being received by the data network communication device from the sending network devices.
7. The computer-implemented method of claim 1, wherein a respective size of the fixed size data transmission window allocated to a one of the sending network devices is weighted based on a class of service of data being received from the one of the sending network devices.
8. The computer implemented method of claim 1, wherein a respective size of the fixed size data transmission window allocated to a one of the sending network devices is weighted based on a transmission latency time of data packets received from the one of the sending network devices.
9. The computer-implemented method of claim 1, wherein the plurality of sending network devices is a subset of network devices having respective data communication channels established with the data network communication device.
10. The computer-implemented method of claim 1, wherein allocating the fixed size data transmission windows comprises allocating the fixed size data transmission windows only when an aggregate allocated window size of the data network communication device is less than or equal to the threshold.
11. The computer-implemented method of claim 1, further comprising:
determining an aggregate allocated window size of the data network communication device, the aggregate allocated window size being a sum of respective sizes of allocated and unused data transmission windows for each of the sending network devices, and
wherein allocating the fixed size data transmission windows comprises allocating the fixed size data transmission windows only when the aggregate allocated window size is less than or equal to the threshold.
12. The computer-implemented method of claim 1, further comprising determining an aggregate allocated window size for the data network communication device, wherein determining the aggregate allocated window size comprises:
determining a sum of respective sizes of allocated and unused data transmission windows for each of the sending network devices;
receiving a data packet from a first one of the sending network devices;
reducing the sum by a size of the received data packet;
allocating a data transmission window to a second one of the sending network devices; and
increasing the sum by a size of the data transmission window allocated to the second one of the sending network devices.
13. The computer-implemented method of claim 12, wherein the first one of the sending network devices and the second one of the sending network devices are a same sending network device.
14. The computer-implemented method of claim 1, further comprising:
receiving a packet from a one of the sending network devices, the packet indicating a zero data backlog for the one of the sending network devices;
removing the one of the sending network devices from a list of active sending network devices; and
allocating a default transmission window to the one of the sending network devices, a size of the default transmission window being smaller than the fixed size data transmission windows.
15. The computer-implemented method of claim 1, further comprising:
establishing a data communication channel with a network device;
receiving a packet from the network device, the packet indicating a non-zero data backlog for the network device;
adding the network device to a list of active sending network devices;
in the event the aggregate data backlog amount is less than or equal to the threshold, allocating a data transmission window to the added network device, wherein a size of the data transmission window allocated to the added network device is based on the non-zero backlog; and
in the event the aggregate data backlog amount is greater than the threshold, allocating a fixed size data transmission window to the added network device.
16. The computer-implemented method of claim 1, further comprising overwriting window allocations of a transport protocol with the respective data transmission window allocations and the fixed sized data transmission window allocations.
17. A non-transitory recordable storage medium having recorded and stored thereon instructions that, when executed by a computing device, perform the actions of:
receiving, at a data network communication device having a shared data buffer for queuing received data, respective data backlog information for a plurality of sending network devices operationally coupled with the data network communication device, the respective data backlog information for a given sending network device including an indication of an amount of queued data at the given sending network device for transmission to the data network communication device;
determining an amount of aggregate data backlog for the data network communication device based on the respective data backlog information for the plurality of sending network devices;
comparing the aggregate data backlog amount with a threshold;
in the event the aggregate data backlog amount is less than or equal to the threshold, allocating, at the data network communication device, respective data transmission windows to the plurality of sending network devices, wherein respective sizes of the respective data transmission windows are based on the respective data backlog information for each sender;
in the event the aggregate data backlog amount is greater than the threshold, allocating, at the data network communication device, fixed size data transmission windows to each of the plurality of network sending devices, wherein the fixed size data transmission windows are based on a fixed number of packets; and
receiving, at the data network communication device, data from the sending network devices in accordance with at least one of the respective data transmission windows and the fixed size data transmission windows.
18. The non-transitory recordable storage medium of claim 17, wherein the instructions, when executed, further provide for:
maintaining a list of the sending network devices, the sending network devices each having a respective data backlog to be sent to the data network communication device, the list including respective previously received data backlog amounts of each sending network device;
receiving a data packet from a one of the sending network devices, the data packet including a data backlog amount of the one of the sending network devices;
reducing a sum of the amount of aggregate data backlog by the respective previously received data backlog amount of the one of the sending network devices; and
increasing the sum by the received data backlog amount of the one of the sending network devices.
19. The non-transitory recordable storage medium of claim 17, wherein the instructions, when executed, further provide for:
determining an aggregate allocated window size of the data network communication device, the aggregate allocated window size being a sum of respective sizes of allocated and unused data transmission windows for each of the sending network devices, and
wherein allocating the fixed size data transmission windows comprises allocating the fixed size data transmission windows only when the aggregate allocated window size is less than or equal to the threshold.
20. The non-transitory recordable storage medium of claim 17, wherein the instructions, when executed, further provide for:
receiving a packet from a one of the sending network devices, the packet indicating a zero data backlog for the one of the sending network devices;
removing the one of the sending network devices from a list of active sending network devices; and
allocating a default transmission window to the one of the sending network devices, a size of the default transmission window being smaller than the fixed size data transmission windows.
21. An data network communication device comprising:
a processor; and
program storage memory operationally coupled with the processor, the program storage memory having instructions stored thereon that, when executed by the processor, provide for:
receiving, at a data network communication device having a shared data buffer for queuing received data, respective data backlog information for a plurality of sending network devices operationally coupled with the data network communication device, the respective data backlog information for a given sending network device including an indication of an amount of queued data at the given sending network device for transmission to the data network communication device;
determining an amount of aggregate data backlog for the data network communication device based on the respective data backlog information for the plurality of sending network devices;
comparing the aggregate data backlog amount with a threshold;
in the event the aggregate data backlog amount is less than or equal to the threshold, allocating, at the data network communication device, respective data transmission windows to the plurality of sending network devices, wherein respective sizes of the respective data transmission windows are based on the respective data backlog information for each sender;
in the event the aggregate data backlog amount is greater than the threshold, allocating, at the data network communication device, fixed size data transmission windows to each of the plurality of network sending devices, wherein the fixed size data transmission windows are based on a fixed number of packets; and
receiving, at the data network communication device; data from the sending network devices in accordance with at least one of the respective data transmission windows and the fixed size data transmission windows.
22. The data network communication device of claim 21, wherein the instructions, when executed by the processor, further provide for:
establishing a network connection with a network device;
receiving a packet from the network device, the packet indicating a non-zero data backlog for the network device;
adding the network device to a list of active sending network devices;
in the event the aggregate data backlog amount is less than or equal to the threshold, allocating a data transmission window to the added network device, wherein a size of the data transmission window allocated to the added network device is based on the non-zero backlog; and
in the event the aggregate data backlog amount is greater than the threshold, allocating a fixed size data transmission window to the added network device.