1461108987-8258db20-0cee-4b64-a01f-c0ae34809020

What is claimed is:

1. A computerized method for copying electronic data stored in a first backup data set, the method comprising:
identifying, in the first backup data set, a data item satisfying a selection criterion; and
copying to a second backup data set at least a portion of the data item.
2. The method of claim 1, wherein identifying the data item comprises identifying a full backup within a primary backup data set of application data.
3. The method of claim 1, wherein identifying the data item comprises identifying a full backup within an auxiliary backup data set of application data.
4. The method of claim 1, wherein identifying the data item comprises identifying a data item associated with a data-specific ID.
5. The method of claim 1, wherein the selection criterion comprises a time criterion and wherein identifying the data item satisfying the selection criterion comprises comparing a time the data item was stored to the time criterion.
6. The method of claim 5, wherein the time criterion comprises a day of a week and wherein identifying the data item satisfying the selection criterion comprises comparing a day of the week the data item was stored to the day of the week.
7. The method of claim 5, wherein the time criterion comprises a day of a month and wherein identifying the data item satisfying the selection criterion comprises comparing a day of the month the data item was stored to the day of the month.
8. The method of claim 1, wherein the selection criterion comprises a cycle criterion and wherein identifying the data item satisfying the selection criterion comprises comparing a number of cycles occurring since the data item was stored to the cycle criterion.
9. The method of claim 8, wherein the cycle criterion comprises a number of full backups performed and wherein identifying the data item satisfying the selection criterion comprises comparing a number of full backups performed since the data item was stored to the number of full backups.
10. The method of claim 1, comprising indicating that the data item satisfies the selection criteria.
11. The method of claim 10, wherein indicating that the data item satisfies the selection criterion comprises associating, in a data structure, information with the data item indicating that the data item satisfies the selection criterion.
12. The method of claim 10, wherein indicating that the data item satisfies the selection criterion comprises associating, in a matrix, information with the data item indicating that the data item satisfies the selection criterion.
13. The method of claim 10, wherein the data item indicated is de-indicated after the data item is copied to the second backup data set.
14. The method of claim 13, wherein de-indicating the data item comprises removing, in a data structure, information associated with the data item indicating that the data item satisfies the selection criterion.
15. The method of claim 13, wherein de-indicating the data item comprises removing, in a matrix, information associated with the data item indicating that the data item satisfies the selection criterion.
16. The method of claim 13, wherein the data item indicated will not be pruned by a pruning program unless the data item is first de-indicated.
17. The method of claim 1, wherein the data item comprises a full backup of application data.
18. The method of claim 1, wherein copying at least a portion of the data item comprises performing an auxiliary copy of at least a portion of the data item.
19. The method of claim 1, wherein the copying of at least a portion of the data item is a restart-able operation.
20. A system for copying electronic data, the system comprising:
a first backup data set containing one or more data items;
a second backup data set; and
a computer, connectable to the first backup data set and the second backup data set;
wherein the computer is programmed to identify, in the first backup data set, a first data item satisfying a selection criteria; and to copy at least a portion of the first data item from the first backup data set to the second backup data set.
21. A computer usable medium storing program code which, when executed on a computerized device, causes the computerized device to execute a computerized method for copying electronic data stored in a first backup data set, the method comprising:
identifying, in the first backup data set, a data item satisfying a selection criterion; and
copying to a second backup data set at least a portion of the data item.

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 OLED device comprising an anode and a cathode and having therebetween a light emitting layer containing a host and an emissive material, wherein the host material is a phosphineoxide compound bearing two or more tri(hetero)arylphosphineoxide groups, provided these groups are selected to give a compound with a Et\u22672.65 eV.
2. The device of claim 1 that emits light in the green or blue region of the visible spectrum, or together with the emission of another layer, emits white light.
3. The device of claim 1 wherein the device contains an exciton or hole blocking layer located between the cathode and the light emitting layer that contains a phosphineoxide compound bearing two or more tri(hetero)arylphosphineoxide groups, provided these groups are selected to give a compound with a Et\u22672.65 eV.
4. The device of claim 3 that emits light in the green or blue region of the visible spectrum, or together with the emission of another layer, emits white light.
5. The device of claim 1 wherein the device contains an electron-transporting layer located between the cathode and the anode and contains a phosphineoxide compound bearing two or more tri(hetero)arylphosphineoxide groups provided the tri(hetero)arylphosphineoxide groups selected to give a compound with a Et\u22672.65 eV.
6. The device of claim 1 wherein the phosphineoxide compound is represented by the formula:
(A)nB
wherein each A is independently represented by:
and
n\u22672;
wherein Ar1, Ar2 and B each represent groups selected to give a compound with a Et\u22672.65 eV and;
Ar1, Ar2 and B are each an aromatic group or heteroaromatic group independently selected from phenyl, biphenyl, and heteroaryl groups which may be independently substituted with one or more of alkyl, alkenyl, alkoxy, aryl, aralkyl, halogen, NH2, NHR, NR2, NO2 and CN groups;
provided that one or more of Ar1, Ar2 and B may be linked together by a linking group selected from a covalent bond, \u2014O\u2014, \u2014CH2\u2014, \u2014CHR\u2014, \u2014CR2\u2014, \u2014NH\u2014, and \u2014NR\u2014in which each R is selected from alkyl, alkenyl, aryl, and aralkyl groups; and
B is a (hetero)aromatic group with n bonds.
7. The device of claim 6 wherein the phosphineoxide compound is represented by the formula:
wherein
B comprises an aromatic group or heteroaromatic group independently selected from phenyl, biphenyl, and heteroaryl with Et\u22672.65 eV;
each R is independently selected from alkyl, alkenyl, alkoxy, aryl, aralkyl, halogen, NH2, NHR, NR2, NO2 and CN groups;
each of p and m is independently selected from the values 0, 1, 2, 3 and 4; and
n is at least 2.
8. The device of claim 6 wherein B is a chain of 2 or more aromatic ring groups.
9. The device of claim 1 wherein the light emitting layer contains at least two host materials.
10. The device of claim 1 wherein the emissive material is a phosphorescent dye.
11. The device of claim 1 wherein the emissive material is a blue or green phosphorescent dye.
12. The device of claim 1 wherein the light emitted by the device is white.
13. The device of claim 1 wherein Et\u22672.8 eV.

1461108977-60176c62-ee22-476c-b8fb-08f6610128b9

1. A method performed in a network element, the network element comprising a plurality of software components that control operations and features of the network element, wherein operations and features of the network element are defined in part by a configuration, the method comprising:
creating and storing one or more configuration partition namespaces each comprising a version identifier and one or more configuration tuples;
associating one or more of the configuration partition namespaces in a configuration partition;
associating one of the software components and the one or more configuration partition namespaces; and
creating and storing information identifying one of the software components, its associated configuration partition namespaces, and the version identifier of each of the configuration partition namespaces.
2. A method as recited in claim 1, wherein associating one of the software components and the one or more configuration partition namespaces comprises creating a namespace component data structure that contains an association of one of the software components and the one or more configuration partition namespaces.
3. The method of claim 1, wherein the network element is a router comprising a distributed plurality of nodes, wherein nodes comprise route processors or line cards.
4. The method of claim 3, wherein a different configuration partition is associated with each of the nodes.
5. The method of claim 4, wherein a further configuration partition is associated with an administration plane of the network element.
6. The method of claim 1, wherein a different configuration partition is associated with each of a plurality of technology features of the network element that are implemented in the software components.
7. The method of claim 1, wherein a different configuration partition is associated with each of a plurality of logical interfaces of the network element.
8. The method of claim 1, wherein the version identifier comprises a major version number and a minor version number, the method further comprising:
receiving information defining a configuration commit representing a change in one or more of the configuration tuples;
determining whether the change comprises only adding one or more configuration tuples;
incrementing only the minor version number when the change comprises only adding one or more configuration tuples, and otherwise incrementing the major version number.
9. The method of claim 1, further comprising:
loading an active set of configuration partition namespaces as part of a boot up process;
installing a software component that is not associated with the active set of configuration partition namespaces;
creating and storing a new configuration partition namespace corresponding to the installed software component.
10. The method of claim 9, further comprising:
processing a command to uninstall a software component from the network element while the network element is running;
identifying one or more of the configuration partition namespaces that are associated with the software component to be uninstalled;
removing, from a system database that holds an active configuration, all configuration tuples associated with the identified configuration partition namespaces;
removing the identified configuration partition namespaces;
deactivating the software component.
11. The method of claim 9 or claim 10, further comprising:
storing information describing the installed software component and the uninstalled software component in a namespace change set;
storing the namespace change set in persistent storage.
12. The method of claim 11, further comprising:
receiving information defining a configuration commit;
storing, in persistent storage, metadata describing the configuration commit as part of a rollback point among a plurality of rollback points, wherein the rollback point includes a version number, wherein the version number is associated with an active partition and a software component;
receiving a request to roll back to an earlier version number;
selecting one of the rollback points that corresponds to the earlier version number;
determining whether software components associated with the selected one of the rollback points are compatible with other software components associated with an active namespace set.
13. The method of claim 12, further comprising:
periodically deleting old rollback points from the persistent storage;
determining whether a particular namespace change set is referenced by no rollback points, and if so, deleting the particular namespace change set.
14. A machine-readable medium carrying one or more sequences of instructions, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of any of claims 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, or 13.
15. An apparatus comprising means for performing the functions provided in steps of any of claims 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, or 13.
16. An apparatus comprising a memory storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of any of claims 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, or 13.
17. A packet router, comprising:
a plurality of distributed processing nodes, wherein each of the nodes is controlled by a network device operating system comprising a plurality of software components that control operations and features of the router, wherein operations and features of the router are defined in part by a configuration;
one or more sequences of instructions, wherein execution of the one or more sequences of instructions by any of the processing nodes causes any of the processing nodes to perform the steps of:
creating and storing one or more configuration partition namespaces each comprising a version identifier and one or more configuration tuples;
associating one or more of the configuration partition namespaces in a configuration partition;
associating one of the software components and the one or more configuration partition namespaces; and
creating and storing information identifying one of the software components, its associated configuration partition namespaces, and the version identifier of each of the configuration partition namespaces.
18. A packet router as recited in claim 17, wherein the sequences of instructions further comprise instructions which, when executed by any of the processing nodes, cause any of the processing nodes to perform the steps of any of claims 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, or 13.

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 of manufacturing a sealed battery, comprising:
an external casing preparing step for preparing an external casing that is made of an aluminum alloy, the external casing with an opening and a rim around the opening, a thickness of the external casing at the rim being no greater than a thickness of the external casing at other parts of the external casing;
a closure cap preparing step for preparing a closure cap that is made of the aluminum alloy, the closure cap fitting into the opening, the closure cap being a plate with a rib along an outer edge of the plate;
a setting step for setting the closure cap to the external casing, after a generator element has been inserted into the external casing, so that the rib comes into contact with the rim;
a welding step for welding the rim and the rib together by radiating an energy beam along a boundary between the rim and the rib, wherein
the closure cap is prepared at the closure cap preparing step so as to satisfy equations T2\u2267(T110+40) \u03bcm and 50(\u03bcm)\u2267T3\u2267T1, a thickness of the plate being set as T1(\u03bcm), a height of the rib being set as T2 (\u03bcm), and a thickness of the rib being set as T3(\u03bcm) and
as a result, heat stress at a time of welding the aluminum alloy is reduced at the welding step.
2. The sealed battery manufacturing method according to claim 1, wherein the external casing is prepared at the external casing preparing step so as to satisfy an equation 50(\u03bcm)\u2267L1\u2267L2, the thickness of the external casing at the rim being set as L1 and the thickness of the external casing at the other parts being set as L2.
3. The sealed battery manufacturing method according to one of claims 1 and 2, wherein the rib is formed by bending outer regions of the plate at the closure cap preparing step.
4. The sealed battery manufacturing method according to claim 1, wherein the external casing is prepared at the external casing preparing step so that the thickness of the external casing at the rim is smaller than the thickness of the external casing at the other parts by applying pressure to a wall of the external casing at the rim from inside of the external casing.
5. The sealed battery manufacturing method according to claim 2, wherein the external casing is prepared at the external casing preparing step so that the thickness of the external casing at the rim is smaller than the thickness of the external casing at the other parts by applying pressure to a wall of the external casing at the rim from inside of the external casing.
6. The sealed battery manufacturing method according to claim 3, wherein the external casing is prepared at the external casing preparing step so that the thickness of the external casing at the rim is smaller than the thickness of the external casing at the other parts by applying pressure to a wall of the external casing at the rim from inside of the external casing.