Author: claimsbot

What is claimed is:

1. A process for recovering helium comprising:
a) passing a first gas containing helium to an eductor to produce a second gas;
b) passing the second gas through a heat exchanger to produce a third gas; and
c) recovering the third gas into the eductor to combine with the first gas.
2. The process of claim 1 which further comprises passing the first gas through a regulator.
3. The process of claim 1 which further comprises passing the first gas through a manual valve.
4. The process of claim 1 which further comprises passing any of the gases through a pressure regulator controlled from one of the gases.
5. The process of claim 1 which further comprises passing any of the gases through a cooler.
6. The process of claim 1 which further comprises passing any of the gases through a flow measuring device.
7. The process of claim 1 which further comprises passing any of the gases through a filter.
8. The process of claim 1 which further comprises passing any of the gases through a control valve.
9. The process of claim 1 which further comprises passing the third gas through a purity measuring device and a flow control device.
10. The process of claim 1 which further comprises controlling the flow of the second gas through a flow measuring device on the second gas stream and a flow controlling device on the first or third gas.
11. The process of claim 1 wherein the second gas is split into a plurality of locations on the cooling tube.
12. The process of claim 1 wherein the second gas is split into a plurality of cooling tubes.
13. The process of claim 1 wherein the third gas is split into a plurality of locations on the cooling tube.
14. The process of claim 1 wherein the third gas is split into a plurality of cooling tubes.
15. The process of claim 1 which comprises passing the third gas through a top portion and a bottom portion of the heat exchanger.
16. The process of claim 15 which comprises passing the top portion and bottom portion through at least one flow control means.
17. The process of claim 16 wherein the flow control means is a valve.
18. The process of claim 1 which further comprises passing the third gas through a filter to remove particulates.
19. The process of claim 1 which further comprises a plurality of eductors.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed is:

1. A method for regenerating at least one diesel particle filter (21; 22), in which exhaust gas is introduced through a supply line (23, 23a, 23b) into the at least one diesel particle filter (21; 22), and is discharged from it through a discharge line (26, 26a, 26b), heating of the exhaust gas flowing through the at least one diesel particle filter (21; 22) taking place, characterized by the creation of a closable circulating air circuit through which exhaust gas emerging from the at least one diesel particle filter (21; 22) is introducible back into the latter.
2. The method as recited in claim 1, wherein ambient air is added to the circulating air circuit.
3. The method as recited in one of claims 1 or 2, wherein circulating air circulating in the circulating air circuit is blown out of the latter in a regulated or controlled manner.
4. The method as recited in claim 3, wherein the quantity of fresh air fed in corresponds to the quantity of circulating air blown out.
5. The method as recited in one of the preceding claims, wherein a burnoff of diesel particulate produced in conjunction with the regeneration of the at least one diesel particle filter (21; 22) is carried out through a measurement of the oxygen differential at the input and output sides of the at least one diesel particle filter (21; 22).
6. The method as recited in one of the preceding claims, characterized by at least two diesel particle filters (21; 22) connected in parallel, an exhaust gas stream acting on both diesel particle filters optionally being diverted in such a way that the essentially complete exhaust gas stream is passed through the first diesel particle filter (21), and a closed circulating air circuit is provided with respect to the second diesel particle filter (22).
7. The method as recited in claim 6, wherein the diversion of the exhaust gas streams is effected by flaps (24, 27) inserted into the supply or discharge lines for the exhaust gas stream.
8. A system for regenerating at least one diesel particle filter (21; 22), which is connected to a supply line (23, 23a; 23, 23b) for supplying exhaust gas and a discharge line (26a, 26; 26, 26b, 26) for discharging exhaust gas, means being (21a; 21b) provided for heating the exhaust gas flowing through at least one diesel particle filter, characterized by means (24, 23a, 26a, 27, 30, 28, 32, 25, 31; 24, 23b, 26b, 27, 30, 28, 32, 25, 31) for creating a closable circulating air circuit through which exhaust gas emerging from the at least one diesel particle filter (21; 22) is introducible back into the latter.
9. The system as recited in claim 8, characterized by means (28, 29) for adding ambient air to the circulating air circuit.
10. The system as recited in one of claims 8 or 9, characterized by means (27) of blowing out exhaust gas from the circulating air circuit in a regulated or controlled manner.
11. The system as recited in one of claims 8 through 10, characterized by means (40, 41) for measuring the oxygen differential at the input and output sides of the at least one diesel particle filter (21; 22).
12. The system as recited in one of claims 8 through 11, in which it is possible for an exhaust gas stream to act on two diesel particle filters (21, 22) connected in parallel in such a way that the essentially complete exhaust gas stream is passable through a first diesel particle filter, and it is possible to provide a closed circulating air circuit with respect to the second diesel particle filter, there being flaps (24, 27) provided which are insertable into the supply or discharge lines as a means for correspondingly diverting the exhaust gas streams.

1. A complex comprising a radionuclide complexed with a compound represented by B:
wherein
Z represents thioalkyl, carboxylate, 2-(carboxy)aryl, 2-(carboxy)heteroaryl, 2-(hydroxy)aryl, 2-(hydroxy)heteroaryl, 2-(thiol)aryl, or 2-(thiol)heteroaryl;
R represents alkyl, hydroxyalkyl, alkoxyalkyl, aminoalkyl, thioalkyl, alkenyl, alkynyl, aryl, heteroaryl, aralkyl, heteroaralkyl, acyl, aminoacyl, hydroxyacyl, thioacyl, \u2014CO2H, \u2014(CH2)d\u2014R80, or an amino acid radical;
R\u2032 is absent or present from 1 to 4 times;

each instance of R\u2032 is selected independently from the group consisting of halogen, alkyl, alkenyl, alkynyl, hydroxyl, alkoxyl, acyl, acyloxy, acylamino, silyloxy, amino, nitro, sulfhydryl, alkylthio, imino, amido, phosphoryl, phosphonate, phosphine, carbonyl, carboxyl, carboxamide, anhydride, silyl, thioalkyl, alkylsulfonyl, arylsulfonyl, selenoalkyl, ketone, aldehyde, ester, heteroalkyl, cyano, guanidine, amidine, acetal, ketal, amine oxide, aryl, heteroaryl, aralkyl, heteroaralkyl, azido, aziridine, carbamoyl, epoxide, hydroxamic acid, imide, oxime, sulfonamide, thioamide, thiocarbamate, urea, thiourea, and \u2014(CH2)d\u2014R80;
R80 represents independently for each occurrence carboxaldehyde, carboxylate, carboxamido, alkoxycarbonyl, aryloxycarbonyl, ammonium, aryl, heteroaryl, cycloalkyl, cycloalkenyl, heterocyclyl, polycyclyl, amino acid, peptide, saccharide, ribonucleic acid, or (deoxy)ribonucleic acid;
d is an integer in the range 2 to 12 inclusive;
m is an integer in the range 0 to 6 inclusive; and
n is an integer in the range 0 to 6 inclusive.
2. The complex of claim 1, wherein said radionuclide is technetium or rhenium.
3. The complex of claim 1, wherein Z is carboxylate.
4. The complex of claim 1, wherein m is 1.
5. The complex of claim 1, wherein n is 1.
6. The complex of claim 1, wherein m is 1; and n is 1.
7. The complex of claim 1, wherein Z is carboxylate; m is 1; and n is 1.
8. The complex of claim 1, wherein R\u2032 is absent.
9. The complex of claim 1, wherein Z is carboxylate; m is 1; n is 1; and R\u2032 is absent.
10. The complex of claim 1, wherein R is \u2014(CH2)d\u2014R80.
11. The complex of claim 1, wherein Z is carboxylate; m is 1; n is 1; R\u2032 is absent; and R is \u2014(CH2)d\u2014R80.
12. The complex of claim 1, wherein Z is carboxylate; m is 1; n is 1; R\u2032 is absent; and R is \u2014(CH2)d\u2014R80; wherein said radionuclide is technetium or rhenium.
13. The complex of claim 1, wherein R is an amino acid radical.
14. The complex of claim 1, wherein R is an amino acid radical; m is 1; and n is 1.
15. The complex of claim 1, wherein R is an amino acid radical; m is 1; n is 1; and R\u2032 is absent.
16. The complex of claim 1, wherein R is an amino acid radical; m is 1; n is 1; and R\u2032 is absent; wherein said radionuclide is technetium or rhenium.
17. The complex of claim 1, wherein the amino acid radical is \u2014CH2CH2CH2CH2CH(NH2)CO2H.
18. The complex of claim 1, wherein the amino acid radical is \u2014CH(CO2H)CH2CH2CH2CH2NH2.
19. The complex of claim 1, wherein R is \u2014CH2CH2COOH.
20. The complex of claim 1, wherein the amino acid radical is \u2014CH(CO2H)(CH2)xCH(NH2)CO2H, wherein x is an integer from 3 to 9 inclusively.
21. A formulation, comprising a complex according to claim 1 and a pharmaceutically acceptable excipient.
22. A method of preparing a peptide conjugate incorporating a complex of claim 13, wherein the peptide conjugate is prepared using solid phase peptide syntheses.

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 data processing system for managing different versions of a data record, the data processing system comprising:
a bus system;
a computer readable storage device connected to the bus system, wherein the computer readable storage device stores computer readable program code; and
a processor unit connected to the bus system, wherein the processor unit executes the computer readable program code to maintain a mapping between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table; update entries within leaf pages of an index associated with the data table to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record; and update the logical record identifier to physical record row identifier indirection mapping table in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.
2. The data processing system of claim 1, wherein the processor further executes the computer readable program code to keep only the version-dependent physical record row identifier that corresponds to a location of a most recent version of the data record within a plurality of versions for the data record in the data table in response to performing the operation on the data record.
3. The data processing system of claim 2, wherein the processor further executes the computer readable program code to update the mapping between the version-independent logical record identifier and the version-dependent physical record row identifier that correspond to the data record in the logical record identifier to physical record row identifier indirection mapping table using the version-dependent physical record row identifier corresponding to the location of the most recent version of the data record in the data table in response to performing the operation on the data record.
4. The data processing system of claim 1, wherein the processor further executes the computer readable program code to generate a null version-dependent physical record row identifier corresponding to the version-independent logical record identifier of the data record within the indirection mapping table without changing the entries within the leaf pages of the index associated with the data table in response to performing a deletion operation on the data record.
5. The data processing system of claim 1, wherein the physical record row identifier indirection mapping table is stored in a solid-state storage device of the data processing system, and wherein the data table and the index associated with the data table are stored in a magnetic hard disk storage device of the data processing system.
6. The data processing system of claim 1, wherein the version-independent logical record identifier identifies the data record without identifying a particular version of the data record.
7. The data processing system of claim 1, wherein the version-dependent physical record row identifier identifies a physical row location where a most recent version of the data record is stored within the data table.
8. The data processing system of claim 1, wherein the logical record identifier to physical record row identifier indirection mapping table maps one version-independent logical record identifier to one version-dependent physical record row identifier corresponding to the data record.
9. A computer program product stored on a computer readable storage device having computer readable program code encoded thereon that is executable by a data processing system for managing different versions of a data record, the computer program product comprising:
computer readable program code for maintaining a mapping between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table;
computer readable program code for updating entries within leaf pages of an index associated with the data table to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record; and
computer readable program code for updating the logical record identifier to physical record row identifier indirection mapping table in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.
10. The computer program product of claim 9, further comprising:
computer readable program code for keeping only the version-dependent physical record row identifier that corresponds to a location of a most recent version of the data record within a plurality of versions for the data record in the data table in response to performing the operation on the data record.
11. The computer program product of claim 10, further comprising:
computer readable program code for updating the mapping between the version-independent logical record identifier and the version-dependent physical record row identifier that correspond to the data record in the logical record identifier to physical record row identifier indirection mapping table using the version-dependent physical record row identifier corresponding to the location of the most recent version of the data record in the data table in response to performing the operation on the data record.
12. The computer program product of claim 9, further comprising:
computer readable program code for generating a null version-dependent physical record row identifier corresponding to the version-independent logical record identifier of the data record within the indirection mapping table without changing the entries within the leaf pages of the index associated with the data table in response to performing a deletion operation on the data record.
13. The computer program product of claim 9, wherein the physical record row identifier indirection mapping table is stored in a solid-state storage device of the data processing system, and wherein the data table and the index associated with the data table are stored in a magnetic hard disk storage device of the data processing system.
14. The computer program product of claim 9, wherein the version-independent logical record identifier identifies the data record without identifying a particular version of the data record.
15. The computer program product of claim 9, wherein the version-dependent physical record row identifier identifies a physical row location where a most recent version of the data record is stored within the data table.
16. The computer program product of claim 9, wherein the logical record identifier to physical record row identifier indirection mapping table maps one version-independent logical record identifier to one version-dependent physical record row identifier corresponding to the data record.