All The Claims

What is claimed is:

1. A method for operating a system having a fuel cell for powering an electrical load, an energy storage device and an oxidant supply device, the method comprising: providing electrical power from the energy storage device to drive the oxidant supply device, in response to an increased electrical power demand from the electrical load, and then, when an increase in the fuel cell power output has been detected, providing electrical power from the energy storage device to the electrical load.
2. The method of claim 1 wherein no electrical power is supplied from the energy storage device to the electrical load until the increase in the fuel cell power output has been detected.
3. The method of claim 1, further comprising the step of reducing the electrical power provided from the energy storage device to the oxidant supply device when the increase in the fuel cell power output has been detected.
4. The method of claim 1 wherein the amount of power provided by the energy storage device to the load compensates the power shortage between the electrical power demand of the electrical load and power available from the fuel cell to the electrical load.
5. The method of claim 2 wherein the amount of power provided by the energy storage device to the load compensates the power shortage between the electrical power demand of the electrical load and power available from the fuel cell to the electrical load.
6. The method of claim 1 wherein the electrical storage device is a battery.
7. The method of claim 1 wherein the electrical storage device is a supercapacitor.
8. A fuel cell system comprising:
a fuel cell for powering an electrical load;
an oxidant supply device for supply oxidant to the fuel cell;
an energy storage device for providing at least temporary electrical power to drive the oxidant supply device and to the electrical load; and
a control device which, in response to an increased power demand from the electrical load, directs the energy storage device to provide electrical power to the oxidant supply device, and then, when an increase in the fuel cell power output has been detected, directs the energy storage device to provide power to the electrical load.
9. The system of claim 8 wherein the control device, when the increase in the fuel cell power output has been detected, reduces the electrical power provided from the energy storage device to the oxidant supply device.
10. The system of claim 8 wherein the control device controls the amount of power provided by the energy storage device to the load to compensate the power shortage between the electrical power demand of the electrical load and power available from the fuel cell to the electrical load.
11. The system of claim 8 wherein the electrical storage device is a battery.
12. The system of claim 8 wherein the electrical storage device is a supercapacitor.

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 method for forming a bound network, comprising:
decomposing an asynchronous input network to form a network of base functions, wherein the network of base functions is selected to include simple base functions that include two-input threshold OR functions and two-input threshold AND functions with hysteresis if the simple base functions would not create hazards in the network of base functions, and selected to include complex base functions if the simple base functions would create hazards in the network of base functions, generated during the decomposing;
partitioning the network of base functions into at least one subject graph that includes a plurality of different portions, each portion of the at least one subject graph having a function;
determining matches between the at least one subject graph and one or more pattern graphs; and
forming the bound network by selecting at least one of the one or more pattern graphs to be used in the bound network for the function of each of the different portions of the at least one subject graph.
2. The method of claim 1, wherein decomposing comprises determining if a vertex in the asynchronous input network was produced by cell merger.
3. The method of claim 1, wherein the decomposing comprises determining if a vertex in the asynchronous input network is one of the simple base functions.
4. The method of claim 1, wherein the decomposing comprises determining if a vertex in the asynchronous input network is an threshold OR function with two or more inputs.
5. The method of claim 1, wherein the decomposing comprises registering a vertex of the asynchronous input network as a complex base function.
6. The method of claim 1, further comprising generating the one or more pattern graphs by decomposing cells of a technology library.
7. The method of claim 1, wherein the partitioning partitions the network of base functions into at least two subject graphs at a vertex with multiple fan-outs in the network of base functions.
8. The method of claim 1, wherein determining matches comprises determining if one of the one or more pattern graphs is a leaf.
9. The method of claim 1, wherein determining matches comprises determining if one of the at least one subject graphs is a leaf.
10. The method of claim 1, wherein determining matches comprises determining if a cell function of one of the one or more pattern graphs is different from a cell function of the root of one of the at least one subject graph.
11. The method of claim 1, wherein one of the one or more pattern graphs has a root with fan-ins and one of the at least one subject graphs has a root with fan-ins, and wherein determining matches comprises determining if the fan-ins of the root of the one of the one or more pattern graphs matches the fan-ins of the root of the one of the at least one subject graph.
12. The method of claim 1, further comprising manufacturing a circuit from the bound network.
13. The method of claim 1, wherein the bound network is hazard-free.
14. A computer-readable medium containing computer-executable instructions that, when executed by a processor, cause the processor to perform a method for forming a bound network, the method comprising:
decomposing an asynchronous input network to form a network of base functions, wherein the network of base functions is selected to include simple base functions that include two-input threshold OR functions and two-input threshold AND functions with hysteresis if the simple base functions would not create hazards in the network of base functions, and selected to include complex base functions if the simple base functions would create hazards in the network of base functions, generated during the decomposing;
partitioning the network of base functions into at least one subject graph that includes a plurality of different portions, each portion of the at least one subject graph having a function;
determining matches between the at least one subject graph and one or more pattern graphs; and
selecting at least one of the one or more pattern graphs to be used in the bound network for the function of each of the different portions of the at least one subject graph.
15. The medium of claim 14, wherein decomposing comprises determining if a vertex in the asynchronous input network was produced by cell merger.
16. The medium of claim 14, wherein the decomposing comprises determining if a vertex in the asynchronous input network is one of the simple base functions.
17. The medium of claim 14, wherein the decomposing comprises determining if a vertex in the asynchronous input network is an threshold OR function with two or more inputs.
18. The medium of claim 14, wherein the decomposing comprises registering a vertex of the asynchronous input network as a complex base function.
19. The medium of claim 14, wherein the method further comprises generating the one or more pattern graphs by decomposing cells of a technology library.
20. The medium of claim 14, wherein the partitioning partitions the network of base functions into at least two subject graphs at a vertex with multiple fan-outs in the network of base functions.
21. The medium of claim 14, wherein determining matches comprises determining if one of the one or more pattern graphs is a leaf.
22. The medium of claim 14, wherein determining matches comprises determining if one of the at least one subject graphs is a leaf.
23. The medium of claim 14, wherein determining matches comprises determining if a cell function of one of the one or more pattern graphs is different from a cell function of the root of one of the at least one subject graph.
24. The medium of claim 14, wherein one of the one or more pattern graphs has a root with fan-ins and one of the at least one subject graph has a root with fan-ins, and wherein determining matches comprises determining if the fan-ins of the root of the one of the one or more pattern graphs matches the fan-ins of the root of the one of the at least one subject graph.
25. The medium of claim 14, wherein the bound network is hazard-free.

1. A rotor having a substantially cylindrical configuration for use in a brushless direct current electric motor having a high torque to size ratio, said rotor having an outer peripheral surface, the rotor comprising: a central rotor shaft; a first and second retaining ends located on said central rotor shaft and being spaced from one another; a plurality of magnets configured to provide an electromagnetic flux disposed around the central rotor shaft, the plurality of permanent magnets radially disposed on the shaft; and a sheath positioned around the radially disposed permanent magnets holding the magnets around the shaft.
2. The rotor of claim 1, wherein said permanent magnets are radially disposed to surround the rotor shaft.
3. The rotor of claim 1, wherein the sheath is made from a rigid material.
4. The rotor of claim 1, wherein at least one retaining end is configured to translate rotational movement to a gear.
5. The rotor of claim 1, wherein the rotor shaft is a hexagonal six sided member with the plurality of magnet received on each of the six sides.
6. The rotor of claim 1, further comprising a plurality of second permanent magnets disposed along the longitudinal axis forming a second phase.
7. The rotor of claim 1, wherein the plurality of magnets form at least three rotational phases on the rotor shaft.
8. The rotor of claim 1, wherein the plurality of magnets form a first phase, a second phase, and a third phase along the rotor shaft, and wherein the first phase includes the plurality of magnets radially surrounding the rotor shaft in a first location with the sheath substantially surrounding the plurality of magnets of the first phase.
9. The rotor of claim 8, wherein the second phase includes the plurality of magnets radially surrounding the rotor shaft in a second location, the second location being separated from the first location with a second sheath substantially surrounding the plurality of magnets of the second phase.
10. The rotor of claim 9, wherein the third phase includes the plurality of magnets radially surrounding the rotor shaft in a third location, the third location separated from the second location with a third sheath substantially surrounding the plurality of magnets of the third phase.
11. The rotor of claim 10, wherein the magnets of the first through third phases are supported by the first through third respective sheaths made from a crimped material.
12. A method of connecting permanent magnets to a rotor output shaft configured for a brushless direct current electric motor having an in-runner configuration, the method comprising: placing at least two permanent magnets on a planar surface of the rotor shaft in an alternating north-south configuration; and crimping a material to substantially surround the at least two permanent magnets in place on the rotor output shaft to provide an electromagnetic flux between a plurality of stator windings and the at least two permanent magnets.
13. The rotor of claim 1, wherein the sheath is lightweight and minimizing a gap between the permanent magnets and the stator for rotation of the central rotor shaft and to provide for the electromagnetic flux between the magnets and the stator windings.

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 method comprising:
receiving internet protocol data at the one or more network devices, the internet protocol data generated at a data source device and communicated to the one or more network devices; and
selectively deleting portions of the data based on specified criteria to effect improved data flow of the internet protocol data, the specified criteria selected from the group consisting of time since last drop, number of packets since last dropped, packet protocol, packet size and combinations thereof.
2. The method of claim 1 wherein the one or more of the specified criteria are dynamically determined.
3. The method of claim 1 wherein one or more specified criteria have a corresponding value that is dynamically determined.
4. The method of claim 1 wherein the generated data is encrypted and the specified criteria includes packet size.
5. A method comprising:
receiving internet protocol data, communicated via a flow controllable interface, at the one or more network devices, the internet protocol data generated at a data source device and communicated to the one or more network devices; and
selectively deleting portions of the data based on specified criteria to effect improved data flow of the internet protocol data.
6. The method of claim 5 wherein the one or more of the specified criteria are dynamically determined.
7. The method of claim 5 wherein one or more specified criteria have a corresponding value that is dynamically determined.
8. The method of claim 5 wherein the generated data is encrypted and the specified criteria includes packet size.
9. An apparatus comprising:
a network device communicatively coupled to a data source device, the network device configured to receive internet protocol data generated at the data source device and selectively delete portions of the data based on specified criteria to effect improved data flow of the internet protocol data the specified criteria selected from the group consisting of time since last drop, number of packets since last dropped, packet protocol, packet size and combinations thereof.
10. The apparatus of claim 9 wherein the one or more of the specified criteria are dynamically determined.
11. The apparatus of the claim 9 wherein one or more specified criteria have a corresponding value that is dynamically determined.
12. The apparatus of claim 9 wherein the generated data is encrypted and the specified criteria includes packet size.
13. An apparatus comprising:
a network device communicatively coupled to a data source device, the network device configured to receive internet protocol data generated at the data source device, the internet protocol data communicated via a flow controllable interface, and selectively delete portions of the data based on specified criteria to effect improved data flow of the internet protocol data.
14. The apparatus of claim 13 wherein the one or more of the specified criteria are dynamically determined.
15. The apparatus of the claim 13 wherein one or more specified criteria have a corresponding value that is dynamically determined.
16. The apparatus of claim 13 wherein the generated data is encrypted and the specified criteria includes packet size.
17. A machine-readable medium that provides executable instructions, which when executed by a processor, cause the processor to perform a method, the method comprising:
receiving internet protocol data at the one or more network devices, the internet protocol data generated at a data source device and communicated to the one or more network device; and
selectively deleting portions of the data based on specified criteria to effect improved data flow of the internet protocol data the specified criteria selected from the group consisting of time since last drop, number of packets since last dropped, packet protocol, packet size and combinations thereof.
18. The machine-readable medium of claim 17 wherein the one or more of the specified criteria are dynamically determined.
19. The machine-readable medium of claim 17 wherein one or more specified criteria have a corresponding value that is dynamically determined.
20. The machine-readable medium of claim 17 wherein the generated data is encrypted and the specified criteria includes packet size.
21. A machine-readable medium that provides executable instructions, which when executed by a processor, cause the processor to perform a method, the method comprising:
receiving internet protocol data, communicated via a flow controllable interface, at the one or more network devices, the internet protocol data generated at a data source device and communicated to the one or more network devices; and
selectively deleting portions of the data based on specified criteria to effect improved data flow of the internet protocol data.
22. The machine-readable medium of claim 21 wherein the one or more of the specified criteria are dynamically determined.
23. The machine-readable medium of claim 21 wherein one or more specified criteria have a corresponding value that is dynamically determined.
24. The machine-readable medium of claim 21 wherein the generated data is encrypted and the specified criteria includes packet size.