1461086133-248bdcf3-218f-4ffb-8560-46f034d45f3f

1. A keypad for entering data in an electronic device, the keypad comprising:
a first carrier having a first side and a second side;
a key panel coupled to the first side of the first carrier;
a backlighting module coupled to the second side of the first carrier;
an actuator panel located on an opposite side of the backlighting module from the key panel and operatively coupled to the key panel;
a dome panel operatively coupled to the actuator panel through a dome array film; and
a printed circuit board coupled to the dome panel.
2. The keypad of claim 1, wherein the first carrier comprises a polymer film and the key panel is coupled to the first side of the first carrier by an adhesive.
3. The keypad of claim 1, wherein the backlighting module is an electroluminescent panel.
4. The keypad of claim 3, wherein the backlighting module comprises:
a conducting layer located on the second side on the first carrier;
a phosphor layer located on the conducting layer; and
one or more electrodes coupled to the phosphor layer.
5. The keypad of claim 4, wherein the phosphor layer is a conductor comprising one of a sputtered layer and a screen printed layer.
6. The keypad of claim 4, wherein the conducting layer is a translucent layer made up of indium tin oxide.
7. The keypad of claim 4, wherein the one or more electrodes are opaque electrodes selected from a group comprising carbon electrodes, and silver electrodes.
8. The keypad of claim 4, wherein the backlighting module further comprises one or more insulating layers between the phosphor layer and the one or more electrodes.
9. The keypad of claim 8, wherein the one or more insulating layers are made of material selected from a group comprising oxides of aluminum, oxides of titanium, oxides of silicon, and oxides of yttrium.
10. The keypad of claim 1, wherein the first carrier is a substrate selected from a group comprising polyethylene terephthalate substrate, a polyester substrate, and a polycarbonate substrate.
11. A keypad, comprising:
an electroluminescent panel having a first side and a second side and comprising: a phosphor layer, one or more electrodes coupled to the phosphor layer and one or more insulating layers between the phosphor layer and the one or more electrodes;
a key panel coupled to the first side of the electroluminescent panel; and
a dome array coupled to the second side of the electroluminescent panel.
12. The keypad of claim 11, wherein the dome array comprises:
an actuator panel coupled to the second side of the electroluminescent panel and operatively coupled to the key panel; and
a dome panel operatively coupled to the actuator panel through a dome array film.
13. The keypad of claim 11, further comprising a printed circuit board coupled to an opposite side of the dome array from the electroluminescent panel.
14. The keypad of claim 11, wherein the phosphor layer is one of a sputtered layer, and a screen printed layer.
15. The keypad of claim 11, wherein the phosphor layer is a translucent layer made up of indium tin oxide.
16. The keypad of claim 11, wherein the one or more electrodes are opaque electrodes selected from a group comprising carbon electrodes and silver electrodes.
17. The keypad of claim 11, wherein the one or more insulating layers are made of material selected from a group comprising oxides of aluminum, oxides of titanium, oxides of silicon, and oxides of yttrium.

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 encoding plaintext to create ciphertext using an Oommen-Rueda tree, which Oommen-Rueda tree has a root, branches and leaves, comprising the steps of:
(a) receiving a first character of plaintext;
(b) traversing the Oommen-Rueda tree between the root of the Oommen-Rueda tree, and a leaf of the Oommen-Rueda tree corresponding to the first character of plaintext, and recording an Assignment Value of at least one branch of the Oommen-Rueda tree so traversed;
(c) calculating a character of ciphertext related to the Assignment Value of the at least one branch of the Oommen-Rueda tree so traversed;
(d) calculating an Assignment Value for at least one other branch of the Oommen-Rueda tree related to a distribution of the ciphertext previously calculated;
(e) receiving a next character of plaintext;
(f) traversing the Oommen-Rueda tree between the root of the Oommen-Rueda tree and a further leaf of the Oommen-Rueda tree corresponding to a next character of plaintext;
(g) calculating a further Assignment Value for at least one further traversed branch of the Oommen-Rueda tree related to a further distribution of the further ciphertext previously calculated;
(h) calculating a further character of ciphertext relating to the further Assignment Value for the at least one further traversed branch of the Oommen-Rueda tree;
(i) repeating steps (e) through (h) until all of the plaintext has been processed;
(j) outputting the ciphertext; and
wherein the Assignment Value for at least one branch traversed is determined in accordance with a Branch Assignment Rule.
2. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when a member of the ciphertext alphabet is under-represented in the ciphertext generated thus far, the Branch Assignment Rule assigns that member of the ciphertext alphabet to at least one of the branches being traversed between the root and the leaf so that that member of the ciphertext alphabet is no longer as under-represented as before the assignment.
3. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when a member of the ciphertext alphabet is under-represented in the ciphertext generated thus far, the Branch Assignment Rule assigns that member of the ciphertext alphabet more frequently than other members of the ciphertext alphabet to the branches being traversed between the root and the leaf so that that member of the ciphertext alphabet is no longer as under-represented as before the assignment.
4. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary, the Branch Assignment Rule assigns a zero to the majority of branches being traversed between the root and the leaf when zero is under-represented in the ciphertext generated thus far, and assigns a one to the majority of branches being traversed between the root and the leaf when one is under-represented in the ciphertext generated thus far.
5. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein, when the conditional frequency of one member of the ciphertext alphabet given a particular sequence of members of the ciphertext alphabet in the ciphertext generated thus far, is under-represented in the ciphertext generated thus far, the Branch Assignment Rule assigns that member of the ciphertext alphabet to at least one of the branches being traversed between the root and the leaf so that the said conditional frequency of that member of the ciphertext alphabet is no longer as under-represented as before the assignment.
6. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein, when the conditional frequency of one member of the ciphertext alphabet given a particular sequence of members of the ciphertext alphabet in the ciphertext generated thus far, is under-represented in the ciphertext generated thus far, the Branch Assignment Rule assigns that member of the ciphertext alphabet more frequently than other members of the ciphertext alphabet to the branches being traversed between the root and the leaf so that the said conditional frequency of that member of the ciphertext alphabet is no longer as under-represented as before the assignment.
7. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein the Branch Assignment Rule assigns a member of the ciphertext alphabet to at least one of the branches being traversed between the root and the leaf, such assignment being determined by comparing a number associated with the frequency of at least one member of the ciphertext alphabet in the ciphertext generated thus far, with a number associated with the output of a pseudo-random number generator.
8. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary, the Branch Assignment Rule assigns a member of the binary alphabet to at least one branch being traversed between the root and the leaf by utilizing at least two pseudo-random numbers, zero being assigned when a first pseudo-random number is less than a second pseudo-random number, where the generation of the second pseudo-random number is bounded between a number associated with the frequency of zeros in the ciphertext generated thus far and the quantity of one minus the said number associated with the frequency of zeros in the ciphertext generated thus far.
9. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary, the Branch Assignment Rule assigns a member of the binary alphabet to at least one of the branches being traversed between the root and the leaf, such assignment being determined by comparing a number associated with the frequency of a member of the binary alphabet in the ciphertext generated thus far, with a number associated with the output of a pseudo-random number generator.
10. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein the Branch Assignment Rule assigns a member of the ciphertext alphabet to at least one branch being traversed between the root and the leaf, such assignment being determined by a number associated with the output of a pseudo-random number generator.
11. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary, the Branch Assignment Rule assigns a member of the binary alphabet to at least one branch being traversed between the root and the leaf, such assignment being determined by comparing a number associated with the a pseudo-random number with a range equal to half the domain of the generator generating the pseudo-random number.
12. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein the Branch Assignment Rule assigns a member of the ciphertext alphabet of cardinality R to at least one branch being traversed between the root and the leaf, such assignment being determined by invoking at least two times (R minus 1) pseudo-random numbers, the domains of at least one of the pseudo-random numbers being related to the frequencies of the occurrences of the ciphertext characters generated thus far, and the domain of at least one of the other of the pseudo-random numbers having a mean of iR for the ith branch of each node encountered in the traversal, where i is the relative position of the branch quantified by a pre-specified ordering of the branches, and the Branch Assignment Rule being such that where the ciphertext character associated with the ith branch in the said ordering is under-represented in the ciphertext generated thus far, it is no longer as under-represented.
13. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary; the Branch Assignment Rule assigns a member of the binary ciphertext alphabet to at least one branch being traversed between the root and the leaf, such assignment being determined by invoking at least two pseudo-random numbers, the domain of the first of these pseudo-random numbers being related to the frequency of the occurrence of zero in the ciphertext, and the domain of a second of these pseudo-random numbers having a mean of 0.5, and the Branch Assignment Rule being such that when any character of the ciphertext alphabet is under-represented in the ciphertext generated thus far, it is no longer as under-represented.
14. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1 wherein when the ciphertext alphabet is binary, the Branch Assignment Rule assigns a member of the binary ciphertext alphabet to at least one branch being traversed between the root and the leaf, such assignment being determined by comparing at least the output of two invoked pseudo-random numbers, the first of which has a domain having a mean between a number associated with the frequency of zeros and the quantity 0.5, and the second of which is a pseudo-random number having a domain whose mean is 0.5, and the Branch Assignment Rule being such that where any member of the ciphertext alphabet is under-represented in the binary ciphertext generated thus far, it is no longer as under-represented.
15. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claims 7, 9, 10, 11, 12, 13, 14, or 8, comprising the further step of receiving first key data associated with an initial seed for at least one of the generators of the pseudo-random numbers utilized by the Branch Assignment Rule.
16. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according claim 1 comprising the further steps of, after at least one traversal of the Oommen-Rueda Tree, recalculating a number associated with the frequency weight of at least one of the nodes of the Oommen-Rueda tree including the internal nodes and the leaves depending therefrom, and thereafter restructuring the Oommen-Rueda Tree in accordance with a Tree Restructuring Rule.
17. The A method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, comprising the further step of receiving second key data associated with the structure and labeling of the Oommen-Rueda Tree.
18. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein the plaintext is modified prior to processing by the addition of a pre- specified prefix data stream.
19. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein at least one of the steps is preformed by a suitably programmed processor.
20. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein at least one of the steps is a process executed in software.
21. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein at least one of the steps is a process executed in firmware.
22. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, further comprising the step of subsequently encrypting the ciphertext generated by any standard encryption process.
23. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein the ciphertext possesses Statistical Perfect Secrecy.
24. The method for encoding plaintext to create ciphertext using an Oommen-Rueda tree according to claim 1, wherein the ciphertext output is at least one of displayed, transmitted, and stored.
25. A method for decoding ciphertext encoded utilizing an Oommen-Rueda Tree and utilizing a Branch Assignment Rule to provide Assignment Values for the branches depending from the root of the Oommen-Rueda Tree, comprising the steps of:
(a) receiving a first character of ciphertext;
(b) utilizing an Oommen-Rueda Tree having a structure corresponding to the Oommen-Rueda Tree initially utilized to encode the ciphertext and utilizing the same Branch Assignment Rule as utilized to encode the ciphertext to provide the Assignment Values for the branches depending from the root, traversing such Oommen-Rueda Tree from the root towards a leaf, the first character of ciphertext determining the branch to then be traversed;
(c) if a leaf has not been reached, utilizing the same Branch Assignment Rule as utilized to encode the ciphertext to provide Assignment Values for the branches depending from the node that has been reached, receiving the next character of ciphertext, and continuing to traverse the Oommen-Rueda Tree from the node that has been reached towards a leaf, the current symbol of ciphertext determining the branch to then be traversed;
(d) when a leaf is reached, recording the plaintext character associated with the label of the leaf, the root becoming the node that has been reached for the purpose of further processing;
(e) repeating steps c and d until all symbols of ciphertext have been processed.
26. The method for decoding ciphertext according to claim 25 comprising the further step of receiving first key data associated with the initial seed for at least one of the generators of the pseudo-random numbers utilized by the Branch Assignment Rule, where first key data is associated with the first key data utilized by the Encoder.
27. The method for decoding ciphertext according to claim 25, comprising the further step of receiving second key data associated with the structure and labeling of the Oommen-Rueda Tree, where second key data is associated with the second key data utilized by the Encoder.
28. The method for decoding ciphertext according to claim 25, wherein when the plaintext has been modified prior to processing by the addition of a pre-specified prefix data stream, the ciphertext is modified prior to processing by the addition of an encoded pre-specified data stream in a prefix manner, and where this encoded pre-specified data stream is related to the pre-specified data stream utilized by the Encoder.
29. The method for decoding ciphertext according to claim 25, wherein at least one of the steps is preformed by a suitably programmed processor.
30. The method for decoding ciphertext according to claim 25, wherein at least one of the steps is a process executed in software.
31. The method for decoding ciphertext according to claim 25, wherein at least one of the steps is a process executed in firmware.
32. The method of decoding ciphertext according to claim 25, comprising the further steps of initially decrypting the ciphertext data stream using the standard decryption process associated with the encryption process, and thereafter decoding.
33. A method for decoding ciphertext, comprising the steps of:
(a) creating an Oommen-Rueda Tree structure corresponding to the Oommen-Rueda Tree initially utilized by the Encoder;
(b) receiving a first character of ciphertext;
(c) utilizing the Oommen-Rueda Tree structure, and utilizing the same Branch Assignment Rule as utilized by the Encoder to provide the Assignment Values for the branches depending from the root, traversing such Oommen-Rueda Tree from the root towards a leaf, the first character of ciphertext determining the branch to then be traversed;
(d) if a leaf has not been reached, utilizing the same Branch Assignment Rule as utilized by the Encoder to provide Assignment Values for the branches depending from the node that has been reached, receiving the next character of ciphertext, and continuing to traverse the Oommen-Rueda Tree from the node that has been reached towards a leaf, the current symbol of ciphertext determining the branch to then be traversed;
(e) when a leaf is reached, recording the plaintext character associated with the label of the leaf, the root becoming the node that has been reached for the purpose of further processing;
(f) repeating steps d and e until all symbols of ciphertext have been processed.

1461086121-6f600e2a-c5bc-4524-9ae8-ccb5338a07db

1. A catalyst composition, comprising:
a catalytic metal secured to a substrate, wherein the substrate has pores that are templated; and,
a calcined product having distribution of clusters of catalytic metal atoms secured to the substrate,
wherein the calcined product is prepared by a process comprising the steps of:
mixing a catalytic metal salt, a templating agent, a solvent, and water to form a water-in-oil microemulsion,
adding a substrate precursor to the water-in-oil microemulsion to form a slurry; and,
calcining the slurry to form a substrate having a porous template that is capable of supporting the catalyst composition.
2. The catalyst composition of claim 1 , wherein the catalytic metal comprises silver, gold, palladium, platinum, cobalt, nickel, iron, or a transition metal.
3. The catalyst composition of claim 1, wherein the catalytic metal comprises at least one promoting metal selected from the group consisting of gallium, indium, gold, vanadium, zirconium, zinc, tin, bismuth, cobalt, rhodium, platinum, molybdenum, and tungsten.
4. The catalyst composition of claim 1, wherein the pores have a single point pore volume of greater than about 0.5 cubic centimeters per gram.
5. The catalyst composition of claim 1, wherein the pores have an average diameter of greater than about 45 nanometers.
6. The catalyst composition of claim 1, wherein the surface area of the catalyst composition is greater than about 200 m2gram.
7. The catalyst composition of claim 1, wherein the catalytic metal is capable of reducing or eliminating NOx in an exhaust gas stream in contact therewith in the presence of diesel fuel at determined operating conditions.
8. A catalyst composition comprising:
clusters of catalytic metal atoms secured to a substrate, wherein a first portion of the clusters of catalytic metal atoms are less than about 10 Angstroms and corresponds to clusters of less than about 3 catalytic metal atoms, and a second portion of clusters of catalytic metal atoms are greater than about 50 Angstroms and corresponds to clusters of greater than about 15catalytic metal atoms.
9. A catalyst composition, comprising:
a catalytic metal secured to a substrate, wherein the substrate has pores that are templated; and,
a calcined product having distribution of clusters of catalytic metal atoms secured to the substrate.

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 thermoelectric heat pump assembly having a top end and a bottom end, the thermoelectric heat pump assembly comprising:
(a) two to nine thermoelectric unit layers capable of active use of the Peltier effect, each thermoelectric unit layer having a cold side and a hot side;
(b) at least one capacitance spacer block that stores heat and provides a buffer to delay transfer of heat from one thermoelectric unit layer to another, the capacitance spacer block having a top portion and a bottom portion and being between a first thermoelectric unit layer and a second thermoelectric layer, wherein the top portion of the capacitance spacer block is thermally connected to the hot side of the first thermoelectric unit layer and the bottom portion is thermally connected to the cold side of the second thermoelectric unit layer, thereby forming a sandwich layer that pumps heat from the first thermoelectric unit layer to the second thermoelectric layer;
(c) at least one energy source operably connected to each thermoelectric unit layer, wherein the energy source is suitable to provide a current, the thermoelectric heat pump assembly being configured so that each individual thermoelectric unit layer has a ratio of input current to maximum available current (IImax) of 0.09 or less at a steady-state when a change in temperature (\u0394T) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is about 20\xb0 C. and heat removal (Q) is about 0 Watts; and
(d) a heat sink associated with a fax assembly, wherein the heat sink is thermally connected at the bottom end of the heat pump assembly.
2. A thermoelectric heat pump assembly having a top end and a bottom end, the thermoelectric heat pump assembly comprising:
(a) two to nine thermoelectric unit layers capable of active use of the Peltier effect, each thermoelectric unit layer having a cold side and a hot side;
(b) at least one capacitance spacer block that stores heat and provides a buffer to delay transfer of heat from one thermoelectric unit layer to another, the capacitance spacer block having a top portion and a bottom portion and being between a first thermoelectric unit layer and a second thermoelectric layer, wherein the top portion of the capacitance spacer block is thermally connected to the hot side of the first thermoelectric unit layer and the bottom portion is thermally connected to the cold side of the second thermoelectric unit layer, thereby forming a sandwich layer that pumps heat from the first thermoelectric unit layer to the second thermoelectric layer;
(c) at least one energy source operably connected to each thermoelectric unit layer, wherein the energy source is suitable to provide a current; and
(d) a heat sink associated with a fan assembly, wherein the heat sink is thermally connected at the bottom end of the heat pump assembly, the heat pump assembly being configured to minimize a temperature rise or drop on the heat sink at a steady-state so that the temperature rise or drop on the heat sink does not exceed 3\xb0 Celsius as compared to ambient.
3. A thermoelectric heat pump assembly having a top end and a bottom end, the thermoelectric heat pump assembly comprising:
(a) two to nine thermoelectric unit layers capable of active use of the Peltier effect, each thermoelectric unit layer having a cold side and a hot side;
(b) at least one capacitance spacer block that stores heat and provides a buffer to delay transfer of heat from one thermoelectric unit leer to another, the capacitance spacer block having a top portion and a bottom portion and being between a first thermoelectric unit layer and a second thermoelectric layer, wherein the top portion of the capacitance spacer block is thermally connected to the hot side of the first thermoelectric unit layer and the bottom portion is thermally connected to the cold side of the second thermoelectric unit layer, thereby forming a sandwich layer that pumps heat from the first thermoelectric unit layer to the second thermoelectric layer;
(c) at least one energy source operably connected to each thermoelectric unit layer, wherein the energy source is suitable to provide a current;
(d) a heat sink associated with a fan assembly, wherein the heat sink is thermally connected at the bottom end of the heat pump assembly; and
(e) a microcontroller operatively associated with the energy source and at least one relay, wherein the microcontroller activates the relay which directs current from the energy source to at least one of the thermoelectric unit layers and reconnects the thermoelectric unit layer in series or parallel with another thermoelectric unit layer.
4. The thermoelectric heat pump assembly of claim 3, wherein the microcontroller defines a setpoint temperature (Tsp) and compares the Tsp to a temperature (Tc) of a container operatively associated with the thermoelectric heat pump assembly, wherein the microcontroller controls the at least one relay to connect the at least one thermoelectric unit layer in series if Tc checks positive or equal against Tsp, and wherein the microcontroller deactivates the at least one relay if Tsp checks negative or equal against Tc.
5. The thermoelectric heat pump assembly of claim 3, wherein the microcontroller defines a setpoint temperature (Tsp) and compares the Tsp to a temperature (Tc) of a container operatively associated with the thermoelectric heat pump assembly, wherein the microcontroller activates the at least one relay to connect the at least one thermoelectric unit layer in parallel if Tc checks positive or equal against Tsp, and wherein the microcontroller deactivates the at least one relay if Tsp checks negative or equal against Tc.
6. The thermoelectric heat pump assembly according to claim 5, wherein the Tc checks positive or equal if the Tc is greater than the Tsp plus 0.1\xb0 C., and wherein the at least one thermoelectric unit layer is in series and the energy source provides a potential difference of about 2.4 volts.
7. The thermoelectric heat pump assembly of claim 3, wherein the thermoelectric heat pump assembly is configured so that each individual thermoelectric unit layer has a ratio of input current to maximum available current (IImax) of 0.08 or less at a steady-state when a change in temperature (\u0394T) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is about 20\xb0 C. and heat (Q) is about 0 Watts.
8. The thermoelectric heat pump assembly of claim 3, wherein the thermoelectric heat pump assembly is configured so that each individual thermoelectric unit layer has a ratio of input current to maximum available current (IImax) of 0.10 or less, when change in temperature (\u0394T) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is about 20\xb0 C. and heat (Q) is about 5 Watts.
9. The thermoelectric heat pump assembly of claim 3, wherein the thermoelectric heat pump assembly is configured so that each individual thermoelectric unit layer has a ratio of input current to maximum available current (IImax) of 0.17 or less at a steady-state when a change in temperature (AT) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is about 40\xb0 C. and heat (Q) is about 0 Watts.
10. The thermoelectric heat pump assembly of claim 3, wherein the thermoelectric heat pump assembly is configured so that each individual thermoelectric unit layer has a ratio of input current to maximum available current (IImax) of 0.22 or less, when change in temperature (\u0394T) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is about 40\xb0 C. and heat (Q) is about 1 Watt.
11. The thermoelectric heat pump assembly of claim 3, wherein the heat pump assembly is configured to minimize a temperature rise or drop on the heat sink at a steady-state so that the temperature rise or drop on the heat sink does not exceed 2.5\xb0 Celsius.
12. The thermoelectric heat pump assembly of claim 3, wherein each thermoelectric unit layer comprises at least 127 coupled pairs of thermoelectric units and has a heat pumping capability of between 15 Watts and 20 Watts.
13. The thermoelectric heat pump assembly of claim 3, wherein each thermoelectric unit layer comprises thermoelectric units electrically connected in parallel or series, but thermally connected in series.
14. The thermoelectric heat pump assembly of claim 3, wherein each thermoelectric unit layer in the heat pump assembly is separated by a capacitance spacer block.
15. The thermoelectric heat pump assembly of claim 3, wherein the number of thermoelectric unit layers is three to nine.
16. The thermoelectric heat pump assembly of claim 3, wherein the thermoelectric heat pump assembly includes programmable circuitry suitable for a user-selected temperature input.
17. The thermoelectric heat pump assembly of claim 3, wherein each thermoelectric unit layer has a maximum change in temperature (\u0394Tmax) potential and comprises at least 127 coupled pairs of thermoelectric units, and wherein the heat pump assembly is configured so that each thermoelectric layer operates at less than 20% of the \u0394Tmax at steady-state when a change in temperature (AT) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is 20\xb0 C.
18. The thermoelectric heat pump assembly of claim 3, wherein each thermoelectric unit layer has a maximum change in temperature (\u0394Tmax) potential and comprises at least 127 coupled pairs of thermoelectric units, and wherein the heat pump assembly is configured so that each thermoelectric layer operates at less than 40% of the \u0394Tmax at steady-state when a change in temperature (\u0394T) of the heat pump assembly at the top end compared to the bottom end of the heat pump assembly is 40\xb0 C.
19. A method of safely transporting temperature sensitive goods at a selected temperature profile during transport, comprising the steps of:
(a) placing the temperature sensitive goods in a transportation device adapted to thermally isolate the temperature sensitive goods from an outside environment, wherein the transportation device comprises at least one temperature control system adapted to actuate the selected temperature profile while the temperature sensitive goods are in the transportation device, the temperature control system comprising at least one thermoelectric heat pump of claim 4 in thermal association with the temperature sensitive goods being transported; and
(b) transporting the temperature sensitive goods while the transportation device is activated according to the selected temperature profile.
20. The method of claim 19, wherein the transportation device comprises at least four thermoelectric heat pumps thermally associated with the temperature sensitive goods being transported.