Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
347,100 | 16,805,574 | 2,872 | The present disclosure generally relates to efficient reading that avoids line discharging between reads. When multiple read commands are present for a common word line, those read commands can be arranged from lowest sensing voltage to highest sensing voltage. Because the sensing voltage increases for each read command, and the read commands are for the same word line, the normal discharge that occurs after the sensing in the read operation can be eliminated until the highest sensing voltage read command has been executed. At that point, the discharging can occur. Because a discharge does not occur after each sensing in the read operation, the read efficiency is improved. | 1. A data storage device, comprising:
a memory device; and a controller coupled to the memory device, the controller configured to:
receive a plurality of read commands for a word line;
reorder the read commands from a lowest sensing voltage to a highest sensing voltage; and
execute the read commands, wherein executing the read commands includes ordering the read commands by a sensing voltage for each of the read commands, and wherein the word line is not discharged to a voltage lower than a previous sensing voltage between the read commands. 2. The data storage device of claim 1, wherein the controller is further configured to execute a first read command of the plurality of read commands by a process comprising:
boosting the word line from a first VSS to a first VDD; increasing a first voltage of a first channel to VREAD spike to clean up the first channel prior to sensing; discharging the first voltage of the first channel from the VREAD spike; bit line charging; word line charging; and sensing the word line at a first sensing voltage. 3. The data storage device of claim 2, wherein the controller is further configured to execute a second read command of the plurality of read commands by a process comprising:
boosting the word line from a second VSS to a second VDD, wherein the second VSS corresponds to the first sensing voltage; increasing a second voltage of a second channel to VREAD spike to clean up the second channel prior to sensing; bit line charging; word line charging; and sensing the word line at a second sensing voltage. 4. The data storage device of claim 3, wherein the controller is further configured to execute a third read command of the plurality of read commands by a process comprising:
boosting the word line from a third VSS to a third VDD, wherein the third VSS corresponds to the second sensing voltage; increasing a voltage of a third channel to VREAD spike to clean up the third channel prior to sensing; bit line charging; word line charging; sensing the word line at a third sensing voltage; and discharging the word line. 5. The data storage device of claim 4, wherein the controller is configured to execute the first read command prior to the second read command, wherein the controller is configured to execute the second read command prior to the third read command. 6. The data storage device of claim 5, wherein the controller is configured to receive at least one of the second read command and the third read command prior to receiving the first read command. 7. The data storage device of claim 1, wherein the controller is configured to discharge the word line after a last read command for the word line has been executed. 8. A data storage device, comprising:
a memory device; and a controller coupled to the memory device, the controller configured to:
receive a first read command for a word line, wherein the first read command has a first sense voltage;
review a read queue for additional read commands for the word line;
determine that a second read command is present in the read queue;
execute the second read command;
execute the first read command, wherein the first read command is executed after the execution of the second read command, wherein the first read command is executed prior to discharging the word line, and wherein discharging the word line does not include a VREAD spike discharge; and
discharge the word line. 9. The data storage device of claim 8, wherein the second read command for the word line has a second sense voltage that is lower than the first sense voltage. 10. The data storage device of claim 8, wherein during execution of the second read command a VREAD spike discharge occurs at a second channel. 11. The data storage device of claim 10, wherein during execution of the first read command a VREAD spike discharge does not occur at a first channel. 12. The data storage device of claim 8, wherein the controller is further configured to determine that a third read command is present in the read queue, wherein the second read command is queued in order prior to the third read command. 13. The data storage device of claim 12, wherein the controller is further configured to execute the third read command after the first read command and wherein the third read command is executed prior to discharging the word line. 14. The data storage device of claim 13, wherein during execution of the second read command a VREAD spike discharge occurs at a second channel, wherein during execution of the first read command a VREAD spike discharge does not occur at a first channel, and wherein during execution of the third read command a VREAD spike discharge does not occur at a third channel. 15. A data storage device, comprising:
a memory device; a means to rearrange an order of execution of a plurality of read commands for a word line, wherein the order of execution is based on a sense voltage of each read command of the plurality of read commands; and a means to execute the plurality of read commands without discharging the word line between execution of each read command. 16. The data storage device of claim 15, further comprising a means to determine that the plurality of read commands for the word line are in a queue. 17. The data storage device of claim 15, further comprising a means to execute at least one read command of the plurality of read commands without performing a VREAD spike discharge at one or more channels of the word line. 18. The data storage device of claim 15, further comprising a means to discharge the word line after executing the plurality of read commands. 19. The data storage device of claim 15, further comprising a means to determine that all read commands for the word line have been executed. 20. The data storage device of claim 15, further comprising a means to execute a plurality of read commands in a queue order where the plurality of read commands are for different word lines. | The present disclosure generally relates to efficient reading that avoids line discharging between reads. When multiple read commands are present for a common word line, those read commands can be arranged from lowest sensing voltage to highest sensing voltage. Because the sensing voltage increases for each read command, and the read commands are for the same word line, the normal discharge that occurs after the sensing in the read operation can be eliminated until the highest sensing voltage read command has been executed. At that point, the discharging can occur. Because a discharge does not occur after each sensing in the read operation, the read efficiency is improved.1. A data storage device, comprising:
a memory device; and a controller coupled to the memory device, the controller configured to:
receive a plurality of read commands for a word line;
reorder the read commands from a lowest sensing voltage to a highest sensing voltage; and
execute the read commands, wherein executing the read commands includes ordering the read commands by a sensing voltage for each of the read commands, and wherein the word line is not discharged to a voltage lower than a previous sensing voltage between the read commands. 2. The data storage device of claim 1, wherein the controller is further configured to execute a first read command of the plurality of read commands by a process comprising:
boosting the word line from a first VSS to a first VDD; increasing a first voltage of a first channel to VREAD spike to clean up the first channel prior to sensing; discharging the first voltage of the first channel from the VREAD spike; bit line charging; word line charging; and sensing the word line at a first sensing voltage. 3. The data storage device of claim 2, wherein the controller is further configured to execute a second read command of the plurality of read commands by a process comprising:
boosting the word line from a second VSS to a second VDD, wherein the second VSS corresponds to the first sensing voltage; increasing a second voltage of a second channel to VREAD spike to clean up the second channel prior to sensing; bit line charging; word line charging; and sensing the word line at a second sensing voltage. 4. The data storage device of claim 3, wherein the controller is further configured to execute a third read command of the plurality of read commands by a process comprising:
boosting the word line from a third VSS to a third VDD, wherein the third VSS corresponds to the second sensing voltage; increasing a voltage of a third channel to VREAD spike to clean up the third channel prior to sensing; bit line charging; word line charging; sensing the word line at a third sensing voltage; and discharging the word line. 5. The data storage device of claim 4, wherein the controller is configured to execute the first read command prior to the second read command, wherein the controller is configured to execute the second read command prior to the third read command. 6. The data storage device of claim 5, wherein the controller is configured to receive at least one of the second read command and the third read command prior to receiving the first read command. 7. The data storage device of claim 1, wherein the controller is configured to discharge the word line after a last read command for the word line has been executed. 8. A data storage device, comprising:
a memory device; and a controller coupled to the memory device, the controller configured to:
receive a first read command for a word line, wherein the first read command has a first sense voltage;
review a read queue for additional read commands for the word line;
determine that a second read command is present in the read queue;
execute the second read command;
execute the first read command, wherein the first read command is executed after the execution of the second read command, wherein the first read command is executed prior to discharging the word line, and wherein discharging the word line does not include a VREAD spike discharge; and
discharge the word line. 9. The data storage device of claim 8, wherein the second read command for the word line has a second sense voltage that is lower than the first sense voltage. 10. The data storage device of claim 8, wherein during execution of the second read command a VREAD spike discharge occurs at a second channel. 11. The data storage device of claim 10, wherein during execution of the first read command a VREAD spike discharge does not occur at a first channel. 12. The data storage device of claim 8, wherein the controller is further configured to determine that a third read command is present in the read queue, wherein the second read command is queued in order prior to the third read command. 13. The data storage device of claim 12, wherein the controller is further configured to execute the third read command after the first read command and wherein the third read command is executed prior to discharging the word line. 14. The data storage device of claim 13, wherein during execution of the second read command a VREAD spike discharge occurs at a second channel, wherein during execution of the first read command a VREAD spike discharge does not occur at a first channel, and wherein during execution of the third read command a VREAD spike discharge does not occur at a third channel. 15. A data storage device, comprising:
a memory device; a means to rearrange an order of execution of a plurality of read commands for a word line, wherein the order of execution is based on a sense voltage of each read command of the plurality of read commands; and a means to execute the plurality of read commands without discharging the word line between execution of each read command. 16. The data storage device of claim 15, further comprising a means to determine that the plurality of read commands for the word line are in a queue. 17. The data storage device of claim 15, further comprising a means to execute at least one read command of the plurality of read commands without performing a VREAD spike discharge at one or more channels of the word line. 18. The data storage device of claim 15, further comprising a means to discharge the word line after executing the plurality of read commands. 19. The data storage device of claim 15, further comprising a means to determine that all read commands for the word line have been executed. 20. The data storage device of claim 15, further comprising a means to execute a plurality of read commands in a queue order where the plurality of read commands are for different word lines. | 2,800 |
347,101 | 16,805,587 | 1,648 | The disclosure relates to respiratory virus ribonucleic acid (RNA) vaccines and combination vaccines, as well as methods of using the vaccines and compositions comprising the vaccines. | 1.-135. (canceled) 136. A composition, comprising: a ribonucleic acid (RNA) comprising an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit formulated in a lipid nanoparticle. 137. The composition of claim 136, wherein the open reading frame encodes a BetaCoV S protein. 138. The composition of claim 136, wherein the open reading frame encodes an S protein subunit selected from an S1 subunit and an S2 subunit. 139. The composition of claim 136, wherein the RNA is a messenger RNA (mRNA) further comprising a 5′ untranslated region (UTR) and a 3′ UTR. 140. The composition of claim 139, wherein the mRNA further comprises a poly(A) tail. 141. The composition of claim 139, wherein the mRNA further comprises a 5′ cap analog. 142. The composition of claim 141, wherein the 5′ cap analog is 7mG(5′)ppp(5′)NlmpNp. 143. The composition of claim 136, wherein the RNA comprises a chemical modification. 144. The composition of claim 143, wherein the chemical modification is a 1-methylpseudouridine modification or a 1-ethylpseudouridine modification. 145. The composition of claim 143, wherein at least 80% of the uracil in the open reading frame has a chemical modification. 146. The composition of claim 136, wherein the lipid nanoparticle comprises an ionizable cationic lipid, a neutral lipid, a sterol, and a PEG-modified lipid. 147. The composition of claim 146, wherein the lipid nanoparticle comprises 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 148. The composition of claim 147, wherein the lipid nanoparticle comprises 50% ionizable cationic lipid, 10% neutral lipid, 38.5% sterol, and 1.5% PEG-modified lipid. 149. The composition of claim 146, wherein the ionizable cationic lipid has a Compound 25 structure. 150. The composition of claim 146, wherein the neutral lipid is DSPC, the sterol is cholesterol, and the PEG-modified lipid is PEG-DMG or PEG-cDMA. 151. A composition, comprising: a messenger ribonucleic acid (mRNA) comprising a 5′ untranslated region (UTR), an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit, a 3′ UTR, and a poly(A) tail, formulated in a lipid nanoparticle that comprises 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 152. The composition of claim 151, wherein the open reading frame encodes a BetaCoV S protein. 153. The composition of claim 151, wherein the open reading frame encodes an S protein subunit selected from an S1 subunit and an S2 subunit. 154. The composition of claim 151, wherein the mRNA further comprises 5′ cap analog 7mG(5′)ppp(5′)NlmpNp. 155. The composition of claim 151, wherein at least 80% of the uracil in the open reading frame has a chemical modification. 156. The composition of claim 155, wherein the chemical modification is a 1-methylpseudouridine modification or a 1-ethylpseudouridine modification. 157. The composition of claim 151, wherein the ionizable cationic lipid has a Compound 25 structure. 158. The composition of claim 151, wherein the neutral lipid is DSPC, the sterol is cholesterol, and the PEG-modified lipid is PEG-DMG. 159. A composition, comprising:
a messenger ribonucleic acid (mRNA) comprising a 5′ cap analog, a 5′ untranslated region (UTR), an open reading frame encoding a betacoronavirus (BetaCoV) S protein, a 3′ UTR, and a poly(A) tail, formulated in a lipid nanoparticle that comprises 20-60% ionizable cationic lipid, 5-25% DSPC, 25-55% sterol, and 0.5-15% PEG-DMG, wherein the ionizable cationic lipid has the structure of Compound 25, and wherein at least 80% of the uracil in the open reading frame has a 1-methylpseudouridine modification. 160. The composition of claim 159, wherein the 5′ cap analog is 7mG(5′)ppp(5′)NlmpNp. 161. A lipid nanoparticle, comprising: a messenger ribonucleic acid (RNA) comprising an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit; and a lipid mixture comprising 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 162. A method comprising administering to a subject the composition of claim 159. 163. The method of claim 162, wherein the composition is administered in an amount effective to induce in the subject an immune response specific to BetaCoV. 164. The method of claim 163, wherein the immune response includes induction of a measurable neutralizing antibody titer in the subject. 165. The method of claim 164, wherein the effective amount is sufficient to produce a 1,000-10,000 neutralization titer produced by neutralizing antibody against BetaCoV S protein, as measured in serum of the subject at 1-72 hours post administration. | The disclosure relates to respiratory virus ribonucleic acid (RNA) vaccines and combination vaccines, as well as methods of using the vaccines and compositions comprising the vaccines.1.-135. (canceled) 136. A composition, comprising: a ribonucleic acid (RNA) comprising an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit formulated in a lipid nanoparticle. 137. The composition of claim 136, wherein the open reading frame encodes a BetaCoV S protein. 138. The composition of claim 136, wherein the open reading frame encodes an S protein subunit selected from an S1 subunit and an S2 subunit. 139. The composition of claim 136, wherein the RNA is a messenger RNA (mRNA) further comprising a 5′ untranslated region (UTR) and a 3′ UTR. 140. The composition of claim 139, wherein the mRNA further comprises a poly(A) tail. 141. The composition of claim 139, wherein the mRNA further comprises a 5′ cap analog. 142. The composition of claim 141, wherein the 5′ cap analog is 7mG(5′)ppp(5′)NlmpNp. 143. The composition of claim 136, wherein the RNA comprises a chemical modification. 144. The composition of claim 143, wherein the chemical modification is a 1-methylpseudouridine modification or a 1-ethylpseudouridine modification. 145. The composition of claim 143, wherein at least 80% of the uracil in the open reading frame has a chemical modification. 146. The composition of claim 136, wherein the lipid nanoparticle comprises an ionizable cationic lipid, a neutral lipid, a sterol, and a PEG-modified lipid. 147. The composition of claim 146, wherein the lipid nanoparticle comprises 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 148. The composition of claim 147, wherein the lipid nanoparticle comprises 50% ionizable cationic lipid, 10% neutral lipid, 38.5% sterol, and 1.5% PEG-modified lipid. 149. The composition of claim 146, wherein the ionizable cationic lipid has a Compound 25 structure. 150. The composition of claim 146, wherein the neutral lipid is DSPC, the sterol is cholesterol, and the PEG-modified lipid is PEG-DMG or PEG-cDMA. 151. A composition, comprising: a messenger ribonucleic acid (mRNA) comprising a 5′ untranslated region (UTR), an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit, a 3′ UTR, and a poly(A) tail, formulated in a lipid nanoparticle that comprises 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 152. The composition of claim 151, wherein the open reading frame encodes a BetaCoV S protein. 153. The composition of claim 151, wherein the open reading frame encodes an S protein subunit selected from an S1 subunit and an S2 subunit. 154. The composition of claim 151, wherein the mRNA further comprises 5′ cap analog 7mG(5′)ppp(5′)NlmpNp. 155. The composition of claim 151, wherein at least 80% of the uracil in the open reading frame has a chemical modification. 156. The composition of claim 155, wherein the chemical modification is a 1-methylpseudouridine modification or a 1-ethylpseudouridine modification. 157. The composition of claim 151, wherein the ionizable cationic lipid has a Compound 25 structure. 158. The composition of claim 151, wherein the neutral lipid is DSPC, the sterol is cholesterol, and the PEG-modified lipid is PEG-DMG. 159. A composition, comprising:
a messenger ribonucleic acid (mRNA) comprising a 5′ cap analog, a 5′ untranslated region (UTR), an open reading frame encoding a betacoronavirus (BetaCoV) S protein, a 3′ UTR, and a poly(A) tail, formulated in a lipid nanoparticle that comprises 20-60% ionizable cationic lipid, 5-25% DSPC, 25-55% sterol, and 0.5-15% PEG-DMG, wherein the ionizable cationic lipid has the structure of Compound 25, and wherein at least 80% of the uracil in the open reading frame has a 1-methylpseudouridine modification. 160. The composition of claim 159, wherein the 5′ cap analog is 7mG(5′)ppp(5′)NlmpNp. 161. A lipid nanoparticle, comprising: a messenger ribonucleic acid (RNA) comprising an open reading frame encoding a betacoronavirus (BetaCoV) S protein or S protein subunit; and a lipid mixture comprising 20-60% ionizable cationic lipid, 5-25% neutral lipid, 25-55% sterol, and 0.5-15% PEG-modified lipid. 162. A method comprising administering to a subject the composition of claim 159. 163. The method of claim 162, wherein the composition is administered in an amount effective to induce in the subject an immune response specific to BetaCoV. 164. The method of claim 163, wherein the immune response includes induction of a measurable neutralizing antibody titer in the subject. 165. The method of claim 164, wherein the effective amount is sufficient to produce a 1,000-10,000 neutralization titer produced by neutralizing antibody against BetaCoV S protein, as measured in serum of the subject at 1-72 hours post administration. | 1,600 |
347,102 | 16,805,586 | 1,648 | A device for application of a hair formulation comprises a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure. | 1. A device for application of a hair formulation, comprising:
a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure. 2. The device of claim 1, comprising a cartridge containing a hair formulation, wherein the cartridge fits at a back end of the body structure. 3. The device of claim 2, wherein the cartridge comprises a product identification tag, and the device includes a product identification tag reader. 4. The device of claim 3, wherein the product identification tag includes instructions for the electrostatic charger. 5. The device of claim 4, wherein the instructions include instructions for turning on the electrostatic charger. 6. The device of claim 4, wherein the instructions include instructions for setting a voltage output by the electrostatic charger. 7. The device of claim 2, wherein the hair formulation includes cationic, anionic, zwitterionic polymers or surfactants. 8. The device of claim 2, wherein all tines are arranged to lie in one plane. 9. The device of claim 2, wherein the plane is a horizontal plane with respect to top and bottom sides of the device 10. The device of claim 1, wherein the tine has a conical shape that decreases in diameter with forward length. 11. The device of claim 1, comprising more than one tine, wherein adjacent tines are separated by a lengthwise space between the tines that is approximately the same as the average width of a tine or greater. 12. A method of making a device for cleansing hair, comprising:
assembling a device to have a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure. 13. The method of claim 12, comprising placing a cartridge containing a hair formulation at a back end of the body structure, wherein the cartridge includes a machine readable product identification tag. 14. The method of claim 12, wherein the device includes a product identification tag reader. 15. The method of claim 13, wherein the machine readable product identification tag includes instructions that control the electrostatic charger. 16. The method of claim 15, wherein the instructions control the electrostatic charger to turn on or to set a voltage. 17. A method for cleansing hair, comprising:
with a device, applying a hair formulation to hair or scalp or both; with the device, agitating the hair formulation; and with the device, creating an electrostatic charge on the hair or scalp or both. 18. The method of claim 17, wherein no external water is mixed with the hair formulation after applying. 19. The method of claim 17, wherein the hair formulation includes cationic, anionic, zwitterionic polymers or surfactants. 20. The method of claim 17, wherein the agitating step further comprises contacting the hair or scalp with more than one tine provided on the device. 21. The method of claim 17, comprising, before the applying step, placing a cartridge at a back end of the device, wherein the cartridge contains the hair formulation. | A device for application of a hair formulation comprises a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure.1. A device for application of a hair formulation, comprising:
a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure. 2. The device of claim 1, comprising a cartridge containing a hair formulation, wherein the cartridge fits at a back end of the body structure. 3. The device of claim 2, wherein the cartridge comprises a product identification tag, and the device includes a product identification tag reader. 4. The device of claim 3, wherein the product identification tag includes instructions for the electrostatic charger. 5. The device of claim 4, wherein the instructions include instructions for turning on the electrostatic charger. 6. The device of claim 4, wherein the instructions include instructions for setting a voltage output by the electrostatic charger. 7. The device of claim 2, wherein the hair formulation includes cationic, anionic, zwitterionic polymers or surfactants. 8. The device of claim 2, wherein all tines are arranged to lie in one plane. 9. The device of claim 2, wherein the plane is a horizontal plane with respect to top and bottom sides of the device 10. The device of claim 1, wherein the tine has a conical shape that decreases in diameter with forward length. 11. The device of claim 1, comprising more than one tine, wherein adjacent tines are separated by a lengthwise space between the tines that is approximately the same as the average width of a tine or greater. 12. A method of making a device for cleansing hair, comprising:
assembling a device to have a body structure having one or more tines at a front end, wherein a tip of a tine includes an electrode; an electrostatic charger electrically connected to the electrode; and a handle extending from the body structure at an obtuse angle with respect to the front end of the body structure. 13. The method of claim 12, comprising placing a cartridge containing a hair formulation at a back end of the body structure, wherein the cartridge includes a machine readable product identification tag. 14. The method of claim 12, wherein the device includes a product identification tag reader. 15. The method of claim 13, wherein the machine readable product identification tag includes instructions that control the electrostatic charger. 16. The method of claim 15, wherein the instructions control the electrostatic charger to turn on or to set a voltage. 17. A method for cleansing hair, comprising:
with a device, applying a hair formulation to hair or scalp or both; with the device, agitating the hair formulation; and with the device, creating an electrostatic charge on the hair or scalp or both. 18. The method of claim 17, wherein no external water is mixed with the hair formulation after applying. 19. The method of claim 17, wherein the hair formulation includes cationic, anionic, zwitterionic polymers or surfactants. 20. The method of claim 17, wherein the agitating step further comprises contacting the hair or scalp with more than one tine provided on the device. 21. The method of claim 17, comprising, before the applying step, placing a cartridge at a back end of the device, wherein the cartridge contains the hair formulation. | 1,600 |
347,103 | 16,805,594 | 3,629 | Program placement with desirability indicators can include: generating a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on a placement platform among a set of candidates who use the placement platform to place among the programs; and determining the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs. | 1. A placement platform, comprising:
a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on the placement platform among a set of candidates who use the placement platform to place among the programs; and a data analyzer that determines the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs. 2. The placement platform of claim 1, wherein the data analyzer determines the relative desirability by determining a rate of completion of one or more events associated with each program. 3. The placement platform of claim 1, wherein the data analyzer determines the relative desirability by determining a set of competitors among the programs in response to the history data. 4. The placement platform of claim 3, wherein the data analyzer determines the competitors by determining an overlap among the candidates who sought placement in the programs. 5. The placement platform of claim 4, wherein the overlap is based on a respective candidate profile of each of the candidates who sought placement. 6. The placement platform of claim 4, wherein the overlap is based on a respective set of questionnaire answers of each of the candidates. 7. The placement platform of claim 3, wherein the data analyzer determines the competitor by determining an overlap among a set of dates pertaining to one or more events held by the respective programs. 8. A method for indicating desirability of program placement, comprising:
generating a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on a placement platform among a set of candidates who use the placement platform to place among the programs; and determining the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs. 9. The method of claim 8, wherein determining the relative desirability comprises determining a rate of completion of one or more events associated with each program. 10. The method of claim 8, wherein determining the relative desirability comprises determining a set of competitors among the programs in response to the history data. 11. The method of claim 10, wherein determining the competitors comprises determining an overlap among the candidates who sought placement in the programs. 12. The method of claim 11, wherein the overlap is based on a respective candidate profile of each of the candidates who sought placement. 13. The method of claim 11, wherein the overlap is based on a respective set of questionnaire answers of each of the candidates. 14. The method of claim 10, wherein determining the competitors comprises determining an overlap among a set of dates pertaining to one or more events held by the respective programs. | Program placement with desirability indicators can include: generating a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on a placement platform among a set of candidates who use the placement platform to place among the programs; and determining the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs.1. A placement platform, comprising:
a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on the placement platform among a set of candidates who use the placement platform to place among the programs; and a data analyzer that determines the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs. 2. The placement platform of claim 1, wherein the data analyzer determines the relative desirability by determining a rate of completion of one or more events associated with each program. 3. The placement platform of claim 1, wherein the data analyzer determines the relative desirability by determining a set of competitors among the programs in response to the history data. 4. The placement platform of claim 3, wherein the data analyzer determines the competitors by determining an overlap among the candidates who sought placement in the programs. 5. The placement platform of claim 4, wherein the overlap is based on a respective candidate profile of each of the candidates who sought placement. 6. The placement platform of claim 4, wherein the overlap is based on a respective set of questionnaire answers of each of the candidates. 7. The placement platform of claim 3, wherein the data analyzer determines the competitor by determining an overlap among a set of dates pertaining to one or more events held by the respective programs. 8. A method for indicating desirability of program placement, comprising:
generating a user interface that includes an indicator of a relative desirability of at least one of a plurality of programs registered on a placement platform among a set of candidates who use the placement platform to place among the programs; and determining the relative desirability in response to a store of history data pertaining to how the candidates used the placement platform to place among the programs during at least one placement season for the programs. 9. The method of claim 8, wherein determining the relative desirability comprises determining a rate of completion of one or more events associated with each program. 10. The method of claim 8, wherein determining the relative desirability comprises determining a set of competitors among the programs in response to the history data. 11. The method of claim 10, wherein determining the competitors comprises determining an overlap among the candidates who sought placement in the programs. 12. The method of claim 11, wherein the overlap is based on a respective candidate profile of each of the candidates who sought placement. 13. The method of claim 11, wherein the overlap is based on a respective set of questionnaire answers of each of the candidates. 14. The method of claim 10, wherein determining the competitors comprises determining an overlap among a set of dates pertaining to one or more events held by the respective programs. | 3,600 |
347,104 | 16,805,540 | 3,629 | An organic light-emitting diode includes: a first electrode, a light-emitting stack thereon including: a hole transport layer (HTL), a blue light-emitting layer including: a blue host material (BHM), and a blue fluorescent dopant (BFD) material, and an electron transport layer (ETL), and a second electrode on the light-emitting stack, wherein BFD LUMO>BHM, BFD HOMO>BHM, BFD singlet energy<BHM, HTL HOMO>BHM and BFD, HTL HOMO−BFD HOMO≤0.1 eV, the HTL material LUMO>the BHM, HTL LUMO−BHM LUMO≥0.5 eV, HTL LUMO>BFD, ETL LUMO>BHM and BFD, a difference in LUMO between the ETL material and the BFD material≤0.1 eV, and the HTL material, the ETL material, and the BHM have the following triplet energy relationships: T1,BH<T1,HTL and T1,BH<T1,ETL, 2.8<T1,HTL<3.0, and 2.6<T1,ETL<2.8. | 1-22. (canceled) 23. An organic light-emitting diode, comprising:
a first electrode; a light-emitting stack on the first electrode comprising, sequentially stacked on the first electrode:
a hole transport layer comprising a hole transport layer material;
a blue light-emitting layer in contact with the hole transport layer comprising:
a blue host material; and
a blue fluorescent dopant material; and
an electron transport layer comprising at least one an electron transport layer material; and
a second electrode on the light-emitting stack, wherein the blue fluorescent dopant material has a higher LUMO (Lowest Unoccupied Molecular Orbital) energy level than the blue host material, wherein the blue fluorescent dopant material has a higher HOMO (Highest Occupied Molecular Orbital) energy level than the blue host material, wherein the blue fluorescent dopant material has a lower singlet energy than the blue host material, wherein the hole transport layer material has a higher HOMO energy level than the blue host material, wherein the hole transport layer material has a higher LUMO energy level than the blue host material, wherein a difference in LUMO energy level between the hole transport layer material and the blue host material is 0.5 eV or more, wherein the hole transport layer material has a higher LUMO energy level than the blue fluorescent dopant material, wherein at least one the electron transport layer material has a higher LUMO energy level than the blue host material, wherein a difference in LUMO energy level between at least one the electron transport layer material and the blue fluorescent dopant material is 0.1 eV or less, and wherein the hole transport layer material, at least one the electron transport layer material, and the blue host material have the following triplet energy relationships: T1,BH<T1,HTL and T1,BH<T1,ETL, where T1,HTL, T1,ETL and T1,BH indicate triplet energies of the hole transport layer material, the electron transport layer material, and the blue host material, respectively. 24. The organic light-emitting diode of claim 24, wherein the electron transport layer material comprises:
an electron transport material; and at least one metal compound selected from among: an alkali metal and an alkali earth metal compound. 25. The organic light-emitting diode of claim 24, wherein the electron transport layer is doped with the at least one metal compound selected from among: an alkali metal and an alkali earth metal compound. 26. The organic light-emitting diode of claim 24, wherein a metal component in the alkali metal compound is selected from among: lithium (Li), sodium (Na), potassium (K) and cesium (Cs). 27. The organic light-emitting diode of claim 24, wherein a metal component in the alkali earth metal compound is selected from among: magnesium (Mg), strontium (Sr), barium (Ba) and radium (Ra). 28. The organic light-emitting diode of claim 24, wherein the electron transport layer comprises 1 wt % to 20 wt % of the at least one metal compound selected from among the alkali metal and the alkali earth metal compound. 29. The organic light-emitting diode of claim 24, wherein the electron transport layer material has a higher LUMO energy level than the blue fluorescent dopant material. 30. The organic light-emitting diode of claim 24, wherein:
the hole transport layer material has a higher HOMO energy level than the blue fluorescent dopant material; and a difference in HOMO energy level between the hole transport layer material and the blue fluorescent dopant material is 0.1 eV or less. 31. The organic light-emitting diode of claim 24, wherein the triplet energy of the blue host material has a range of 2.8<T1,HTL<3.0, and 2.6<T1,ETL<2.8. 32. The organic light-emitting diode of claim 23, wherein the hole transport layer material comprises a tertiary amine-based material. 33. The organic light-emitting diode of claim 23, wherein the blue host material comprises an anthracene-based material. 34. The organic light-emitting diode of claim 23, wherein the blue fluorescent dopant material comprises a pyrene amine derivative material. 35. The organic light-emitting diode of claim 23, wherein the electron transport layer material comprises a pyrimidine-based material. 36. The organic light-emitting diode of claim 23, wherein the blue light-emitting layer comprises 1 wt % to 5 wt % of the blue fluorescent dopant material. 37. The organic light-emitting diode of claim 23, wherein:
the light-emitting stack is a first light-emitting stack; and at least one additional light-emitting stack, comprising a second light-emitting stack, is further between the first electrode and the second electrode. 38. The organic light-emitting diode of claim 37, further comprising a charge generation layer between the first light-emitting stack and the second light-emitting stack. 39. The organic light-emitting diode of claim 38, wherein the charge generation layer comprises:
an N-type charge generation layer; and a P-type charge generation layer. 40. The organic light-emitting diode of claim 37, wherein the organic light-emitting diode comprises a white organic light-emitting diode comprising the at least one additional light-emitting stack configured to emit red (R), green (G), or yellow (Y) light. 41. An organic light-emitting display, comprising:
a substrate; the organic light-emitting diode of claim 1 on the substrate; and a driving device between the substrate and the organic light-emitting diode, and connected to the first electrode. 42. The organic light-emitting display of claim 41, further comprising a color filter disposed:
between the substrate and the first electrode; or on the organic light-emitting diode. | An organic light-emitting diode includes: a first electrode, a light-emitting stack thereon including: a hole transport layer (HTL), a blue light-emitting layer including: a blue host material (BHM), and a blue fluorescent dopant (BFD) material, and an electron transport layer (ETL), and a second electrode on the light-emitting stack, wherein BFD LUMO>BHM, BFD HOMO>BHM, BFD singlet energy<BHM, HTL HOMO>BHM and BFD, HTL HOMO−BFD HOMO≤0.1 eV, the HTL material LUMO>the BHM, HTL LUMO−BHM LUMO≥0.5 eV, HTL LUMO>BFD, ETL LUMO>BHM and BFD, a difference in LUMO between the ETL material and the BFD material≤0.1 eV, and the HTL material, the ETL material, and the BHM have the following triplet energy relationships: T1,BH<T1,HTL and T1,BH<T1,ETL, 2.8<T1,HTL<3.0, and 2.6<T1,ETL<2.8.1-22. (canceled) 23. An organic light-emitting diode, comprising:
a first electrode; a light-emitting stack on the first electrode comprising, sequentially stacked on the first electrode:
a hole transport layer comprising a hole transport layer material;
a blue light-emitting layer in contact with the hole transport layer comprising:
a blue host material; and
a blue fluorescent dopant material; and
an electron transport layer comprising at least one an electron transport layer material; and
a second electrode on the light-emitting stack, wherein the blue fluorescent dopant material has a higher LUMO (Lowest Unoccupied Molecular Orbital) energy level than the blue host material, wherein the blue fluorescent dopant material has a higher HOMO (Highest Occupied Molecular Orbital) energy level than the blue host material, wherein the blue fluorescent dopant material has a lower singlet energy than the blue host material, wherein the hole transport layer material has a higher HOMO energy level than the blue host material, wherein the hole transport layer material has a higher LUMO energy level than the blue host material, wherein a difference in LUMO energy level between the hole transport layer material and the blue host material is 0.5 eV or more, wherein the hole transport layer material has a higher LUMO energy level than the blue fluorescent dopant material, wherein at least one the electron transport layer material has a higher LUMO energy level than the blue host material, wherein a difference in LUMO energy level between at least one the electron transport layer material and the blue fluorescent dopant material is 0.1 eV or less, and wherein the hole transport layer material, at least one the electron transport layer material, and the blue host material have the following triplet energy relationships: T1,BH<T1,HTL and T1,BH<T1,ETL, where T1,HTL, T1,ETL and T1,BH indicate triplet energies of the hole transport layer material, the electron transport layer material, and the blue host material, respectively. 24. The organic light-emitting diode of claim 24, wherein the electron transport layer material comprises:
an electron transport material; and at least one metal compound selected from among: an alkali metal and an alkali earth metal compound. 25. The organic light-emitting diode of claim 24, wherein the electron transport layer is doped with the at least one metal compound selected from among: an alkali metal and an alkali earth metal compound. 26. The organic light-emitting diode of claim 24, wherein a metal component in the alkali metal compound is selected from among: lithium (Li), sodium (Na), potassium (K) and cesium (Cs). 27. The organic light-emitting diode of claim 24, wherein a metal component in the alkali earth metal compound is selected from among: magnesium (Mg), strontium (Sr), barium (Ba) and radium (Ra). 28. The organic light-emitting diode of claim 24, wherein the electron transport layer comprises 1 wt % to 20 wt % of the at least one metal compound selected from among the alkali metal and the alkali earth metal compound. 29. The organic light-emitting diode of claim 24, wherein the electron transport layer material has a higher LUMO energy level than the blue fluorescent dopant material. 30. The organic light-emitting diode of claim 24, wherein:
the hole transport layer material has a higher HOMO energy level than the blue fluorescent dopant material; and a difference in HOMO energy level between the hole transport layer material and the blue fluorescent dopant material is 0.1 eV or less. 31. The organic light-emitting diode of claim 24, wherein the triplet energy of the blue host material has a range of 2.8<T1,HTL<3.0, and 2.6<T1,ETL<2.8. 32. The organic light-emitting diode of claim 23, wherein the hole transport layer material comprises a tertiary amine-based material. 33. The organic light-emitting diode of claim 23, wherein the blue host material comprises an anthracene-based material. 34. The organic light-emitting diode of claim 23, wherein the blue fluorescent dopant material comprises a pyrene amine derivative material. 35. The organic light-emitting diode of claim 23, wherein the electron transport layer material comprises a pyrimidine-based material. 36. The organic light-emitting diode of claim 23, wherein the blue light-emitting layer comprises 1 wt % to 5 wt % of the blue fluorescent dopant material. 37. The organic light-emitting diode of claim 23, wherein:
the light-emitting stack is a first light-emitting stack; and at least one additional light-emitting stack, comprising a second light-emitting stack, is further between the first electrode and the second electrode. 38. The organic light-emitting diode of claim 37, further comprising a charge generation layer between the first light-emitting stack and the second light-emitting stack. 39. The organic light-emitting diode of claim 38, wherein the charge generation layer comprises:
an N-type charge generation layer; and a P-type charge generation layer. 40. The organic light-emitting diode of claim 37, wherein the organic light-emitting diode comprises a white organic light-emitting diode comprising the at least one additional light-emitting stack configured to emit red (R), green (G), or yellow (Y) light. 41. An organic light-emitting display, comprising:
a substrate; the organic light-emitting diode of claim 1 on the substrate; and a driving device between the substrate and the organic light-emitting diode, and connected to the first electrode. 42. The organic light-emitting display of claim 41, further comprising a color filter disposed:
between the substrate and the first electrode; or on the organic light-emitting diode. | 3,600 |
347,105 | 16,805,568 | 3,629 | A vibration damper in a wheel suspension of a vehicle, which damper is supported on a wheel-guide element of the wheel suspension via two resilient bearings which are provided laterally of a damper tube of the vibration damper and which are diametrically opposed in relation to the damper tube. Each bearing has a rubber-elastic bearing element in which a damper receptacle is supported which is force-transmittingly connected to the damper tube. The damper receptacle is supported on the damper tube via a releasable securing element. | 1. A vibration damper in a wheel suspension of a vehicle, comprising:
a damper tube; and two elastic bearings, wherein the vibration damper is supported on a wheel-guide element of the wheel suspension via the two elastic bearings, wherein the two elastic bearings are disposed laterally of the damper tube and are diametrically opposite one another in relation to the damper tube, and wherein each of the two elastic bearings has a respective rubber-elastic bearing element in which there is supported a respective damper receptacle which is in force-transmitting connection with the damper tube; wherein each respective damper receptacle is supported on the damper tube via a respective releasable securing element. 2. The vibration damper according to claim 1, wherein each damper receptacle is supported between a respective damper support, which is disposed on the damper tube and is configured as a collar or a web, and the respective releasable securing element, which is releasably fastened to the damper tube or to a damper bottom portion. 3. The vibration damper according to claim 1, wherein each releasable securing element is configured as a screw nut which is screwed onto a thread which is disposed on the damper tube or a damper tube bottom part and wherein a longitudinal axis of the thread coincides with a longitudinal axis of the damper tube. 4. The vibration damper according to claim 1, wherein the respective damper receptacles of the two elastic bearings are combined to form a structural unit which is plugged onto the damper tube by an annular connecting portion. 5. The vibration damper according to claim 1, wherein the rubber-elastic bearing elements are surrounded by respective bearing receptacles which are connected to the wheel-guide element in a force-fitting or integrally bonded manner. 6. The vibration damper according to claim 1, wherein a common axis of rotation of the two elastic bearings is normal to a plane which is formed by axes of the damper tube in its two end positions. | A vibration damper in a wheel suspension of a vehicle, which damper is supported on a wheel-guide element of the wheel suspension via two resilient bearings which are provided laterally of a damper tube of the vibration damper and which are diametrically opposed in relation to the damper tube. Each bearing has a rubber-elastic bearing element in which a damper receptacle is supported which is force-transmittingly connected to the damper tube. The damper receptacle is supported on the damper tube via a releasable securing element.1. A vibration damper in a wheel suspension of a vehicle, comprising:
a damper tube; and two elastic bearings, wherein the vibration damper is supported on a wheel-guide element of the wheel suspension via the two elastic bearings, wherein the two elastic bearings are disposed laterally of the damper tube and are diametrically opposite one another in relation to the damper tube, and wherein each of the two elastic bearings has a respective rubber-elastic bearing element in which there is supported a respective damper receptacle which is in force-transmitting connection with the damper tube; wherein each respective damper receptacle is supported on the damper tube via a respective releasable securing element. 2. The vibration damper according to claim 1, wherein each damper receptacle is supported between a respective damper support, which is disposed on the damper tube and is configured as a collar or a web, and the respective releasable securing element, which is releasably fastened to the damper tube or to a damper bottom portion. 3. The vibration damper according to claim 1, wherein each releasable securing element is configured as a screw nut which is screwed onto a thread which is disposed on the damper tube or a damper tube bottom part and wherein a longitudinal axis of the thread coincides with a longitudinal axis of the damper tube. 4. The vibration damper according to claim 1, wherein the respective damper receptacles of the two elastic bearings are combined to form a structural unit which is plugged onto the damper tube by an annular connecting portion. 5. The vibration damper according to claim 1, wherein the rubber-elastic bearing elements are surrounded by respective bearing receptacles which are connected to the wheel-guide element in a force-fitting or integrally bonded manner. 6. The vibration damper according to claim 1, wherein a common axis of rotation of the two elastic bearings is normal to a plane which is formed by axes of the damper tube in its two end positions. | 3,600 |
347,106 | 16,805,581 | 3,629 | An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions to receive, from a client, a request to create a catalog item corresponding to a file, determine an identifier of a cluster manager associated with a cluster having available capacity, send, to the cluster manager, a source location of the catalog item, and cause the cluster manager to store the catalog item from the source location in the cluster. | 1. An apparatus including a processor having programmed instructions to:
receive, from a client, a request to create a catalog item corresponding to a file; determine an identifier of a cluster manager associated with a cluster having available capacity; send, to the cluster manager, a source location of the catalog item; and cause the cluster manager to store the catalog item from the source location in the cluster. 2. The apparatus of claim 1, the processor having further programmed instructions to:
send, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receive, from the scheduler, the identifier of the cluster manager. 3. The apparatus of claim 1, wherein the source location is a uniform resource locator (URL), the processor having further programmed instructions to:
access a content server via the URL; and download the catalog item. 4. The apparatus of claim 1, the processor having further programmed instructions to:
store the file in a file repository; and store a pointer to the file in the cluster. 5. The apparatus of claim 1, the processor having further programmed instructions to:
provision storage in an object store accessible by the cluster manager; and store the file in the object store. 6. The apparatus of claim 1, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 7. The apparatus of claim 1, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. 8. A non-transitory computer readable storage medium having instructions stored thereon that, upon execution by a processor, causes the processor to perform operations comprising:
receiving, from a client, a request to create a catalog item corresponding to a file; determining an identifier of a cluster manager associated with a cluster having available capacity; sending, to the cluster manager, a source location of the catalog item; and causing the cluster manager to store the catalog item from the source location in the cluster. 9. The medium of claim 8, the processor performing operations comprising:
sending, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receiving, from the scheduler, the identifier of the cluster manager. 10. The medium of claim 8, wherein the source location is a uniform resource locator (URL), the processor performing operations comprising:
accessing a content server via the URL; and downloading the catalog item. 11. The medium of claim 8, the processor performing operations comprising:
storing the file in a file repository; and storing a pointer to the file in the cluster. 12. The medium of claim 8, the processor performing operations comprising:
provisioning storage in an object store accessible by the cluster manager; and storing the file in the object store. 13. The medium of claim 8, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 14. The medium of claim 8, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. 15. A computer-implemented method comprising:
receiving, by a processor and from a client, a request to create a catalog item corresponding to a file; determining, by the processor, an identifier of a cluster manager associated with a cluster having available capacity; sending, by the processor and to the cluster manager, a source location of the catalog item; and causing, by the processor, the cluster manager to store the catalog item from the source location in the cluster. 16. The method of claim 15, further comprising:
sending, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receiving, from the scheduler, the identifier of the cluster manager. 17. The method of claim 15, wherein the source location is a uniform resource locator (URL), the method further comprising:
accessing a content server via the URL; and downloading the catalog item. 18. The method of claim 15, further comprising:
storing the file in a file repository; and storing a pointer to the file in the cluster. 19. The method of claim 15, further comprising:
provisioning storage in an object store accessible by the cluster manager; and storing the file in the object store. 20. The method of claim 15, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 21. The method of claim 15, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. | An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions to receive, from a client, a request to create a catalog item corresponding to a file, determine an identifier of a cluster manager associated with a cluster having available capacity, send, to the cluster manager, a source location of the catalog item, and cause the cluster manager to store the catalog item from the source location in the cluster.1. An apparatus including a processor having programmed instructions to:
receive, from a client, a request to create a catalog item corresponding to a file; determine an identifier of a cluster manager associated with a cluster having available capacity; send, to the cluster manager, a source location of the catalog item; and cause the cluster manager to store the catalog item from the source location in the cluster. 2. The apparatus of claim 1, the processor having further programmed instructions to:
send, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receive, from the scheduler, the identifier of the cluster manager. 3. The apparatus of claim 1, wherein the source location is a uniform resource locator (URL), the processor having further programmed instructions to:
access a content server via the URL; and download the catalog item. 4. The apparatus of claim 1, the processor having further programmed instructions to:
store the file in a file repository; and store a pointer to the file in the cluster. 5. The apparatus of claim 1, the processor having further programmed instructions to:
provision storage in an object store accessible by the cluster manager; and store the file in the object store. 6. The apparatus of claim 1, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 7. The apparatus of claim 1, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. 8. A non-transitory computer readable storage medium having instructions stored thereon that, upon execution by a processor, causes the processor to perform operations comprising:
receiving, from a client, a request to create a catalog item corresponding to a file; determining an identifier of a cluster manager associated with a cluster having available capacity; sending, to the cluster manager, a source location of the catalog item; and causing the cluster manager to store the catalog item from the source location in the cluster. 9. The medium of claim 8, the processor performing operations comprising:
sending, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receiving, from the scheduler, the identifier of the cluster manager. 10. The medium of claim 8, wherein the source location is a uniform resource locator (URL), the processor performing operations comprising:
accessing a content server via the URL; and downloading the catalog item. 11. The medium of claim 8, the processor performing operations comprising:
storing the file in a file repository; and storing a pointer to the file in the cluster. 12. The medium of claim 8, the processor performing operations comprising:
provisioning storage in an object store accessible by the cluster manager; and storing the file in the object store. 13. The medium of claim 8, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 14. The medium of claim 8, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. 15. A computer-implemented method comprising:
receiving, by a processor and from a client, a request to create a catalog item corresponding to a file; determining, by the processor, an identifier of a cluster manager associated with a cluster having available capacity; sending, by the processor and to the cluster manager, a source location of the catalog item; and causing, by the processor, the cluster manager to store the catalog item from the source location in the cluster. 16. The method of claim 15, further comprising:
sending, to a scheduler, a second request to identify the cluster manager associated with the cluster having the available capacity; and receiving, from the scheduler, the identifier of the cluster manager. 17. The method of claim 15, wherein the source location is a uniform resource locator (URL), the method further comprising:
accessing a content server via the URL; and downloading the catalog item. 18. The method of claim 15, further comprising:
storing the file in a file repository; and storing a pointer to the file in the cluster. 19. The method of claim 15, further comprising:
provisioning storage in an object store accessible by the cluster manager; and storing the file in the object store. 20. The method of claim 15, wherein the source location is a location of a first cluster, and the cluster is a second cluster different from the first cluster. 21. The method of claim 15, wherein the source location is a location of a public cloud, and the cluster is an on-premises cluster. | 3,600 |
347,107 | 16,805,620 | 3,629 | HER3 antigen-binding molecules are disclosed. Also disclosed are nucleic acids and expression vectors encoding, compositions comprising, and methods using, the HER3 antigen-binding molecules. | 1-23. (canceled) 24. An antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 25. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 26. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 27. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 28. A nucleic acid, or a plurality of nucleic acids, encoding an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 29. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 30. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 31. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 32. A cell comprising a nucleic acid, or a plurality of nucleic acids, encoding an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 33. The cell according to claim 32, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 34. The cell according to claim 32, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 35. The cell according to claim 32, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 36. A method of treating a cancer in a subject, comprising administering to a subject a therapeutically effective amount of an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 37. The method according to claim 36, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 38. The method according to claim 36, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 39. The method according to claim 36, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 40. The method according to claim 36, wherein the cancer is selected from: a cancer comprising cells expressing an EGFR family member, a cancer comprising cells expressing HER3, a solid tumor, breast cancer, breast carcinoma, ductal carcinoma, gastric cancer, gastric carcinoma, gastric adenocarcinoma, colorectal cancer, colorectal carcinoma, colorectal adenocarcinoma, head and neck cancer, squamous cell carcinoma of the head and neck (SCCHN), lung cancer, lung adenocarcinoma, squamous cell lung carcinoma, ovarian cancer, ovarian carcinoma, ovarian serous adenocarcinoma, kidney cancer, renal cell carcinoma, renal clear cell carcinoma, renal cell adenocarcinoma, renal papillary cell carcinoma, pancreatic cancer, pancreatic adenocarcinoma, pancreatic ductal adenocarcinoma, cervical cancer, cervical squamous cell carcinoma, skin cancer, melanoma, esophageal cancer, esophageal adenocarcinoma, liver cancer, hepatocellular carcinoma, cholangiocarcinoma, uterine cancer, uterine corpus endometrial carcinoma, thyroid cancer, thyroid carcinoma, pheochromocytoma, paraganglioma, bladder cancer, bladder urothelial carcinoma, prostate cancer, prostate adenocarcinoma, sarcoma and thymoma. | HER3 antigen-binding molecules are disclosed. Also disclosed are nucleic acids and expression vectors encoding, compositions comprising, and methods using, the HER3 antigen-binding molecules.1-23. (canceled) 24. An antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 25. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 26. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 27. The antigen-binding molecule according to claim 24, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 28. A nucleic acid, or a plurality of nucleic acids, encoding an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 29. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 30. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 31. The nucleic acid or plurality of nucleic acids according to claim 28, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 32. A cell comprising a nucleic acid, or a plurality of nucleic acids, encoding an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 33. The cell according to claim 32, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 34. The cell according to claim 32, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 35. The cell according to claim 32, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 36. A method of treating a cancer in a subject, comprising administering to a subject a therapeutically effective amount of an antigen-binding molecule comprising a heavy chain variable (VH) region and a light chain variable (VL) region, wherein the antigen-binding molecule specifically binds to HER3, and wherein binding to HER3 comprises contact with one or more amino acid residues of the region of HER3 shown in SEQ ID NO:229. 37. The method according to claim 36, wherein the antigen-binding molecule comprises:
a VH region incorporating the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:43
HC-CDR2 having the amino acid sequence of SEQ ID NO:46
HC-CDR3 having the amino acid sequence of SEQ ID NO:51; and
a VL region incorporating the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:91
LC-CDR2 having the amino acid sequence of SEQ ID NO:94
LC-CDR3 having the amino acid sequence of SEQ ID NO:99. 38. The method according to claim 36, wherein the antigen-binding molecule comprises:
(a)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(b)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:89
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(c)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:90
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:96; or
(d)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(e)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:49; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(f)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:50; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:93
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(g)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(h)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:97; or
(i)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:42
HC-CDR2 having the amino acid sequence of SEQ ID NO:45
HC-CDR3 having the amino acid sequence of SEQ ID NO:48; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:95; or
(j)
a VH region having the following CDRs:
HC-CDR1 having the amino acid sequence of SEQ ID NO:41
HC-CDR2 having the amino acid sequence of SEQ ID NO:44
HC-CDR3 having the amino acid sequence of SEQ ID NO:47; and
a VL region having the following CDRs:
LC-CDR1 having the amino acid sequence of SEQ ID NO:88
LC-CDR2 having the amino acid sequence of SEQ ID NO:92
LC-CDR3 having the amino acid sequence of SEQ ID NO:98. 39. The method according to claim 36, wherein the antigen-binding molecule comprises:
(a) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:24; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:74; or (b) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:25; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:75; or (c) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:26; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:76; or (d) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:27; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:77; or (e) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:28; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (f) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:29; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (g) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:30; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:78; or (h) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:31; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (i) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:32; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:79; or (j) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:33; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:80; or (k) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:34; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:81; or (l) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:35; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:82; or (m) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:36; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:83; or (n) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:37; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:84; or (o) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:38; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:85; or (p) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:39; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:86; or (q) a VH region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:40; and a VL region comprising an amino acid sequence having at least 70% sequence identity to the amino acid sequence of SEQ ID NO:87. 40. The method according to claim 36, wherein the cancer is selected from: a cancer comprising cells expressing an EGFR family member, a cancer comprising cells expressing HER3, a solid tumor, breast cancer, breast carcinoma, ductal carcinoma, gastric cancer, gastric carcinoma, gastric adenocarcinoma, colorectal cancer, colorectal carcinoma, colorectal adenocarcinoma, head and neck cancer, squamous cell carcinoma of the head and neck (SCCHN), lung cancer, lung adenocarcinoma, squamous cell lung carcinoma, ovarian cancer, ovarian carcinoma, ovarian serous adenocarcinoma, kidney cancer, renal cell carcinoma, renal clear cell carcinoma, renal cell adenocarcinoma, renal papillary cell carcinoma, pancreatic cancer, pancreatic adenocarcinoma, pancreatic ductal adenocarcinoma, cervical cancer, cervical squamous cell carcinoma, skin cancer, melanoma, esophageal cancer, esophageal adenocarcinoma, liver cancer, hepatocellular carcinoma, cholangiocarcinoma, uterine cancer, uterine corpus endometrial carcinoma, thyroid cancer, thyroid carcinoma, pheochromocytoma, paraganglioma, bladder cancer, bladder urothelial carcinoma, prostate cancer, prostate adenocarcinoma, sarcoma and thymoma. | 3,600 |
347,108 | 16,805,607 | 3,629 | In some examples, a first set of image data is received, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle and including a first plurality of images of the person over a time interval. In some examples, a second set of image data is received, the second set of image data corresponding to images of a second type and being of the person in the environment of the vehicle and including a second plurality of images of the person over the time interval. In some examples, the first set of image data and the second set of image data are processed to determine a recognized action of the person, which includes using a first neural network to determine the recognized action of the person. | 1. A method comprising:
at an electronic device with one or more processors and memory:
receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval;
receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and
processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 2. The method of claim 1, wherein the images of the first type and the images of the second type are generated from outputs of a single monocular camera. 3. The method of claim 1, wherein the images of the first type are two-dimensional RGB images of the person, and the images of the second type are U,V images of a plurality of parts of a surface of a body of the person. 4. The method of claim 1, further comprising:
processing the images of the first type using a second neural network to generate the first set of image data, the first set of image data comprising one or more features extracted by the second neural network from the first plurality of images; and processing the images of the second type using a third neural network to generate the second set of image data, the second set of image data comprising one or more features extracted by the third neural network from the second plurality of images. 5. The method of claim 4, wherein the first neural network is of a different type than the second neural network and the third neural network. 6. The method of claim 5, wherein the first neural network is a temporal relation network, and the second neural network and the third neural network are convolutional neural networks. 7. The method of claim 4, wherein processing the first set of image data and the second set of image data comprises:
providing the first set of image data as an input to a first linear layer to generate a processed first set of image data; and providing the second set of image data as an input to a second linear layer to generate a processed second set of image data, wherein the first neural network determines the recognized action of the person based on the processed first set of image data and the processed second set of image data. 8. The method of claim 7, wherein processing the first set of image data and the second set of image data comprises:
combining the processed first set of image data and the processed second set of image data, and providing the combined processed first set of image data and the processed second set of image data as an input to the first neural network to determine the recognized action of the person. 9. The method of claim 1, further comprising:
autonomously adjusting operation of the vehicle based on the recognized action of the person. 10. The method of claim 1, wherein the images of the first type are images that have been cropped to a bounding box surrounding the person, and the images of the second type are images that have been cropped to the bounding box surrounding the person. 11. The method of claim 1, further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 12. The method of claim 11, wherein the asymmetrical loss function reflects an asymmetrical distribution of estimated distance errors as a function of a true distance of a respective person from the vehicle. 13. The method of claim 12, wherein the asymmetrical loss function is a Johnson SU loss function. 14. The method of claim 11, wherein the first set of image data, the second set of image data, and the first set of key points data are generated from images outputted from a single monocular camera. 15. The method of claim 11, further comprising:
autonomously adjusting operation of the vehicle based on the estimated distance of the person. 16. A non-transitory computer-readable storage medium storing instructions, which when executed by an electronic device with one or more processors, cause the electronic device to perform a method comprising:
receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval; receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 17. The computer-readable storage medium of claim 16, the method further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 18. An electronic device comprising:
one or more processors; and memory storing instructions, which when executed by the one or more processors, cause the electronic device to perform a method comprising: receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval; receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 19. The electronic device of claim 18, the method further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 20. The electronic device of claim 18, wherein the images of the first type are two-dimensional RGB images of the person, and the images of the second type are U,V images of a plurality of parts of a surface of a body of the person. | In some examples, a first set of image data is received, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle and including a first plurality of images of the person over a time interval. In some examples, a second set of image data is received, the second set of image data corresponding to images of a second type and being of the person in the environment of the vehicle and including a second plurality of images of the person over the time interval. In some examples, the first set of image data and the second set of image data are processed to determine a recognized action of the person, which includes using a first neural network to determine the recognized action of the person.1. A method comprising:
at an electronic device with one or more processors and memory:
receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval;
receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and
processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 2. The method of claim 1, wherein the images of the first type and the images of the second type are generated from outputs of a single monocular camera. 3. The method of claim 1, wherein the images of the first type are two-dimensional RGB images of the person, and the images of the second type are U,V images of a plurality of parts of a surface of a body of the person. 4. The method of claim 1, further comprising:
processing the images of the first type using a second neural network to generate the first set of image data, the first set of image data comprising one or more features extracted by the second neural network from the first plurality of images; and processing the images of the second type using a third neural network to generate the second set of image data, the second set of image data comprising one or more features extracted by the third neural network from the second plurality of images. 5. The method of claim 4, wherein the first neural network is of a different type than the second neural network and the third neural network. 6. The method of claim 5, wherein the first neural network is a temporal relation network, and the second neural network and the third neural network are convolutional neural networks. 7. The method of claim 4, wherein processing the first set of image data and the second set of image data comprises:
providing the first set of image data as an input to a first linear layer to generate a processed first set of image data; and providing the second set of image data as an input to a second linear layer to generate a processed second set of image data, wherein the first neural network determines the recognized action of the person based on the processed first set of image data and the processed second set of image data. 8. The method of claim 7, wherein processing the first set of image data and the second set of image data comprises:
combining the processed first set of image data and the processed second set of image data, and providing the combined processed first set of image data and the processed second set of image data as an input to the first neural network to determine the recognized action of the person. 9. The method of claim 1, further comprising:
autonomously adjusting operation of the vehicle based on the recognized action of the person. 10. The method of claim 1, wherein the images of the first type are images that have been cropped to a bounding box surrounding the person, and the images of the second type are images that have been cropped to the bounding box surrounding the person. 11. The method of claim 1, further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 12. The method of claim 11, wherein the asymmetrical loss function reflects an asymmetrical distribution of estimated distance errors as a function of a true distance of a respective person from the vehicle. 13. The method of claim 12, wherein the asymmetrical loss function is a Johnson SU loss function. 14. The method of claim 11, wherein the first set of image data, the second set of image data, and the first set of key points data are generated from images outputted from a single monocular camera. 15. The method of claim 11, further comprising:
autonomously adjusting operation of the vehicle based on the estimated distance of the person. 16. A non-transitory computer-readable storage medium storing instructions, which when executed by an electronic device with one or more processors, cause the electronic device to perform a method comprising:
receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval; receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 17. The computer-readable storage medium of claim 16, the method further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 18. An electronic device comprising:
one or more processors; and memory storing instructions, which when executed by the one or more processors, cause the electronic device to perform a method comprising: receiving a first set of image data, the first set of image data corresponding to images of a first type and being of a person in an environment of a vehicle, and the images of the first type including a first plurality of images of the person over a time interval; receiving a second set of image data, the second set of image data corresponding to images of a second type, different from the first type, and being of the person in the environment of the vehicle, and the images of the second type including a second plurality of images of the person over the time interval; and processing the first set of image data and the second set of image data to determine a recognized action of the person, wherein the processing includes using a first neural network to determine the recognized action of the person based on the first set of image data and the second set of image data. 19. The electronic device of claim 18, the method further comprising:
receiving a first set of key points data of the person in the environment of the vehicle; and processing the first set of key points data to determine an estimated distance of the person from the vehicle, wherein the processing of the first set of key points data includes processing the first set of key points data using a second neural network utilizing a regression process and trained based on an asymmetrical loss function. 20. The electronic device of claim 18, wherein the images of the first type are two-dimensional RGB images of the person, and the images of the second type are U,V images of a plurality of parts of a surface of a body of the person. | 3,600 |
347,109 | 16,805,616 | 3,629 | The present disclosure provides an IPv6 stateless address auto-configuration method, a network device and a host. The method includes: sending a router advertisement RA message to a host, wherein the RA message includes a prefix information option, and the prefix information option includes a prefix and a flag. The host performs IPv6 stateless address auto-configuration according to the prefix and the flag. | 1. A method of performing Internet Protocol Version 6 (IPv6) stateless address auto-configuration, applied to a network device and comprising:
sending a router advertisement (RA) message to a host, wherein the RA message comprises a prefix information option, the prefix information option comprises a prefix and a flag, and the prefix and the flag are used for IPv6 stateless address auto-configuration. 2. The method according to claim 1, wherein the flag is configured to indicate an address generation mode and an IPv6 address lifetime refresh mode;
the IPv6 stateless address auto-configuration comprises:
generating an IPv6 address of the host; or refreshing a lifetime of the IPv6 address of the host. 3. The method according to claim 2, wherein the flag comprises a Mode field and a T field;
the Mode field is configured to indicate the address generation mode; the T field is configured to indicate the IPv6 address lifetime refresh mode, wherein the Mode field and the T field occupy four bits in a reserved field comprised in the prefix information option; wherein, three consecutive bits of the four bits are occupied by the Mode field, and one bit is occupied by the T field. 4. The method according to claim 3, wherein the address generation mode comprises a mode in which the host generates an interface identifier of the host,
wherein the address generation mode is set according to an interface identifier generation mode pre-configured locally by the network device, or according to networking configuration of the network device. 5. The method according to claim 4, wherein the Mode field carries any of the following information:
first indication information indicating a first interface identifier generation mode, wherein the first interface identifier generation mode comprises: generating a random number, and determining the generated random number as the interface identifier of the host; second indication information indicating a second interface identifier generation mode, wherein the second interface identifier generation mode comprises: generating a random number, encrypting the generated random number, and determining the encrypted random number as the interface identifier of the host; and third indication information indicating a third interface identifier generation mode, wherein the third interface identifier generation mode comprises: generating the interface identifier of the host according to an interface identifier generation mode built in the host. 6. The method according to claim 3, wherein the IPv6 address lifetime refresh mode is set according to an IPv6 address lifetime refresh mode pre-configured by the network device, or according to a total number of existing IPv6 addresses of the host and a preset number threshold, or according to networking configuration of the network device. 7. The method according to claim 6, wherein the T field carries any of the following information:
fourth indication information indicating a first refresh mode, wherein the first refresh mode comprises: forcibly refreshing a lifetime of an IPv6 address comprising the prefix; and fifth indication information indicating a second refresh mode, wherein the second refresh mode comprises: refreshing a lifetime of an IPv6 address comprising the prefix according to a default IPv6 address lifetime refresh mode of the host. 8. The method according to claim 7, wherein when the total number of the IPv6 addresses exceeds the preset number threshold, the T field carries the fourth indication information;
when the total number of the IPv6 addresses does not exceed the preset number threshold, the T field carries the fifth indication information. 9. The method according to claim 3, wherein the prefix information option further comprises an A field for indicating a stateless address auto-allocation marking;
the method further comprises: if the stateless address auto-allocation marking is set to be invalid, not setting the Mode field and the T field. 10. The method according to claim 1, wherein sending the router advertisement RA message to the host comprises:
sending an RA message to the host periodically; or after receiving a router solicitation (RS) message sent by the host, sending an RA message to the host in response to the RS message. 11. A method of performing Internet Protocol Version 6 (IPv6) stateless address auto-configuration, applied to a host and comprising:
receiving a router advertisement (RA) message sent by a network device, wherein the RA message comprises a prefix information option, and the prefix information option comprises a prefix and a flag; and performing IPv6 stateless address auto-configuration according to the prefix and the flag. 12. The method according to claim 11, wherein the flag is configured to indicate an address generation mode and an IPv6 address lifetime refresh mode;
performing the IPv6 stateless address auto-configuration according to the prefix and the flag comprises: generating an IPv6 address of the host according to the prefix and the address generation mode; or refreshing a lifetime of an IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode. 13. The method according to claim 12, wherein the flag comprises a Mode field and a T field;
the Mode field is configured to indicate the address generation mode, and the T field is configured to indicate the IPv6 address lifetime refresh mode, wherein the address generation mode comprises: a mode in which the host generates the interface identifier of the host; generating the IPv6 address of the host according to the prefix and the address generation mode comprises: generating an interface identifier of the host according to the address generation mode carried in the Mode field; and generating the IPv6 address of the host according to the prefix and the generated interface identifier. 14. The method according to claim 13, wherein generating the interface identifier of the host according to the address generation mode carried in the Mode field comprises:
if the Mode field carries first indication information, generating the interface identifier of the host according to a first interface identifier generation mode indicated by the first indication information, wherein the first interface identifier generation mode comprises: generating a random number, and determining the generated random number as the interface identifier of the host; if the Mode field carries second indication information, generating the interface identifier of the host according to a second interface identifier generation mode indicated by the second indication information, wherein the second interface identifier generation mode comprises: generating a random number, encrypting the generated random number, and determining the encrypted random number as the interface identifier of the host; and if the Mode field carries third indication information, generating the interface identifier of the host according to a third interface identifier generation mode indicated by the third indication information, wherein the third interface identifier generation mode comprises: generating the interface identifier of the host according to an interface identifier generation mode built in the host. 15. The method according to claim 13, wherein refreshing the lifetime of the IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode comprises:
if the T field carries fourth indication information, refreshing the lifetime of the IPv6 address comprising the prefix according to a first refresh mode indicated by the fourth indication information, wherein the first refresh mode comprises: forcibly refreshing the lifetime of the IPv6 address comprising the prefix; if the T field carries fifth indication information, refreshing the lifetime of the IPv6 address comprising the prefix according to a second refresh mode indicated by the fifth indication information, wherein the second refresh mode comprises: refreshing the lifetime of the IPv6 address comprising the prefix according to a default IPv6 address lifetime refresh mode of the host. 16. The method according to claim 12, wherein before performing the IPv6 stateless address auto-configuration according to the prefix and the flag, the method further comprises:
if the host generates the IPv6 address comprising the prefix, refreshing the lifetime of the IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode; and if the host does not generate the IPv6 address comprising the prefix, generating the IPv6 address of the host according to the prefix and the address generation mode. 17. The method according to claim 13, wherein the prefix information option further comprises: an A field for indicating a stateless address auto-allocation marking;
the method further comprises: if the stateless address auto-allocation marking is set to be invalid, skipping the Mode field and the T field; if the prefix is a local link prefix, skipping the Mode field and the T field. 18. The method according to claim 11, wherein receiving the router advertisement RA message sent by the network device comprises:
sending a router solicitation RS message to the network device, and receiving an RA message returned by the network device in response to the RS message; or, receiving an RA message periodically sent by the network device. 19. A network device, comprising a processor and a machine readable storage medium, wherein the machine readable storage medium stores machine executable instructions executable by the processor, and the processor is caused by the machine executable instructions to perform the method according to claim 1. 20. A host, comprising a processor and a machine readable storage medium, wherein the machine readable storage medium stores machine executable instructions executable by the processor, and the processor is caused by the machine executable instructions to perform the method according to claim 11. | The present disclosure provides an IPv6 stateless address auto-configuration method, a network device and a host. The method includes: sending a router advertisement RA message to a host, wherein the RA message includes a prefix information option, and the prefix information option includes a prefix and a flag. The host performs IPv6 stateless address auto-configuration according to the prefix and the flag.1. A method of performing Internet Protocol Version 6 (IPv6) stateless address auto-configuration, applied to a network device and comprising:
sending a router advertisement (RA) message to a host, wherein the RA message comprises a prefix information option, the prefix information option comprises a prefix and a flag, and the prefix and the flag are used for IPv6 stateless address auto-configuration. 2. The method according to claim 1, wherein the flag is configured to indicate an address generation mode and an IPv6 address lifetime refresh mode;
the IPv6 stateless address auto-configuration comprises:
generating an IPv6 address of the host; or refreshing a lifetime of the IPv6 address of the host. 3. The method according to claim 2, wherein the flag comprises a Mode field and a T field;
the Mode field is configured to indicate the address generation mode; the T field is configured to indicate the IPv6 address lifetime refresh mode, wherein the Mode field and the T field occupy four bits in a reserved field comprised in the prefix information option; wherein, three consecutive bits of the four bits are occupied by the Mode field, and one bit is occupied by the T field. 4. The method according to claim 3, wherein the address generation mode comprises a mode in which the host generates an interface identifier of the host,
wherein the address generation mode is set according to an interface identifier generation mode pre-configured locally by the network device, or according to networking configuration of the network device. 5. The method according to claim 4, wherein the Mode field carries any of the following information:
first indication information indicating a first interface identifier generation mode, wherein the first interface identifier generation mode comprises: generating a random number, and determining the generated random number as the interface identifier of the host; second indication information indicating a second interface identifier generation mode, wherein the second interface identifier generation mode comprises: generating a random number, encrypting the generated random number, and determining the encrypted random number as the interface identifier of the host; and third indication information indicating a third interface identifier generation mode, wherein the third interface identifier generation mode comprises: generating the interface identifier of the host according to an interface identifier generation mode built in the host. 6. The method according to claim 3, wherein the IPv6 address lifetime refresh mode is set according to an IPv6 address lifetime refresh mode pre-configured by the network device, or according to a total number of existing IPv6 addresses of the host and a preset number threshold, or according to networking configuration of the network device. 7. The method according to claim 6, wherein the T field carries any of the following information:
fourth indication information indicating a first refresh mode, wherein the first refresh mode comprises: forcibly refreshing a lifetime of an IPv6 address comprising the prefix; and fifth indication information indicating a second refresh mode, wherein the second refresh mode comprises: refreshing a lifetime of an IPv6 address comprising the prefix according to a default IPv6 address lifetime refresh mode of the host. 8. The method according to claim 7, wherein when the total number of the IPv6 addresses exceeds the preset number threshold, the T field carries the fourth indication information;
when the total number of the IPv6 addresses does not exceed the preset number threshold, the T field carries the fifth indication information. 9. The method according to claim 3, wherein the prefix information option further comprises an A field for indicating a stateless address auto-allocation marking;
the method further comprises: if the stateless address auto-allocation marking is set to be invalid, not setting the Mode field and the T field. 10. The method according to claim 1, wherein sending the router advertisement RA message to the host comprises:
sending an RA message to the host periodically; or after receiving a router solicitation (RS) message sent by the host, sending an RA message to the host in response to the RS message. 11. A method of performing Internet Protocol Version 6 (IPv6) stateless address auto-configuration, applied to a host and comprising:
receiving a router advertisement (RA) message sent by a network device, wherein the RA message comprises a prefix information option, and the prefix information option comprises a prefix and a flag; and performing IPv6 stateless address auto-configuration according to the prefix and the flag. 12. The method according to claim 11, wherein the flag is configured to indicate an address generation mode and an IPv6 address lifetime refresh mode;
performing the IPv6 stateless address auto-configuration according to the prefix and the flag comprises: generating an IPv6 address of the host according to the prefix and the address generation mode; or refreshing a lifetime of an IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode. 13. The method according to claim 12, wherein the flag comprises a Mode field and a T field;
the Mode field is configured to indicate the address generation mode, and the T field is configured to indicate the IPv6 address lifetime refresh mode, wherein the address generation mode comprises: a mode in which the host generates the interface identifier of the host; generating the IPv6 address of the host according to the prefix and the address generation mode comprises: generating an interface identifier of the host according to the address generation mode carried in the Mode field; and generating the IPv6 address of the host according to the prefix and the generated interface identifier. 14. The method according to claim 13, wherein generating the interface identifier of the host according to the address generation mode carried in the Mode field comprises:
if the Mode field carries first indication information, generating the interface identifier of the host according to a first interface identifier generation mode indicated by the first indication information, wherein the first interface identifier generation mode comprises: generating a random number, and determining the generated random number as the interface identifier of the host; if the Mode field carries second indication information, generating the interface identifier of the host according to a second interface identifier generation mode indicated by the second indication information, wherein the second interface identifier generation mode comprises: generating a random number, encrypting the generated random number, and determining the encrypted random number as the interface identifier of the host; and if the Mode field carries third indication information, generating the interface identifier of the host according to a third interface identifier generation mode indicated by the third indication information, wherein the third interface identifier generation mode comprises: generating the interface identifier of the host according to an interface identifier generation mode built in the host. 15. The method according to claim 13, wherein refreshing the lifetime of the IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode comprises:
if the T field carries fourth indication information, refreshing the lifetime of the IPv6 address comprising the prefix according to a first refresh mode indicated by the fourth indication information, wherein the first refresh mode comprises: forcibly refreshing the lifetime of the IPv6 address comprising the prefix; if the T field carries fifth indication information, refreshing the lifetime of the IPv6 address comprising the prefix according to a second refresh mode indicated by the fifth indication information, wherein the second refresh mode comprises: refreshing the lifetime of the IPv6 address comprising the prefix according to a default IPv6 address lifetime refresh mode of the host. 16. The method according to claim 12, wherein before performing the IPv6 stateless address auto-configuration according to the prefix and the flag, the method further comprises:
if the host generates the IPv6 address comprising the prefix, refreshing the lifetime of the IPv6 address comprising the prefix according to the prefix and the IPv6 address lifetime refresh mode; and if the host does not generate the IPv6 address comprising the prefix, generating the IPv6 address of the host according to the prefix and the address generation mode. 17. The method according to claim 13, wherein the prefix information option further comprises: an A field for indicating a stateless address auto-allocation marking;
the method further comprises: if the stateless address auto-allocation marking is set to be invalid, skipping the Mode field and the T field; if the prefix is a local link prefix, skipping the Mode field and the T field. 18. The method according to claim 11, wherein receiving the router advertisement RA message sent by the network device comprises:
sending a router solicitation RS message to the network device, and receiving an RA message returned by the network device in response to the RS message; or, receiving an RA message periodically sent by the network device. 19. A network device, comprising a processor and a machine readable storage medium, wherein the machine readable storage medium stores machine executable instructions executable by the processor, and the processor is caused by the machine executable instructions to perform the method according to claim 1. 20. A host, comprising a processor and a machine readable storage medium, wherein the machine readable storage medium stores machine executable instructions executable by the processor, and the processor is caused by the machine executable instructions to perform the method according to claim 11. | 3,600 |
347,110 | 16,805,525 | 3,629 | The present specification discloses a data processing method, apparatus, and equipment. The method includes: obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. | 1. A method, comprising:
obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 2. The method according to claim 1, wherein the method further comprises:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model:
receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and
determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 3. The method according to claim 2, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 4. The method according to claim 2, wherein the method further comprises:
adjusting the image recognition model based on the image and the labeling information. 5. The method according to claim 1, wherein the method further comprises:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 6. The method according to claim 1, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the method further comprises:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 7. The method according to claim 1, wherein the method further comprises:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model:
sending, by the server, a labeling prompt to prompt the user for entering labeling information; and
receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. 8. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 9. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model:
receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and
determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 10. The non-transitory, computer-readable medium according to claim 9, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 11. The non-transitory, computer-readable medium according to claim 9, wherein the operations further comprise:
adjusting the image recognition model based on the image and the labeling information. 12. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 13. The non-transitory, computer-readable medium according to claim 8, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the operations further comprise:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 14. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model:
sending, by the server, a labeling prompt to prompt the user for entering labeling information; and
receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. 15. A computer-implemented system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising: obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 16. The computer-implemented system according to claim 15, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model: receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 17. The computer-implemented system according to claim 16, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 18. The computer-implemented system according to claim 16, wherein the operations further comprise:
adjusting the image recognition model based on the image and the labeling information. 19. The computer-implemented system according to claim 15, wherein the operations further comprise:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 20. The computer-implemented system according to claim 15, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the operations further comprise:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 21. The computer-implemented system according to claim 15, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model: sending, by the server, a labeling prompt to prompt the user for entering labeling information; and receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. | The present specification discloses a data processing method, apparatus, and equipment. The method includes: obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant.1. A method, comprising:
obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 2. The method according to claim 1, wherein the method further comprises:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model:
receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and
determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 3. The method according to claim 2, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 4. The method according to claim 2, wherein the method further comprises:
adjusting the image recognition model based on the image and the labeling information. 5. The method according to claim 1, wherein the method further comprises:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 6. The method according to claim 1, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the method further comprises:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 7. The method according to claim 1, wherein the method further comprises:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model:
sending, by the server, a labeling prompt to prompt the user for entering labeling information; and
receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. 8. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 9. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model:
receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and
determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 10. The non-transitory, computer-readable medium according to claim 9, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 11. The non-transitory, computer-readable medium according to claim 9, wherein the operations further comprise:
adjusting the image recognition model based on the image and the labeling information. 12. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 13. The non-transitory, computer-readable medium according to claim 8, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the operations further comprise:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 14. The non-transitory, computer-readable medium according to claim 8, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model:
sending, by the server, a labeling prompt to prompt the user for entering labeling information; and
receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. 15. A computer-implemented system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising: obtaining an image sent by a user, wherein the image to is collected by the user for a merchant; identifying carbon-saving behavior of the merchant, comprising processing the image using a trained image recognition model; and determining, based on the carbon-saving behavior, a value representing an amount of carbon saved by the merchant. 16. The computer-implemented system according to claim 15, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the image identification model: receiving, from the user, labeling information of the image, wherein the labeling information specifies carbon-saving behavior of the merchant that is identified by the user; and determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant. 17. The computer-implemented system according to claim 16, wherein the determining, based on the received labeled information, the value representing the amount of carbon saved by the merchant comprises:
determining the carbon-saving behavior specified by the labeled information; determining a reference value that corresponds to the carbon-saving behavior; and determining, based on computing a product of the reference value and a confidence coefficient, the value representing the amount of carbon saved by the merchant. 18. The computer-implemented system according to claim 16, wherein the operations further comprise:
adjusting the image recognition model based on the image and the labeling information. 19. The computer-implemented system according to claim 15, wherein the operations further comprise:
determining a contribution degree of the user; and performing at least one of providing the user with a virtual item that corresponds to the contribution degree, or crediting an account of the user by the contribution degree. 20. The computer-implemented system according to claim 15, wherein the value representing the amount of carbon saved by the merchant comprises a carbon-saving bonus point representing amount of carbon saved by the merchant; and
the operations further comprise:
adding the carbon-saving bonus point to a carbon-saving account of the merchant. 21. The computer-implemented system according to claim 15, wherein the operations further comprise:
if the carbon-saving behavior of the merchant is not identified from the image using the trained image recognition model: sending, by the server, a labeling prompt to prompt the user for entering labeling information; and receiving labeling information entered by the user after sending the labeling prompt, and determining the carbon-saving behavior of the merchant based on the labeling information. | 3,600 |
347,111 | 16,805,576 | 3,629 | Devices and methods for inserting an implant into skin or other tissue of a patient can include an insertion device that can enclose and support a hyaluronic thread as it is injected into a patient's skin or other tissue. The device can include a cover member, a non-tubular support member, and the thread. The cover member can have a proximal portion, a closed distal portion, and an inner cavity extending from the proximal portion toward the closed distal portion. The thread can be positioned along a longitudinal length of support member, between the support member and the cover member. The non-tubular support member can extend within the inner cavity of the cover member. The cover member can be moveable relative to the support member to expose the thread. | 1. A thread insertion assembly comprising:
a first base comprising a non-tubular support member, non-tubular support member having a proximal portion coupled to the first base and a distal portion extending away from the first base; a second base comprising a flexible cover member, the flexible cover member having a proximal portion coupled to the second base, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein the support member extends within the inner cavity of the cover member; and a thread positioned along a longitudinal length of support member, between the support member and the cover member, wherein the flexible cover member conforms to a shape of the support member and is separable from the thread in situ, and wherein the support member is separable from the thread in situ to separate the thread from the support member and expose the thread. 2. The thread insertion assembly of claim 1, wherein the second base is moveable, relative to the first base, to separate the cover member and expose the thread in situ. 3. The thread insertion assembly of claim 1, wherein the second base comprises a through-hole, and wherein the first base extends through the through-hole of the second base. 4. The thread insertion assembly of claim 1, wherein the non-tubular support member comprises a flat cross-sectional profile. 5. The thread insertion assembly of claim 1, wherein the thread is a dermal filler thread. 6. The thread insertion assembly of claim 1, wherein the thread comprises hyaluronic acid. 7. The thread insertion assembly of claim 1, wherein a longitudinal length of the cover member is approximately equal to or greater than a longitudinal length of the support member. 8. A method of inserting a thread comprising:
inserting a distal portion of a flexible cover member into a patient, wherein the cover member comprises a proximal portion, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein a non-tubular support member, comprising a proximal portion coupled to a first base, extends within the inner cavity from the proximal portion of the cover member toward the closed distal portion of the cover member, and wherein the proximal portion of the cover member is coupled to a second base; and proximally sliding the second base, relative to the first base, in situ to separate the cover member and expose a thread positioned along a longitudinal length of support member, between the support member and the cover member. 9. The method of claim 8, comprising proximally sliding the first base relative to the thread in situ to separate the thread from the support member. 10. The method of claim 8, wherein proximally sliding the second base, relative to the first base, comprises sliding the second base with the first base extending through a through-hole of the second base. 11. The method of claim 8, comprising creating an opening through a patient's skin to permit insertion of the distal portion of the cover member. 12. The method of claim 8, wherein separating the cover member relative to the thread to expose the thread comprises withdrawing the distal portion of the cover member from the patient. 13. The method of claim 8, wherein the thread is a dermal filler thread. 14. The method of claim 8, wherein the thread comprises hyaluronic acid. 15. A thread insertion assembly comprising
a first base and a second base, the first base comprising a non-tubular support member extending away from the first base, and the second base comprising a flexible cover member, the flexible cover member having a proximal portion coupled to the second base, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein the first and second base are coupled together such that support member extends within the inner cavity of the cover member; and a thread positioned along a longitudinal length of support member, between the support member and the cover member, wherein the second base is moveable, relative to the first base, to expose the thread in situ. 16. The thread insertion assembly of claim 15, wherein the first base is proximally slideable relative to the thread in situ to separate the thread from the support member. 17. The thread insertion assembly of claim 15, wherein the second base comprises a through-hole, and wherein the first base extends through the through-hole of the second base. 18. The thread insertion assembly of claim 15, wherein the non-tubular support member comprises a flat cross-sectional profile. 19. The thread insertion assembly of claim 15, wherein the thread is a dermal filler thread. 20. The thread insertion assembly of claim 15, wherein the thread comprises hyaluronic acid. | Devices and methods for inserting an implant into skin or other tissue of a patient can include an insertion device that can enclose and support a hyaluronic thread as it is injected into a patient's skin or other tissue. The device can include a cover member, a non-tubular support member, and the thread. The cover member can have a proximal portion, a closed distal portion, and an inner cavity extending from the proximal portion toward the closed distal portion. The thread can be positioned along a longitudinal length of support member, between the support member and the cover member. The non-tubular support member can extend within the inner cavity of the cover member. The cover member can be moveable relative to the support member to expose the thread.1. A thread insertion assembly comprising:
a first base comprising a non-tubular support member, non-tubular support member having a proximal portion coupled to the first base and a distal portion extending away from the first base; a second base comprising a flexible cover member, the flexible cover member having a proximal portion coupled to the second base, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein the support member extends within the inner cavity of the cover member; and a thread positioned along a longitudinal length of support member, between the support member and the cover member, wherein the flexible cover member conforms to a shape of the support member and is separable from the thread in situ, and wherein the support member is separable from the thread in situ to separate the thread from the support member and expose the thread. 2. The thread insertion assembly of claim 1, wherein the second base is moveable, relative to the first base, to separate the cover member and expose the thread in situ. 3. The thread insertion assembly of claim 1, wherein the second base comprises a through-hole, and wherein the first base extends through the through-hole of the second base. 4. The thread insertion assembly of claim 1, wherein the non-tubular support member comprises a flat cross-sectional profile. 5. The thread insertion assembly of claim 1, wherein the thread is a dermal filler thread. 6. The thread insertion assembly of claim 1, wherein the thread comprises hyaluronic acid. 7. The thread insertion assembly of claim 1, wherein a longitudinal length of the cover member is approximately equal to or greater than a longitudinal length of the support member. 8. A method of inserting a thread comprising:
inserting a distal portion of a flexible cover member into a patient, wherein the cover member comprises a proximal portion, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein a non-tubular support member, comprising a proximal portion coupled to a first base, extends within the inner cavity from the proximal portion of the cover member toward the closed distal portion of the cover member, and wherein the proximal portion of the cover member is coupled to a second base; and proximally sliding the second base, relative to the first base, in situ to separate the cover member and expose a thread positioned along a longitudinal length of support member, between the support member and the cover member. 9. The method of claim 8, comprising proximally sliding the first base relative to the thread in situ to separate the thread from the support member. 10. The method of claim 8, wherein proximally sliding the second base, relative to the first base, comprises sliding the second base with the first base extending through a through-hole of the second base. 11. The method of claim 8, comprising creating an opening through a patient's skin to permit insertion of the distal portion of the cover member. 12. The method of claim 8, wherein separating the cover member relative to the thread to expose the thread comprises withdrawing the distal portion of the cover member from the patient. 13. The method of claim 8, wherein the thread is a dermal filler thread. 14. The method of claim 8, wherein the thread comprises hyaluronic acid. 15. A thread insertion assembly comprising
a first base and a second base, the first base comprising a non-tubular support member extending away from the first base, and the second base comprising a flexible cover member, the flexible cover member having a proximal portion coupled to the second base, a closed distal portion, and an inner cavity extending from the proximal portion of the cover member toward the closed distal portion of the cover member, wherein the first and second base are coupled together such that support member extends within the inner cavity of the cover member; and a thread positioned along a longitudinal length of support member, between the support member and the cover member, wherein the second base is moveable, relative to the first base, to expose the thread in situ. 16. The thread insertion assembly of claim 15, wherein the first base is proximally slideable relative to the thread in situ to separate the thread from the support member. 17. The thread insertion assembly of claim 15, wherein the second base comprises a through-hole, and wherein the first base extends through the through-hole of the second base. 18. The thread insertion assembly of claim 15, wherein the non-tubular support member comprises a flat cross-sectional profile. 19. The thread insertion assembly of claim 15, wherein the thread is a dermal filler thread. 20. The thread insertion assembly of claim 15, wherein the thread comprises hyaluronic acid. | 3,600 |
347,112 | 16,805,601 | 3,629 | Disclosed is a user-customized artificial intelligence (AI) speaker-based personalized service system using voiceprint recognition. The system is used by a small group of users. The system includes a voice recognition device that identifies each user through voice recognition and enables a voice instruction of each user to be executed, and a data processing device interconnected with the voice recognition device. The voice recognition device includes a storage unit that stores speech samples of respective registered users, a receiver that receives a first utterance of a first utterer, a determination unit that determines whether the first utterer is a registered user by comparing the first utterance of the first utterer against the speech samples of the respective registered users stored in the storage unit, and an execution that generates an instruction signal corresponding to a first instruction phrase uttered as a first voice instruction by the first utterer. | 1. A user-customized artificial intelligence (AI) speaker-based personalized service system using voiceprint recognition, the system comprising:
a voice recognition device configured to verify each user of a group of users through voice recognition so that a voice instruction issued by each of the users can be performed; and a data processing device interconnected with the voice recognition device, wherein the voice recognition device comprises:
a storage unit configured to store a speech sample of each of the users;
a receiver configured to receive a first utterance of a first utterer;
a determination unit configured to compare the first utterance against the speech samples stored in the storage unit; and
an execution unit configured to generate an instruction signal corresponding to a first voice instruction uttered by the first utterer,
wherein the receiver comprises a wake-up-call receiver, wherein the determination unit comprises a caller recognition unit, wherein the storage unit comprises a wakeup call phrase storage unit, wherein when the first utterer utters a first wakeup call phrase as the first utterance, the wake-up-call receiver receives the first wakeup call phrase, registered wakeup call phrases of the respective users are stored in the wake-up-call storage unit, the caller recognition unit compares the first wakeup call phrase against the registered wakeup call phrases to determine whether the first utterer is a registered user, and the voice recognition device creates a first instruction session for the first utterer when the first utterer is determined to be a registered user. 2. The system according to claim 1, wherein the wakeup-call receiver transforms the first wakeup call phrase into a sound wave signal. 3. The system according to claim 1, wherein when a second utterer utters a second wakeup call phrase as a second utterance during the first instruction session, the wakeup-call receiver receives the second wakeup call phrase, the caller recognition unit determines whether the second utterer is a registered user by comparing the second wakeup call phrase against the registered wakeup call phrases, and the voice recognition device creates a second instruction session for the second utterer when it is determined that the second utterer is a registered user. 4. The system according to claim 1, wherein the receiver further comprises an instruction receiver that receives a first instruction phrase uttered by the first utterer as a first voice instruction. 5. The system according to claim 4, wherein the instruction receiver transforms the first instruction phrase into a sound wave signal. 6. The system according to claim 4, wherein the storage unit further comprises an instruction storage unit in which registered instruction phrase of each of the registered users are stored. 7. The system according to claim 6, wherein the determination unit further comprises an instruction phrase recognition unit that compares the first instruction phrase against the registered instruction phrases of the registered users and determines whether the first instruction phrase is a general instruction or a special instruction. 8. The system according to claim 7, wherein when the first instruction phrase is determined to be a general instruction, the execution unit generates a general instruction signal for executing the general instruction. 9. The system according to claim 7, wherein the determination unit further comprises a caller-utterer recognition unit, and
wherein when the first instruction phrase is a special instruction, the caller-utterer recognition unit compares the first instruction phrase against the registered instruction phrases to determine whether the first utterer is a registered user. 10. The system according to claim 9, wherein when it is determined that the first utterer is a registered user, the execution unit generates a special instruction signal for executing the special instruction. 11. The system according to claim 4, wherein when a third utterer utters a second instruction phrase as a second voice instruction, in a case where the second instruction phrase is a general instruction, the execution unit generates a general instruction signal for executing the general instruction. 12. The system according to claim 4, wherein when a third utterer utters a second instruction phrase as a second voice instruction, in a case where the second instruction phrase is a special instruction, the determination unit determines whether the first utterer and the third utterer are the same person, and
wherein when it is determined that the third utterer and the first utterer are not the same person, the first instruction session is closed. 13. The system according to claim 1, wherein when it is determined that the first utterer is not a registered user, the caller recognition unit compares the first wakeup call phrase of the first utterer against the registered wakeup call phrases of the respective users. 14. The system according to claim 13, wherein an i-vector between the first wakeup call phrase of the first utterer and each of the registered wakeup call phrases of the respective users is calculated, and wherein when the i-vector indicating similarity has a value of 0.8 or more, the first utterer is determined to be a user belong to the group and the first utterer is asked to start a user registration process. | Disclosed is a user-customized artificial intelligence (AI) speaker-based personalized service system using voiceprint recognition. The system is used by a small group of users. The system includes a voice recognition device that identifies each user through voice recognition and enables a voice instruction of each user to be executed, and a data processing device interconnected with the voice recognition device. The voice recognition device includes a storage unit that stores speech samples of respective registered users, a receiver that receives a first utterance of a first utterer, a determination unit that determines whether the first utterer is a registered user by comparing the first utterance of the first utterer against the speech samples of the respective registered users stored in the storage unit, and an execution that generates an instruction signal corresponding to a first instruction phrase uttered as a first voice instruction by the first utterer.1. A user-customized artificial intelligence (AI) speaker-based personalized service system using voiceprint recognition, the system comprising:
a voice recognition device configured to verify each user of a group of users through voice recognition so that a voice instruction issued by each of the users can be performed; and a data processing device interconnected with the voice recognition device, wherein the voice recognition device comprises:
a storage unit configured to store a speech sample of each of the users;
a receiver configured to receive a first utterance of a first utterer;
a determination unit configured to compare the first utterance against the speech samples stored in the storage unit; and
an execution unit configured to generate an instruction signal corresponding to a first voice instruction uttered by the first utterer,
wherein the receiver comprises a wake-up-call receiver, wherein the determination unit comprises a caller recognition unit, wherein the storage unit comprises a wakeup call phrase storage unit, wherein when the first utterer utters a first wakeup call phrase as the first utterance, the wake-up-call receiver receives the first wakeup call phrase, registered wakeup call phrases of the respective users are stored in the wake-up-call storage unit, the caller recognition unit compares the first wakeup call phrase against the registered wakeup call phrases to determine whether the first utterer is a registered user, and the voice recognition device creates a first instruction session for the first utterer when the first utterer is determined to be a registered user. 2. The system according to claim 1, wherein the wakeup-call receiver transforms the first wakeup call phrase into a sound wave signal. 3. The system according to claim 1, wherein when a second utterer utters a second wakeup call phrase as a second utterance during the first instruction session, the wakeup-call receiver receives the second wakeup call phrase, the caller recognition unit determines whether the second utterer is a registered user by comparing the second wakeup call phrase against the registered wakeup call phrases, and the voice recognition device creates a second instruction session for the second utterer when it is determined that the second utterer is a registered user. 4. The system according to claim 1, wherein the receiver further comprises an instruction receiver that receives a first instruction phrase uttered by the first utterer as a first voice instruction. 5. The system according to claim 4, wherein the instruction receiver transforms the first instruction phrase into a sound wave signal. 6. The system according to claim 4, wherein the storage unit further comprises an instruction storage unit in which registered instruction phrase of each of the registered users are stored. 7. The system according to claim 6, wherein the determination unit further comprises an instruction phrase recognition unit that compares the first instruction phrase against the registered instruction phrases of the registered users and determines whether the first instruction phrase is a general instruction or a special instruction. 8. The system according to claim 7, wherein when the first instruction phrase is determined to be a general instruction, the execution unit generates a general instruction signal for executing the general instruction. 9. The system according to claim 7, wherein the determination unit further comprises a caller-utterer recognition unit, and
wherein when the first instruction phrase is a special instruction, the caller-utterer recognition unit compares the first instruction phrase against the registered instruction phrases to determine whether the first utterer is a registered user. 10. The system according to claim 9, wherein when it is determined that the first utterer is a registered user, the execution unit generates a special instruction signal for executing the special instruction. 11. The system according to claim 4, wherein when a third utterer utters a second instruction phrase as a second voice instruction, in a case where the second instruction phrase is a general instruction, the execution unit generates a general instruction signal for executing the general instruction. 12. The system according to claim 4, wherein when a third utterer utters a second instruction phrase as a second voice instruction, in a case where the second instruction phrase is a special instruction, the determination unit determines whether the first utterer and the third utterer are the same person, and
wherein when it is determined that the third utterer and the first utterer are not the same person, the first instruction session is closed. 13. The system according to claim 1, wherein when it is determined that the first utterer is not a registered user, the caller recognition unit compares the first wakeup call phrase of the first utterer against the registered wakeup call phrases of the respective users. 14. The system according to claim 13, wherein an i-vector between the first wakeup call phrase of the first utterer and each of the registered wakeup call phrases of the respective users is calculated, and wherein when the i-vector indicating similarity has a value of 0.8 or more, the first utterer is determined to be a user belong to the group and the first utterer is asked to start a user registration process. | 3,600 |
347,113 | 16,805,583 | 3,629 | Embodiments of the invention provide swallowable devices, preparations, and methods for delivering drugs and other therapeutic agents within the GI tract. Particular embodiments provide a swallowable device such as a capsule for delivering drugs or other therapeutic agents (TA) into a wall of the GI tract such as the stomach or small intestine. The swallowable device comprises a sensor, a combustible propellant (CP) and a therapeutic agent preparation (TAP) comprising at least one TA. The sensor triggers the CP to ignite and propel the TAP into the wall of the GI tract in response to an external condition or change in external condition. Embodiments of the invention are particularly useful for orally delivering drugs or other TAs which are degraded within the GI tract and require parenteral injection. | 1. A swallowable device for delivering a solid dosage therapeutic agent preparation to a patient, the device comprising:
a swallowable capsule having a capsule wall; a solid dosage therapeutic agent preparation held inside the capsule; a propulsive driver within the capsule configured to advance the solid dosage therapeutic agent preparation through the capsule wall and into a wall of the gastrointestinal (GI) tract, wherein the propulsive driver comprises a combustible propellant and an igniter; and wherein the igniter is configured to ignite the combustible propellant in response to a condition external to the capsule. 2. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to a change in any one or more external conditions selected from a group consisting of pH, pressure, and proximity to a wall of the GI tract. 3. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to an external condition selected from a group consisting of moisture, temperature, pressure and pH. 4. The device of claim 1, further comprising a sensor embedded in the capsule wall and coupled to the igniter, wherein the sensor senses the value of the external condition and causes the igniter to ignite the combustible propellant when a threshold value of the external condition is reached. 5. The device of claim 4, wherein sensor is electronic and produces an electrical signal representative of the sensed condition. 6. The device of claim 5, wherein igniter comprises a trigger circuit that receives the signal representative of the sensed condition from the sensor and that generates an ignition current and delivers the ignition current to the combustible propellant. 7. The device of claim 6, wherein the trigger circuit includes a battery and a capacitor, wherein the battery charges the capacitor and the capacitor discharges the charge into the propellant. 8. The device of claim 7, wherein the trigger circuit further includes wire filaments embedded in the propellant, wherein the wire filaments produce heat sufficient to ignite the propellant as the current is discharged from the capacitor therethrough. 9. The device of claim 8, wherein the propellant comprises nitrocellulose. 10. The device of claim 1, wherein the propulsive driver comprises a piston and a cylinder, wherein the combustible propellant is at a bottom of the cylinder beneath the piston and the solid dosage therapeutic agent preparation is on an upper surface of the piston. 11. The device of claim 10, wherein the wherein the propellant comprises a layer of nitrocellulose formed along the bottom of the cylinder. 12. The device of claim 1, wherein the layer comprises from 0.1 gm to 0.5 gm of nitrocellulose. 13. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises an active agent compressed with at least one of an excipient or a binder into an elongate member having a tapered, sharpened, or honed tip. 14. The device of claim 1, wherein the swallowable capsule wall comprises a cylindrical shell. 15. The device of claim 1, wherein at least a portion of the capsule wall is degradable in a patient's gastrointestinal tract. 16. The device of claim 15, wherein at least a portion of the capsule wall is degradable in a patient's intestinal tract. 17. The device of claim 16, wherein the at least a portion of the capsule wall degrades at a pH equal to or greater than about 6.5. 18. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises a first solid dosage therapeutic agent preparation and a second solid dosage therapeutic agent preparation; the device further comprising:
a second propulsive driver configured to drive the second solid dosage therapeutic agent preparation in a direction different from the first solid dosage therapeutic agent preparation. 19. The device of claim 18, wherein the propulsive driver and second propulsive driver are configured to drive the first solid dosage therapeutic agent preparation and second solid dosage therapeutic agent preparation in at least two diametrically opposed directions. 20. The device of claim 1, wherein the sensor comprises a mechanical or fluidic sensor element on an external region of the swallowable capsule that changes state in response to a change in the external condition. 21. The device of claim 20, wherein the igniter comprises mechanical or fluidic igniter element that responds to a change of state of the mechanical or fluidic sensor and mechanically generates energy to ignite the combustible propellant. 22. A method for delivering of a therapeutic agent into a wall of a patient's intestinal tract, the method comprising:
providing a swallowable capsule having the therapeutic agent preparation held therein; wherein the patient ingests the swallowable capsule; wherein the capsule passes through an initial portion of the patient's gastrointestinal (GI) tract while maintaining therapeutic agent preparation therein; wherein a combustible propellant within the capsule is ignited in response to an external condition within the GI tract; and wherein the ignited propellant injects the therapeutic agent from the capsule into a wall of the GI tract. 23-34. (canceled) 35. A swallowable device for delivering a therapeutic agent preparation into an antral wall of a patient's stomach, the device comprising:
a capsule sized to pass through the patient's gastrointestinal tract, the capsule having a wall including opposed side portions and opposed end portions, the capsule having an elongated shape configured to longitudinally orient within the stomach at the antral wall; a therapeutic preparation in the capsule, the preparation comprising a therapeutic agent and shaped as a tissue-penetrating member; a sensor disposed in a side wall portion of the capsule wall, the sensor configured to sense a condition external to the capsule and produce an output; and an ejector operatively coupled to the tissue-penetrating member and responsive to the output from the sensor, the ejector configured to trigger combustion of a propellant to eject the tissue-penetrating member through the capsule into the antral wall. 36. The swallowable device of claim 35, wherein the capsule is configured to longitudinally orient within the stomach during a peristaltic contraction of the stomach such that a side portion of the capsule wall is adjacent a wall of the antrum, and wherein the sensor is configured to generate an electrical output in response to sensing an external condition corresponding to a peristaltic contraction of the stomach, the device further comprising:
a logic circuit configured to analyze the electrical output from the sensor and generate a trigger signal when a change in the external condition is detected. | Embodiments of the invention provide swallowable devices, preparations, and methods for delivering drugs and other therapeutic agents within the GI tract. Particular embodiments provide a swallowable device such as a capsule for delivering drugs or other therapeutic agents (TA) into a wall of the GI tract such as the stomach or small intestine. The swallowable device comprises a sensor, a combustible propellant (CP) and a therapeutic agent preparation (TAP) comprising at least one TA. The sensor triggers the CP to ignite and propel the TAP into the wall of the GI tract in response to an external condition or change in external condition. Embodiments of the invention are particularly useful for orally delivering drugs or other TAs which are degraded within the GI tract and require parenteral injection.1. A swallowable device for delivering a solid dosage therapeutic agent preparation to a patient, the device comprising:
a swallowable capsule having a capsule wall; a solid dosage therapeutic agent preparation held inside the capsule; a propulsive driver within the capsule configured to advance the solid dosage therapeutic agent preparation through the capsule wall and into a wall of the gastrointestinal (GI) tract, wherein the propulsive driver comprises a combustible propellant and an igniter; and wherein the igniter is configured to ignite the combustible propellant in response to a condition external to the capsule. 2. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to a change in any one or more external conditions selected from a group consisting of pH, pressure, and proximity to a wall of the GI tract. 3. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to an external condition selected from a group consisting of moisture, temperature, pressure and pH. 4. The device of claim 1, further comprising a sensor embedded in the capsule wall and coupled to the igniter, wherein the sensor senses the value of the external condition and causes the igniter to ignite the combustible propellant when a threshold value of the external condition is reached. 5. The device of claim 4, wherein sensor is electronic and produces an electrical signal representative of the sensed condition. 6. The device of claim 5, wherein igniter comprises a trigger circuit that receives the signal representative of the sensed condition from the sensor and that generates an ignition current and delivers the ignition current to the combustible propellant. 7. The device of claim 6, wherein the trigger circuit includes a battery and a capacitor, wherein the battery charges the capacitor and the capacitor discharges the charge into the propellant. 8. The device of claim 7, wherein the trigger circuit further includes wire filaments embedded in the propellant, wherein the wire filaments produce heat sufficient to ignite the propellant as the current is discharged from the capacitor therethrough. 9. The device of claim 8, wherein the propellant comprises nitrocellulose. 10. The device of claim 1, wherein the propulsive driver comprises a piston and a cylinder, wherein the combustible propellant is at a bottom of the cylinder beneath the piston and the solid dosage therapeutic agent preparation is on an upper surface of the piston. 11. The device of claim 10, wherein the wherein the propellant comprises a layer of nitrocellulose formed along the bottom of the cylinder. 12. The device of claim 1, wherein the layer comprises from 0.1 gm to 0.5 gm of nitrocellulose. 13. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises an active agent compressed with at least one of an excipient or a binder into an elongate member having a tapered, sharpened, or honed tip. 14. The device of claim 1, wherein the swallowable capsule wall comprises a cylindrical shell. 15. The device of claim 1, wherein at least a portion of the capsule wall is degradable in a patient's gastrointestinal tract. 16. The device of claim 15, wherein at least a portion of the capsule wall is degradable in a patient's intestinal tract. 17. The device of claim 16, wherein the at least a portion of the capsule wall degrades at a pH equal to or greater than about 6.5. 18. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises a first solid dosage therapeutic agent preparation and a second solid dosage therapeutic agent preparation; the device further comprising:
a second propulsive driver configured to drive the second solid dosage therapeutic agent preparation in a direction different from the first solid dosage therapeutic agent preparation. 19. The device of claim 18, wherein the propulsive driver and second propulsive driver are configured to drive the first solid dosage therapeutic agent preparation and second solid dosage therapeutic agent preparation in at least two diametrically opposed directions. 20. The device of claim 1, wherein the sensor comprises a mechanical or fluidic sensor element on an external region of the swallowable capsule that changes state in response to a change in the external condition. 21. The device of claim 20, wherein the igniter comprises mechanical or fluidic igniter element that responds to a change of state of the mechanical or fluidic sensor and mechanically generates energy to ignite the combustible propellant. 22. A method for delivering of a therapeutic agent into a wall of a patient's intestinal tract, the method comprising:
providing a swallowable capsule having the therapeutic agent preparation held therein; wherein the patient ingests the swallowable capsule; wherein the capsule passes through an initial portion of the patient's gastrointestinal (GI) tract while maintaining therapeutic agent preparation therein; wherein a combustible propellant within the capsule is ignited in response to an external condition within the GI tract; and wherein the ignited propellant injects the therapeutic agent from the capsule into a wall of the GI tract. 23-34. (canceled) 35. A swallowable device for delivering a therapeutic agent preparation into an antral wall of a patient's stomach, the device comprising:
a capsule sized to pass through the patient's gastrointestinal tract, the capsule having a wall including opposed side portions and opposed end portions, the capsule having an elongated shape configured to longitudinally orient within the stomach at the antral wall; a therapeutic preparation in the capsule, the preparation comprising a therapeutic agent and shaped as a tissue-penetrating member; a sensor disposed in a side wall portion of the capsule wall, the sensor configured to sense a condition external to the capsule and produce an output; and an ejector operatively coupled to the tissue-penetrating member and responsive to the output from the sensor, the ejector configured to trigger combustion of a propellant to eject the tissue-penetrating member through the capsule into the antral wall. 36. The swallowable device of claim 35, wherein the capsule is configured to longitudinally orient within the stomach during a peristaltic contraction of the stomach such that a side portion of the capsule wall is adjacent a wall of the antrum, and wherein the sensor is configured to generate an electrical output in response to sensing an external condition corresponding to a peristaltic contraction of the stomach, the device further comprising:
a logic circuit configured to analyze the electrical output from the sensor and generate a trigger signal when a change in the external condition is detected. | 3,600 |
347,114 | 16,805,604 | 3,629 | Embodiments of the invention provide swallowable devices, preparations, and methods for delivering drugs and other therapeutic agents within the GI tract. Particular embodiments provide a swallowable device such as a capsule for delivering drugs or other therapeutic agents (TA) into a wall of the GI tract such as the stomach or small intestine. The swallowable device comprises a sensor, a combustible propellant (CP) and a therapeutic agent preparation (TAP) comprising at least one TA. The sensor triggers the CP to ignite and propel the TAP into the wall of the GI tract in response to an external condition or change in external condition. Embodiments of the invention are particularly useful for orally delivering drugs or other TAs which are degraded within the GI tract and require parenteral injection. | 1. A swallowable device for delivering a solid dosage therapeutic agent preparation to a patient, the device comprising:
a swallowable capsule having a capsule wall; a solid dosage therapeutic agent preparation held inside the capsule; a propulsive driver within the capsule configured to advance the solid dosage therapeutic agent preparation through the capsule wall and into a wall of the gastrointestinal (GI) tract, wherein the propulsive driver comprises a combustible propellant and an igniter; and wherein the igniter is configured to ignite the combustible propellant in response to a condition external to the capsule. 2. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to a change in any one or more external conditions selected from a group consisting of pH, pressure, and proximity to a wall of the GI tract. 3. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to an external condition selected from a group consisting of moisture, temperature, pressure and pH. 4. The device of claim 1, further comprising a sensor embedded in the capsule wall and coupled to the igniter, wherein the sensor senses the value of the external condition and causes the igniter to ignite the combustible propellant when a threshold value of the external condition is reached. 5. The device of claim 4, wherein sensor is electronic and produces an electrical signal representative of the sensed condition. 6. The device of claim 5, wherein igniter comprises a trigger circuit that receives the signal representative of the sensed condition from the sensor and that generates an ignition current and delivers the ignition current to the combustible propellant. 7. The device of claim 6, wherein the trigger circuit includes a battery and a capacitor, wherein the battery charges the capacitor and the capacitor discharges the charge into the propellant. 8. The device of claim 7, wherein the trigger circuit further includes wire filaments embedded in the propellant, wherein the wire filaments produce heat sufficient to ignite the propellant as the current is discharged from the capacitor therethrough. 9. The device of claim 8, wherein the propellant comprises nitrocellulose. 10. The device of claim 1, wherein the propulsive driver comprises a piston and a cylinder, wherein the combustible propellant is at a bottom of the cylinder beneath the piston and the solid dosage therapeutic agent preparation is on an upper surface of the piston. 11. The device of claim 10, wherein the wherein the propellant comprises a layer of nitrocellulose formed along the bottom of the cylinder. 12. The device of claim 1, wherein the layer comprises from 0.1 gm to 0.5 gm of nitrocellulose. 13. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises an active agent compressed with at least one of an excipient or a binder into an elongate member having a tapered, sharpened, or honed tip. 14. The device of claim 1, wherein the swallowable capsule wall comprises a cylindrical shell. 15. The device of claim 1, wherein at least a portion of the capsule wall is degradable in a patient's gastrointestinal tract. 16. The device of claim 15, wherein at least a portion of the capsule wall is degradable in a patient's intestinal tract. 17. The device of claim 16, wherein the at least a portion of the capsule wall degrades at a pH equal to or greater than about 6.5. 18. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises a first solid dosage therapeutic agent preparation and a second solid dosage therapeutic agent preparation; the device further comprising:
a second propulsive driver configured to drive the second solid dosage therapeutic agent preparation in a direction different from the first solid dosage therapeutic agent preparation. 19. The device of claim 18, wherein the propulsive driver and second propulsive driver are configured to drive the first solid dosage therapeutic agent preparation and second solid dosage therapeutic agent preparation in at least two diametrically opposed directions. 20. The device of claim 1, wherein the sensor comprises a mechanical or fluidic sensor element on an external region of the swallowable capsule that changes state in response to a change in the external condition. 21. The device of claim 20, wherein the igniter comprises mechanical or fluidic igniter element that responds to a change of state of the mechanical or fluidic sensor and mechanically generates energy to ignite the combustible propellant. 22. A method for delivering of a therapeutic agent into a wall of a patient's intestinal tract, the method comprising:
providing a swallowable capsule having the therapeutic agent preparation held therein; wherein the patient ingests the swallowable capsule; wherein the capsule passes through an initial portion of the patient's gastrointestinal (GI) tract while maintaining therapeutic agent preparation therein; wherein a combustible propellant within the capsule is ignited in response to an external condition within the GI tract; and wherein the ignited propellant injects the therapeutic agent from the capsule into a wall of the GI tract. 23-34. (canceled) 35. A swallowable device for delivering a therapeutic agent preparation into an antral wall of a patient's stomach, the device comprising:
a capsule sized to pass through the patient's gastrointestinal tract, the capsule having a wall including opposed side portions and opposed end portions, the capsule having an elongated shape configured to longitudinally orient within the stomach at the antral wall; a therapeutic preparation in the capsule, the preparation comprising a therapeutic agent and shaped as a tissue-penetrating member; a sensor disposed in a side wall portion of the capsule wall, the sensor configured to sense a condition external to the capsule and produce an output; and an ejector operatively coupled to the tissue-penetrating member and responsive to the output from the sensor, the ejector configured to trigger combustion of a propellant to eject the tissue-penetrating member through the capsule into the antral wall. 36. The swallowable device of claim 35, wherein the capsule is configured to longitudinally orient within the stomach during a peristaltic contraction of the stomach such that a side portion of the capsule wall is adjacent a wall of the antrum, and wherein the sensor is configured to generate an electrical output in response to sensing an external condition corresponding to a peristaltic contraction of the stomach, the device further comprising:
a logic circuit configured to analyze the electrical output from the sensor and generate a trigger signal when a change in the external condition is detected. | Embodiments of the invention provide swallowable devices, preparations, and methods for delivering drugs and other therapeutic agents within the GI tract. Particular embodiments provide a swallowable device such as a capsule for delivering drugs or other therapeutic agents (TA) into a wall of the GI tract such as the stomach or small intestine. The swallowable device comprises a sensor, a combustible propellant (CP) and a therapeutic agent preparation (TAP) comprising at least one TA. The sensor triggers the CP to ignite and propel the TAP into the wall of the GI tract in response to an external condition or change in external condition. Embodiments of the invention are particularly useful for orally delivering drugs or other TAs which are degraded within the GI tract and require parenteral injection.1. A swallowable device for delivering a solid dosage therapeutic agent preparation to a patient, the device comprising:
a swallowable capsule having a capsule wall; a solid dosage therapeutic agent preparation held inside the capsule; a propulsive driver within the capsule configured to advance the solid dosage therapeutic agent preparation through the capsule wall and into a wall of the gastrointestinal (GI) tract, wherein the propulsive driver comprises a combustible propellant and an igniter; and wherein the igniter is configured to ignite the combustible propellant in response to a condition external to the capsule. 2. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to a change in any one or more external conditions selected from a group consisting of pH, pressure, and proximity to a wall of the GI tract. 3. The device of claim 1, wherein the igniter is configured to ignite the combustible propellant in response to an external condition selected from a group consisting of moisture, temperature, pressure and pH. 4. The device of claim 1, further comprising a sensor embedded in the capsule wall and coupled to the igniter, wherein the sensor senses the value of the external condition and causes the igniter to ignite the combustible propellant when a threshold value of the external condition is reached. 5. The device of claim 4, wherein sensor is electronic and produces an electrical signal representative of the sensed condition. 6. The device of claim 5, wherein igniter comprises a trigger circuit that receives the signal representative of the sensed condition from the sensor and that generates an ignition current and delivers the ignition current to the combustible propellant. 7. The device of claim 6, wherein the trigger circuit includes a battery and a capacitor, wherein the battery charges the capacitor and the capacitor discharges the charge into the propellant. 8. The device of claim 7, wherein the trigger circuit further includes wire filaments embedded in the propellant, wherein the wire filaments produce heat sufficient to ignite the propellant as the current is discharged from the capacitor therethrough. 9. The device of claim 8, wherein the propellant comprises nitrocellulose. 10. The device of claim 1, wherein the propulsive driver comprises a piston and a cylinder, wherein the combustible propellant is at a bottom of the cylinder beneath the piston and the solid dosage therapeutic agent preparation is on an upper surface of the piston. 11. The device of claim 10, wherein the wherein the propellant comprises a layer of nitrocellulose formed along the bottom of the cylinder. 12. The device of claim 1, wherein the layer comprises from 0.1 gm to 0.5 gm of nitrocellulose. 13. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises an active agent compressed with at least one of an excipient or a binder into an elongate member having a tapered, sharpened, or honed tip. 14. The device of claim 1, wherein the swallowable capsule wall comprises a cylindrical shell. 15. The device of claim 1, wherein at least a portion of the capsule wall is degradable in a patient's gastrointestinal tract. 16. The device of claim 15, wherein at least a portion of the capsule wall is degradable in a patient's intestinal tract. 17. The device of claim 16, wherein the at least a portion of the capsule wall degrades at a pH equal to or greater than about 6.5. 18. The device of claim 1, wherein the solid dosage therapeutic agent preparation comprises a first solid dosage therapeutic agent preparation and a second solid dosage therapeutic agent preparation; the device further comprising:
a second propulsive driver configured to drive the second solid dosage therapeutic agent preparation in a direction different from the first solid dosage therapeutic agent preparation. 19. The device of claim 18, wherein the propulsive driver and second propulsive driver are configured to drive the first solid dosage therapeutic agent preparation and second solid dosage therapeutic agent preparation in at least two diametrically opposed directions. 20. The device of claim 1, wherein the sensor comprises a mechanical or fluidic sensor element on an external region of the swallowable capsule that changes state in response to a change in the external condition. 21. The device of claim 20, wherein the igniter comprises mechanical or fluidic igniter element that responds to a change of state of the mechanical or fluidic sensor and mechanically generates energy to ignite the combustible propellant. 22. A method for delivering of a therapeutic agent into a wall of a patient's intestinal tract, the method comprising:
providing a swallowable capsule having the therapeutic agent preparation held therein; wherein the patient ingests the swallowable capsule; wherein the capsule passes through an initial portion of the patient's gastrointestinal (GI) tract while maintaining therapeutic agent preparation therein; wherein a combustible propellant within the capsule is ignited in response to an external condition within the GI tract; and wherein the ignited propellant injects the therapeutic agent from the capsule into a wall of the GI tract. 23-34. (canceled) 35. A swallowable device for delivering a therapeutic agent preparation into an antral wall of a patient's stomach, the device comprising:
a capsule sized to pass through the patient's gastrointestinal tract, the capsule having a wall including opposed side portions and opposed end portions, the capsule having an elongated shape configured to longitudinally orient within the stomach at the antral wall; a therapeutic preparation in the capsule, the preparation comprising a therapeutic agent and shaped as a tissue-penetrating member; a sensor disposed in a side wall portion of the capsule wall, the sensor configured to sense a condition external to the capsule and produce an output; and an ejector operatively coupled to the tissue-penetrating member and responsive to the output from the sensor, the ejector configured to trigger combustion of a propellant to eject the tissue-penetrating member through the capsule into the antral wall. 36. The swallowable device of claim 35, wherein the capsule is configured to longitudinally orient within the stomach during a peristaltic contraction of the stomach such that a side portion of the capsule wall is adjacent a wall of the antrum, and wherein the sensor is configured to generate an electrical output in response to sensing an external condition corresponding to a peristaltic contraction of the stomach, the device further comprising:
a logic circuit configured to analyze the electrical output from the sensor and generate a trigger signal when a change in the external condition is detected. | 3,600 |
347,115 | 16,805,603 | 3,711 | An archery release aid mount includes an attachment mechanism configured to rigidly attach the archery release aid to a bow. A securing device is configured to receive an archery release aid. The securing device includes a securing device that upon the archery release aid mount receiving the archery release aid, holds the archery release aid securely, and that is configured to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. | 1. An archery release aid mount, comprising:
an attachment mechanism configured to rigidly attach the archery release aid mount to a bow or to rigidly integrate the archery release aid mount as part of the bow; and a mounting mechanism configured to receive an archery release aid, the mounting mechanism including:
a securing device that upon the archery release aid mount receiving the archery release aid, holds the archery release aid securely, and that is configured to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 2. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a stabilizer of the bow. 3. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a sight of the bow. 4. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a riser structure of the bow. 5. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a quiver of the bow or is integrated into the design of the quiver of the bow. 6. An archery release aid mount as in claim 1, wherein the attachment mechanism is configured to be attached to the bow using auxiliary or accessory mounting holes of the bow. 7. An archery release aid mount as in claim 1, wherein the attachment mechanism includes clamps that clamp to a cross bar of a removable sight dovetail sight. 8. An archery release aid mount as in claim 1, wherein the attachment mechanism includes clamps that clamp to quiver support shafts of the bow. 9. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a sight base that attaches a sight to the bow. 10. An archery release aid mount as in claim 1, wherein the attachment mechanism includes:
support rods; a plurality of clam shell clamps that clamp to the support rods; and clamps that clamp each clam shell clamp in the plurality of clam shell clamps to a quiver support shaft of the bow. 11. An archery release aid mount as in claim 1, wherein the attachment mechanism includes:
support rods; a plurality of clam shell clamps that clamp to the support rods; and clamps that clamp each clam shell clamp in the plurality of clam shell clamps to a quiver support shaft of the bow; wherein positioning of the clam shell clams with respect to the support rods allows variance of a distance from the bow the release aid is mounted. 12. An archery release aid mount as in claim 1, wherein the securing device includes a thin cylinder positioned to allow the archery release aid to attach to the cylinder in a same way that the archery release aid is configured to attach to a bow string. 13. An archery release aid mount as in claim 1, wherein the securing device includes a spring loaded tab, 14. An archery release aid mount as in claim 1, wherein the securing device includes an open ended clamp that includes jaws that hold the archery release aid securely, the jaws being configured to allow the user to pull the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 15. An archery release aid mount as in claim 1, wherein the securing device includes a flexible flange with a riser that locks into an indentation within the archery release aid to hold the archery release aid securely, the flexible flange being configured to allow the user to separate the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 16. An archery release aid mount as in claim 1, wherein the securing device includes one or more magnets that are configured to hold the archery release aid securely and to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 17. An archery release aid mount as in claim 1, wherein the securing device includes one or more protrusions configured to fit within one or more grooves in the archery release aid. 18. An archery release aid mount as in claim 1, wherein the securing device includes one or more protrusions configured to fit within one or more grooves in the archery release aid, each protrusion including a spherical protrusion configured to align with an indentation in one of the one or more grooves. 19. An archery release aid mount as in claim 1, wherein the securing device includes a lever that when in a first position holds the archery release aid securely and that when rotated to a second position to allow removal of the archery release aid from the archery release aid mount. 20. An archery release aid mount as in claim 1, wherein the securing device includes strap that is secured to holds the archery release aid securely and that when is unsecured allows removal of the archery release aid from the archery release aid mount. | An archery release aid mount includes an attachment mechanism configured to rigidly attach the archery release aid to a bow. A securing device is configured to receive an archery release aid. The securing device includes a securing device that upon the archery release aid mount receiving the archery release aid, holds the archery release aid securely, and that is configured to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery.1. An archery release aid mount, comprising:
an attachment mechanism configured to rigidly attach the archery release aid mount to a bow or to rigidly integrate the archery release aid mount as part of the bow; and a mounting mechanism configured to receive an archery release aid, the mounting mechanism including:
a securing device that upon the archery release aid mount receiving the archery release aid, holds the archery release aid securely, and that is configured to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 2. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a stabilizer of the bow. 3. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a sight of the bow. 4. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a riser structure of the bow. 5. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a quiver of the bow or is integrated into the design of the quiver of the bow. 6. An archery release aid mount as in claim 1, wherein the attachment mechanism is configured to be attached to the bow using auxiliary or accessory mounting holes of the bow. 7. An archery release aid mount as in claim 1, wherein the attachment mechanism includes clamps that clamp to a cross bar of a removable sight dovetail sight. 8. An archery release aid mount as in claim 1, wherein the attachment mechanism includes clamps that clamp to quiver support shafts of the bow. 9. An archery release aid mount as in claim 1, wherein the attachment mechanism attaches to a sight base that attaches a sight to the bow. 10. An archery release aid mount as in claim 1, wherein the attachment mechanism includes:
support rods; a plurality of clam shell clamps that clamp to the support rods; and clamps that clamp each clam shell clamp in the plurality of clam shell clamps to a quiver support shaft of the bow. 11. An archery release aid mount as in claim 1, wherein the attachment mechanism includes:
support rods; a plurality of clam shell clamps that clamp to the support rods; and clamps that clamp each clam shell clamp in the plurality of clam shell clamps to a quiver support shaft of the bow; wherein positioning of the clam shell clams with respect to the support rods allows variance of a distance from the bow the release aid is mounted. 12. An archery release aid mount as in claim 1, wherein the securing device includes a thin cylinder positioned to allow the archery release aid to attach to the cylinder in a same way that the archery release aid is configured to attach to a bow string. 13. An archery release aid mount as in claim 1, wherein the securing device includes a spring loaded tab, 14. An archery release aid mount as in claim 1, wherein the securing device includes an open ended clamp that includes jaws that hold the archery release aid securely, the jaws being configured to allow the user to pull the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 15. An archery release aid mount as in claim 1, wherein the securing device includes a flexible flange with a riser that locks into an indentation within the archery release aid to hold the archery release aid securely, the flexible flange being configured to allow the user to separate the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 16. An archery release aid mount as in claim 1, wherein the securing device includes one or more magnets that are configured to hold the archery release aid securely and to allow a user to without tools remove the archery release aid from the archery release aid mount when the user wants to use the archery release aid during archery. 17. An archery release aid mount as in claim 1, wherein the securing device includes one or more protrusions configured to fit within one or more grooves in the archery release aid. 18. An archery release aid mount as in claim 1, wherein the securing device includes one or more protrusions configured to fit within one or more grooves in the archery release aid, each protrusion including a spherical protrusion configured to align with an indentation in one of the one or more grooves. 19. An archery release aid mount as in claim 1, wherein the securing device includes a lever that when in a first position holds the archery release aid securely and that when rotated to a second position to allow removal of the archery release aid from the archery release aid mount. 20. An archery release aid mount as in claim 1, wherein the securing device includes strap that is secured to holds the archery release aid securely and that when is unsecured allows removal of the archery release aid from the archery release aid mount. | 3,700 |
347,116 | 16,805,537 | 3,711 | The present disclosure provides systems and methods for inter prediction process in video data coding. One exemplary method comprises: selecting one of a DMVR process and a BDOF process, based on a video bitstream; and inter predicting an image block based on the selected process. The selection can be made either through explicit signaling, or implicit derivation at the decoder side. According to one exemplary method, selecting the one of the DMVR process and the BDOF process can be performed by selecting the one of the DMVR process and the BDOF process based on: a flag signaled at at least one of a coding unit (CU) level and a coding tree unit (CTU) level, or a merge candidate index associated with an extended merge candidate list. | 1. A method implemented by a decoder of video data, the method comprising:
selecting one of a decoder side motion vector refinement (DMVR) process and a bi-directional optical flow (BDOF) process, based on a video bitstream; and inter predicting an image block based on the selected process. 2. The method according to claim 1, wherein selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on one or more flags signaled in the video bitstream. 3. The method according to claim 2, wherein the one or more flags include a flag signaled at a coding tree unit (CTU) level for a CTU including the image block, and the method further comprises:
in response to the flag having a first value, selecting the DMVR process; or in response to the flag having a second value, selecting the BDOF process. 4. The method according to claim 2, wherein the one or more flags include a flag is signaled at a coding unit (CU) level for the image block, and the method further comprises:
in response to the flag having a first value, selecting the DMVR process; or in response to the flag having a second value, selecting the BDOF process. 5. The method according to claim 4, further comprising:
decoding the flag using context-adaptive binary arithmetic coding (CABAC). 6. The method according to claim 2, wherein the one or more flags include a first flag signaled at the CTU level for a CTU including the image block, and the method further comprises:
determining whether the video bitstream includes a second flag signaled at the CU level for the image block, based on a value of the first flag; in response to the video bitstream including the second flag, selecting the one of the DMVR process and the BDOF process based on a value of the second flag; and in response to the video bitstream not including the second flag, selecting the one of the DMVR process and the BDOF process based on a default rule. 7. The method according to claim 1, wherein selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on a merge candidate index signaled in the video bitstream, the merge candidate index pointing to a merge candidate in a merge candidate list. 8. The method according to claim 7, wherein:
the merge candidate list is an extended merge candidate list that comprises a first merge candidate and a second merge candidate, the first merge candidate being same as the second merge candidate and having a smaller merge candidate index than the second merge candidate; and the selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on whether the merge candidate index signaled in the video bitstream corresponds to the first or the second merge candidate. 9. The method according to claim 8, further comprising:
determining whether the first merge candidate corresponds to the DMVR process and the BDOF process, based on at least one of a shape or a size of the image block 10. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on at least one of the following: a distortion of two reference blocks of the image block, a motion vector of the image block, a size of the image block, a shape of the image block, a motion vector associated with a neighboring block of the image block, or signal statistics. 11. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the distortion of the two reference blocks of the image block is smaller than a pre-defined threshold; and in response to the distortion of the two reference blocks being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 12. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether two motion vectors for bi-predicting the image block are symmetric; and in response to the two motion vectors being symmetric, selecting the one of the DMVR process and the BDOF process. 13. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether a magnitude of the motion vector of the image block is smaller than a pre-defined threshold; and in response to the magnitude of the motion vector being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 14. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the size of the image block is smaller than a pre-defined threshold; and in response to the size of the image block being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 15. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining a ratio of max(width, height) and min(width, height) associated with the image block; and in response to the ratio being higher than a pre-defined threshold, selecting the BDOF process. 16. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the motion vector of the neighboring block is substantially similar to a motion vector of the image block; and in response to the motion vector of the neighboring block being substantially similar to the motion vector of the image block, selecting the one of the DMVR process and the BDOF process. 17. The method according to claim 10, wherein the signal statistics includes at least one of the following:
statistics associated with a previously decoded block in a frame; statistics associated with a previously decoded CTU; statistics associated with a collocated CTU in a reference frame; or statistics associated with a neighboring CTU. 18. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining a process applied for the neighboring block, the process being the BDOF process or the DMVR process; and selecting the process applied for the neighboring block as the process to be applied for the image block. 19. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process comprises:
splitting the image block into a plurality of sub-blocks; and selecting one of the DMVR process and the BDOF process for each of the plurality of sub-blocks. 20. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether a size of the image block is larger than or equal to a pre-defined threshold; and in response to the size of the image block being determined to be larger than or equal to the pre-defined threshold, selecting the one of the DMVR process and the BDOF process for the image block based on a flag signaled at a CU level for the image block. 21. The method according to claim 20, further comprising:
in response to the size of the image block being determined to be smaller than the pre-defined threshold, selecting the BDOF process for the image block. 22. The method according to claim 20, further comprising:
in response to the size of the image block being determined to be smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process for the image block based on a shape of the image block. 23. The method according to claim 20, wherein the size of the image block is determined based a number of luma samples within the image block. 24. The method according to claim 20, wherein the pre-defined threshold is determined based on:
information signaled at at least one of: the CTU level, a tile level, or a sequence parameter set (SPS) level; or information associated with sequence resolution. 25. A method for processing video data, comprising:
determining whether a triangle partition mode is applied to inter prediction of an image block; and in response to the triangle partition mode being determined to be applied to the inter prediction of the image block, disabling a sub-block transform mode with respect to the image block. | The present disclosure provides systems and methods for inter prediction process in video data coding. One exemplary method comprises: selecting one of a DMVR process and a BDOF process, based on a video bitstream; and inter predicting an image block based on the selected process. The selection can be made either through explicit signaling, or implicit derivation at the decoder side. According to one exemplary method, selecting the one of the DMVR process and the BDOF process can be performed by selecting the one of the DMVR process and the BDOF process based on: a flag signaled at at least one of a coding unit (CU) level and a coding tree unit (CTU) level, or a merge candidate index associated with an extended merge candidate list.1. A method implemented by a decoder of video data, the method comprising:
selecting one of a decoder side motion vector refinement (DMVR) process and a bi-directional optical flow (BDOF) process, based on a video bitstream; and inter predicting an image block based on the selected process. 2. The method according to claim 1, wherein selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on one or more flags signaled in the video bitstream. 3. The method according to claim 2, wherein the one or more flags include a flag signaled at a coding tree unit (CTU) level for a CTU including the image block, and the method further comprises:
in response to the flag having a first value, selecting the DMVR process; or in response to the flag having a second value, selecting the BDOF process. 4. The method according to claim 2, wherein the one or more flags include a flag is signaled at a coding unit (CU) level for the image block, and the method further comprises:
in response to the flag having a first value, selecting the DMVR process; or in response to the flag having a second value, selecting the BDOF process. 5. The method according to claim 4, further comprising:
decoding the flag using context-adaptive binary arithmetic coding (CABAC). 6. The method according to claim 2, wherein the one or more flags include a first flag signaled at the CTU level for a CTU including the image block, and the method further comprises:
determining whether the video bitstream includes a second flag signaled at the CU level for the image block, based on a value of the first flag; in response to the video bitstream including the second flag, selecting the one of the DMVR process and the BDOF process based on a value of the second flag; and in response to the video bitstream not including the second flag, selecting the one of the DMVR process and the BDOF process based on a default rule. 7. The method according to claim 1, wherein selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on a merge candidate index signaled in the video bitstream, the merge candidate index pointing to a merge candidate in a merge candidate list. 8. The method according to claim 7, wherein:
the merge candidate list is an extended merge candidate list that comprises a first merge candidate and a second merge candidate, the first merge candidate being same as the second merge candidate and having a smaller merge candidate index than the second merge candidate; and the selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on whether the merge candidate index signaled in the video bitstream corresponds to the first or the second merge candidate. 9. The method according to claim 8, further comprising:
determining whether the first merge candidate corresponds to the DMVR process and the BDOF process, based on at least one of a shape or a size of the image block 10. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process comprises:
selecting the one of the DMVR process and the BDOF process based on at least one of the following: a distortion of two reference blocks of the image block, a motion vector of the image block, a size of the image block, a shape of the image block, a motion vector associated with a neighboring block of the image block, or signal statistics. 11. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the distortion of the two reference blocks of the image block is smaller than a pre-defined threshold; and in response to the distortion of the two reference blocks being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 12. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether two motion vectors for bi-predicting the image block are symmetric; and in response to the two motion vectors being symmetric, selecting the one of the DMVR process and the BDOF process. 13. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether a magnitude of the motion vector of the image block is smaller than a pre-defined threshold; and in response to the magnitude of the motion vector being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 14. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the size of the image block is smaller than a pre-defined threshold; and in response to the size of the image block being smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process. 15. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining a ratio of max(width, height) and min(width, height) associated with the image block; and in response to the ratio being higher than a pre-defined threshold, selecting the BDOF process. 16. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether the motion vector of the neighboring block is substantially similar to a motion vector of the image block; and in response to the motion vector of the neighboring block being substantially similar to the motion vector of the image block, selecting the one of the DMVR process and the BDOF process. 17. The method according to claim 10, wherein the signal statistics includes at least one of the following:
statistics associated with a previously decoded block in a frame; statistics associated with a previously decoded CTU; statistics associated with a collocated CTU in a reference frame; or statistics associated with a neighboring CTU. 18. The method according to claim 10, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining a process applied for the neighboring block, the process being the BDOF process or the DMVR process; and selecting the process applied for the neighboring block as the process to be applied for the image block. 19. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process comprises:
splitting the image block into a plurality of sub-blocks; and selecting one of the DMVR process and the BDOF process for each of the plurality of sub-blocks. 20. The method according to claim 1, wherein the selecting the one of the DMVR process and the BDOF process further comprises:
determining whether a size of the image block is larger than or equal to a pre-defined threshold; and in response to the size of the image block being determined to be larger than or equal to the pre-defined threshold, selecting the one of the DMVR process and the BDOF process for the image block based on a flag signaled at a CU level for the image block. 21. The method according to claim 20, further comprising:
in response to the size of the image block being determined to be smaller than the pre-defined threshold, selecting the BDOF process for the image block. 22. The method according to claim 20, further comprising:
in response to the size of the image block being determined to be smaller than the pre-defined threshold, selecting the one of the DMVR process and the BDOF process for the image block based on a shape of the image block. 23. The method according to claim 20, wherein the size of the image block is determined based a number of luma samples within the image block. 24. The method according to claim 20, wherein the pre-defined threshold is determined based on:
information signaled at at least one of: the CTU level, a tile level, or a sequence parameter set (SPS) level; or information associated with sequence resolution. 25. A method for processing video data, comprising:
determining whether a triangle partition mode is applied to inter prediction of an image block; and in response to the triangle partition mode being determined to be applied to the inter prediction of the image block, disabling a sub-block transform mode with respect to the image block. | 3,700 |
347,117 | 16,805,609 | 3,675 | A rotary seal assembly includes a viscoelastically deformable support ring having a high-pressure side first support leg connected by a back portion to a low-pressure side second support leg. The legs laterally delimit an annular groove of the support ring open toward the sealing surface retaining a sealing ring. A rubber-elastically deformable pre-loading element between the seal retaining structure and the support ring pre-loads the sealing ring against the sealing surface via the support ring. A pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed in the pre-loading direction proportionally to the operating pressure such that the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof. | 1. A rotary seal assembly, comprising:
a first machine part and a second machine part which are arranged at a distance from each other and so as to be rotatable relative to each other about a rotational axis, while forming a sealing gap, wherein one of the two machine parts has a sealing surface and the respective other machine part has a seal retaining structure; a rotary seal for sealing a high-pressure side from a low-pressure side of the sealing gap; a support ring made of a viscoelastically deformable material, which support ring has a first support leg arranged on the high-pressure side and a second support leg arranged on the low-pressure side, wherein the two support legs are connected to each other by a back portion, and the two support legs laterally delimit an annular groove of the support ring, which annular groove is open toward the sealing surface; a sealing ring arranged in a retained manner in the annular groove of the support ring and engaging interlockingly in the axial and radial direction in the annular groove of the support ring, wherein the sealing ring has a spherically designed dynamic sealing section which abuts against the sealing surface in a dynamically sealing manner, wherein the sealing ring has a lower rigidity than the support ring; and a rubber-elastically deformable pre-loading element arranged between the seal retaining structure of the one machine part and the support ring in order to pre-load the sealing ring against the sealing surface via the support ring in a pre-loading direction oriented orthogonally to the sealing surface, wherein the material of the pre-loading element is isovolumetrically deformable; wherein the two support legs of the support ring are each arranged at a distance from the sealing surface in the non-pressurized operating state of the rotary seal, and wherein, in the case of a pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed proportionally to the operating pressure wherein the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof, until the support ring contacts the sealing surface continuously with its low-pressure-side support leg when a maximum operating pressure is reached or exceeded. 2. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the sealing ring. 3. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the support ring. 4. The rotary seal assembly according to claim 1, wherein the sealing ring is retained without play in the annular groove of the support ring. 5. The rotary seal assembly according to claim 1, wherein at least one of the two support legs of the support ring are chamfered on the outer side. 6. The rotary seal assembly according to claim 1, wherein the support ring and/or the sealing ring and/or the pre-loading element comprises a plastic material or consists of a plastic material. 7. The rotary seal assembly according claim 1, wherein the support ring and the sealing ring are designed jointly as a multi-component injection-molded part. 8. The rotary seal assembly according to claim 1, wherein the support surface is arranged on and formed by the machine part having the seal retaining structure. 9. The rotary seal assembly according to claim 1, wherein the support surface is a shoulder or a flank of the seal retaining structure. 10. The rotary seal assembly according to claim 1, wherein the sealing ring has a design height which is less than half of the width of the annular groove. 11. The rotary seal assembly according to claim 1, wherein the pre-loading element can be pressure-activated in a bidirectional manner. 12. The rotary seal assembly according to claim 1, wherein a back surface of the back portion of the support ring in the non-pressurized operating state is a cylindrical lateral surface in the case of a rotary seal designed as a radial seal, and in the case of an axially sealing rotary seal it is an annular surface. 13. The rotary seal assembly according to claim 1, wherein both of the two support legs of the support ring are chamfered on the outer side. | A rotary seal assembly includes a viscoelastically deformable support ring having a high-pressure side first support leg connected by a back portion to a low-pressure side second support leg. The legs laterally delimit an annular groove of the support ring open toward the sealing surface retaining a sealing ring. A rubber-elastically deformable pre-loading element between the seal retaining structure and the support ring pre-loads the sealing ring against the sealing surface via the support ring. A pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed in the pre-loading direction proportionally to the operating pressure such that the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof.1. A rotary seal assembly, comprising:
a first machine part and a second machine part which are arranged at a distance from each other and so as to be rotatable relative to each other about a rotational axis, while forming a sealing gap, wherein one of the two machine parts has a sealing surface and the respective other machine part has a seal retaining structure; a rotary seal for sealing a high-pressure side from a low-pressure side of the sealing gap; a support ring made of a viscoelastically deformable material, which support ring has a first support leg arranged on the high-pressure side and a second support leg arranged on the low-pressure side, wherein the two support legs are connected to each other by a back portion, and the two support legs laterally delimit an annular groove of the support ring, which annular groove is open toward the sealing surface; a sealing ring arranged in a retained manner in the annular groove of the support ring and engaging interlockingly in the axial and radial direction in the annular groove of the support ring, wherein the sealing ring has a spherically designed dynamic sealing section which abuts against the sealing surface in a dynamically sealing manner, wherein the sealing ring has a lower rigidity than the support ring; and a rubber-elastically deformable pre-loading element arranged between the seal retaining structure of the one machine part and the support ring in order to pre-load the sealing ring against the sealing surface via the support ring in a pre-loading direction oriented orthogonally to the sealing surface, wherein the material of the pre-loading element is isovolumetrically deformable; wherein the two support legs of the support ring are each arranged at a distance from the sealing surface in the non-pressurized operating state of the rotary seal, and wherein, in the case of a pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed proportionally to the operating pressure wherein the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof, until the support ring contacts the sealing surface continuously with its low-pressure-side support leg when a maximum operating pressure is reached or exceeded. 2. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the sealing ring. 3. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the support ring. 4. The rotary seal assembly according to claim 1, wherein the sealing ring is retained without play in the annular groove of the support ring. 5. The rotary seal assembly according to claim 1, wherein at least one of the two support legs of the support ring are chamfered on the outer side. 6. The rotary seal assembly according to claim 1, wherein the support ring and/or the sealing ring and/or the pre-loading element comprises a plastic material or consists of a plastic material. 7. The rotary seal assembly according claim 1, wherein the support ring and the sealing ring are designed jointly as a multi-component injection-molded part. 8. The rotary seal assembly according to claim 1, wherein the support surface is arranged on and formed by the machine part having the seal retaining structure. 9. The rotary seal assembly according to claim 1, wherein the support surface is a shoulder or a flank of the seal retaining structure. 10. The rotary seal assembly according to claim 1, wherein the sealing ring has a design height which is less than half of the width of the annular groove. 11. The rotary seal assembly according to claim 1, wherein the pre-loading element can be pressure-activated in a bidirectional manner. 12. The rotary seal assembly according to claim 1, wherein a back surface of the back portion of the support ring in the non-pressurized operating state is a cylindrical lateral surface in the case of a rotary seal designed as a radial seal, and in the case of an axially sealing rotary seal it is an annular surface. 13. The rotary seal assembly according to claim 1, wherein both of the two support legs of the support ring are chamfered on the outer side. | 3,600 |
347,118 | 16,805,530 | 3,675 | A rotary seal assembly includes a viscoelastically deformable support ring having a high-pressure side first support leg connected by a back portion to a low-pressure side second support leg. The legs laterally delimit an annular groove of the support ring open toward the sealing surface retaining a sealing ring. A rubber-elastically deformable pre-loading element between the seal retaining structure and the support ring pre-loads the sealing ring against the sealing surface via the support ring. A pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed in the pre-loading direction proportionally to the operating pressure such that the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof. | 1. A rotary seal assembly, comprising:
a first machine part and a second machine part which are arranged at a distance from each other and so as to be rotatable relative to each other about a rotational axis, while forming a sealing gap, wherein one of the two machine parts has a sealing surface and the respective other machine part has a seal retaining structure; a rotary seal for sealing a high-pressure side from a low-pressure side of the sealing gap; a support ring made of a viscoelastically deformable material, which support ring has a first support leg arranged on the high-pressure side and a second support leg arranged on the low-pressure side, wherein the two support legs are connected to each other by a back portion, and the two support legs laterally delimit an annular groove of the support ring, which annular groove is open toward the sealing surface; a sealing ring arranged in a retained manner in the annular groove of the support ring and engaging interlockingly in the axial and radial direction in the annular groove of the support ring, wherein the sealing ring has a spherically designed dynamic sealing section which abuts against the sealing surface in a dynamically sealing manner, wherein the sealing ring has a lower rigidity than the support ring; and a rubber-elastically deformable pre-loading element arranged between the seal retaining structure of the one machine part and the support ring in order to pre-load the sealing ring against the sealing surface via the support ring in a pre-loading direction oriented orthogonally to the sealing surface, wherein the material of the pre-loading element is isovolumetrically deformable; wherein the two support legs of the support ring are each arranged at a distance from the sealing surface in the non-pressurized operating state of the rotary seal, and wherein, in the case of a pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed proportionally to the operating pressure wherein the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof, until the support ring contacts the sealing surface continuously with its low-pressure-side support leg when a maximum operating pressure is reached or exceeded. 2. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the sealing ring. 3. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the support ring. 4. The rotary seal assembly according to claim 1, wherein the sealing ring is retained without play in the annular groove of the support ring. 5. The rotary seal assembly according to claim 1, wherein at least one of the two support legs of the support ring are chamfered on the outer side. 6. The rotary seal assembly according to claim 1, wherein the support ring and/or the sealing ring and/or the pre-loading element comprises a plastic material or consists of a plastic material. 7. The rotary seal assembly according claim 1, wherein the support ring and the sealing ring are designed jointly as a multi-component injection-molded part. 8. The rotary seal assembly according to claim 1, wherein the support surface is arranged on and formed by the machine part having the seal retaining structure. 9. The rotary seal assembly according to claim 1, wherein the support surface is a shoulder or a flank of the seal retaining structure. 10. The rotary seal assembly according to claim 1, wherein the sealing ring has a design height which is less than half of the width of the annular groove. 11. The rotary seal assembly according to claim 1, wherein the pre-loading element can be pressure-activated in a bidirectional manner. 12. The rotary seal assembly according to claim 1, wherein a back surface of the back portion of the support ring in the non-pressurized operating state is a cylindrical lateral surface in the case of a rotary seal designed as a radial seal, and in the case of an axially sealing rotary seal it is an annular surface. 13. The rotary seal assembly according to claim 1, wherein both of the two support legs of the support ring are chamfered on the outer side. | A rotary seal assembly includes a viscoelastically deformable support ring having a high-pressure side first support leg connected by a back portion to a low-pressure side second support leg. The legs laterally delimit an annular groove of the support ring open toward the sealing surface retaining a sealing ring. A rubber-elastically deformable pre-loading element between the seal retaining structure and the support ring pre-loads the sealing ring against the sealing surface via the support ring. A pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed in the pre-loading direction proportionally to the operating pressure such that the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof.1. A rotary seal assembly, comprising:
a first machine part and a second machine part which are arranged at a distance from each other and so as to be rotatable relative to each other about a rotational axis, while forming a sealing gap, wherein one of the two machine parts has a sealing surface and the respective other machine part has a seal retaining structure; a rotary seal for sealing a high-pressure side from a low-pressure side of the sealing gap; a support ring made of a viscoelastically deformable material, which support ring has a first support leg arranged on the high-pressure side and a second support leg arranged on the low-pressure side, wherein the two support legs are connected to each other by a back portion, and the two support legs laterally delimit an annular groove of the support ring, which annular groove is open toward the sealing surface; a sealing ring arranged in a retained manner in the annular groove of the support ring and engaging interlockingly in the axial and radial direction in the annular groove of the support ring, wherein the sealing ring has a spherically designed dynamic sealing section which abuts against the sealing surface in a dynamically sealing manner, wherein the sealing ring has a lower rigidity than the support ring; and a rubber-elastically deformable pre-loading element arranged between the seal retaining structure of the one machine part and the support ring in order to pre-load the sealing ring against the sealing surface via the support ring in a pre-loading direction oriented orthogonally to the sealing surface, wherein the material of the pre-loading element is isovolumetrically deformable; wherein the two support legs of the support ring are each arranged at a distance from the sealing surface in the non-pressurized operating state of the rotary seal, and wherein, in the case of a pressure activation of the pre-loading element by an operating pressure prevailing on the high-pressure side, the pre-loading element, which is supported on a support surface of one of the two machine parts, is deformed proportionally to the operating pressure wherein the support ring is moved toward the sealing surface with the low-pressure-side support leg thereof and is moved away from the sealing surface with the high-pressure-side support leg thereof, until the support ring contacts the sealing surface continuously with its low-pressure-side support leg when a maximum operating pressure is reached or exceeded. 2. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the sealing ring. 3. The rotary seal assembly according to claim 1, wherein the pre-loading ring in the non-pressurized state of the rotary seal extends over the entire width or almost over the entire width of the support ring. 4. The rotary seal assembly according to claim 1, wherein the sealing ring is retained without play in the annular groove of the support ring. 5. The rotary seal assembly according to claim 1, wherein at least one of the two support legs of the support ring are chamfered on the outer side. 6. The rotary seal assembly according to claim 1, wherein the support ring and/or the sealing ring and/or the pre-loading element comprises a plastic material or consists of a plastic material. 7. The rotary seal assembly according claim 1, wherein the support ring and the sealing ring are designed jointly as a multi-component injection-molded part. 8. The rotary seal assembly according to claim 1, wherein the support surface is arranged on and formed by the machine part having the seal retaining structure. 9. The rotary seal assembly according to claim 1, wherein the support surface is a shoulder or a flank of the seal retaining structure. 10. The rotary seal assembly according to claim 1, wherein the sealing ring has a design height which is less than half of the width of the annular groove. 11. The rotary seal assembly according to claim 1, wherein the pre-loading element can be pressure-activated in a bidirectional manner. 12. The rotary seal assembly according to claim 1, wherein a back surface of the back portion of the support ring in the non-pressurized operating state is a cylindrical lateral surface in the case of a rotary seal designed as a radial seal, and in the case of an axially sealing rotary seal it is an annular surface. 13. The rotary seal assembly according to claim 1, wherein both of the two support legs of the support ring are chamfered on the outer side. | 3,600 |
347,119 | 16,805,624 | 3,675 | In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator. | 1. A computer-implemented method comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator. 2. The computer-implemented method of claim 1, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 3. The computer-implemented method of claim 1, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 4. The computer-implemented method of claim 3, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. 5. The computer-implemented method of claim 1, wherein the query operator is detected as part of query optimization. 6. The computer-implemented method of claim 1, wherein the checking that the column-oriented database provides sorted dictionary access and that dictionary collation and the collation of the query operator are the same comprises a call to a fragment of the column-oriented database and a response to the call indicating the column-oriented database is eligible. 7. The computer-implemented method of claim 1, wherein the reading from the sorted dictionary the batch of sorted values includes storing a last, or a next, value read from the sorted dictionary to enable a second batch read of the sorted dictionary. 8. The computer-implemented method of claim 1, wherein the reading directly from the sorted dictionary enables avoiding, in response to the query operator, a sort or a scan of a fragment at the column-oriented database. 9. A system comprising:
at least one processor; and at least one memory including program code which when executed by the at least one processor causes operations comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database;
determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same;
when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and
processing, based on the batch sorted values read from the sorted dictionary, the query operator. 10. The system of claim 9, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 11. The system of claim 9, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 12. The system of claim 11, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. 13. The system of claim 9, wherein the query operator is detected as part of query optimization. 14. The system of claim 9, wherein the checking that the column-oriented database provides sorted dictionary access and that dictionary collation and the collation of the query operator are the same comprises a call to a fragment of the column-oriented database and a response to the call indicating the column-oriented database is eligible. 15. The system of claim 9, wherein the reading from the sorted dictionary the batch of sorted values includes storing a last, or a next, value read from the sorted dictionary to enable a second batch read of the sorted dictionary. 16. The system of claim 9, wherein the reading directly from the sorted dictionary enables avoiding, in response to the query operator, a sort or a scan of a fragment at the column-oriented database. 17. A non-transitory computer-reader medium including program code which when executed by at least one processor causes operations comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator. 18. The non-transitory computer-reader medium of claim 17, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 19. The non-transitory computer-reader medium of claim 17, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 20. The non-transitory computer-reader medium of claim 17, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. | In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator.1. A computer-implemented method comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator. 2. The computer-implemented method of claim 1, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 3. The computer-implemented method of claim 1, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 4. The computer-implemented method of claim 3, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. 5. The computer-implemented method of claim 1, wherein the query operator is detected as part of query optimization. 6. The computer-implemented method of claim 1, wherein the checking that the column-oriented database provides sorted dictionary access and that dictionary collation and the collation of the query operator are the same comprises a call to a fragment of the column-oriented database and a response to the call indicating the column-oriented database is eligible. 7. The computer-implemented method of claim 1, wherein the reading from the sorted dictionary the batch of sorted values includes storing a last, or a next, value read from the sorted dictionary to enable a second batch read of the sorted dictionary. 8. The computer-implemented method of claim 1, wherein the reading directly from the sorted dictionary enables avoiding, in response to the query operator, a sort or a scan of a fragment at the column-oriented database. 9. A system comprising:
at least one processor; and at least one memory including program code which when executed by the at least one processor causes operations comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database;
determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same;
when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and
processing, based on the batch sorted values read from the sorted dictionary, the query operator. 10. The system of claim 9, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 11. The system of claim 9, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 12. The system of claim 11, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. 13. The system of claim 9, wherein the query operator is detected as part of query optimization. 14. The system of claim 9, wherein the checking that the column-oriented database provides sorted dictionary access and that dictionary collation and the collation of the query operator are the same comprises a call to a fragment of the column-oriented database and a response to the call indicating the column-oriented database is eligible. 15. The system of claim 9, wherein the reading from the sorted dictionary the batch of sorted values includes storing a last, or a next, value read from the sorted dictionary to enable a second batch read of the sorted dictionary. 16. The system of claim 9, wherein the reading directly from the sorted dictionary enables avoiding, in response to the query operator, a sort or a scan of a fragment at the column-oriented database. 17. A non-transitory computer-reader medium including program code which when executed by at least one processor causes operations comprising:
detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator. 18. The non-transitory computer-reader medium of claim 17, wherein the predetermined type of query operator comprises at least one of an order by, an order by with limit, an order by with top k smallest, an order by with top k largest, a minimum, and a maximum. 19. The non-transitory computer-reader medium of claim 17, wherein the column-oriented database includes a main fragment storing a column of data values as a data vector, the sorted dictionary, and an inverted index. 20. The non-transitory computer-reader medium of claim 17, wherein the column-oriented database includes a delta fragment, a delta fragment sorted dictionary, a search tree, and a delta fragment inverted index. | 3,600 |
347,120 | 16,805,588 | 3,675 | Systems, methods, and devices are disclosed for implementing photonic links. Methods include transmitting light using an optical emitter, splitting, using an input coupler, the light into a first path and a second path, the first path being provided to a modulator, and the second path being provided to a phase shifter, and combining, using an output coupler, an output of the modulator and an output of the phase shifter. Methods further include identifying a modulator phase angle that reduces a third order distortion at an output of the output coupler, applying a first bias voltage to a modulator to maintain the identified modulator phase angle, and applying a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of a phase shifter. | 1. A method of using a photonic link, the method comprising:
transmitting light using an optical emitter; splitting, using an input coupler, the light into a first path and a second path, the first path being provided to a modulator, and the second path being provided to a phase shifter; combining, using an output coupler, an output of the modulator and an output of the phase shifter; identifying a modulator phase angle that reduces a third order distortion at an output of the output coupler; applying a first bias voltage to a modulator to maintain the identified modulator phase angle; and applying a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of a phase shifter. 2. The method of claim 1 further comprising:
coupling, using an output coupler, an output of the modulator and an output of the phase shifter; and
monitoring an output of a photodetector coupled to an output of the output coupler. 3. The method of claim 2 further comprising:
extracting a low frequency component and a fundamental frequency component of an output of a photodetector coupled to the output coupler. 4. The method of claim 3 further comprising:
determining the control signal based, at least in part, on the low frequency component and the fundamental frequency component. 5. The method of claim 4 further comprising:
determining the control signal based, at least in part, on the low frequency component and the fundamental frequency component as well as the output of the modulator. 6. The method of claim 1 further comprising:
receiving, at the modulator, a radio frequency (RF) signal from an antenna. 7. The method of claim 6, wherein the antenna is mounted, at least in part, on an exterior surface of an aircraft. 8. The method of claim 1 further comprising:
determining the first bias voltage by achieving a minimum value of a fundamental frequency of a test waveform. 9. The method of claim 8 further comprising:
determining a second bias voltage to implement a phase offset from the first bias voltage, the phase offset suppressing a third order distortion. 10. A system configured to implement a photonic link, the system comprising:
an optical emitter; an input coupler configured to split an output of the optical emitter into a first path and a second path; a modulator configured to modulate light transmitted along the first path based on an RF signal; a phase shifter configured to modify a phase of light transmitted along the second path based on a bias voltage; and a controller configured to:
identify a modulator phase angle that reduces a third order distortion of the photonic link;
apply a first bias voltage to the modulator to maintain the identified phase angle; and
apply a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of the phase shifter. 11. The system of claim 10 further comprising:
an output coupler coupled to the output of the modulator and the output of the phase shifter; and
a photodetector coupled to an output of the output coupler. 12. The system of claim 11, wherein the controller is configured to extract a low frequency component and a fundamental frequency component of an output of the photodetector. 13. The system of claim 12, wherein the controller is configured to determine the first bias voltage and the control signal based, at least in part, on the low frequency component and the fundamental frequency component. 14. The system of claim 13, wherein the first bias voltage is applied to the modulator, and wherein the control signal is applied to the phase shifter. 15. The system of claim 11, wherein the modulator is coupled to an antenna, and wherein the modulator and the antenna are implemented in a vehicle. 16. The system of claim 15, wherein the vehicle is an aircraft, and wherein the antenna is mounted, at least in part, on an exterior surface of the aircraft. 17. A device comprising:
a modulator configured to receive a first optical signal from an optical emitter via a first path, the modulator being configured to modulate light transmitted along the first path based on an RF signal; a phase shifter configured to receive a second optical signal from the optical emitter via a second path, the phase shifter being configured to modify a phase of light transmitted along the second path based on a bias voltage; and a controller configured to:
identify a modulator phase angle that reduces a third order distortion;
apply a first bias voltage to the modulator to maintain the identified phase angle; and
apply a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of the phase shifter. 18. The device of claim 17, wherein the modulator is coupled to an antenna, and wherein the modulator and the antenna are implemented in an aircraft. 19. The device of claim 17, wherein the controller is configured to extract a low frequency component and a fundamental frequency component of an output of a photodetector. 20. The device of claim 19, wherein the controller is configured to determine the first bias voltage and the control signal based, at least in part, on the low frequency component and the fundamental frequency component. | Systems, methods, and devices are disclosed for implementing photonic links. Methods include transmitting light using an optical emitter, splitting, using an input coupler, the light into a first path and a second path, the first path being provided to a modulator, and the second path being provided to a phase shifter, and combining, using an output coupler, an output of the modulator and an output of the phase shifter. Methods further include identifying a modulator phase angle that reduces a third order distortion at an output of the output coupler, applying a first bias voltage to a modulator to maintain the identified modulator phase angle, and applying a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of a phase shifter.1. A method of using a photonic link, the method comprising:
transmitting light using an optical emitter; splitting, using an input coupler, the light into a first path and a second path, the first path being provided to a modulator, and the second path being provided to a phase shifter; combining, using an output coupler, an output of the modulator and an output of the phase shifter; identifying a modulator phase angle that reduces a third order distortion at an output of the output coupler; applying a first bias voltage to a modulator to maintain the identified modulator phase angle; and applying a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of a phase shifter. 2. The method of claim 1 further comprising:
coupling, using an output coupler, an output of the modulator and an output of the phase shifter; and
monitoring an output of a photodetector coupled to an output of the output coupler. 3. The method of claim 2 further comprising:
extracting a low frequency component and a fundamental frequency component of an output of a photodetector coupled to the output coupler. 4. The method of claim 3 further comprising:
determining the control signal based, at least in part, on the low frequency component and the fundamental frequency component. 5. The method of claim 4 further comprising:
determining the control signal based, at least in part, on the low frequency component and the fundamental frequency component as well as the output of the modulator. 6. The method of claim 1 further comprising:
receiving, at the modulator, a radio frequency (RF) signal from an antenna. 7. The method of claim 6, wherein the antenna is mounted, at least in part, on an exterior surface of an aircraft. 8. The method of claim 1 further comprising:
determining the first bias voltage by achieving a minimum value of a fundamental frequency of a test waveform. 9. The method of claim 8 further comprising:
determining a second bias voltage to implement a phase offset from the first bias voltage, the phase offset suppressing a third order distortion. 10. A system configured to implement a photonic link, the system comprising:
an optical emitter; an input coupler configured to split an output of the optical emitter into a first path and a second path; a modulator configured to modulate light transmitted along the first path based on an RF signal; a phase shifter configured to modify a phase of light transmitted along the second path based on a bias voltage; and a controller configured to:
identify a modulator phase angle that reduces a third order distortion of the photonic link;
apply a first bias voltage to the modulator to maintain the identified phase angle; and
apply a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of the phase shifter. 11. The system of claim 10 further comprising:
an output coupler coupled to the output of the modulator and the output of the phase shifter; and
a photodetector coupled to an output of the output coupler. 12. The system of claim 11, wherein the controller is configured to extract a low frequency component and a fundamental frequency component of an output of the photodetector. 13. The system of claim 12, wherein the controller is configured to determine the first bias voltage and the control signal based, at least in part, on the low frequency component and the fundamental frequency component. 14. The system of claim 13, wherein the first bias voltage is applied to the modulator, and wherein the control signal is applied to the phase shifter. 15. The system of claim 11, wherein the modulator is coupled to an antenna, and wherein the modulator and the antenna are implemented in a vehicle. 16. The system of claim 15, wherein the vehicle is an aircraft, and wherein the antenna is mounted, at least in part, on an exterior surface of the aircraft. 17. A device comprising:
a modulator configured to receive a first optical signal from an optical emitter via a first path, the modulator being configured to modulate light transmitted along the first path based on an RF signal; a phase shifter configured to receive a second optical signal from the optical emitter via a second path, the phase shifter being configured to modify a phase of light transmitted along the second path based on a bias voltage; and a controller configured to:
identify a modulator phase angle that reduces a third order distortion;
apply a first bias voltage to the modulator to maintain the identified phase angle; and
apply a control signal to the phase shifter to maintain a phase difference between an output of the modulator and an output of the phase shifter. 18. The device of claim 17, wherein the modulator is coupled to an antenna, and wherein the modulator and the antenna are implemented in an aircraft. 19. The device of claim 17, wherein the controller is configured to extract a low frequency component and a fundamental frequency component of an output of a photodetector. 20. The device of claim 19, wherein the controller is configured to determine the first bias voltage and the control signal based, at least in part, on the low frequency component and the fundamental frequency component. | 3,600 |
347,121 | 16,805,598 | 2,117 | A building management system includes a processing circuit configured to clone the configuration of a first device to one or more devices in a network. The building management system may be configured to determine the source device and the one or more destination devices, retrieve the configuration data from the source device, determine a configuration of the second device, determine a mapping of the source device configuration to the destination device configuration, and send one or more commands to the destination devices to configure the destination devices with properties from the source device configuration. The cloning method may thus be used to clone devices remotely, where the devices can be from different vendors or be different models and located at different locations. | 1. A building system configured to copy a configuration of a first controller to a second controller, the building system comprising a processing circuit configured to:
receive, via a user interface, a selection of the first controller from a plurality of source controllers and the second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with the configuration of the first controller; receive a first instruction to copy the configuration of the first controller to the second controller; retrieve the configuration of the first controller, the configuration defining a first set of properties of the first controller and corresponding values of the properties; determine a mapping of the first set of properties to a second set of properties associated with the second controller; and send a command to the second controller, the command comprising a second instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 2. The building system of claim 1, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 3. The building system of claim 1, wherein the processing circuit is configured to determine the second controller is compatible to be a clone of the first controller. 4. The building system of claim 1, wherein the second set of properties is different than the first set of properties. 5. The building system of claim 1, wherein the processing circuit is configured to communicate with the first controller and the second controller via a universal communication protocol. 6. The building system of claim 1, wherein the configuration is further defined by a model, and wherein properties in the first set of properties are associated with the object model. 7. The building system of claim 6, wherein to determine the second set of properties the processing circuit is configured to generate an instance of the model for the second controller. 8. The building system of claim 1, wherein the received first instruction is based on a user input indicating an identity of the first controller and the second controller. 9. The building system of claim 1, wherein the first controller and the second controller are different controller models. 10. A building management system (BMS) comprising:
a network interface configured to communicate with a first controller and a second controller in a building system; and a processing circuit comprising a processor and a memory with instructions stored thereon that, when executed by the processor, cause the processor to:
receive, via a user interface, a selection of the first controller from a plurality of source controllers and the second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with a configuration of the first controller;
receive a first instruction to copy the configuration of the first controller to the second controller;
retrieve the configuration of the first controller, the configuration defining a first set of properties of the first controller and corresponding values of the properties;
determine a mapping of the first set of properties to a second set of properties associated with the second controller; and
send a command to the second controller, the command comprising a second instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 11. The BMS of claim 10, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 12. The BMS of claim 10, wherein the processor is further caused to determine the second controller is compatible to be a clone of the first controller. 13. The BMS of claim 10, wherein the second set of properties is different than the first set of properties. 14. The BMS of claim 10, wherein the network interface is based on a universal communication protocol. 15. The BMS of claim 10, wherein the first instruction is received from a user via a graphical user interface. 16. The BMS of claim 10, wherein the first controller and the second controller are produced by different vendors. 17. A method, comprising:
receiving, via a user interface, a selection of a first controller from a plurality of source controllers and a second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with the configuration of the first controller; receiving an indication to clone configuration data of the first controller to the second controller; retrieving the configuration data of the first controller, the configuration data defining a first set of properties of the first controller and corresponding values of the properties; determining a mapping of the first set of properties to a second set of properties associated with the second controller; and sending a command to the second controller, the command comprising an instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 18. The method of claim 17, further comprising determining the second controller is compatible to be a clone of the first controller. 19. The method of claim 17, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 20. The method of claim 17, wherein the second set of properties is different than the first set of properties. | A building management system includes a processing circuit configured to clone the configuration of a first device to one or more devices in a network. The building management system may be configured to determine the source device and the one or more destination devices, retrieve the configuration data from the source device, determine a configuration of the second device, determine a mapping of the source device configuration to the destination device configuration, and send one or more commands to the destination devices to configure the destination devices with properties from the source device configuration. The cloning method may thus be used to clone devices remotely, where the devices can be from different vendors or be different models and located at different locations.1. A building system configured to copy a configuration of a first controller to a second controller, the building system comprising a processing circuit configured to:
receive, via a user interface, a selection of the first controller from a plurality of source controllers and the second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with the configuration of the first controller; receive a first instruction to copy the configuration of the first controller to the second controller; retrieve the configuration of the first controller, the configuration defining a first set of properties of the first controller and corresponding values of the properties; determine a mapping of the first set of properties to a second set of properties associated with the second controller; and send a command to the second controller, the command comprising a second instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 2. The building system of claim 1, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 3. The building system of claim 1, wherein the processing circuit is configured to determine the second controller is compatible to be a clone of the first controller. 4. The building system of claim 1, wherein the second set of properties is different than the first set of properties. 5. The building system of claim 1, wherein the processing circuit is configured to communicate with the first controller and the second controller via a universal communication protocol. 6. The building system of claim 1, wherein the configuration is further defined by a model, and wherein properties in the first set of properties are associated with the object model. 7. The building system of claim 6, wherein to determine the second set of properties the processing circuit is configured to generate an instance of the model for the second controller. 8. The building system of claim 1, wherein the received first instruction is based on a user input indicating an identity of the first controller and the second controller. 9. The building system of claim 1, wherein the first controller and the second controller are different controller models. 10. A building management system (BMS) comprising:
a network interface configured to communicate with a first controller and a second controller in a building system; and a processing circuit comprising a processor and a memory with instructions stored thereon that, when executed by the processor, cause the processor to:
receive, via a user interface, a selection of the first controller from a plurality of source controllers and the second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with a configuration of the first controller;
receive a first instruction to copy the configuration of the first controller to the second controller;
retrieve the configuration of the first controller, the configuration defining a first set of properties of the first controller and corresponding values of the properties;
determine a mapping of the first set of properties to a second set of properties associated with the second controller; and
send a command to the second controller, the command comprising a second instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 11. The BMS of claim 10, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 12. The BMS of claim 10, wherein the processor is further caused to determine the second controller is compatible to be a clone of the first controller. 13. The BMS of claim 10, wherein the second set of properties is different than the first set of properties. 14. The BMS of claim 10, wherein the network interface is based on a universal communication protocol. 15. The BMS of claim 10, wherein the first instruction is received from a user via a graphical user interface. 16. The BMS of claim 10, wherein the first controller and the second controller are produced by different vendors. 17. A method, comprising:
receiving, via a user interface, a selection of a first controller from a plurality of source controllers and a second controller from a plurality of eligible destination controllers, wherein the user interface includes a first element providing an indication of the plurality of source controllers and a second element providing an indication of the plurality of eligible destination controllers, the plurality of eligible destination controllers being compatible with the configuration of the first controller; receiving an indication to clone configuration data of the first controller to the second controller; retrieving the configuration data of the first controller, the configuration data defining a first set of properties of the first controller and corresponding values of the properties; determining a mapping of the first set of properties to a second set of properties associated with the second controller; and sending a command to the second controller, the command comprising an instruction to configure the second set of properties with the corresponding values of the first set of properties according to the determined mapping. 18. The method of claim 17, further comprising determining the second controller is compatible to be a clone of the first controller. 19. The method of claim 17, wherein the first set of properties and the second set of properties include at least one of a data type, controller setpoint, object data structure, or control scheme. 20. The method of claim 17, wherein the second set of properties is different than the first set of properties. | 2,100 |
347,122 | 16,805,625 | 2,117 | The subject technology receives assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data. The subject technology applies the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data. The subject technology determines whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model. The subject technology retrains the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution. | 1. A method comprising:
receiving assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data; applying the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data; determining whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model; and retraining the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution of the corresponding assessment values determined by the first machine learning model. 2. The method of claim 1, further comprising:
deploying the retrained first machine learning model to the client electronic device. 3. The method of claim 1, wherein the first machine learning model is deployed across a plurality of client electronic devices that includes the client electronic device and the assessment values are received from the first machine learning model deployed across the plurality of client electronic devices. 4. The method of claim 1, wherein determining whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for the corresponding assessment values is based at least in part on feedback data indicating that one or more particular classifications were accurate. 5. The method of claim 1, wherein the second machine learning model is deployed on a server. 6. The method of claim 1, wherein the classifications comprise binary classifications. 7. The method of claim 6, wherein the probability distribution of the constraint data comprises a first set of percentages for false positives and a second set of percentages for false negatives corresponding to the assessment values. 8. The method of claim 6, wherein the binary classifications include a first classification corresponding to a fraudulent transaction and a second classification corresponding to a non-fraudulent transaction. 9. The method of claim 1, wherein retraining the first machine learning model is based at least in part on a threshold value from a range of values of the assessment values. 10. The method of claim 1, wherein the assessment values are based at least in part on signals indicating activity performed on the client electronic device, and the signals from the client electronic device are not shared with a server that receives the assessment values. 11. A system comprising:
a processor; a memory device containing instructions, which when executed by the processor cause the processor to:
receive assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data;
apply the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data;
determine whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model; and
retrain the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution of the corresponding assessment values determined by the first machine learning model. 12. The system of claim 11, wherein the memory device contains further instructions, which when executed by the processor further causes the processor to:
deploy the retrained first machine learning model to the client electronic device. 13. The system of claim 11, wherein the first machine learning model is deployed across a plurality of client electronic devices that includes the client electronic device and the assessment values are received from the first machine learning model deployed across the plurality of client electronic devices. 14. The system of claim 11, wherein to determine whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for the corresponding assessment values is based at least in part on feedback data indicating that one or more particular classifications were accurate. 15. The system of claim 11, wherein the second machine learning model is deployed on a server. 16. The system of claim 11, wherein the classifications comprise binary classifications. 17. The system of claim 11, wherein the probability distribution of the constraint data comprises a first set of percentages for false positives and a second set of percentages for false negatives corresponding to the assessment values. 18. The system of claim 11, wherein to retrain the first machine learning model is based at least in part on a threshold value from a range of values of the assessment values. 19. The system of claim 11, wherein the assessment values are based at least in part on signals indicating activity performed on the client electronic device, and the signals from the client electronic device are not shared with a server that receives the assessment values. 20. A non-transitory computer-readable medium comprising instructions, which when executed by a computing device, cause the computing device to perform operations comprising:
receiving, at a destination electronic device, an assessment value from a source electronic device, the assessment value being provided from an output of a first machine learning model deployed on the source electronic device; determining, by a second machine learning model deployed on the destination electronic device, a classification of the assessment value based on a set of constraints, the set of constraints being utilized by the source electronic device and the destination electronic device to at least define a probability that the assessment value corresponds to a particular classification; and performing, by the destination electronic device, an action based at least in part on the classification of the assessment value. | The subject technology receives assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data. The subject technology applies the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data. The subject technology determines whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model. The subject technology retrains the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution.1. A method comprising:
receiving assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data; applying the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data; determining whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model; and retraining the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution of the corresponding assessment values determined by the first machine learning model. 2. The method of claim 1, further comprising:
deploying the retrained first machine learning model to the client electronic device. 3. The method of claim 1, wherein the first machine learning model is deployed across a plurality of client electronic devices that includes the client electronic device and the assessment values are received from the first machine learning model deployed across the plurality of client electronic devices. 4. The method of claim 1, wherein determining whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for the corresponding assessment values is based at least in part on feedback data indicating that one or more particular classifications were accurate. 5. The method of claim 1, wherein the second machine learning model is deployed on a server. 6. The method of claim 1, wherein the classifications comprise binary classifications. 7. The method of claim 6, wherein the probability distribution of the constraint data comprises a first set of percentages for false positives and a second set of percentages for false negatives corresponding to the assessment values. 8. The method of claim 6, wherein the binary classifications include a first classification corresponding to a fraudulent transaction and a second classification corresponding to a non-fraudulent transaction. 9. The method of claim 1, wherein retraining the first machine learning model is based at least in part on a threshold value from a range of values of the assessment values. 10. The method of claim 1, wherein the assessment values are based at least in part on signals indicating activity performed on the client electronic device, and the signals from the client electronic device are not shared with a server that receives the assessment values. 11. A system comprising:
a processor; a memory device containing instructions, which when executed by the processor cause the processor to:
receive assessment values determined by a first machine learning model deployed on a client electronic device, the assessment values being indicative of classifications of input data and the assessment values being associated with constraint data that comprises a probability distribution of the assessment values with respect to the classifications of the input data;
apply the assessment values determined by the first machine learning model to a second machine learning model to determine the classifications of the input data;
determine whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for corresponding assessment values determined by the first machine learning model; and
retrain the first machine learning model when the accuracies of the classifications determined by the second machine learning model do not conform with the probability distribution of the corresponding assessment values determined by the first machine learning model. 12. The system of claim 11, wherein the memory device contains further instructions, which when executed by the processor further causes the processor to:
deploy the retrained first machine learning model to the client electronic device. 13. The system of claim 11, wherein the first machine learning model is deployed across a plurality of client electronic devices that includes the client electronic device and the assessment values are received from the first machine learning model deployed across the plurality of client electronic devices. 14. The system of claim 11, wherein to determine whether accuracies of the classifications determined by the second machine learning model conform with the probability distribution for the corresponding assessment values is based at least in part on feedback data indicating that one or more particular classifications were accurate. 15. The system of claim 11, wherein the second machine learning model is deployed on a server. 16. The system of claim 11, wherein the classifications comprise binary classifications. 17. The system of claim 11, wherein the probability distribution of the constraint data comprises a first set of percentages for false positives and a second set of percentages for false negatives corresponding to the assessment values. 18. The system of claim 11, wherein to retrain the first machine learning model is based at least in part on a threshold value from a range of values of the assessment values. 19. The system of claim 11, wherein the assessment values are based at least in part on signals indicating activity performed on the client electronic device, and the signals from the client electronic device are not shared with a server that receives the assessment values. 20. A non-transitory computer-readable medium comprising instructions, which when executed by a computing device, cause the computing device to perform operations comprising:
receiving, at a destination electronic device, an assessment value from a source electronic device, the assessment value being provided from an output of a first machine learning model deployed on the source electronic device; determining, by a second machine learning model deployed on the destination electronic device, a classification of the assessment value based on a set of constraints, the set of constraints being utilized by the source electronic device and the destination electronic device to at least define a probability that the assessment value corresponds to a particular classification; and performing, by the destination electronic device, an action based at least in part on the classification of the assessment value. | 2,100 |
347,123 | 16,805,626 | 2,117 | A composition comprising caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent, and a method for use in the preparation of a composition containing caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives. The method includes the steps of pre-concentrating an extract containing the caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives and isolating said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives from said extract by liquid chromatography, wherein the elution activity of said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives vary depending on the stationary phase and the composition of the mobile phase. | 1. A composition comprising caffeoylshikimic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent. 2. The composition as claimed in claim 1, wherein the composition comprises caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from the vegetation liquor of palm oil milling. 3. The composition as claimed in claim 1, wherein the composition further contains at least one of the following: hydroxytyrosol, p-hydroxybenzoic acid, 5-0-caffeoylshikimic acid, 4-0 caffeoylshikimic acid and 3-0 caffeoylshikimic acid. | A composition comprising caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent, and a method for use in the preparation of a composition containing caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives. The method includes the steps of pre-concentrating an extract containing the caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives and isolating said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives from said extract by liquid chromatography, wherein the elution activity of said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives vary depending on the stationary phase and the composition of the mobile phase.1. A composition comprising caffeoylshikimic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent. 2. The composition as claimed in claim 1, wherein the composition comprises caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from the vegetation liquor of palm oil milling. 3. The composition as claimed in claim 1, wherein the composition further contains at least one of the following: hydroxytyrosol, p-hydroxybenzoic acid, 5-0-caffeoylshikimic acid, 4-0 caffeoylshikimic acid and 3-0 caffeoylshikimic acid. | 2,100 |
347,124 | 16,805,630 | 2,117 | A composition comprising caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent, and a method for use in the preparation of a composition containing caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives. The method includes the steps of pre-concentrating an extract containing the caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives and isolating said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives from said extract by liquid chromatography, wherein the elution activity of said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives vary depending on the stationary phase and the composition of the mobile phase. | 1. A composition comprising caffeoylshikimic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent. 2. The composition as claimed in claim 1, wherein the composition comprises caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from the vegetation liquor of palm oil milling. 3. The composition as claimed in claim 1, wherein the composition further contains at least one of the following: hydroxytyrosol, p-hydroxybenzoic acid, 5-0-caffeoylshikimic acid, 4-0 caffeoylshikimic acid and 3-0 caffeoylshikimic acid. | A composition comprising caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent, and a method for use in the preparation of a composition containing caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives. The method includes the steps of pre-concentrating an extract containing the caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives and isolating said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives from said extract by liquid chromatography, wherein the elution activity of said caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, caffeoylshikimic acids and their derivatives vary depending on the stationary phase and the composition of the mobile phase.1. A composition comprising caffeoylshikimic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from any part of oil palm including but not confined to the vegetation liquor of palm oil milling and palm oil mill effluent. 2. The composition as claimed in claim 1, wherein the composition comprises caffeoylshikimic acids, protocatechuic acid, hydroxytyrosol, hydroxybenzoic acid, said caffeoylshikimic acids and their derivatives extracted from the vegetation liquor of palm oil milling. 3. The composition as claimed in claim 1, wherein the composition further contains at least one of the following: hydroxytyrosol, p-hydroxybenzoic acid, 5-0-caffeoylshikimic acid, 4-0 caffeoylshikimic acid and 3-0 caffeoylshikimic acid. | 2,100 |
347,125 | 16,805,629 | 3,745 | The present invention relates to a positive displacement pump having a delivery chamber, which is connected to a discharge connection and a suction connection, characterized in that the surface of the delivery chamber is configured in the form of an at least partially microstructured surface. The at least partially microstructured surface has a multiplicity of ribs and channels located therebetween, these running in a direction along the direction of flow of the delivery medium. As a result of the surface being structured, the situation where gas bubbles stick is reliably prevented and the harmful gas volume is considerably reduced. | 1. Positive displacement pump having a delivery chamber, which is connected to a discharge connection and a suction connection, characterized in that the surface of at least one positive-displacement-pump element which is in contact with fluid is configured in the form of an at least partially microstructured surface. 2. Positive displacement pump according to claim 1, characterized in that
the surface of the delivery chamber, of the working chamber, of lines and/or bores in the pump, of the displacing piston, of the diaphragm, of the valves and/or of all other positive-displacement-pump elements which are in contact with fluid is or are configured in the form of an at least partially microstructured surface. 3. Positive displacement pump according to claim 1, characterized in that
the surface or the surfaces have or has a multiplicity of ribs and channels located therebetween. 4. Positive displacement pump according to claim 1, characterized in that
ribs and channels run at least partially, in particular fully, in a direction along the direction of flow of the delivery medium. 5. Positive displacement pump according to claim 1, characterized in that
the ribs and channels are arranged at least partially, in particular fully, in segmented form, wherein the individual segments are offset in relation to one another, and wherein it is possible for the respective segments to be of identical length or of different lengths. 6. Positive displacement pump according to claim 1, characterized in that
the ribs and channels are arranged at least partially, in particular fully, in segmented form, wherein it is possible for the individual segments to have ribs and channels of different heights and widths. 7. Positive displacement pump according to claim 1, characterized in that
the ribs are designed at least partially, in particular fully, in honeycomb form, wherein the honeycomb boundary interrupts the ribs and channels. 8. Positive displacement pump according to claim 1, characterized in that
at least one of the ribs, preferably all the ribs, in a single segment, in particular all the ribs, are pointed and at least one of the channels, preferably all the channels, in a single segment, in particular all the channels, are round. 9. Positive displacement pump according to claim 1, characterized in that
at least one of the ribs, preferably all the ribs, in a single segment, in particular all the ribs, and at least one of the channels, preferably all the channels, in a single segment, in particular all the channels, are triangular and/or trapezoidal. 10. Positive displacement pump according to claim 1, characterized in that
the ribs have a height from 0.3 to 1000 μm, preferably between 30 and 300 μm. 11. Positive displacement pump according to claim 4, characterized in that
the ribs have a height between 30% and 120%, preferably between 50% and 100%, of the distance from an adjacent rib. 12. Positive displacement pump according to claim 3, characterized in that
the ribs have a width from 0.3 μm to 1000 μm, preferably 25 μm to 300 μm, in particular 35 μm to 200 μm. 13. Positive displacement pump according to claim 3, characterized in that
the channels have a width from 0.3 μm to 1000 μm, preferably 25 μm to 300 μm, in particular 35 μm to 200 μm, wherein the channels are preferably rounded and/or taper in relation to the ribs in particular at an acute angle of smaller than, or equal to, 75°, in particular smaller than, or equal to, 60°. 14. Method for producing an at least partially microstructured surface of an element of a positive displacement pump, in particular of a delivery chamber, working chamber, of lines and/or bores in the pump, of a displacing piston, of a valve, of a line and/or a seal, preferably of a positive displacement pump according to claim 1, characterized in that
a microstructured film is adhesively bonded to the surface and/or the microstructured surface is produced by casting or injection moulding and/or by imprinting and/or by machining, in particular milling, and/or a lacquer applied to the surface is structured and/or the structure is produced using a pulsed laser beam or using fine jet plasma. 15. Use of microstructured surfaces for optimizing the harmful volume of pumps and/or for reducing noise or vibration in pumps, in particular by coating the delivery chamber, the working chamber, lines and/or bores in the pump, the displacing piston, the diaphragm and/or seals of the pump, preferably in a positive displacement pump according to claim 3. | The present invention relates to a positive displacement pump having a delivery chamber, which is connected to a discharge connection and a suction connection, characterized in that the surface of the delivery chamber is configured in the form of an at least partially microstructured surface. The at least partially microstructured surface has a multiplicity of ribs and channels located therebetween, these running in a direction along the direction of flow of the delivery medium. As a result of the surface being structured, the situation where gas bubbles stick is reliably prevented and the harmful gas volume is considerably reduced.1. Positive displacement pump having a delivery chamber, which is connected to a discharge connection and a suction connection, characterized in that the surface of at least one positive-displacement-pump element which is in contact with fluid is configured in the form of an at least partially microstructured surface. 2. Positive displacement pump according to claim 1, characterized in that
the surface of the delivery chamber, of the working chamber, of lines and/or bores in the pump, of the displacing piston, of the diaphragm, of the valves and/or of all other positive-displacement-pump elements which are in contact with fluid is or are configured in the form of an at least partially microstructured surface. 3. Positive displacement pump according to claim 1, characterized in that
the surface or the surfaces have or has a multiplicity of ribs and channels located therebetween. 4. Positive displacement pump according to claim 1, characterized in that
ribs and channels run at least partially, in particular fully, in a direction along the direction of flow of the delivery medium. 5. Positive displacement pump according to claim 1, characterized in that
the ribs and channels are arranged at least partially, in particular fully, in segmented form, wherein the individual segments are offset in relation to one another, and wherein it is possible for the respective segments to be of identical length or of different lengths. 6. Positive displacement pump according to claim 1, characterized in that
the ribs and channels are arranged at least partially, in particular fully, in segmented form, wherein it is possible for the individual segments to have ribs and channels of different heights and widths. 7. Positive displacement pump according to claim 1, characterized in that
the ribs are designed at least partially, in particular fully, in honeycomb form, wherein the honeycomb boundary interrupts the ribs and channels. 8. Positive displacement pump according to claim 1, characterized in that
at least one of the ribs, preferably all the ribs, in a single segment, in particular all the ribs, are pointed and at least one of the channels, preferably all the channels, in a single segment, in particular all the channels, are round. 9. Positive displacement pump according to claim 1, characterized in that
at least one of the ribs, preferably all the ribs, in a single segment, in particular all the ribs, and at least one of the channels, preferably all the channels, in a single segment, in particular all the channels, are triangular and/or trapezoidal. 10. Positive displacement pump according to claim 1, characterized in that
the ribs have a height from 0.3 to 1000 μm, preferably between 30 and 300 μm. 11. Positive displacement pump according to claim 4, characterized in that
the ribs have a height between 30% and 120%, preferably between 50% and 100%, of the distance from an adjacent rib. 12. Positive displacement pump according to claim 3, characterized in that
the ribs have a width from 0.3 μm to 1000 μm, preferably 25 μm to 300 μm, in particular 35 μm to 200 μm. 13. Positive displacement pump according to claim 3, characterized in that
the channels have a width from 0.3 μm to 1000 μm, preferably 25 μm to 300 μm, in particular 35 μm to 200 μm, wherein the channels are preferably rounded and/or taper in relation to the ribs in particular at an acute angle of smaller than, or equal to, 75°, in particular smaller than, or equal to, 60°. 14. Method for producing an at least partially microstructured surface of an element of a positive displacement pump, in particular of a delivery chamber, working chamber, of lines and/or bores in the pump, of a displacing piston, of a valve, of a line and/or a seal, preferably of a positive displacement pump according to claim 1, characterized in that
a microstructured film is adhesively bonded to the surface and/or the microstructured surface is produced by casting or injection moulding and/or by imprinting and/or by machining, in particular milling, and/or a lacquer applied to the surface is structured and/or the structure is produced using a pulsed laser beam or using fine jet plasma. 15. Use of microstructured surfaces for optimizing the harmful volume of pumps and/or for reducing noise or vibration in pumps, in particular by coating the delivery chamber, the working chamber, lines and/or bores in the pump, the displacing piston, the diaphragm and/or seals of the pump, preferably in a positive displacement pump according to claim 3. | 3,700 |
347,126 | 16,805,613 | 3,745 | A charging kit for inductively charging a rechargeable hearing instrument having an inductive coil, includes: a base unit having a first cavity; and an adapter configured to be received by the first cavity, wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument; wherein the base unit is configured to determine a characteristic of the inductive coil of the hearing instrument; wherein the base unit is configured to provide a current by the base unit based at least in part on the determined characteristic of the inductive coil; and wherein the base unit is configured to inductively charge the rechargeable hearing instrument. | 1. A charging kit for inductively charging a rechargeable hearing instrument having an inductive coil, comprising:
a base unit having a first cavity; and an adapter configured to be received by the first cavity, wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument; wherein the base unit is configured to determine a characteristic of the inductive coil of the hearing instrument; wherein the base unit is configured to provide a current by the base unit based at least in part on the determined characteristic of the inductive coil; and wherein the base unit is configured to inductively charge the rechargeable hearing instrument. 2. The charging kit of claim 1, wherein the base unit is configured to determine the characteristic of the inductive coil of the hearing instrument by determining an operational frequency of the inductive coil of the hearing instrument. 3. The charging kit of claim 2, wherein the operational frequency of the inductive coil of the hearing instrument is anywhere between 1 and 100 kHz. 4. The charging kit of claim 2, wherein the base unit is configured to determine the operational frequency of the inductive coil by receiving information associated with the operational frequency of the inductive coil, the information transmitted by the hearing instrument. 5. The charging kit of claim 4, wherein the information associated with the operational frequency of the inductive coil comprises a device ID of the hearing instrument. 6. The charging kit of claim 1, wherein the base unit is configured to establish a wireless connection with the hearing instrument. 7. The charging kit of claim 1, wherein the base unit is configured to receive a device ID of the hearing instrument by the base unit. 8. The charging kit of claim 7, wherein the base unit is configured to:
select an operational frequency value from a set of operation frequency values stored in a memory of the base unit based on the device ID of the hearing instrument; and supply AC current at the selected operational frequency value to an adapter inductive coil of the adapter. 9. The charging kit of claim 1, wherein the base unit is configured to supply AC current at at least two different frequencies to an adapter inductive coil of the adapter. 10. The charging kit of claim 1, wherein the base unit is configured to discontinue a charging scheme if an inductive energy supply for the hearing instrument results in an energy level of a battery of the rechargeable hearing instrument increasing by a value that exceeds a predetermined energy amount. 11. The charging kit of claim 10, wherein the predetermined energy amount is 10 mAh. 12. The charging kit of claim 1, wherein the charging kit is configured to reset the base unit and/or the adapter. 13. The charging kit of claim 1, wherein the base unit and/or the adapter is configured to connect with the hearing instrument and via a 2.4 GHz wireless link. 14. The charging kit of claim 1, wherein the current provided by the base unit has a characteristic that corresponds with the determined characteristic of the inductive coil of the hearing instrument. 15. The charging kit of claim 1, wherein the adapter is configured to receive energy from the base unit when the adapter is received in the first cavity, and wherein the adapter comprises an adapter inductive coil. 16. A method for inductively charging a rechargeable hearing instrument having an inductive coil, the method being performed by a charging kit comprising a base unit having a first cavity, and an adapter configured to be received by the first cavity, and wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument, the method comprising:
receiving the hearing instrument by the second cavity of the adapter; 17. The method of claim 16, wherein the act of determining the characteristic of the inductive coil of the hearing instrument comprises determining an operational frequency of the inductive coil of the hearing instrument. 18. The method of claim 17, wherein the operational frequency of the inductive coil of the hearing instrument is anywhere between 1 and 100 kHz. 19. The method of claim 17, wherein the act of determining the operational frequency of the inductive coil comprises receiving, by the base unit, information associated with the operational frequency of the inductive coil, the information being transmitted by the hearing instrument. 20. The method of claim 19, wherein the information associated with the operational frequency of the inductive coil comprises a device ID of the hearing instrument. 21. The method of claim 16, further comprising establishing a wireless connection between the hearing instrument and the base unit. 22. The method of claim 16, further comprising receiving a device ID of the hearing instrument by the base unit. 23. The method of claim 22, further comprising:
selecting an operational frequency value from a set of operation frequency values stored in a memory of the base unit based on the device ID of the hearing instrument; and supplying AC current at the selected operational frequency value to an adapter inductive coil of the adapter. 24. The method of claim 17, wherein the act of determining the operational frequency of the inductive coil comprises supplying AC current at at least two different frequencies to an adapter inductive coil of the adapter. 25. The method of claim 16, further comprising discontinuing a charging scheme if an inductive energy supply for the hearing instrument results in an energy level of a battery of the rechargeable hearing instrument increasing by a value that exceeds a predetermined energy amount. 26. The method of claim 25, wherein the predetermined energy amount is 10 mAh. 27. The method of claim 16, further comprising resetting the base unit and/or the adapter. 28. The method of claim 16, wherein the base unit and/or the adapter is connected with the hearing instrument and via a 2.4 GHz wireless link. 29. The method of claim 16, wherein the current provided by the base unit has a characteristic that corresponds with the determined characteristic of the inductive coil of the hearing instrument. 30. The method of claim 16, wherein the adapter is configured to receive energy from the base unit when the adapter is received in the first cavity, and wherein the adapter comprises an adapter inductive coil. | A charging kit for inductively charging a rechargeable hearing instrument having an inductive coil, includes: a base unit having a first cavity; and an adapter configured to be received by the first cavity, wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument; wherein the base unit is configured to determine a characteristic of the inductive coil of the hearing instrument; wherein the base unit is configured to provide a current by the base unit based at least in part on the determined characteristic of the inductive coil; and wherein the base unit is configured to inductively charge the rechargeable hearing instrument.1. A charging kit for inductively charging a rechargeable hearing instrument having an inductive coil, comprising:
a base unit having a first cavity; and an adapter configured to be received by the first cavity, wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument; wherein the base unit is configured to determine a characteristic of the inductive coil of the hearing instrument; wherein the base unit is configured to provide a current by the base unit based at least in part on the determined characteristic of the inductive coil; and wherein the base unit is configured to inductively charge the rechargeable hearing instrument. 2. The charging kit of claim 1, wherein the base unit is configured to determine the characteristic of the inductive coil of the hearing instrument by determining an operational frequency of the inductive coil of the hearing instrument. 3. The charging kit of claim 2, wherein the operational frequency of the inductive coil of the hearing instrument is anywhere between 1 and 100 kHz. 4. The charging kit of claim 2, wherein the base unit is configured to determine the operational frequency of the inductive coil by receiving information associated with the operational frequency of the inductive coil, the information transmitted by the hearing instrument. 5. The charging kit of claim 4, wherein the information associated with the operational frequency of the inductive coil comprises a device ID of the hearing instrument. 6. The charging kit of claim 1, wherein the base unit is configured to establish a wireless connection with the hearing instrument. 7. The charging kit of claim 1, wherein the base unit is configured to receive a device ID of the hearing instrument by the base unit. 8. The charging kit of claim 7, wherein the base unit is configured to:
select an operational frequency value from a set of operation frequency values stored in a memory of the base unit based on the device ID of the hearing instrument; and supply AC current at the selected operational frequency value to an adapter inductive coil of the adapter. 9. The charging kit of claim 1, wherein the base unit is configured to supply AC current at at least two different frequencies to an adapter inductive coil of the adapter. 10. The charging kit of claim 1, wherein the base unit is configured to discontinue a charging scheme if an inductive energy supply for the hearing instrument results in an energy level of a battery of the rechargeable hearing instrument increasing by a value that exceeds a predetermined energy amount. 11. The charging kit of claim 10, wherein the predetermined energy amount is 10 mAh. 12. The charging kit of claim 1, wherein the charging kit is configured to reset the base unit and/or the adapter. 13. The charging kit of claim 1, wherein the base unit and/or the adapter is configured to connect with the hearing instrument and via a 2.4 GHz wireless link. 14. The charging kit of claim 1, wherein the current provided by the base unit has a characteristic that corresponds with the determined characteristic of the inductive coil of the hearing instrument. 15. The charging kit of claim 1, wherein the adapter is configured to receive energy from the base unit when the adapter is received in the first cavity, and wherein the adapter comprises an adapter inductive coil. 16. A method for inductively charging a rechargeable hearing instrument having an inductive coil, the method being performed by a charging kit comprising a base unit having a first cavity, and an adapter configured to be received by the first cavity, and wherein the adapter comprises a second cavity configured to receive the rechargeable hearing instrument, the method comprising:
receiving the hearing instrument by the second cavity of the adapter; 17. The method of claim 16, wherein the act of determining the characteristic of the inductive coil of the hearing instrument comprises determining an operational frequency of the inductive coil of the hearing instrument. 18. The method of claim 17, wherein the operational frequency of the inductive coil of the hearing instrument is anywhere between 1 and 100 kHz. 19. The method of claim 17, wherein the act of determining the operational frequency of the inductive coil comprises receiving, by the base unit, information associated with the operational frequency of the inductive coil, the information being transmitted by the hearing instrument. 20. The method of claim 19, wherein the information associated with the operational frequency of the inductive coil comprises a device ID of the hearing instrument. 21. The method of claim 16, further comprising establishing a wireless connection between the hearing instrument and the base unit. 22. The method of claim 16, further comprising receiving a device ID of the hearing instrument by the base unit. 23. The method of claim 22, further comprising:
selecting an operational frequency value from a set of operation frequency values stored in a memory of the base unit based on the device ID of the hearing instrument; and supplying AC current at the selected operational frequency value to an adapter inductive coil of the adapter. 24. The method of claim 17, wherein the act of determining the operational frequency of the inductive coil comprises supplying AC current at at least two different frequencies to an adapter inductive coil of the adapter. 25. The method of claim 16, further comprising discontinuing a charging scheme if an inductive energy supply for the hearing instrument results in an energy level of a battery of the rechargeable hearing instrument increasing by a value that exceeds a predetermined energy amount. 26. The method of claim 25, wherein the predetermined energy amount is 10 mAh. 27. The method of claim 16, further comprising resetting the base unit and/or the adapter. 28. The method of claim 16, wherein the base unit and/or the adapter is connected with the hearing instrument and via a 2.4 GHz wireless link. 29. The method of claim 16, wherein the current provided by the base unit has a characteristic that corresponds with the determined characteristic of the inductive coil of the hearing instrument. 30. The method of claim 16, wherein the adapter is configured to receive energy from the base unit when the adapter is received in the first cavity, and wherein the adapter comprises an adapter inductive coil. | 3,700 |
347,127 | 16,805,634 | 3,745 | Detecting a pathogen may include introducing a nonmagnetic metal into the sample where the nonmagnetic metal includes an antibody that is specific to the pathogen to form a complex of the nonmagnetic metal and the pathogen, removing the nonmagnetic metal that is not complexed with the pathogen from the sample, and detecting the presence of the nonmagnetic metal in the sample where the presence of the nonmagnetic metal indicates the presence of the pathogen. | 1. A method for detecting a pathogen in a sample, comprising:
introducing a nonmagnetic metal into the sample, the nonmagnetic metal coupled to an anti-pathogen antibody that is specific for the pathogen and configured to form a complex of the nonmagnetic metal and the pathogen; removing free nonmagnetic metal from the sample, wherein the free nonmagnetic metal is not forming the complex; detecting a presence of the nonmagnetic metal in the sample; and determining a concentration of the pathogen in the sample based on the presence of the nonmagnetic metal. 2. The method of claim 1, wherein the nonmagnetic metal includes at least one non-ferrous metal nanoshell. 3. The method of claim 2, wherein the nonmagnetic metal includes gold. 4. The method of claim 1, further comprising collecting the complex of the nonmagnetic metal and the pathogen on a surface of an electrode. 5. The method of claim 4, wherein the complex further includes magnetic objects that are complexed with the anti-pathogen antibody. 6. The method of claim 5, wherein detecting the presence of the nonmagnetic metal in the sample includes performing voltammetry on the electrode. 7. The method of claim 6, wherein detecting the presence of the nonmagnetic metal in the sample includes comparing a signal from the voltammetry to signals from other samples known to contain the pathogen. 8. The method of claim 5, further including introducing the magnetic objects into the sample prior to introducing the nonmagnetic metal. 9. The method of claim 8, further comprising magnetically separating immunocaptured complex from a remaining portion of the sample, the immunocaptured complex including the magnetic objects, the nonmagnetic metal, the pathogen, and the anti-pathogen antibody. 10. The method of claim 8, further comprising holding the magnetic objects in place within a tube with a magnet while removing non-target debris from the tube. 11. The method of claim 1, further comprising depositing a portion of the nonmagnetic metal bound to the pathogen on an electrode through an aqueous solution and drying the electrode with the deposited nonmagnetic metal bound to the pathogen. 12. The method of claim 11, wherein determining the concentration of the pathogen in the sample based on the presence of the nonmagnetic metal comprises:
placing a solution containing charge carriers on the electrode; passing an electrical signal through the electrode; measuring a resulting electrical characteristic of the electrical signal; and comparing the resulting electrical characteristic to a database of electrical characteristics of known pathogens concentrations to determine the presence of a pathogen in the sample. 13. A system for detecting at least one pathogen in a sample, comprising:
a first antibody coupled to a nonmagnetic metal; a second antibody coupled to a magnetic object, wherein the first and second antibodies are configured to form a complex comprising a pathogen, the nonmagnetic metal and the magnetic object; a sample mixing chamber for receiving the sample; a magnet selectively positionable to be adjacent the sample mixing chamber; an electrode in selective communication with the sample mixing chamber, the nonmagnetic metal configured to associate with the electrode; and a voltmeter in electrical communication with the electrode. 14. The system of claim 13, wherein the first antibody and the second antibody are each specific for the pathogen. 15. The system of claim 13, wherein the first antibody is specific for the pathogen and the second antibody is specific to the Fc region of the first antibody. 16. A method for detecting a pathogen in a sample, comprising:
binding a pathogen to a magnetic object by introducing the magnetic object into the sample, wherein the magnetic object is complexed with a first antibody that is specific to the pathogen to form a first complex; forming a second complex including the first complex and a nonmagnetic metal by introducing the nonmagnetic metal into the sample with the first complex, wherein the nonmagnetic metal is complexed with a second antibody specific to the pathogen; retaining the second complex in the sample with a magnet; removing a portion of the nonmagnetic metal not incorporated into the second complex; and detecting the presence of the nonmagnetic metal in the sample, wherein the presence of the nonmagnetic material indicates the presence of the pathogen. 17. The method of claim 16, wherein the specificity of the first antibody and the second antibody are to the same epitopes of the pathogen. 18. The method of claim 16, further comprising depositing the second complex on an electrode through an aqueous solution. 19. The method of claim 18, further comprising determining a concentration of the pathogen in the sample based on the presence of the nonmagnetic metal. 20. The method of claim 19, wherein determining the concentration of the pathogen in the sample based on the presence of the nonmagnetic metal comprises:
passing an electrical signal through the electrode; measuring a resulting electrical characteristic of the electrical signal; and comparing the resulting electrical characteristic to a database of electrical signals of known pathogens concentrations to determine the concentration of the pathogen in the sample. | Detecting a pathogen may include introducing a nonmagnetic metal into the sample where the nonmagnetic metal includes an antibody that is specific to the pathogen to form a complex of the nonmagnetic metal and the pathogen, removing the nonmagnetic metal that is not complexed with the pathogen from the sample, and detecting the presence of the nonmagnetic metal in the sample where the presence of the nonmagnetic metal indicates the presence of the pathogen.1. A method for detecting a pathogen in a sample, comprising:
introducing a nonmagnetic metal into the sample, the nonmagnetic metal coupled to an anti-pathogen antibody that is specific for the pathogen and configured to form a complex of the nonmagnetic metal and the pathogen; removing free nonmagnetic metal from the sample, wherein the free nonmagnetic metal is not forming the complex; detecting a presence of the nonmagnetic metal in the sample; and determining a concentration of the pathogen in the sample based on the presence of the nonmagnetic metal. 2. The method of claim 1, wherein the nonmagnetic metal includes at least one non-ferrous metal nanoshell. 3. The method of claim 2, wherein the nonmagnetic metal includes gold. 4. The method of claim 1, further comprising collecting the complex of the nonmagnetic metal and the pathogen on a surface of an electrode. 5. The method of claim 4, wherein the complex further includes magnetic objects that are complexed with the anti-pathogen antibody. 6. The method of claim 5, wherein detecting the presence of the nonmagnetic metal in the sample includes performing voltammetry on the electrode. 7. The method of claim 6, wherein detecting the presence of the nonmagnetic metal in the sample includes comparing a signal from the voltammetry to signals from other samples known to contain the pathogen. 8. The method of claim 5, further including introducing the magnetic objects into the sample prior to introducing the nonmagnetic metal. 9. The method of claim 8, further comprising magnetically separating immunocaptured complex from a remaining portion of the sample, the immunocaptured complex including the magnetic objects, the nonmagnetic metal, the pathogen, and the anti-pathogen antibody. 10. The method of claim 8, further comprising holding the magnetic objects in place within a tube with a magnet while removing non-target debris from the tube. 11. The method of claim 1, further comprising depositing a portion of the nonmagnetic metal bound to the pathogen on an electrode through an aqueous solution and drying the electrode with the deposited nonmagnetic metal bound to the pathogen. 12. The method of claim 11, wherein determining the concentration of the pathogen in the sample based on the presence of the nonmagnetic metal comprises:
placing a solution containing charge carriers on the electrode; passing an electrical signal through the electrode; measuring a resulting electrical characteristic of the electrical signal; and comparing the resulting electrical characteristic to a database of electrical characteristics of known pathogens concentrations to determine the presence of a pathogen in the sample. 13. A system for detecting at least one pathogen in a sample, comprising:
a first antibody coupled to a nonmagnetic metal; a second antibody coupled to a magnetic object, wherein the first and second antibodies are configured to form a complex comprising a pathogen, the nonmagnetic metal and the magnetic object; a sample mixing chamber for receiving the sample; a magnet selectively positionable to be adjacent the sample mixing chamber; an electrode in selective communication with the sample mixing chamber, the nonmagnetic metal configured to associate with the electrode; and a voltmeter in electrical communication with the electrode. 14. The system of claim 13, wherein the first antibody and the second antibody are each specific for the pathogen. 15. The system of claim 13, wherein the first antibody is specific for the pathogen and the second antibody is specific to the Fc region of the first antibody. 16. A method for detecting a pathogen in a sample, comprising:
binding a pathogen to a magnetic object by introducing the magnetic object into the sample, wherein the magnetic object is complexed with a first antibody that is specific to the pathogen to form a first complex; forming a second complex including the first complex and a nonmagnetic metal by introducing the nonmagnetic metal into the sample with the first complex, wherein the nonmagnetic metal is complexed with a second antibody specific to the pathogen; retaining the second complex in the sample with a magnet; removing a portion of the nonmagnetic metal not incorporated into the second complex; and detecting the presence of the nonmagnetic metal in the sample, wherein the presence of the nonmagnetic material indicates the presence of the pathogen. 17. The method of claim 16, wherein the specificity of the first antibody and the second antibody are to the same epitopes of the pathogen. 18. The method of claim 16, further comprising depositing the second complex on an electrode through an aqueous solution. 19. The method of claim 18, further comprising determining a concentration of the pathogen in the sample based on the presence of the nonmagnetic metal. 20. The method of claim 19, wherein determining the concentration of the pathogen in the sample based on the presence of the nonmagnetic metal comprises:
passing an electrical signal through the electrode; measuring a resulting electrical characteristic of the electrical signal; and comparing the resulting electrical characteristic to a database of electrical signals of known pathogens concentrations to determine the concentration of the pathogen in the sample. | 3,700 |
347,128 | 16,805,615 | 3,745 | Embodiments of the present technology pertain to a system for hyper-localized immobilization of a bone structures. In various embodiments the system includes a power supply, the power supply being internal or external to a patient and allowing for variable control of electric current from the power supply. Embodiments further include a first micro-electromagnet being internal to the patient and being placed in a first bracket that is secured to a first side of the bone structure generating half of an electromagnetic attractive force that will immobilize the other bone structure when a second micro-electromagnet being internal to the patient is placed in a second bracket that is secured to a second side of the bone structure generating the electromagnetic attractive force that immobilizes the bone structure. This method could be applied to stabilize or fixate bone fracture sites when electromagnets leverage attractive forces. | 1. A system for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the system comprising:
a power supply, the power supply generating variable electric current supplied to micro-electromagnets connected to the power supply; a first micro-electromagnet being internal to the patient and being placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and a second micro-electromagnet being internal to the patient and being placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 2. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 3. The system of claim 2,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 4. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 5. The system of claim 1, wherein the power supply provides increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 6. The system of claim 1, wherein the power supply provides decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 7. The system of claim 1,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 8. The system of claim 1,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 9. The system of claim 1, further comprising:
a first plurality of micro-electromagnets being internal to the patient and being secured to the first side of the surrounding bone structures of the bone fracture injury site, the first plurality of micro-electromagnets enhancing electromagnetic fields of the first micro-electromagnet; and a second plurality of micro-electromagnets being internal to the patient and being secured to the second side of the surrounding bone structures of the bone fracture injury site, the second plurality of micro-electromagnets enhancing electromagnetic fields of the second micro-electromagnet. 10. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 11. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 12. The method of claim 11,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 13. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 14. The method of claim 10, further comprising:
generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 15. The method of claim 10, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 16. The method of claim 10,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 17. The method of claim 10,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 18. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing; and generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 19. The method of claim 18, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 20. The method of claim 19, further comprising treating the patient with stem cell therapy to promote accelerated healing of fractured bone of the bone fracture injury site. | Embodiments of the present technology pertain to a system for hyper-localized immobilization of a bone structures. In various embodiments the system includes a power supply, the power supply being internal or external to a patient and allowing for variable control of electric current from the power supply. Embodiments further include a first micro-electromagnet being internal to the patient and being placed in a first bracket that is secured to a first side of the bone structure generating half of an electromagnetic attractive force that will immobilize the other bone structure when a second micro-electromagnet being internal to the patient is placed in a second bracket that is secured to a second side of the bone structure generating the electromagnetic attractive force that immobilizes the bone structure. This method could be applied to stabilize or fixate bone fracture sites when electromagnets leverage attractive forces.1. A system for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the system comprising:
a power supply, the power supply generating variable electric current supplied to micro-electromagnets connected to the power supply; a first micro-electromagnet being internal to the patient and being placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and a second micro-electromagnet being internal to the patient and being placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 2. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 3. The system of claim 2,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 4. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 5. The system of claim 1, wherein the power supply provides increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 6. The system of claim 1, wherein the power supply provides decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 7. The system of claim 1,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 8. The system of claim 1,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 9. The system of claim 1, further comprising:
a first plurality of micro-electromagnets being internal to the patient and being secured to the first side of the surrounding bone structures of the bone fracture injury site, the first plurality of micro-electromagnets enhancing electromagnetic fields of the first micro-electromagnet; and a second plurality of micro-electromagnets being internal to the patient and being secured to the second side of the surrounding bone structures of the bone fracture injury site, the second plurality of micro-electromagnets enhancing electromagnetic fields of the second micro-electromagnet. 10. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 11. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 12. The method of claim 11,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 13. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 14. The method of claim 10, further comprising:
generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 15. The method of claim 10, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 16. The method of claim 10,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 17. The method of claim 10,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 18. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing; and generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 19. The method of claim 18, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 20. The method of claim 19, further comprising treating the patient with stem cell therapy to promote accelerated healing of fractured bone of the bone fracture injury site. | 3,700 |
347,129 | 16,805,627 | 3,745 | Embodiments of the present technology pertain to a system for hyper-localized immobilization of a bone structures. In various embodiments the system includes a power supply, the power supply being internal or external to a patient and allowing for variable control of electric current from the power supply. Embodiments further include a first micro-electromagnet being internal to the patient and being placed in a first bracket that is secured to a first side of the bone structure generating half of an electromagnetic attractive force that will immobilize the other bone structure when a second micro-electromagnet being internal to the patient is placed in a second bracket that is secured to a second side of the bone structure generating the electromagnetic attractive force that immobilizes the bone structure. This method could be applied to stabilize or fixate bone fracture sites when electromagnets leverage attractive forces. | 1. A system for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the system comprising:
a power supply, the power supply generating variable electric current supplied to micro-electromagnets connected to the power supply; a first micro-electromagnet being internal to the patient and being placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and a second micro-electromagnet being internal to the patient and being placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 2. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 3. The system of claim 2,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 4. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 5. The system of claim 1, wherein the power supply provides increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 6. The system of claim 1, wherein the power supply provides decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 7. The system of claim 1,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 8. The system of claim 1,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 9. The system of claim 1, further comprising:
a first plurality of micro-electromagnets being internal to the patient and being secured to the first side of the surrounding bone structures of the bone fracture injury site, the first plurality of micro-electromagnets enhancing electromagnetic fields of the first micro-electromagnet; and a second plurality of micro-electromagnets being internal to the patient and being secured to the second side of the surrounding bone structures of the bone fracture injury site, the second plurality of micro-electromagnets enhancing electromagnetic fields of the second micro-electromagnet. 10. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 11. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 12. The method of claim 11,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 13. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 14. The method of claim 10, further comprising:
generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 15. The method of claim 10, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 16. The method of claim 10,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 17. The method of claim 10,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 18. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing; and generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 19. The method of claim 18, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 20. The method of claim 19, further comprising treating the patient with stem cell therapy to promote accelerated healing of fractured bone of the bone fracture injury site. | Embodiments of the present technology pertain to a system for hyper-localized immobilization of a bone structures. In various embodiments the system includes a power supply, the power supply being internal or external to a patient and allowing for variable control of electric current from the power supply. Embodiments further include a first micro-electromagnet being internal to the patient and being placed in a first bracket that is secured to a first side of the bone structure generating half of an electromagnetic attractive force that will immobilize the other bone structure when a second micro-electromagnet being internal to the patient is placed in a second bracket that is secured to a second side of the bone structure generating the electromagnetic attractive force that immobilizes the bone structure. This method could be applied to stabilize or fixate bone fracture sites when electromagnets leverage attractive forces.1. A system for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the system comprising:
a power supply, the power supply generating variable electric current supplied to micro-electromagnets connected to the power supply; a first micro-electromagnet being internal to the patient and being placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and a second micro-electromagnet being internal to the patient and being placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 2. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 3. The system of claim 2,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 4. The system of claim 1,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 5. The system of claim 1, wherein the power supply provides increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 6. The system of claim 1, wherein the power supply provides decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 7. The system of claim 1,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 8. The system of claim 1,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 9. The system of claim 1, further comprising:
a first plurality of micro-electromagnets being internal to the patient and being secured to the first side of the surrounding bone structures of the bone fracture injury site, the first plurality of micro-electromagnets enhancing electromagnetic fields of the first micro-electromagnet; and a second plurality of micro-electromagnets being internal to the patient and being secured to the second side of the surrounding bone structures of the bone fracture injury site, the second plurality of micro-electromagnets enhancing electromagnetic fields of the second micro-electromagnet. 10. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; and receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing. 11. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using epoxy and bone meal. 12. The method of claim 11,
wherein the first side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a male coupling joint; and wherein the second side of the surrounding bone structures of the bone fracture injury site is mechanically scored for enhanced healing of the bone fracture injury site and to create a female coupling joint. 13. The method of claim 10,
wherein the first bracket is secured to the first side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light; and wherein the second bracket is secured to the second side of the surrounding bone structures of the bone fracture injury site using dental resin cured using ultraviolet light. 14. The method of claim 10, further comprising:
generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 15. The method of claim 10, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 16. The method of claim 10,
wherein the first micro-electromagnet placed within the first bracket that is secured to the first side of the surrounding bone structures of the bone fracture injury site is square shaped; and wherein the second micro-electromagnet placed within the second bracket that is secured to the second side of the surrounding bone structures of the bone fracture injury site is square shaped. 17. The method of claim 10,
wherein fractured bone of the bone fracture injury site is treated with stems cells to enhance healing of the bone fracture injury site. 18. A method for hyper-localized immobilization, stabilization, and/or fixation of bone structures using micro-electromagnets secured to surrounding bone structures of a bone fracture injury site causing accelerated healing for a patient, the method comprising:
generating variable electric current, using a power supply, the variable electric current being supplied to micro-electromagnets connected to the power supply; receiving the variable electric current at a first micro-electromagnet that is internal to the patient and placed within a first bracket that is secured to a first side of the surrounding bone structures of the bone fracture injury site, the first micro-electromagnet being electronically connected to a positive lead connected to the power supply, the positive lead receiving the variable electric current from the power supply causing a first half of an electromagnetic attractive force that immobilizes the bone fracture injury site and a first part of an electromagnetic repulsive force that creates bone spacing; receiving the variable electric current at a second micro-electromagnet that is internal to the patient and is placed within a second bracket that is secured to a second side of the surrounding bone structures of the bone fracture injury site, the second micro-electromagnet being electrically connected to a negative lead connected to the power supply, the negative lead receiving the variable electric current from the power supply causing a second half of the electromagnetic attractive force that immobilizes the bone fracture injury site and a second part of the electromagnetic repulsive force that creates bone spacing; and generating, using the power supply, increased electric current relative to a baseline of electric current, the increased electric current causing increased pressure at the bone fracture injury site relative to a baseline pressure that enhances immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 19. The method of claim 18, further comprising:
generating, using the power supply, decreased electric current relative to a baseline of electric current, the decreased electric current causing decreased pressure at the bone fracture injury site relative to a baseline pressure that diminishes immobilization of fractured bone of the bone fracture injury site allowing for personalized healing of the bone fracture injury site. 20. The method of claim 19, further comprising treating the patient with stem cell therapy to promote accelerated healing of fractured bone of the bone fracture injury site. | 3,700 |
347,130 | 16,805,619 | 3,745 | A memory system includes a link having at least one signal line and a controller. The controller includes at least one transmitter coupled to the link to transmit first data, and a first error protection generator coupled to the transmitter. The first error protection generator dynamically adds an error detection code to at least a portion of the first data. At least one receiver is coupled to the link to receive second data. A first error detection logic determines if the second data received by the controller contains at least one error and, if an error is detected, asserts a first error condition. The system includes a memory device having at least one memory device transmitter coupled to the link to transmit the second data. A second error protection generator coupled to the memory device transmitter dynamically adds an error detection code to at least a portion of the second data. | 1. (canceled) 2. A memory device, comprising:
at least one memory array; interface circuitry to receive, from a memory controller, write commands, associated data, and information with which to detect an error in the write commands; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one memory array; and error detection circuitry to detect existence of error in a write command in dependence on the information, and to prevent the writing of the associated data into the at least one memory array upon detection of the error. 3. The memory device of claim 2, wherein each array of the at least one memory array comprises one or more arrays of dynamic random access memory (DRAM) cells. 4. The memory device of claim 2, wherein the memory device further comprises circuitry to communicate information identifying the existence of the error to the memory controller. 5. The memory device of claim 4, wherein the circuitry to communicate the information identifying the existence of the error is to do so unsolicitedly, via a link not used for exchange of write data or read data with the memory controller. 6. The memory device of claim 2, wherein the information is parity information. 7. The memory device of claim 2, wherein the interface circuitry is to receive an error correction code corresponding to the associated data, and wherein the memory device comprises circuitry to correct at least one detected error in the associated data in dependence on the error correction code. 8. The memory device of claim 7, wherein the error correction code is a cyclic code. 9. The memory device of claim 2, further comprising a deserializer, wherein the memory device is to deserialize the command with the deserializer, to generate deserialized information, and is to detect the existence of the error from the deserialized information. 10. The memory device of claim 2, wherein:
the memory device comprises a buffer to queue the write commands for a predetermined period of time corresponding to an integer number of symbol transmission periods; and the array control circuitry, in absence of detection of error in the write commands by the error detection circuitry, is to write the associated data into the at least one memory array for the queued write commands. 11. The memory device of claim 2, wherein each of the write commands comprises first fields and second fields, and wherein the information identifies the existence of the error in the first fields only but does not permit correction of the error in the first fields. 12. A memory device, comprising:
at least one dynamic random access memory (DRAM) array; interface circuitry to receive, from a memory controller, write commands, associated data, and information with which to detect an error in the commands; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one DRAM array; and error detection circuitry to detect existence of error in one or more of the write commands and to cause the memory device to ignore each erroneous command in dependence on the information, so as to prevent the writing of the associated data into the at least one DRAM array. 13. The memory device of claim 12, wherein the memory device further comprises circuitry to communicate information identifying the existence of the error to the memory controller. 14. The memory device of claim 13, wherein the circuitry to communicate the information identifying the existence of the error is to do so unsolicitedly, via a link not used for exchange of write data or read data with the memory controller. 15. The memory device of claim 12, wherein the information is parity information. 16. The memory device of claim 12, wherein the interface circuitry is to receive an error correction code corresponding to the associated data, and wherein the memory device comprises circuitry to correct at least one detected error in the associated data in dependence on the error correction code. 17. The memory device of claim 16, wherein the error correction code is a cyclic code. 18. The memory device of claim 12, further comprising a deserializer, wherein the memory device is to deserialize the command with the deserializer, to generate deserialized information, and is to detect the existence of the error from the deserialized information. 19. The memory device of claim 2, wherein:
the memory device comprises a buffer to queue the write commands for a predetermined period of time, comprising an integer number of symbol transmission periods; and the array control circuitry, in absence of detection of error in the write commands by the error detection circuitry, is to write the associated data into the at least one DRAM array for the queued write commands. 20. The memory device of claim 12, wherein each of the write commands comprises first fields and second fields, and wherein the information identifies the existence of the error in the first fields only but does not permit correction of the error in the first fields. 21. A memory device, comprising:
at least one dynamic random access memory (DRAM) array; interface circuitry to receive, from a memory controller, write commands, associated data, first information with which to detect an error in the commands, and second information with which to detect an error in the data; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one DRAM array; and error detection circuitry to
detect existence of error in one or more of the write commands and to cause the memory device to ignore each erroneous command in dependence on the respective first information, so as to prevent the writing of the associated data into the at least one DRAM array, and
correct existence of at least one error in the associated data in dependence on the second information, prior to writing the associated data into the at least one DRAM array. | A memory system includes a link having at least one signal line and a controller. The controller includes at least one transmitter coupled to the link to transmit first data, and a first error protection generator coupled to the transmitter. The first error protection generator dynamically adds an error detection code to at least a portion of the first data. At least one receiver is coupled to the link to receive second data. A first error detection logic determines if the second data received by the controller contains at least one error and, if an error is detected, asserts a first error condition. The system includes a memory device having at least one memory device transmitter coupled to the link to transmit the second data. A second error protection generator coupled to the memory device transmitter dynamically adds an error detection code to at least a portion of the second data.1. (canceled) 2. A memory device, comprising:
at least one memory array; interface circuitry to receive, from a memory controller, write commands, associated data, and information with which to detect an error in the write commands; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one memory array; and error detection circuitry to detect existence of error in a write command in dependence on the information, and to prevent the writing of the associated data into the at least one memory array upon detection of the error. 3. The memory device of claim 2, wherein each array of the at least one memory array comprises one or more arrays of dynamic random access memory (DRAM) cells. 4. The memory device of claim 2, wherein the memory device further comprises circuitry to communicate information identifying the existence of the error to the memory controller. 5. The memory device of claim 4, wherein the circuitry to communicate the information identifying the existence of the error is to do so unsolicitedly, via a link not used for exchange of write data or read data with the memory controller. 6. The memory device of claim 2, wherein the information is parity information. 7. The memory device of claim 2, wherein the interface circuitry is to receive an error correction code corresponding to the associated data, and wherein the memory device comprises circuitry to correct at least one detected error in the associated data in dependence on the error correction code. 8. The memory device of claim 7, wherein the error correction code is a cyclic code. 9. The memory device of claim 2, further comprising a deserializer, wherein the memory device is to deserialize the command with the deserializer, to generate deserialized information, and is to detect the existence of the error from the deserialized information. 10. The memory device of claim 2, wherein:
the memory device comprises a buffer to queue the write commands for a predetermined period of time corresponding to an integer number of symbol transmission periods; and the array control circuitry, in absence of detection of error in the write commands by the error detection circuitry, is to write the associated data into the at least one memory array for the queued write commands. 11. The memory device of claim 2, wherein each of the write commands comprises first fields and second fields, and wherein the information identifies the existence of the error in the first fields only but does not permit correction of the error in the first fields. 12. A memory device, comprising:
at least one dynamic random access memory (DRAM) array; interface circuitry to receive, from a memory controller, write commands, associated data, and information with which to detect an error in the commands; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one DRAM array; and error detection circuitry to detect existence of error in one or more of the write commands and to cause the memory device to ignore each erroneous command in dependence on the information, so as to prevent the writing of the associated data into the at least one DRAM array. 13. The memory device of claim 12, wherein the memory device further comprises circuitry to communicate information identifying the existence of the error to the memory controller. 14. The memory device of claim 13, wherein the circuitry to communicate the information identifying the existence of the error is to do so unsolicitedly, via a link not used for exchange of write data or read data with the memory controller. 15. The memory device of claim 12, wherein the information is parity information. 16. The memory device of claim 12, wherein the interface circuitry is to receive an error correction code corresponding to the associated data, and wherein the memory device comprises circuitry to correct at least one detected error in the associated data in dependence on the error correction code. 17. The memory device of claim 16, wherein the error correction code is a cyclic code. 18. The memory device of claim 12, further comprising a deserializer, wherein the memory device is to deserialize the command with the deserializer, to generate deserialized information, and is to detect the existence of the error from the deserialized information. 19. The memory device of claim 2, wherein:
the memory device comprises a buffer to queue the write commands for a predetermined period of time, comprising an integer number of symbol transmission periods; and the array control circuitry, in absence of detection of error in the write commands by the error detection circuitry, is to write the associated data into the at least one DRAM array for the queued write commands. 20. The memory device of claim 12, wherein each of the write commands comprises first fields and second fields, and wherein the information identifies the existence of the error in the first fields only but does not permit correction of the error in the first fields. 21. A memory device, comprising:
at least one dynamic random access memory (DRAM) array; interface circuitry to receive, from a memory controller, write commands, associated data, first information with which to detect an error in the commands, and second information with which to detect an error in the data; array control circuitry to, in fulfillment of the write commands, write the associated data into the at least one DRAM array; and error detection circuitry to
detect existence of error in one or more of the write commands and to cause the memory device to ignore each erroneous command in dependence on the respective first information, so as to prevent the writing of the associated data into the at least one DRAM array, and
correct existence of at least one error in the associated data in dependence on the second information, prior to writing the associated data into the at least one DRAM array. | 3,700 |
347,131 | 16,805,633 | 3,745 | An e-beam inspection tool is disclosed, the tool comprising, an electron optics system configured to generate an electron beam, an object table configured to hold a specimen, a positioning device configured to position the object table, the positioning device comprising an actuator, wherein the positioning device further comprises a heating device configured to generate a heat load and a heat load controller to control the generated heat load at least partly based on an actuator heat load generated in the actuator. | 1. An e-beam inspection tool comprising:
an electron optics system configured to generate an electron beam; an object table configured to hold a specimen; and a positioning device configured to position the object table, the positioning device comprising an actuator, wherein the positioning device further comprises a heating device configured to generate a heat load and a heat load controller to control the heat load generated at least partly based on an actuator heat load generated in the actuator, and wherein the heating device is mounted to the object table. 2. The e-beam inspection tool according to claim 1, wherein the positioning device comprises:
a first positioner configured to position the object table; and a second positioner configured to position the first positioner and the object table. 3. The e-beam inspection tool according to claim 2, wherein the actuator heat load comprises an actuator heat load by the first positioner. 4. The e-beam inspection tool according to claim 1, wherein the positioning device comprises a temperature sensor configured to output a temperature signal and the heat load controller is configured to control the heat load generated at least partly based on the temperature signal. 5. The e-beam inspection tool according to claim 4, wherein the heat load controller is configured to control the heat load generated so as to obtain a predetermined temperature of the object table. 6. The e-beam inspection tool according to claim 4, wherein the e-beam inspection tool further comprises a heatsink and the heatsink is configured to be kept at a substantially constant temperature. 7. The e-beam inspection tool according to claim 2, wherein the first positioner comprises a plurality of actuators and the heating device comprises a plurality of heating devices, at least one of the plurality of actuators comprising a heating device of the plurality of heating devices. 8. The e-beam inspection tool according to claim 7, wherein the at least one of the plurality of actuators comprises a magnetic shielding. 9. The e-beam inspection tool according to claim 7, wherein the heat load controller is configured to control a heat load distribution of the plurality of heating devices such that a combined heat load of the at least one of the plurality of actuators and the heating device associated remains substantially constant during an operating cycle of the e-beam inspection tool. 10. The e-beam inspection tool according to claim 1, wherein the e-beam inspection tool further comprises an electromagnetic shield comprising an absorptive coating. 11. A method of controlling heat load, the method comprising:
determining an actuator heat load of a positioning device; generating a heat load using a heating device arranged in the positioning device, the heating device is mounted to an object table; and controlling the heat load generated at least partly based on the actuator heat load. 12. The method of controlling heat load according to claim 11, wherein the heat load generated is controlled such that a combined heat load of the heat load generated and the actuator heat load remains substantially constant during an operating cycle of the positioning device. 13. The method of controlling heat load according to claim 11, wherein the heat load generated is controlled at least partly based on a trajectory and/or an actuation profile of the positioning device. 14. The method of controlling heat load according to claim 11, wherein the heat load generated is applied during a start-up of the positioning device in order to bring an object table to be positioned by the positioning device to a thermal equilibrium. | An e-beam inspection tool is disclosed, the tool comprising, an electron optics system configured to generate an electron beam, an object table configured to hold a specimen, a positioning device configured to position the object table, the positioning device comprising an actuator, wherein the positioning device further comprises a heating device configured to generate a heat load and a heat load controller to control the generated heat load at least partly based on an actuator heat load generated in the actuator.1. An e-beam inspection tool comprising:
an electron optics system configured to generate an electron beam; an object table configured to hold a specimen; and a positioning device configured to position the object table, the positioning device comprising an actuator, wherein the positioning device further comprises a heating device configured to generate a heat load and a heat load controller to control the heat load generated at least partly based on an actuator heat load generated in the actuator, and wherein the heating device is mounted to the object table. 2. The e-beam inspection tool according to claim 1, wherein the positioning device comprises:
a first positioner configured to position the object table; and a second positioner configured to position the first positioner and the object table. 3. The e-beam inspection tool according to claim 2, wherein the actuator heat load comprises an actuator heat load by the first positioner. 4. The e-beam inspection tool according to claim 1, wherein the positioning device comprises a temperature sensor configured to output a temperature signal and the heat load controller is configured to control the heat load generated at least partly based on the temperature signal. 5. The e-beam inspection tool according to claim 4, wherein the heat load controller is configured to control the heat load generated so as to obtain a predetermined temperature of the object table. 6. The e-beam inspection tool according to claim 4, wherein the e-beam inspection tool further comprises a heatsink and the heatsink is configured to be kept at a substantially constant temperature. 7. The e-beam inspection tool according to claim 2, wherein the first positioner comprises a plurality of actuators and the heating device comprises a plurality of heating devices, at least one of the plurality of actuators comprising a heating device of the plurality of heating devices. 8. The e-beam inspection tool according to claim 7, wherein the at least one of the plurality of actuators comprises a magnetic shielding. 9. The e-beam inspection tool according to claim 7, wherein the heat load controller is configured to control a heat load distribution of the plurality of heating devices such that a combined heat load of the at least one of the plurality of actuators and the heating device associated remains substantially constant during an operating cycle of the e-beam inspection tool. 10. The e-beam inspection tool according to claim 1, wherein the e-beam inspection tool further comprises an electromagnetic shield comprising an absorptive coating. 11. A method of controlling heat load, the method comprising:
determining an actuator heat load of a positioning device; generating a heat load using a heating device arranged in the positioning device, the heating device is mounted to an object table; and controlling the heat load generated at least partly based on the actuator heat load. 12. The method of controlling heat load according to claim 11, wherein the heat load generated is controlled such that a combined heat load of the heat load generated and the actuator heat load remains substantially constant during an operating cycle of the positioning device. 13. The method of controlling heat load according to claim 11, wherein the heat load generated is controlled at least partly based on a trajectory and/or an actuation profile of the positioning device. 14. The method of controlling heat load according to claim 11, wherein the heat load generated is applied during a start-up of the positioning device in order to bring an object table to be positioned by the positioning device to a thermal equilibrium. | 3,700 |
347,132 | 16,805,599 | 3,745 | A custom file system in a containerized software architecture facilitates the instantiation of application containers. Each container is composed of one or more application image layers. An application container instance includes read-only application image layer data shared among application container instances associated with the same application container. An application container instance may also include read/write application container instance data that is specific to the application container instance. | 1. A system comprising:
a memory; and at least one processor configured to: instantiate a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; and instantiate a second application container based, at least in part, on the first plurality of application image layers; and a private page cache configured to facilitate shared access of both the first application container and the second application container to the first plurality of application image layers. 2. The system of claim 1, further comprising a network interface configured to enable communications over a network. 3. The system of claim 1, wherein the processor is further configured to store the first plurality of application image layers. 4. The system of claim 1, wherein the plurality of application image layers comprises a stack of layers representing an application image. 5. The system of claim 1, wherein the second application container has a different hardware configuration than the first application container. 6. The system of claim 1 further comprising a database configured to store and maintain information associated with the first plurality of application layers. 7. The system of claim 6, wherein the database is configured to store a name, a checksum, time information, and an application identifier for each image layer of the first plurality of application image layers. 8. The system of claim 1, wherein the at least one processor is further configured to store a second plurality of application image layers associated with a second application. 9. The system of claim 8, wherein the at least one processor is further configured to instantiate a third application container based on the second plurality of application image layers. 10. The system of claim 1, wherein the first application container is a privileged storage container application. 11. The system of claim 1, wherein the memory and the at least one processor are included in a storage container node. 12. A method comprising:
instantiating, using at least one processor, a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; instantiating a second application container based, at least in part, on the first plurality of application image layers; and facilitating shared access of both the first application container and the second application container to the first plurality of application image layers via a private page cache. 13. The method of claim 12, further comprising:
identifying the first plurality of application image layers, the first plurality of application image layers being a stack of layers representing an application image. 14. The method of claim 13 further comprising:
identifying a second plurality of application image layers associated with a second application. 15. The method of claim 14 further comprising:
instantiating a third application container based on the second plurality of application image layers. 16. The method of claim 12, wherein the first application container is a privileged storage container application. 17. One or more non-transitory computer readable media having instructions stored thereon for performing a method, the method comprising:
instantiating, using at least one processor, a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; instantiating a second application container based, at least in part, on the first plurality of application image layers; and facilitating shared access of both the first application container and the second application container to the first plurality of application image layers via a private page cache. 18. The one or more non-transitory computer readable media recited in claim 17, wherein the method further comprises:
identifying the first plurality of application image layers, the first plurality of application image layers being a stack of layers representing an application image. 19. The one or more non-transitory computer readable media recited in claim 17, wherein the method further comprises:
identifying a second plurality of application image layers associated with a second application. 20. The one or more non-transitory computer readable media recited in claim 19, wherein the method further comprises:
instantiating a third application container based on the second plurality of application image layers. | A custom file system in a containerized software architecture facilitates the instantiation of application containers. Each container is composed of one or more application image layers. An application container instance includes read-only application image layer data shared among application container instances associated with the same application container. An application container instance may also include read/write application container instance data that is specific to the application container instance.1. A system comprising:
a memory; and at least one processor configured to: instantiate a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; and instantiate a second application container based, at least in part, on the first plurality of application image layers; and a private page cache configured to facilitate shared access of both the first application container and the second application container to the first plurality of application image layers. 2. The system of claim 1, further comprising a network interface configured to enable communications over a network. 3. The system of claim 1, wherein the processor is further configured to store the first plurality of application image layers. 4. The system of claim 1, wherein the plurality of application image layers comprises a stack of layers representing an application image. 5. The system of claim 1, wherein the second application container has a different hardware configuration than the first application container. 6. The system of claim 1 further comprising a database configured to store and maintain information associated with the first plurality of application layers. 7. The system of claim 6, wherein the database is configured to store a name, a checksum, time information, and an application identifier for each image layer of the first plurality of application image layers. 8. The system of claim 1, wherein the at least one processor is further configured to store a second plurality of application image layers associated with a second application. 9. The system of claim 8, wherein the at least one processor is further configured to instantiate a third application container based on the second plurality of application image layers. 10. The system of claim 1, wherein the first application container is a privileged storage container application. 11. The system of claim 1, wherein the memory and the at least one processor are included in a storage container node. 12. A method comprising:
instantiating, using at least one processor, a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; instantiating a second application container based, at least in part, on the first plurality of application image layers; and facilitating shared access of both the first application container and the second application container to the first plurality of application image layers via a private page cache. 13. The method of claim 12, further comprising:
identifying the first plurality of application image layers, the first plurality of application image layers being a stack of layers representing an application image. 14. The method of claim 13 further comprising:
identifying a second plurality of application image layers associated with a second application. 15. The method of claim 14 further comprising:
instantiating a third application container based on the second plurality of application image layers. 16. The method of claim 12, wherein the first application container is a privileged storage container application. 17. One or more non-transitory computer readable media having instructions stored thereon for performing a method, the method comprising:
instantiating, using at least one processor, a first application container based on a first plurality of application image layers and application instance data, the first application container being a virtualized application, the first application container having read-only access to the first plurality of application image layers; instantiating a second application container based, at least in part, on the first plurality of application image layers; and facilitating shared access of both the first application container and the second application container to the first plurality of application image layers via a private page cache. 18. The one or more non-transitory computer readable media recited in claim 17, wherein the method further comprises:
identifying the first plurality of application image layers, the first plurality of application image layers being a stack of layers representing an application image. 19. The one or more non-transitory computer readable media recited in claim 17, wherein the method further comprises:
identifying a second plurality of application image layers associated with a second application. 20. The one or more non-transitory computer readable media recited in claim 19, wherein the method further comprises:
instantiating a third application container based on the second plurality of application image layers. | 3,700 |
347,133 | 16,805,579 | 3,745 | An aqueous coating composition is provided that is useful in coating a variety of substrates, including interior or exterior portions of food or beverage cans. The coating composition includes a resin system that includes a multi-stage latex having a global extraction result of less than 50 ppm. In some embodiments, the multi-stage latex has a metal exposure value of less than 3 mA. | 1. An aqueous coating composition comprising a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower glass transition temperature (Tg) emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or (ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and 2. An article comprising an aluminum or steel two-piece drawn and ironed food or beverage can, having an interior spray-applied coating formed from an aqueous coating composition comprising:
a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower Tg emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or
(ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and
wherein the can exhibits:
(iii) a global extraction result of less than 50 ppm; and
(iv) a metal exposure of less than 3 mA on average when the can is filled with 1% NaCl in deionized water and tested pursuant to the Initial Metal Exposure test method disclosed herein. 3. A method for making a coated food or beverage container or container component, the method comprising the steps of:
(a) spray applying on an interior surface of a metal food or beverage can having a body portion and an end portion an aqueous coating composition comprising a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower Tg emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or
(ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and
(b) curing the coating composition to form a hardened coating; wherein the hardened coating exhibits:
(iii) a global extraction result of less than 50 ppm; and
(iv) a metal exposure of less than 3 mA on average when the can is filled with 1% NaCl in deionized water and tested pursuant to the Initial Metal Exposure test method disclosed herein. 4. (canceled) 5. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg of less than 30° C. and a higher Tg emulsion polymerized stage having a calculated Tg of greater than 50° C. 6. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg of less than 20° C. and a higher Tg emulsion polymerized stage having a calculated Tg of greater than 60° C. 7. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg that is at least 40° C. lower than a calculated Tg of the higher Tg emulsion polymerized stage. 8. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg that is at least 60° C. lower than a calculated Tg of the higher Tg emulsion polymerized stage. 9. The composition of claim 1, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of at least 60° C. 10. The composition of claim 1, wherein two or more of the emulsion polymerized stages are formed from monomers having in the aggregate a calculated Tg of at least 30° C. 11. The composition of claim 1, wherein the aqueous coating composition includes, based on total resin solids, at least 50 wt. % of the two or more emulsion polymerized stages. 12. The composition of claim 1, wherein the aqueous coating composition contains more than 70 wt. % resin solids from polymerized ethylenically unsaturated monomers based on total resin solids in the coating composition. 13. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including at least 50 wt. % of one or more (meth)acrylates. 14. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including at least 80 wt. % of one or more of methyl methacrylate, ethyl acrylate, ethyl methacrylate, butyl acrylate, and butyl methacrylate. 15. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including a multi-ethylenically unsaturated monomer. 16. The composition of claim 1, wherein the latex has a gradient Tg. 17. The composition of claim 1, wherein the coating composition is substantially free of each of bisphenol A, bisphenol F, and bisphenol S, the coating composition is not prepared using halogenated monomers, and the coating composition includes or is derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of the ethylenically unsaturated monomer component and polymerizable monomers employed to make the latex. 18. (canceled) 19. The composition of claim 1, wherein the coating composition is substantially free of styrene and substituted styrene compounds. 20. (canceled) 21. The composition of claim 1, wherein the coating composition includes or is derived from no more than 10 wt. % polyether compounds or polymers based on the total coating composition solids. 22. The composition of claim 1, wherein the aqueous coating composition further comprises a crosslinker. 23. The composition of claim 1, wherein the aqueous coating composition further comprises a phenoplast crosslinker. 24. The composition of claim 1, wherein the aqueous coating composition has a viscosity of from 20 to 80 seconds (Ford Cup #2, 25° C.) and is an inside spray coating composition for a food or beverage can. 25. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 drawn & ironed aluminum beverage can at a dry film weight of 115 milligrams per can and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, exhibits a lower sidewall adhesion rating value of 9 or 10 after retort in 2% citric acid under pressure at 121° C. and testing according to ASTM D 3359—Test Method B. 26. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 two-piece drawn and ironed aluminum beverage can at 115 milligrams per can coating weight and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, gives a metal exposure of less than 3.5 mA when tested pursuant to the Metal Exposure after Drop Damage test disclosed herein. 27. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 two-piece drawn and ironed aluminum beverage can at 115 milligrams per can coating weight and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, is capable of passing a necking and flanging test as indicated by a change of metal exposure after necking of less than 1.0 mA. 28. The article of claim 2, wherein the coating composition is cured and is on an interior food-contact coating of an aluminum beverage can. 29. The article of claim 2, wherein the coating composition is cured and the container further comprises a packaged food or beverage product. 30. The composition of claim 1, wherein the aqueous coating composition further comprises a beta-hydroxyalkyl-amide crosslinker. 31. The composition of claim 1, wherein the lower Tg emulsion polymerized stage is emulsion polymerized before the higher Tg emulsion polymerized stage. 32. The composition of claim 1, wherein the lower Tg emulsion polymerized stage is emulsion polymerized after the higher Tg emulsion polymerized stage. 33. The composition of claim 1, wherein the weight ratio of the lower Tg emulsion polymerized stage relative to the higher Tg emulsion polymerized stage ranges from 25:75 to 48:52. | An aqueous coating composition is provided that is useful in coating a variety of substrates, including interior or exterior portions of food or beverage cans. The coating composition includes a resin system that includes a multi-stage latex having a global extraction result of less than 50 ppm. In some embodiments, the multi-stage latex has a metal exposure value of less than 3 mA.1. An aqueous coating composition comprising a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower glass transition temperature (Tg) emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or (ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and 2. An article comprising an aluminum or steel two-piece drawn and ironed food or beverage can, having an interior spray-applied coating formed from an aqueous coating composition comprising:
a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower Tg emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or
(ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and
wherein the can exhibits:
(iii) a global extraction result of less than 50 ppm; and
(iv) a metal exposure of less than 3 mA on average when the can is filled with 1% NaCl in deionized water and tested pursuant to the Initial Metal Exposure test method disclosed herein. 3. A method for making a coated food or beverage container or container component, the method comprising the steps of:
(a) spray applying on an interior surface of a metal food or beverage can having a body portion and an end portion an aqueous coating composition comprising a multi-stage polymeric latex having two or more emulsion polymerized stages in an aqueous carrier liquid, wherein the latex has one or both of:
(i) a lower Tg emulsion polymerized stage having a calculated Tg that is at least 20° C. lower than a calculated Tg of a higher Tg emulsion polymerized stage, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of greater than 40° C. and the lower Tg emulsion polymerized stage has a calculated Tg of less than 40° C. and wherein the emulsion polymerized stages include or are derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of ethylenically unsaturated monomers employed to make the emulsion polymerized stages, or
(ii) a gradient Tg with at least a 20° C. differential in the calculated Tg of monomers fed at the start of polymerization compared to monomers fed at the end of polymerization; and
(b) curing the coating composition to form a hardened coating; wherein the hardened coating exhibits:
(iii) a global extraction result of less than 50 ppm; and
(iv) a metal exposure of less than 3 mA on average when the can is filled with 1% NaCl in deionized water and tested pursuant to the Initial Metal Exposure test method disclosed herein. 4. (canceled) 5. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg of less than 30° C. and a higher Tg emulsion polymerized stage having a calculated Tg of greater than 50° C. 6. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg of less than 20° C. and a higher Tg emulsion polymerized stage having a calculated Tg of greater than 60° C. 7. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg that is at least 40° C. lower than a calculated Tg of the higher Tg emulsion polymerized stage. 8. The composition of claim 1, wherein the latex has a lower Tg emulsion polymerized stage having a calculated Tg that is at least 60° C. lower than a calculated Tg of the higher Tg emulsion polymerized stage. 9. The composition of claim 1, wherein more than 50 weight percent of the emulsion polymerized stages have a calculated Tg of at least 60° C. 10. The composition of claim 1, wherein two or more of the emulsion polymerized stages are formed from monomers having in the aggregate a calculated Tg of at least 30° C. 11. The composition of claim 1, wherein the aqueous coating composition includes, based on total resin solids, at least 50 wt. % of the two or more emulsion polymerized stages. 12. The composition of claim 1, wherein the aqueous coating composition contains more than 70 wt. % resin solids from polymerized ethylenically unsaturated monomers based on total resin solids in the coating composition. 13. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including at least 50 wt. % of one or more (meth)acrylates. 14. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including at least 80 wt. % of one or more of methyl methacrylate, ethyl acrylate, ethyl methacrylate, butyl acrylate, and butyl methacrylate. 15. The composition of claim 1, wherein at least one of the emulsion polymerized stages is formed from monomers including a multi-ethylenically unsaturated monomer. 16. The composition of claim 1, wherein the latex has a gradient Tg. 17. The composition of claim 1, wherein the coating composition is substantially free of each of bisphenol A, bisphenol F, and bisphenol S, the coating composition is not prepared using halogenated monomers, and the coating composition includes or is derived from no more than 0.5 wt. % of acrylamide-type monomers based on the aggregate weight of the ethylenically unsaturated monomer component and polymerizable monomers employed to make the latex. 18. (canceled) 19. The composition of claim 1, wherein the coating composition is substantially free of styrene and substituted styrene compounds. 20. (canceled) 21. The composition of claim 1, wherein the coating composition includes or is derived from no more than 10 wt. % polyether compounds or polymers based on the total coating composition solids. 22. The composition of claim 1, wherein the aqueous coating composition further comprises a crosslinker. 23. The composition of claim 1, wherein the aqueous coating composition further comprises a phenoplast crosslinker. 24. The composition of claim 1, wherein the aqueous coating composition has a viscosity of from 20 to 80 seconds (Ford Cup #2, 25° C.) and is an inside spray coating composition for a food or beverage can. 25. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 drawn & ironed aluminum beverage can at a dry film weight of 115 milligrams per can and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, exhibits a lower sidewall adhesion rating value of 9 or 10 after retort in 2% citric acid under pressure at 121° C. and testing according to ASTM D 3359—Test Method B. 26. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 two-piece drawn and ironed aluminum beverage can at 115 milligrams per can coating weight and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, gives a metal exposure of less than 3.5 mA when tested pursuant to the Metal Exposure after Drop Damage test disclosed herein. 27. The composition of claim 1, wherein the aqueous coating composition, when spray applied onto an interior of a 355 mL no. 211 two-piece drawn and ironed aluminum beverage can at 115 milligrams per can coating weight and cured at 188° C. to 199° C. (measured at the can dome) for 55 seconds, is capable of passing a necking and flanging test as indicated by a change of metal exposure after necking of less than 1.0 mA. 28. The article of claim 2, wherein the coating composition is cured and is on an interior food-contact coating of an aluminum beverage can. 29. The article of claim 2, wherein the coating composition is cured and the container further comprises a packaged food or beverage product. 30. The composition of claim 1, wherein the aqueous coating composition further comprises a beta-hydroxyalkyl-amide crosslinker. 31. The composition of claim 1, wherein the lower Tg emulsion polymerized stage is emulsion polymerized before the higher Tg emulsion polymerized stage. 32. The composition of claim 1, wherein the lower Tg emulsion polymerized stage is emulsion polymerized after the higher Tg emulsion polymerized stage. 33. The composition of claim 1, wherein the weight ratio of the lower Tg emulsion polymerized stage relative to the higher Tg emulsion polymerized stage ranges from 25:75 to 48:52. | 3,700 |
347,134 | 16,805,531 | 3,745 | Implementations of this disclosure provide for video broadcast monitoring. An example method performed by a video broadcast monitoring device includes obtaining a first video that is provided by a video output device for presentation by a video display device; obtaining first characteristic information of a second video, the second video being a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicating pixel change characteristics of the second video; determining, based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating monitoring information that includes the result of the determining; and providing the monitoring information to a server. | 1. A computer-implemented method, comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device; obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video; determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 2. The computer-implemented method of claim 1, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 3. The computer-implemented method of claim 2, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 4. The computer-implemented method of claim 1, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 5. The computer-implemented method of claim 4, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 6. The computer-implemented method of claim 4, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. 7. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device; obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video; determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 8. The computer-readable medium of claim 7, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 9. The computer-readable medium of claim 8, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 10. The computer-readable medium of claim 7, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 11. The computer-readable medium of claim 10, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 12. The computer-readable medium of claim 10, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. 13. A computer-implemented system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device;
obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video;
determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining;
generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 14. The computer-implemented system of claim 13, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 15. The computer-implemented system of claim 14, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 16. The computer-implemented system of claim 13, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 17. The computer-implemented system of claim 16, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 18. The computer-implemented system of claim 16, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. | Implementations of this disclosure provide for video broadcast monitoring. An example method performed by a video broadcast monitoring device includes obtaining a first video that is provided by a video output device for presentation by a video display device; obtaining first characteristic information of a second video, the second video being a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicating pixel change characteristics of the second video; determining, based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating monitoring information that includes the result of the determining; and providing the monitoring information to a server.1. A computer-implemented method, comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device; obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video; determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 2. The computer-implemented method of claim 1, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 3. The computer-implemented method of claim 2, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 4. The computer-implemented method of claim 1, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 5. The computer-implemented method of claim 4, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 6. The computer-implemented method of claim 4, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. 7. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device; obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video; determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining; generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 8. The computer-readable medium of claim 7, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 9. The computer-readable medium of claim 8, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 10. The computer-readable medium of claim 7, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 11. The computer-readable medium of claim 10, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 12. The computer-readable medium of claim 10, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. 13. A computer-implemented system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:
obtaining, by a video broadcast monitoring device, a first video that is provided by a video output device for presentation by a video display device;
obtaining, by the video broadcast monitoring device, first characteristic information of a second video, wherein the second video is a video that is to be monitored by the video broadcast monitoring device, and the first characteristic information indicates pixel change characteristics of the second video;
determining, by the video broadcast monitoring device and based on the first characteristic information, whether the first video matches the second video, to obtain a result of the determining;
generating, by the video broadcast monitoring device, monitoring information that includes the result of the determining; and providing, by the video broadcast monitoring device and to a server, the monitoring information. 14. The computer-implemented system of claim 13, further comprising:
before obtaining the first video that is provided by the video output device for presentation by the video display device, receiving, by the video broadcast monitoring device and from the server, the first characteristic information, wherein the first characteristic information has been obtained by the server through analysis of the second video. 15. The computer-implemented system of claim 14, wherein receiving the first characteristic information comprises:
receiving, by the video broadcast monitoring device and from the server, an image authenticity verification model, wherein the image authenticity verification model indicates a pixel change rule of pixels in the second video according to one or more predetermined criteria. 16. The computer-implemented system of claim 13, wherein determining, based on the first characteristic information, whether the first video matches the second video, to obtain the result of the determining comprises:
determining a pixel change degree of each pixel in the first video; determining, from the pixels in the first video, a set of pixels that satisfy one or more predetermined criteria related to the pixel change degree; determining second characteristic information of the set of pixels, wherein the second characteristic information indicates pixel change characteristics of the first video; and determining whether the second characteristic information matches the first characteristic information, to obtain the result of the determining. 17. The computer-implemented system of claim 16, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information satisfy a predetermined matching condition, generating first monitoring information, wherein the first monitoring information comprises at least stream time period information of the first video, and the first monitoring information indicates that the second video is monitored by the video broadcast monitoring device within a stream time period corresponding to the stream time period information. 18. The computer-implemented system of claim 16, wherein generating monitoring information that includes the result of the determining comprises:
in response to the result of the determining indicating that the second characteristic information and the first characteristic information do not satisfy a predetermined matching condition, generating second monitoring information, wherein the second monitoring information comprises at least stream time period information of the first video, and the second monitoring information indicates that the second video is not monitored within a stream time period corresponding to the stream time period information. | 3,700 |
347,135 | 16,805,617 | 3,632 | A method and an apparatus for isolating a vibration of a positioning device are provided. The apparatus includes a base plate for the positioning device, at least one active bearing element for bearing the base plate on/at a foundation and at least one evaluation and control device. The apparatus includes at least one means for determining a foundation movement-dependent quantity, wherein the active bearing element is controllable by the at least one control and evaluation device on the basis of the foundation movement-dependent quantity. | 1. An apparatus for isolating a vibration of a positioning device, the apparatus comprising:
a base plate for the positioning device; at least one active bearing element for bearing the base plate on/at a foundation; at least one evaluation and control device; at least one means for determining a foundation movement-dependent quantity; and the at least one active bearing element being controllable by the at least one evaluation and control device based on the foundation movement-dependent quantity. 2. The apparatus as claimed in claim 1, wherein the at least one active bearing element further comprises a spring element and/or a damping element. 3. The apparatus as claimed in claim 1, further comprising:
at least one means for determining a base plate movement-dependent quantity, and/or at least one means for determining an inherent movement-dependent quantity of the positioning device, wherein the at least one active bearing element is additionally controllable by the at least one evaluation and control device based on the base plate movement-dependent quantity and/or the inherent movement-dependent quantity of the positioning device. 4. The apparatus as claimed in claim 3, wherein the inherent movement-dependent quantity of the positioning device is determinable based on a model. 5. The apparatus as claimed in claim 1, wherein:
a maximum producible force of the at least one active bearing element is larger than 100 N, and/or a dynamical property is larger than 50 Hz, and/or a damping provided by the at least one active bearing element is larger than 50% for frequencies of less than 10 Hz. 6. The apparatus as claimed in claim 1, wherein the at least one active bearing element includes a piezo-actuator, an electromagnetic actuator, or a capacitive actuator. 7. The apparatus as claimed in claim 1, wherein the at least one active bearing element is additionally controllable by the at least one evaluation and control device based on at least one movement quantity of the positioning device. 8. The apparatus as claimed in claim 1, wherein the at least one active bearing element includes at least one position detection device. 9. The apparatus as claimed in claim 1, further comprising at least three active bearing elements. 10. An arrangement of the positioning device and the apparatus as claimed in claim 1, wherein the positioning device is mounted on or at the base plate of the apparatus. 11. A method for isolating the vibration of the positioning device by the apparatus as claimed in claim 1, the method comprising:
determining the foundation movement-dependent quantity; and controlling the at least one active bearing element based on the foundation movement-dependent quantity. | A method and an apparatus for isolating a vibration of a positioning device are provided. The apparatus includes a base plate for the positioning device, at least one active bearing element for bearing the base plate on/at a foundation and at least one evaluation and control device. The apparatus includes at least one means for determining a foundation movement-dependent quantity, wherein the active bearing element is controllable by the at least one control and evaluation device on the basis of the foundation movement-dependent quantity.1. An apparatus for isolating a vibration of a positioning device, the apparatus comprising:
a base plate for the positioning device; at least one active bearing element for bearing the base plate on/at a foundation; at least one evaluation and control device; at least one means for determining a foundation movement-dependent quantity; and the at least one active bearing element being controllable by the at least one evaluation and control device based on the foundation movement-dependent quantity. 2. The apparatus as claimed in claim 1, wherein the at least one active bearing element further comprises a spring element and/or a damping element. 3. The apparatus as claimed in claim 1, further comprising:
at least one means for determining a base plate movement-dependent quantity, and/or at least one means for determining an inherent movement-dependent quantity of the positioning device, wherein the at least one active bearing element is additionally controllable by the at least one evaluation and control device based on the base plate movement-dependent quantity and/or the inherent movement-dependent quantity of the positioning device. 4. The apparatus as claimed in claim 3, wherein the inherent movement-dependent quantity of the positioning device is determinable based on a model. 5. The apparatus as claimed in claim 1, wherein:
a maximum producible force of the at least one active bearing element is larger than 100 N, and/or a dynamical property is larger than 50 Hz, and/or a damping provided by the at least one active bearing element is larger than 50% for frequencies of less than 10 Hz. 6. The apparatus as claimed in claim 1, wherein the at least one active bearing element includes a piezo-actuator, an electromagnetic actuator, or a capacitive actuator. 7. The apparatus as claimed in claim 1, wherein the at least one active bearing element is additionally controllable by the at least one evaluation and control device based on at least one movement quantity of the positioning device. 8. The apparatus as claimed in claim 1, wherein the at least one active bearing element includes at least one position detection device. 9. The apparatus as claimed in claim 1, further comprising at least three active bearing elements. 10. An arrangement of the positioning device and the apparatus as claimed in claim 1, wherein the positioning device is mounted on or at the base plate of the apparatus. 11. A method for isolating the vibration of the positioning device by the apparatus as claimed in claim 1, the method comprising:
determining the foundation movement-dependent quantity; and controlling the at least one active bearing element based on the foundation movement-dependent quantity. | 3,600 |
347,136 | 16,805,628 | 1,794 | A micromechanic structure includes a substrate, an adhesion layer arranged on the substrate, a first metal layer arranged on the adhesion layer, a ferroelectric layer arranged on the first metal layer and including lead zirconate titanate, and a second metal layer arranged on the ferroelectric layer, wherein the lead concentration of the ferroelectric layer decreases in a stepped manner with increasing distance from the first metal layer such that the ferroelectric layer includes a plurality of partial layers in which the lead concentration is respectively uniform. | 1. A micromechanic structure comprising:
a substrate; an adhesion layer arranged on the substrate; a first metal layer arranged on the adhesion layer; a ferroelectric layer arranged on the first metal layer and including lead zirconate titanate, a lead concentration of the ferroelectric layer decreasing in a stepped manner with an increasing distance from the first metal layer such that the ferroelectric layer includes a plurality of partial layers in which the lead concentration is respectively uniform; and a second metal layer arranged on the ferroelectric layer. 2. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is in a range from 100 nm to 900 nm. 3. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is in a range from 400 nm to 600 nm. 4. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is 500 nm. 5. The micromechanic structure according to claim 1, wherein a thickness of the ferroelectric layer is in a range from 200 nm to 5000 nm. 6. The micromechanic structure according to claim 1, wherein the ferroelectric layer has a pyroelectric coefficient higher than 1.5*10-4 C/(m2K). 7. The micromechanic structure according to claim 1, wherein:
in the ferroelectric layer c(Pb)/(c(Zr)+c(Ti)) is in a range from 0.9 to 1.0, c(Zr)/(c(Zr)+c(Ti)) is in the range from 0.1 to 0.3, c(Pb) is the lead concentration, c(Zr) is a zirconium concentration, and c(Ti) is a titanium concentration. 8. The micromechanic structure according to claim 1, wherein the micromechanic structure is an infrared light sensor and/or an actuator. 9. A method for making the micromechanic structure, the method comprising:
providing the micromechanic structure according to claim 1; and arranging the ferroelectric layer on the first metal layer by a sputter process. 10. The method according to claim 9, wherein the sputter process is a confocal sputter process. 11. The method according to claim 9, further comprising:
simultaneously depositing lead, zirconium, and titanium of the lead zirconate titanate from three different sputter targets, wherein each of the three different sputter targets includes only one of the lead, the zirconium, and the titanium. 12. The method according to claim 9, further comprising:
decreasing the lead concentration in the ferroelectric layer in the stepped manner with the increasing distance from the first metal layer by lowering only a sputter rate of the lead. 13. The method according to claim 9, further comprising:
decreasing the lead concentration in the ferroelectric layer in the stepped manner with the increasing distance from the first metal layer by lowering an electrical power applied on a sputter target that includes the lead. 14. The method according to claim 13, wherein the electrical power applied on the sputter target that includes the lead is lowered starting from an electrical start power Pmax,lead by a value in a range from 0.2 W to 2 W per a distance of 100 nm from the first metal layer. 15. The method according to claim 13, wherein the electrical power applied on the sputter target that includes the lead is lowered starting from an electrical start power Pmax,lead by a value of 1 W per a distance of 100 nm from the first metal layer. | A micromechanic structure includes a substrate, an adhesion layer arranged on the substrate, a first metal layer arranged on the adhesion layer, a ferroelectric layer arranged on the first metal layer and including lead zirconate titanate, and a second metal layer arranged on the ferroelectric layer, wherein the lead concentration of the ferroelectric layer decreases in a stepped manner with increasing distance from the first metal layer such that the ferroelectric layer includes a plurality of partial layers in which the lead concentration is respectively uniform.1. A micromechanic structure comprising:
a substrate; an adhesion layer arranged on the substrate; a first metal layer arranged on the adhesion layer; a ferroelectric layer arranged on the first metal layer and including lead zirconate titanate, a lead concentration of the ferroelectric layer decreasing in a stepped manner with an increasing distance from the first metal layer such that the ferroelectric layer includes a plurality of partial layers in which the lead concentration is respectively uniform; and a second metal layer arranged on the ferroelectric layer. 2. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is in a range from 100 nm to 900 nm. 3. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is in a range from 400 nm to 600 nm. 4. The micromechanic structure according to claim 1, wherein a thickness of each of the plurality of partial layers is 500 nm. 5. The micromechanic structure according to claim 1, wherein a thickness of the ferroelectric layer is in a range from 200 nm to 5000 nm. 6. The micromechanic structure according to claim 1, wherein the ferroelectric layer has a pyroelectric coefficient higher than 1.5*10-4 C/(m2K). 7. The micromechanic structure according to claim 1, wherein:
in the ferroelectric layer c(Pb)/(c(Zr)+c(Ti)) is in a range from 0.9 to 1.0, c(Zr)/(c(Zr)+c(Ti)) is in the range from 0.1 to 0.3, c(Pb) is the lead concentration, c(Zr) is a zirconium concentration, and c(Ti) is a titanium concentration. 8. The micromechanic structure according to claim 1, wherein the micromechanic structure is an infrared light sensor and/or an actuator. 9. A method for making the micromechanic structure, the method comprising:
providing the micromechanic structure according to claim 1; and arranging the ferroelectric layer on the first metal layer by a sputter process. 10. The method according to claim 9, wherein the sputter process is a confocal sputter process. 11. The method according to claim 9, further comprising:
simultaneously depositing lead, zirconium, and titanium of the lead zirconate titanate from three different sputter targets, wherein each of the three different sputter targets includes only one of the lead, the zirconium, and the titanium. 12. The method according to claim 9, further comprising:
decreasing the lead concentration in the ferroelectric layer in the stepped manner with the increasing distance from the first metal layer by lowering only a sputter rate of the lead. 13. The method according to claim 9, further comprising:
decreasing the lead concentration in the ferroelectric layer in the stepped manner with the increasing distance from the first metal layer by lowering an electrical power applied on a sputter target that includes the lead. 14. The method according to claim 13, wherein the electrical power applied on the sputter target that includes the lead is lowered starting from an electrical start power Pmax,lead by a value in a range from 0.2 W to 2 W per a distance of 100 nm from the first metal layer. 15. The method according to claim 13, wherein the electrical power applied on the sputter target that includes the lead is lowered starting from an electrical start power Pmax,lead by a value of 1 W per a distance of 100 nm from the first metal layer. | 1,700 |
347,137 | 16,805,622 | 3,784 | Embodiments disclosed herein provide an exercise system that facilitates a varying load. During operation, the system produces a load-control pattern using a control module, and varies a load using a load-varying mechanism based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. | 1. An exercise system that facilitates a varying load, the system comprising:
a control module configured to produce a load-control pattern; and a load-varying mechanism coupled to the control module and configured to vary a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. 2. The exercise system of claim 1, wherein the load-control pattern indicates at least one of:
an amplitude range for the load; a frequency range for varying the load; a period duration for varying the load; a number of periods for load variation; a randomized load; and a randomized frequency for varying the load. 3. The exercise system of claim 1, further comprising a user input module configured to receive a user input to select a pre-configured load-varying program or to define a custom load-varying program. 4. The exercise system of claim 1, wherein the load-varying mechanism comprises an electrical generator coupled to a circuit; and
wherein the circuit comprises a circuit-control module. 5. The exercise system of claim 4, wherein the circuit-control module is configured to vary a resistive load of the circuit using pulse width modulation based on a control signal. 6. The exercise system of claim 1, wherein the load-varying mechanism comprises an electro-magnetic braking mechanism. 7. The exercise system of claim 6, wherein the electro-magnetic braking mechanism is configured to apply a braking force based on the load-control pattern. 8. The exercise system of claim 6, further comprising a rotor; and
wherein the electro-magnetic braking mechanism is configured to apply a braking force on the rotor. 9. The exercise system of claim 1, further comprising a weight coupled to the load-varying mechanism. 10. The exercise system of claim 1, wherein the load-varying mechanism comprises a mechanical braking mechanism. 11. A method for facilitating a varying load in an exercise system, the method comprising:
producing a load-control pattern; varying, using a load-control mechanism, a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. 12. The method of claim 11, wherein the load-control pattern indicates at least one of:
an amplitude range for the load; a frequency range for varying the load; a period duration for varying the load; a number of periods for load variation; a randomized load; and a randomized frequency for varying the load. 13. The method of claim 11, further comprising receiving a user input to select a pre-configured load-varying program or to define a custom load-varying program. 14. The method of claim 11, wherein the load-varying mechanism comprises an electrical generator coupled to a circuit; and
wherein the circuit comprises a circuit-control module. 15. The method of claim 14, wherein varying the load comprises allowing the circuit-control module vary a resistive load of the circuit using pulse width modulation based on a control signal. 16. The method of claim 11, wherein the load-control mechanism comprises an electro-magnetic braking mechanism; and
wherein varying the load comprises engaging the electro-magnetic braking system. 17. The method of claim 16, wherein varying the load comprises applying a braking force using the electro-magnetic braking system. 18. The method of claim 11, wherein the load-control mechanism comprises mechanical braking mechanism; and
wherein varying the load comprises engaging the mechanical braking system. 19. The method of claim 11, wherein the exercise system comprises a rotor; and
wherein varying the load comprises applying a braking force on the rotor. 20. The method of claim 11, wherein the exercise system comprises a weight, and wherein varying the load comprises applying a braking force to a mechanism coupled to the weight. 21. An exercise means that facilitates a varying load, the means comprising:
a control means for producing a load-control pattern; and a load-varying means for varying a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. | Embodiments disclosed herein provide an exercise system that facilitates a varying load. During operation, the system produces a load-control pattern using a control module, and varies a load using a load-varying mechanism based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation.1. An exercise system that facilitates a varying load, the system comprising:
a control module configured to produce a load-control pattern; and a load-varying mechanism coupled to the control module and configured to vary a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. 2. The exercise system of claim 1, wherein the load-control pattern indicates at least one of:
an amplitude range for the load; a frequency range for varying the load; a period duration for varying the load; a number of periods for load variation; a randomized load; and a randomized frequency for varying the load. 3. The exercise system of claim 1, further comprising a user input module configured to receive a user input to select a pre-configured load-varying program or to define a custom load-varying program. 4. The exercise system of claim 1, wherein the load-varying mechanism comprises an electrical generator coupled to a circuit; and
wherein the circuit comprises a circuit-control module. 5. The exercise system of claim 4, wherein the circuit-control module is configured to vary a resistive load of the circuit using pulse width modulation based on a control signal. 6. The exercise system of claim 1, wherein the load-varying mechanism comprises an electro-magnetic braking mechanism. 7. The exercise system of claim 6, wherein the electro-magnetic braking mechanism is configured to apply a braking force based on the load-control pattern. 8. The exercise system of claim 6, further comprising a rotor; and
wherein the electro-magnetic braking mechanism is configured to apply a braking force on the rotor. 9. The exercise system of claim 1, further comprising a weight coupled to the load-varying mechanism. 10. The exercise system of claim 1, wherein the load-varying mechanism comprises a mechanical braking mechanism. 11. A method for facilitating a varying load in an exercise system, the method comprising:
producing a load-control pattern; varying, using a load-control mechanism, a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. 12. The method of claim 11, wherein the load-control pattern indicates at least one of:
an amplitude range for the load; a frequency range for varying the load; a period duration for varying the load; a number of periods for load variation; a randomized load; and a randomized frequency for varying the load. 13. The method of claim 11, further comprising receiving a user input to select a pre-configured load-varying program or to define a custom load-varying program. 14. The method of claim 11, wherein the load-varying mechanism comprises an electrical generator coupled to a circuit; and
wherein the circuit comprises a circuit-control module. 15. The method of claim 14, wherein varying the load comprises allowing the circuit-control module vary a resistive load of the circuit using pulse width modulation based on a control signal. 16. The method of claim 11, wherein the load-control mechanism comprises an electro-magnetic braking mechanism; and
wherein varying the load comprises engaging the electro-magnetic braking system. 17. The method of claim 16, wherein varying the load comprises applying a braking force using the electro-magnetic braking system. 18. The method of claim 11, wherein the load-control mechanism comprises mechanical braking mechanism; and
wherein varying the load comprises engaging the mechanical braking system. 19. The method of claim 11, wherein the exercise system comprises a rotor; and
wherein varying the load comprises applying a braking force on the rotor. 20. The method of claim 11, wherein the exercise system comprises a weight, and wherein varying the load comprises applying a braking force to a mechanism coupled to the weight. 21. An exercise means that facilitates a varying load, the means comprising:
a control means for producing a load-control pattern; and a load-varying means for varying a load based on the load-control pattern, thereby facilitating varying-load during exercise for effective muscle stimulation. | 3,700 |
347,138 | 16,805,614 | 3,784 | Methods and systems to control mining pools configured to mine more than one blockchain network. A pool controller may automatically select a candidate block generated for one of the blockchain networks for mining by the mining units. The selection may be based on determining an expectation value associated with each current candidate block generated for the respective blockchain networks and which of them is the highest. The expectation value may be based, at least in part, on a current coinbase value and a current difficulty setting for that blockchain network. The pool control may perform the selection with the generation of each new candidate block for any of the blockchain networks. | 1. A computer-implemented method of controlling a mining pool, the mining pool containing a plurality of mining units and a pool controller, the mining units being configured to mine in accordance with a plurality of blockchain protocols, the method comprising:
for each of a plurality of blockchain networks, generating a respective candidate block containing a plurality of transactions from that blockchain network and having a candidate block header that includes a coinbase value and a difficulty setting for that blockchain network; for each of the candidate blocks, determining an expectation value based on the difficulty setting and the coinbase value for that candidate block; based on a comparison of the expectation values, selecting the candidate block associated with the highest of the expectation values; and providing the candidate block header for the selected candidate block to the mining units for mining. 2. The method claimed in claim 1, wherein determining the expectation value includes determining a probability of finding a next block based on the difficulty setting, and multiplying the probability by the coinbase value to determine the expectation value. 3. The method claimed in claim 2, wherein the difficulty setting includes a target value in an nBits field in the candidate block header, and determining the probability is based on the target value divided by a total hash space value. 4. The method claimed in claim 1, further comprising outputting an identifier of the blockchain network associated with the highest of the expectation values. 5. The method claimed in claim 4, wherein outputting includes publishing to a log. 6. The method claimed in claim 4, wherein outputting includes transmitting to the mining units. 7. The method claimed in claim 6, wherein providing includes providing each of the candidate block headers to the mining units, and wherein the mining units are configured to select the selected candidate block for mining based on the identifier transmitted. 8. The method claimed in claim 1, wherein selecting the candidate block includes converting the expectation values to a common unit for the comparison. 9. The method claimed in claim 8, wherein converting includes requesting and receiving conversion factors from an external database for converting the expectation values to the common unit. 10. The method claimed in claim 8, wherein the common unit is a unit associated with one of the blockchain networks. 11. A system to control a mining pool, the mining pool containing a plurality of mining units and a pool controller, the mining units being configured to mine in accordance with a plurality of blockchain protocols, the system comprising:
one or more processors; memory; and computer-executable instructions stored in the memory that, when executed by the one or more processors, cause the processors to:
for each of a plurality of blockchain networks, generate a respective candidate block containing a plurality of transactions from that blockchain network and having a candidate block header that includes a coinbase value and a difficulty setting for that blockchain network;
for each of the candidate blocks, determine an expectation value based on the difficulty setting and the coinbase value for that candidate block;
based on a comparison of the expectation values, select the candidate block associated with the highest of the expectation values; and
provide the candidate block header for the selected candidate block to the mining units for mining. 12. The system claimed in claim 11, wherein the instructions, when executed, are to cause the one or more processors to determine the expectation value by determining a probability of finding a next block based on the difficulty setting, and multiplying the probability by the coinbase value to determine the expectation value. 13. The system claimed in claim 12, wherein the difficulty setting includes a target value in an nBits field in the candidate block header, and wherein the instructions, when executed, are to cause the one or more processors to determine the probability based on the target value divided by a total hash space value. 14. The system claimed in claim 11, wherein the instructions, when executed, are to further cause the one or more processors to output an identifier of the blockchain network associated with the highest of the expectation values. 15. The system claimed in claim 14, wherein outputting includes publishing to a log. 16. The system claimed in claim 14, wherein outputting includes transmitting to the mining units. 17. The system claimed in claim 16, wherein the instructions, when executed, are to cause the one or more processors to provide by the candidate block header providing each of the candidate block headers to the mining units, and wherein the mining units are configured to select the selected candidate block for mining based on the identifier transmitted. 18. The system claimed in claim 11, wherein the instructions, when executed, are to cause the one or more processors to select the candidate block by converting the expectation values to a common unit for the comparison. 19. The system claimed in claim 18, wherein converting includes requesting and receiving conversion factors from an external database for converting the expectation values to the common unit. 20. The system claimed in claim 18, wherein the common unit is a unit associated with one of the blockchain networks. | Methods and systems to control mining pools configured to mine more than one blockchain network. A pool controller may automatically select a candidate block generated for one of the blockchain networks for mining by the mining units. The selection may be based on determining an expectation value associated with each current candidate block generated for the respective blockchain networks and which of them is the highest. The expectation value may be based, at least in part, on a current coinbase value and a current difficulty setting for that blockchain network. The pool control may perform the selection with the generation of each new candidate block for any of the blockchain networks.1. A computer-implemented method of controlling a mining pool, the mining pool containing a plurality of mining units and a pool controller, the mining units being configured to mine in accordance with a plurality of blockchain protocols, the method comprising:
for each of a plurality of blockchain networks, generating a respective candidate block containing a plurality of transactions from that blockchain network and having a candidate block header that includes a coinbase value and a difficulty setting for that blockchain network; for each of the candidate blocks, determining an expectation value based on the difficulty setting and the coinbase value for that candidate block; based on a comparison of the expectation values, selecting the candidate block associated with the highest of the expectation values; and providing the candidate block header for the selected candidate block to the mining units for mining. 2. The method claimed in claim 1, wherein determining the expectation value includes determining a probability of finding a next block based on the difficulty setting, and multiplying the probability by the coinbase value to determine the expectation value. 3. The method claimed in claim 2, wherein the difficulty setting includes a target value in an nBits field in the candidate block header, and determining the probability is based on the target value divided by a total hash space value. 4. The method claimed in claim 1, further comprising outputting an identifier of the blockchain network associated with the highest of the expectation values. 5. The method claimed in claim 4, wherein outputting includes publishing to a log. 6. The method claimed in claim 4, wherein outputting includes transmitting to the mining units. 7. The method claimed in claim 6, wherein providing includes providing each of the candidate block headers to the mining units, and wherein the mining units are configured to select the selected candidate block for mining based on the identifier transmitted. 8. The method claimed in claim 1, wherein selecting the candidate block includes converting the expectation values to a common unit for the comparison. 9. The method claimed in claim 8, wherein converting includes requesting and receiving conversion factors from an external database for converting the expectation values to the common unit. 10. The method claimed in claim 8, wherein the common unit is a unit associated with one of the blockchain networks. 11. A system to control a mining pool, the mining pool containing a plurality of mining units and a pool controller, the mining units being configured to mine in accordance with a plurality of blockchain protocols, the system comprising:
one or more processors; memory; and computer-executable instructions stored in the memory that, when executed by the one or more processors, cause the processors to:
for each of a plurality of blockchain networks, generate a respective candidate block containing a plurality of transactions from that blockchain network and having a candidate block header that includes a coinbase value and a difficulty setting for that blockchain network;
for each of the candidate blocks, determine an expectation value based on the difficulty setting and the coinbase value for that candidate block;
based on a comparison of the expectation values, select the candidate block associated with the highest of the expectation values; and
provide the candidate block header for the selected candidate block to the mining units for mining. 12. The system claimed in claim 11, wherein the instructions, when executed, are to cause the one or more processors to determine the expectation value by determining a probability of finding a next block based on the difficulty setting, and multiplying the probability by the coinbase value to determine the expectation value. 13. The system claimed in claim 12, wherein the difficulty setting includes a target value in an nBits field in the candidate block header, and wherein the instructions, when executed, are to cause the one or more processors to determine the probability based on the target value divided by a total hash space value. 14. The system claimed in claim 11, wherein the instructions, when executed, are to further cause the one or more processors to output an identifier of the blockchain network associated with the highest of the expectation values. 15. The system claimed in claim 14, wherein outputting includes publishing to a log. 16. The system claimed in claim 14, wherein outputting includes transmitting to the mining units. 17. The system claimed in claim 16, wherein the instructions, when executed, are to cause the one or more processors to provide by the candidate block header providing each of the candidate block headers to the mining units, and wherein the mining units are configured to select the selected candidate block for mining based on the identifier transmitted. 18. The system claimed in claim 11, wherein the instructions, when executed, are to cause the one or more processors to select the candidate block by converting the expectation values to a common unit for the comparison. 19. The system claimed in claim 18, wherein converting includes requesting and receiving conversion factors from an external database for converting the expectation values to the common unit. 20. The system claimed in claim 18, wherein the common unit is a unit associated with one of the blockchain networks. | 3,700 |
347,139 | 16,805,632 | 3,784 | Example caching systems and methods are described. In one implementation, a method identifies multiple files used to process a query and distributes each of the multiple files to a particular execution node to execute the query. Each execution node determines whether the distributed file is stored in the execution node's cache. If the execution node determines that the file is stored in the cache, it processes the query using the cached file. If the file is not stored in the cache, the execution node retrieves the file from a remote storage device, stores the file in the execution node's cache, and processes the query using the file. | 1. A non-transitory computer-readable medium storing instructions which, when executed by one or more second processors of a computing device, cause the one or more second processors to:
receive a query for information stored in one or more databases; identify a plurality of tasks associated with the query; distribute, with the one or more second processors, the plurality of tasks to a plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; execute the plurality of tasks with the first plurality of processors; and update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 2. The machine-readable medium of claim 1, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 3. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 4. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 5. The machine-readable medium of claim 2, wherein each of the first plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processor. 6. The machine-readable medium of claim 1, wherein the query is received from a client, and wherein the instructions further cause the one or more second processors to:
generate a result from the execution of the plurality of tasks, and data from the result to the client associated with the query 7. The machine-readable medium of claim 1, wherein the instructions further cause the computing device to:
optimize the query. 8. The non-transitory computer-readable medium of claim 1, wherein the set of data is stored in a relational database. 9. The non-transitory computer-readable medium of claim 8, wherein the relational database is a structured query language database. 10. The non-transitory computer-readable medium of claim 1, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 11. The non-transitory computer-readable medium of claim 1, wherein at least one of the databases is external to a system that includes the first plurality of processors. 12. The non-transitory computer-readable medium of claim 1, wherein the statistics comprise metadata related to the one or more databases. 13. The non-transitory computer-readable medium of claim 1, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 14. The non-transitory computer-readable medium of claim 1, wherein the updating of the at least the portion of the set of statistics occurs automatically. 15. A method comprising:
receiving a query for information stored in one or more databases; identifying a plurality of tasks associated with the query; distributing, with the one or more second processors, the plurality of tasks to a first plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; executing the plurality of tasks with the first plurality of processors; updating at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 16. The method of claim 15, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 17. The method of claim 16, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 18. The method of claim 16, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 19. The method of claim 16, wherein each of the first plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processors. 20. The method of claim 15, wherein the query is received from a client, and further comprising:
returning a result to a query coordinator. 21. The method of claim 15, further comprising:
optimizing the query. 22. The method of claim 15, wherein the set of data is stored in a relational database. 23. The method of claim 15, wherein the relational database is a structured query language database. 24. The method of claim 15, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 25. The method of claim 15, wherein at least one of the databases is external to a system that includes the first plurality of processors. 26. The method of claim 15, wherein the statistics comprise metadata related to the one or more databases. 27. The method of claim 15, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 28. The method of claim 15, wherein the updating of the at least the portion of the set of statistics occurs automatically. 29. A system comprising:
a query coordinator process programmed to:
receive a query for information stored in one or more databases,
identify a plurality of tasks associated with the query,
distribute the plurality of tasks to a plurality of processors using at least a set of statistics associated with the plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of processors; and
the plurality of processors programmed to:
execute the plurality of tasks, wherein the query coordinator process is further programmed to update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 30. The system of claim 29, wherein the executing of the plurality of tasks uses at least a plurality of database tables. | Example caching systems and methods are described. In one implementation, a method identifies multiple files used to process a query and distributes each of the multiple files to a particular execution node to execute the query. Each execution node determines whether the distributed file is stored in the execution node's cache. If the execution node determines that the file is stored in the cache, it processes the query using the cached file. If the file is not stored in the cache, the execution node retrieves the file from a remote storage device, stores the file in the execution node's cache, and processes the query using the file.1. A non-transitory computer-readable medium storing instructions which, when executed by one or more second processors of a computing device, cause the one or more second processors to:
receive a query for information stored in one or more databases; identify a plurality of tasks associated with the query; distribute, with the one or more second processors, the plurality of tasks to a plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; execute the plurality of tasks with the first plurality of processors; and update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 2. The machine-readable medium of claim 1, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 3. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 4. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 5. The machine-readable medium of claim 2, wherein each of the first plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processor. 6. The machine-readable medium of claim 1, wherein the query is received from a client, and wherein the instructions further cause the one or more second processors to:
generate a result from the execution of the plurality of tasks, and data from the result to the client associated with the query 7. The machine-readable medium of claim 1, wherein the instructions further cause the computing device to:
optimize the query. 8. The non-transitory computer-readable medium of claim 1, wherein the set of data is stored in a relational database. 9. The non-transitory computer-readable medium of claim 8, wherein the relational database is a structured query language database. 10. The non-transitory computer-readable medium of claim 1, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 11. The non-transitory computer-readable medium of claim 1, wherein at least one of the databases is external to a system that includes the first plurality of processors. 12. The non-transitory computer-readable medium of claim 1, wherein the statistics comprise metadata related to the one or more databases. 13. The non-transitory computer-readable medium of claim 1, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 14. The non-transitory computer-readable medium of claim 1, wherein the updating of the at least the portion of the set of statistics occurs automatically. 15. A method comprising:
receiving a query for information stored in one or more databases; identifying a plurality of tasks associated with the query; distributing, with the one or more second processors, the plurality of tasks to a first plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; executing the plurality of tasks with the first plurality of processors; updating at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 16. The method of claim 15, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 17. The method of claim 16, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 18. The method of claim 16, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 19. The method of claim 16, wherein each of the first plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processors. 20. The method of claim 15, wherein the query is received from a client, and further comprising:
returning a result to a query coordinator. 21. The method of claim 15, further comprising:
optimizing the query. 22. The method of claim 15, wherein the set of data is stored in a relational database. 23. The method of claim 15, wherein the relational database is a structured query language database. 24. The method of claim 15, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 25. The method of claim 15, wherein at least one of the databases is external to a system that includes the first plurality of processors. 26. The method of claim 15, wherein the statistics comprise metadata related to the one or more databases. 27. The method of claim 15, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 28. The method of claim 15, wherein the updating of the at least the portion of the set of statistics occurs automatically. 29. A system comprising:
a query coordinator process programmed to:
receive a query for information stored in one or more databases,
identify a plurality of tasks associated with the query,
distribute the plurality of tasks to a plurality of processors using at least a set of statistics associated with the plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of processors; and
the plurality of processors programmed to:
execute the plurality of tasks, wherein the query coordinator process is further programmed to update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 30. The system of claim 29, wherein the executing of the plurality of tasks uses at least a plurality of database tables. | 3,700 |
347,140 | 16,805,492 | 3,784 | Implementations of the present specification include receiving a request to perform a private transaction associated with at least one account; in response to receiving the request, performing, by a workflow node, the private transaction; in response to performing the private transaction, generating, by the workflow node, a representation of the private transaction configured to be accessible only to entities that are authorized to access the private transaction; storing, in a private blockchain, the representation of the private transaction; generating, by the workflow node, an account record for the at least one account associated with the private transaction based at least in part on the private transaction, wherein the account record is configured to be accessible to at least one entity that is not authorized to access the representation of the private transaction in the private blockchain; and storing, in a public blockchain, the account record. | 1-27. (canceled) 28. A computer-implemented method, comprising:
performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. 29. The computer-implemented method of claim 28, wherein:
the first distributed ledger network is managed by a financial institution; and the second distributed ledger network is a public blockchain network. 30. The computer-implemented method of claim 28, further comprising:
storing, by the node belonging to the first distributed ledger network, the transaction in a datastore of the node, wherein the datastore is separate from the first distributed ledger network. 31. The computer-implemented method of claim 28, wherein generating the private representation of the transaction further comprises generating representation of respective identities of the two or more transaction participants. 32. The computer-implemented method of claim 28, wherein generating the public representation of the transaction comprises generating respective account records of the two or more transaction participants. 33. The computer-implemented method of claim 28, the method further comprising:
maintaining, by the node belonging to the first distributed ledger network, a local representation of respective account records of the two or more transaction participants; wherein performing the transaction comprises modifying the local representation of the respective account records based on the transaction; and wherein each of the respective account records includes a subset of information in the local representation of the respective account records. 34. The computer-implemented method of claim 28, wherein broadcasting the public representation of the transaction for inclusion in the second distributed ledger network is performed after storing the private representation of the transaction in the first distributed ledger network. 35. The computer-implemented method of claim 28, further comprising:
storing, in a datastore separate from the first distributed ledger network, an encrypted copy of the transaction that has been encrypted with a public key of a public/private keypair. 36. The computer-implemented method of claim 35, wherein storing the encrypted copy of the transaction includes storing a signature of the encrypted copy that has been created with a private key of the public/private keypair. 37. The computer-implemented method of claim 28, further comprising:
storing, in a third distributed ledger network that is different from the first distributed ledger network, a private representation of another transaction that is different from the first private transaction; comparing, by a node belonging to the first distributed ledger network, a quantity of transactions performed to a threshold representing a predetermined quantity of transactions; determining, by a node belonging to the first distributed ledger network and based on the result of comparing the quantity of transactions to the threshold, that an account record for a transaction participant associated with the other transaction can be stored in the second distributed ledger network blockchain; and storing, in the second distributed ledger network, the account record for the transaction participant associated with the other transaction. 38. A non-transitory computer-readable storage medium storing one or more instructions executable by a computer system to perform operations comprising:
performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. 39. The non-transitory computer-readable medium of claim 38, wherein:
the first distributed ledger network is managed by a financial institution; and the second distributed ledger network is a public blockchain network. 40. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
storing, by the node belonging to the first distributed ledger network, the transaction in a datastore of the node, wherein the datastore is separate from the first distributed ledger network. 41. The non-transitory computer-readable medium of claim 38, wherein generating the private representation of the transaction further comprises generating representation of respective identities of the two or more transaction participants. 42. The non-transitory computer-readable medium of claim 38, wherein generating the public representation of the transaction comprises generating respective account records of the two or more transaction participants. 43. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
maintaining, by the node belonging to the first distributed ledger network, a local representation of respective account records of the two or more transaction participants; wherein performing the transaction comprises modifying the local representation of the respective account records based on the transaction; and wherein each of the respective account records includes a subset of information in the local representation of the respective account records. 44. The non-transitory computer-readable medium of claim 38, wherein broadcasting the public representation of the transaction for inclusion in the second distributed ledger network is performed after storing the private representation of the transaction in the first distributed ledger network. 45. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
storing, in a datastore separate from the first distributed ledger network, an encrypted copy of the transaction that has been encrypted with a public key of a public/private keypair. 46. The non-transitory computer-readable medium of claim 45, wherein storing the encrypted copy of the transaction includes storing a signature of the encrypted copy that has been created with a private key of the public/private keypair. 47. A system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising: performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. | Implementations of the present specification include receiving a request to perform a private transaction associated with at least one account; in response to receiving the request, performing, by a workflow node, the private transaction; in response to performing the private transaction, generating, by the workflow node, a representation of the private transaction configured to be accessible only to entities that are authorized to access the private transaction; storing, in a private blockchain, the representation of the private transaction; generating, by the workflow node, an account record for the at least one account associated with the private transaction based at least in part on the private transaction, wherein the account record is configured to be accessible to at least one entity that is not authorized to access the representation of the private transaction in the private blockchain; and storing, in a public blockchain, the account record.1-27. (canceled) 28. A computer-implemented method, comprising:
performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. 29. The computer-implemented method of claim 28, wherein:
the first distributed ledger network is managed by a financial institution; and the second distributed ledger network is a public blockchain network. 30. The computer-implemented method of claim 28, further comprising:
storing, by the node belonging to the first distributed ledger network, the transaction in a datastore of the node, wherein the datastore is separate from the first distributed ledger network. 31. The computer-implemented method of claim 28, wherein generating the private representation of the transaction further comprises generating representation of respective identities of the two or more transaction participants. 32. The computer-implemented method of claim 28, wherein generating the public representation of the transaction comprises generating respective account records of the two or more transaction participants. 33. The computer-implemented method of claim 28, the method further comprising:
maintaining, by the node belonging to the first distributed ledger network, a local representation of respective account records of the two or more transaction participants; wherein performing the transaction comprises modifying the local representation of the respective account records based on the transaction; and wherein each of the respective account records includes a subset of information in the local representation of the respective account records. 34. The computer-implemented method of claim 28, wherein broadcasting the public representation of the transaction for inclusion in the second distributed ledger network is performed after storing the private representation of the transaction in the first distributed ledger network. 35. The computer-implemented method of claim 28, further comprising:
storing, in a datastore separate from the first distributed ledger network, an encrypted copy of the transaction that has been encrypted with a public key of a public/private keypair. 36. The computer-implemented method of claim 35, wherein storing the encrypted copy of the transaction includes storing a signature of the encrypted copy that has been created with a private key of the public/private keypair. 37. The computer-implemented method of claim 28, further comprising:
storing, in a third distributed ledger network that is different from the first distributed ledger network, a private representation of another transaction that is different from the first private transaction; comparing, by a node belonging to the first distributed ledger network, a quantity of transactions performed to a threshold representing a predetermined quantity of transactions; determining, by a node belonging to the first distributed ledger network and based on the result of comparing the quantity of transactions to the threshold, that an account record for a transaction participant associated with the other transaction can be stored in the second distributed ledger network blockchain; and storing, in the second distributed ledger network, the account record for the transaction participant associated with the other transaction. 38. A non-transitory computer-readable storage medium storing one or more instructions executable by a computer system to perform operations comprising:
performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. 39. The non-transitory computer-readable medium of claim 38, wherein:
the first distributed ledger network is managed by a financial institution; and the second distributed ledger network is a public blockchain network. 40. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
storing, by the node belonging to the first distributed ledger network, the transaction in a datastore of the node, wherein the datastore is separate from the first distributed ledger network. 41. The non-transitory computer-readable medium of claim 38, wherein generating the private representation of the transaction further comprises generating representation of respective identities of the two or more transaction participants. 42. The non-transitory computer-readable medium of claim 38, wherein generating the public representation of the transaction comprises generating respective account records of the two or more transaction participants. 43. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
maintaining, by the node belonging to the first distributed ledger network, a local representation of respective account records of the two or more transaction participants; wherein performing the transaction comprises modifying the local representation of the respective account records based on the transaction; and wherein each of the respective account records includes a subset of information in the local representation of the respective account records. 44. The non-transitory computer-readable medium of claim 38, wherein broadcasting the public representation of the transaction for inclusion in the second distributed ledger network is performed after storing the private representation of the transaction in the first distributed ledger network. 45. The non-transitory computer-readable medium of claim 38, wherein the operations further comprise:
storing, in a datastore separate from the first distributed ledger network, an encrypted copy of the transaction that has been encrypted with a public key of a public/private keypair. 46. The non-transitory computer-readable medium of claim 45, wherein storing the encrypted copy of the transaction includes storing a signature of the encrypted copy that has been created with a private key of the public/private keypair. 47. A system, comprising:
one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising: performing, by a node belonging to a first distributed ledger network, a transaction that is submitted by a user of the first distributed ledger network and that is associated with two or more transaction participants; generating, by the node belonging to the first distributed ledger network, a private representation of the transaction that is configured to be accessible only to the two or more transaction participants, the private representation of the transaction comprising a hash of the transaction; generating, by the node belonging to the first distributed ledger network, a public representation of the transaction that is configured to be accessible to at least one node belonging to a second distributed ledger network, the public representation specifying respective account balance updates of the two or more transaction participants; and broadcasting, by the node belonging to the first distributed ledger network, the public representation of the transaction for inclusion in the second distributed ledger network. | 3,700 |
347,141 | 16,805,608 | 3,784 | A method and apparatus generate and process transport packets. A method of processing a transport packet at receiving entity includes identifying, in response to receiving the transport packet, a payload type based on a field indicating the payload type in a packet header for the transport packet. The method also includes identifying, in response to identifying that the payload type is a streaming mode payload type, a delivery data unit type of DU data in the transport packet based on a field indicating the delivery data unit type in a streaming mode payload header for the DU data. Additionally, the method includes processing the DU data according to the identified delivery data unit type. | 1. A method of transmitting media contents, the method comprising:
identifying at least one media processing unit (MPU) comprising one or more media fragment units (MFUs) based on media data of the media contents; and transmitting a transport packet including a packet header and a payload comprising payload data generated from the at least one MPU, wherein the packet header comprises a type field indicating a type of the payload data and a random access point (RAP) flag indicating that the payload contains a RAP to a data stream of a media data type, wherein, in case that the type field is set to a first value indicating that the payload data is a media-aware fragment of the MPU, the payload consists of a first payload header for a MPU mode prior to the payload data, the first payload header comprising a data type field indicating a fragment type of the payload data, a fragmentation indicator (f_i) comprising information about fragmentation of the payload data, an aggregation flag (A) indicating that more than one delivery data unit is in the payload, and a fragment counter (frag_count) indicating a number of payload containing fragments of a same delivery data unit succeeding the payload, and wherein, in case that the type field is set to a second value indicating that the payload data is a generic object including the MPU completely, the payload consists of a second payload header for a generic file delivery (GFD) mode prior to the payload data, the second payload header comprising a L field indicating that the transport packet is a last delivered packet of the generic object, a B field indicating that the transport packet comprising a last byte of the generic object, a code point field indicating an opaque identifier that is passed a packet payload decoder to convey information on the payload, and a start offset indicating a location of the payload data in the generic object. 2. The method of claim 1, wherein the generic object in the payload data comprises a complete MPU. 3. The method of claim 1, wherein the fragment type indicated by the data type field is one of MPU metadata, movie fragment metadata, and MFU. | A method and apparatus generate and process transport packets. A method of processing a transport packet at receiving entity includes identifying, in response to receiving the transport packet, a payload type based on a field indicating the payload type in a packet header for the transport packet. The method also includes identifying, in response to identifying that the payload type is a streaming mode payload type, a delivery data unit type of DU data in the transport packet based on a field indicating the delivery data unit type in a streaming mode payload header for the DU data. Additionally, the method includes processing the DU data according to the identified delivery data unit type.1. A method of transmitting media contents, the method comprising:
identifying at least one media processing unit (MPU) comprising one or more media fragment units (MFUs) based on media data of the media contents; and transmitting a transport packet including a packet header and a payload comprising payload data generated from the at least one MPU, wherein the packet header comprises a type field indicating a type of the payload data and a random access point (RAP) flag indicating that the payload contains a RAP to a data stream of a media data type, wherein, in case that the type field is set to a first value indicating that the payload data is a media-aware fragment of the MPU, the payload consists of a first payload header for a MPU mode prior to the payload data, the first payload header comprising a data type field indicating a fragment type of the payload data, a fragmentation indicator (f_i) comprising information about fragmentation of the payload data, an aggregation flag (A) indicating that more than one delivery data unit is in the payload, and a fragment counter (frag_count) indicating a number of payload containing fragments of a same delivery data unit succeeding the payload, and wherein, in case that the type field is set to a second value indicating that the payload data is a generic object including the MPU completely, the payload consists of a second payload header for a generic file delivery (GFD) mode prior to the payload data, the second payload header comprising a L field indicating that the transport packet is a last delivered packet of the generic object, a B field indicating that the transport packet comprising a last byte of the generic object, a code point field indicating an opaque identifier that is passed a packet payload decoder to convey information on the payload, and a start offset indicating a location of the payload data in the generic object. 2. The method of claim 1, wherein the generic object in the payload data comprises a complete MPU. 3. The method of claim 1, wherein the fragment type indicated by the data type field is one of MPU metadata, movie fragment metadata, and MFU. | 3,700 |
347,142 | 16,805,639 | 3,784 | The technology disclosed relates to creating user-defined interaction spaces and modalities in a three dimensional (3D) sensor space in response to control gestures. It also relates to controlling virtual cameras in the 3D sensor space using control gestures and manipulating controls of the virtual cameras through the control gestures. In particular, it relates to defining one or more spatial attributes of the interaction spaces and modalities in response to one or more gesture parameters of the control gesture. It also particularly relates to defining one or more visual parameters of a virtual camera in response to one or more gesture parameters of the control gesture. | 1. A method of manipulating virtual objects in a three-dimensional (3D) sensor space, the method including:
receiving a control gesture that makes swirling motions in a 3D sensor space; obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex; receiving subsequent control gestures that make circular sweeps in the 3D sensor space; obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects; obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 2. The method of claim 1, further comprising:
obtaining an area determined for the vortex from the control gestures. 3. The method of claim 1, further comprising:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 4. The method of claim 1, further comprising obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 5. The method of claim 1, further comprising obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 6. The method of claim 1, further comprising the virtual vector field increasing in strength responsive to continued circling of a control gesture. 7. The method of claim 1, further comprising obtaining a repulsive vortex in which virtual objects move further apart from one another. 8. A non-transitory computer-readable recording medium having a program recorded thereon for manipulating virtual objects in a three-dimensional (3D) sensor space, the program, when executed on a processor, implementing a method comprising:
receiving a virtual vector field in response to a control gesture that makes swirling motions in a 3D sensor space; obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex; receiving subsequent control gestures that make circular sweeps in the 3D sensor space; obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects; obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 9. The non-transitory computer-readable recording medium of claim 8, further comprising:
obtaining an area determined for the vortex from the control gestures. 10. The non-transitory computer-readable recording medium of claim 8, further comprising:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 11. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 12. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 13. The non-transitory computer-readable recording medium of claim 8, further comprising the virtual vector field increasing in strength responsive to continued circling of a control gesture. 14. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining a repulsive vortex in which virtual objects move further apart from one another. 15. A smart phone having an interface that manipulates virtual objects in a three-dimensional (3D) sensor space, the smart phone comprising:
a hardware controller storing instructions that, when executed, implement actions including:
receiving a control gesture, as viewed by a camera having a particular vantage point, that makes swirling motions in a 3D sensor space;
obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex;
receiving subsequent control gestures that make circular sweeps in the 3D sensor space;
obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects;
obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and
providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 16. The smart phone of claim 15, wherein the actions further include:
obtaining an area determined for the vortex from the control gestures. 17. The smart phone of claim 15, wherein the actions further include:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 18. The smart phone of claim 15, wherein the actions further include obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 19. The smart phone of claim 15, wherein the actions further include obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 20. The smart phone of claim 15, wherein the actions further include obtaining a repulsive vortex in which virtual objects move further apart from one another. | The technology disclosed relates to creating user-defined interaction spaces and modalities in a three dimensional (3D) sensor space in response to control gestures. It also relates to controlling virtual cameras in the 3D sensor space using control gestures and manipulating controls of the virtual cameras through the control gestures. In particular, it relates to defining one or more spatial attributes of the interaction spaces and modalities in response to one or more gesture parameters of the control gesture. It also particularly relates to defining one or more visual parameters of a virtual camera in response to one or more gesture parameters of the control gesture.1. A method of manipulating virtual objects in a three-dimensional (3D) sensor space, the method including:
receiving a control gesture that makes swirling motions in a 3D sensor space; obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex; receiving subsequent control gestures that make circular sweeps in the 3D sensor space; obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects; obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 2. The method of claim 1, further comprising:
obtaining an area determined for the vortex from the control gestures. 3. The method of claim 1, further comprising:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 4. The method of claim 1, further comprising obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 5. The method of claim 1, further comprising obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 6. The method of claim 1, further comprising the virtual vector field increasing in strength responsive to continued circling of a control gesture. 7. The method of claim 1, further comprising obtaining a repulsive vortex in which virtual objects move further apart from one another. 8. A non-transitory computer-readable recording medium having a program recorded thereon for manipulating virtual objects in a three-dimensional (3D) sensor space, the program, when executed on a processor, implementing a method comprising:
receiving a virtual vector field in response to a control gesture that makes swirling motions in a 3D sensor space; obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex; receiving subsequent control gestures that make circular sweeps in the 3D sensor space; obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects; obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 9. The non-transitory computer-readable recording medium of claim 8, further comprising:
obtaining an area determined for the vortex from the control gestures. 10. The non-transitory computer-readable recording medium of claim 8, further comprising:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 11. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 12. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 13. The non-transitory computer-readable recording medium of claim 8, further comprising the virtual vector field increasing in strength responsive to continued circling of a control gesture. 14. The non-transitory computer-readable recording medium of claim 8, wherein the method further includes obtaining a repulsive vortex in which virtual objects move further apart from one another. 15. A smart phone having an interface that manipulates virtual objects in a three-dimensional (3D) sensor space, the smart phone comprising:
a hardware controller storing instructions that, when executed, implement actions including:
receiving a control gesture, as viewed by a camera having a particular vantage point, that makes swirling motions in a 3D sensor space;
obtaining a virtual vector field using the control gesture received, wherein the virtual vector field is a vortex;
receiving subsequent control gestures that make circular sweeps in the 3D sensor space;
obtaining a plurality of virtual objects in response to the subsequent control gestures received and object vectors defined on respective virtual objects;
obtaining interactions of the vector field compounded with the object vectors based on their respective magnitudes; and
providing for display, the virtual objects adjusted for an effect of the vortex on the virtual objects in proportion to the interactions of the vector field and the object vectors thereby causing the object vectors of the respective virtual objects to bring one or more of the virtual objects closer to a center of the vortex or pushing one or more of the virtual objects away from the center of the vortex. 16. The smart phone of claim 15, wherein the actions further include:
obtaining an area determined for the vortex from the control gestures. 17. The smart phone of claim 15, wherein the actions further include:
obtaining from the plurality of virtual objects, a set of virtual objects determined to be within the vortex based upon the size of the vortex; and providing for display, members of the set of virtual objects moving in unison responsive to the control gesture. 18. The smart phone of claim 15, wherein the actions further include obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and curling of fingers of a hand. 19. The smart phone of claim 15, wherein the actions further include obtaining an appropriate velocity of motion for the virtual objects determined from a compounding of the size of the vortex and degrees of freedom between fingers of curled fingers of a hand. 20. The smart phone of claim 15, wherein the actions further include obtaining a repulsive vortex in which virtual objects move further apart from one another. | 3,700 |
347,143 | 16,805,623 | 3,784 | Methods, systems, and devices for wireless communications are described. A UE may communicate with a set of transceiver nodes (e.g., transmission reception points (TRPs)) in a first transceiver node operation mode (e.g., a multi-TRP mode). A first transceiver node of the set of transceiver nodes may receive, from a second of the set of transceiver nodes, an indication to switch between rate matching states. The first transceiver node may switch from a first rate matching state to a second rate matching state and may transmit a downlink shared channel based on a resource configuration associated with the second rate matching state. The UE may receive the shared channel based on an antenna port configuration determined by the UE based on the first transceiver node operation and rate matching information. The rate matching information may be provided by the first transceiver node. | 1. A method for wireless communications at a user equipment (UE), comprising:
identifying a transceiver node operation mode for the UE; receiving an indication of rate matching information for a downlink shared channel for the UE; determining an antenna port configuration for the downlink shared channel based at least in part on the transceiver node operation mode and the rate matching information; and monitoring for the downlink shared channel based at least in part on the antenna port configuration. 2. The method of claim 1, further comprising:
identifying an antenna port mapping table of a plurality of antenna port mapping tables based at least in part on the transceiver node operation mode; and determining the antenna port configuration for the downlink shared channel based at least in part on the antenna port mapping table. 3. The method of claim 2, further comprising:
receiving a downlink control channel that comprises the indication of rate matching information, wherein the antenna port mapping table is identified based at least in part on the downlink control channel. 4. The method of claim 2, wherein the antenna port mapping table comprises a demodulation reference signal port mapping table indicating a number of demodulation reference signal code division multiplexing groups and a set of demodulation reference signal port indices. 5. The method of claim 2, wherein:
the antenna port mapping table of the plurality of antenna port mapping tables is associated with the transceiver node operation mode; and a second antenna port mapping table of the plurality of antenna port mapping tables is associated with a second transceiver node operation mode different from the transceiver node operation mode. 6. The method of claim 1, further comprising:
receiving the downlink shared channel based at least in part on the monitoring, wherein the downlink shared channel is received via a set of resource elements allocated for demodulation reference signal transmission from another transceiver node based at least in part on the antenna port configuration; identifying a set of demodulation reference signals and a set of demodulation reference signal port indices based at least in part on the antenna port configuration; and monitoring for data of the downlink shared channel via a set of resources allocated based at least in part on the antenna port configuration. 7. The method of claim 1, wherein the transceiver node operation mode comprises one of a single transmission reception point operation mode associated with a first antenna port mapping table or a multiple transmission reception point operation mode associated with a plurality of antenna port mapping tables including at least a second antenna port mapping table different from the first antenna port mapping table. 8. The method of claim 1, wherein identifying the transceiver node operation mode comprises:
receiving an indication of the transceiver node operation mode or a change in mode operation via control signaling. 9. A method for wireless communications at a transceiver node, comprising:
identifying a transceiver node operation mode for a user equipment (UE) in communication with the transceiver node; determining an antenna port configuration for a downlink shared channel for the UE based at least in part on the transceiver node operation mode; transmitting, to the UE, an indication of rate matching information for the downlink shared channel, the rate matching information indicating the antenna port configuration; and transmitting the downlink shared channel to the UE according to the antenna port configuration. 10. The method of claim 9, further comprising:
identifying an antenna port mapping table of a plurality of antenna port mapping tables based at least in part on the transceiver node operation mode; and determining the antenna port configuration for the downlink shared channel based at least in part on the antenna port mapping table. 11. The method of claim 10, further comprising:
transmitting, to the UE, a downlink control channel that comprises the indication of rate matching information and the antenna port mapping table. 12. The method of claim 10, wherein the antenna port mapping table comprises a demodulation reference signal port mapping table indicating a number of demodulation reference signal code division multiplexing groups and a set of demodulation reference signal port indices. 13. The method of claim 10, wherein:
the antenna port mapping table of the plurality of antenna port mapping tables is associated with the transceiver node operation mode; and a second antenna port mapping table of the plurality of antenna port mapping tables is associated with a second transceiver node operation mode different from the transceiver node operation mode. 14. The method of claim 9, further comprising:
transmitting the downlink shared channel via a set of resources over which an associated demodulation reference signal is transmitted. 15. The method of claim 9, further comprising:
identifying a set of resource elements allocated for demodulation reference signal transmission from another transceiver node based at least in part on the antenna port configuration; and allocating the set of resource elements to at least a portion of data based at least in part on the antenna port configuration and the transceiver node operation mode. 16. The method of claim 15, further comprising:
emptying the set of resource elements based at least in part on the antenna port configuration and the transceiver node operation mode; or identifying a set of demodulation reference signals and a set of demodulation reference signal port indices based at least in part on the antenna port configuration; and transmitting the downlink shared channel based at least in part on the set of demodulation reference signals and the set of demodulation reference signal port indices. 17. The method of claim 9, wherein the transceiver node operation mode comprises one of a single transmission reception point operation mode associated with a first antenna port mapping table or a multiple transmission reception point operation mode associated with a plurality of antenna port mapping tables including at least a second antenna port mapping table different from the first antenna port mapping table. 18. A method for wireless communications at a first transceiver node of a plurality of transceiver nodes, comprising:
identifying a buffer of data for transmission to a user equipment (UE) in communication with the first transceiver node; receiving, from a second transceiver node of the plurality of transceiver nodes, an indication to switch between rate matching states at the first transceiver node; switching from a first rate matching state to a second rate matching state based at least in part on receiving the indication; and transmitting, to the UE, a downlink shared channel transmission based at least in part on a resource configuration associated with the second rate matching state. 19. The method of claim 18, further comprising:
delaying switching from the first rate matching state to the second rate matching state for a number of slots after receiving the indication; and switching from the first rate matching state to the second rate matching state after the number of slots. 20. The method of claim 19, further comprising:
transmitting a second downlink shared channel transmission based at least in part on a resource configuration associated with the first rate matching state, wherein the second downlink shared channel transmission is transmitted after receiving the indication and before switching from the first rate matching state to the second rate matching state. 21. The method of claim 18, further comprising:
switching from the first rate matching state to the second rate matching state in a first slot consecutive to a slot in which the indication is received. 22. The method of claim 21, further comprising:
transmitting the downlink shared channel transmission in the first slot based at least in part on the buffer of data being empty. 23. The method of claim 18, further comprising:
determining, after transmitting the downlink shared channel transmission, that the buffer of data has changed from non-empty to empty; and transmitting, to the second transceiver node, a second indication to switch between rate matching states at the second transceiver node. 24. The method of claim 18, further comprising:
determining that the buffer of data has changed from empty to non-empty; transmitting, to the second transceiver node, a second indication to switch between rate matching states at the second transceiver node; and transmitting a second downlink shared channel transmission to the UE after transmitting the second indication to switch between rate matching states at the second transceiver node. 25. The method of claim 24, further comprising:
delaying transmission of the second downlink shared channel transmission for a number of slots after transmitting the second indication to switch between rate matching states at the second transceiver node, wherein delaying the transmission is based at least in part on a rate matching state of the first transceiver node at a time of receipt of the indication to switch between rate matching states at the first transceiver node; and transmitting the downlink shared channel transmission after the number of slots. 26. The method of claim 24, further comprising:
monitoring for a response to the second indication to switch between rate matching states at the second transceiver node, wherein monitoring for the response is based at least in part on a rate matching state of the first transceiver node at a time of receipt of the indication to switch between rate matching states at the first transceiver node; and transmitting the second downlink shared channel transmission upon receiving the response. 27. The method of claim 18, further comprising:
transmitting an acknowledgement to the second transceiver node in response to receiving the indication. 28. The method of claim 18, further comprising:
transmitting a non-acknowledgement to the second transceiver node after receiving the indication; and receiving, from the second transceiver node, a third indication to switch between rate matching states at the first transceiver node. 29. The method of claim 18, wherein:
the resource configuration comprises a set of resource elements allocated for a plurality of demodulation reference signal resources and a plurality of data resources; and downlink shared channel transmissions from the first transceiver node in the first rate matching state are associated with a second resource configuration that comprises a second set of resource elements, the second set of resource elements comprising a second plurality of demodulation reference signal resources and a second plurality of data resources. 30. An apparatus for wireless communications at a user equipment (UE), comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify a transceiver node operation mode for the UE;
receive an indication of rate matching information for a downlink shared channel for the UE;
determine an antenna port configuration for the downlink shared channel based at least in part on the transceiver node operation mode and the rate matching information; and
monitor for the downlink shared channel based at least in part on the antenna port configuration. | Methods, systems, and devices for wireless communications are described. A UE may communicate with a set of transceiver nodes (e.g., transmission reception points (TRPs)) in a first transceiver node operation mode (e.g., a multi-TRP mode). A first transceiver node of the set of transceiver nodes may receive, from a second of the set of transceiver nodes, an indication to switch between rate matching states. The first transceiver node may switch from a first rate matching state to a second rate matching state and may transmit a downlink shared channel based on a resource configuration associated with the second rate matching state. The UE may receive the shared channel based on an antenna port configuration determined by the UE based on the first transceiver node operation and rate matching information. The rate matching information may be provided by the first transceiver node.1. A method for wireless communications at a user equipment (UE), comprising:
identifying a transceiver node operation mode for the UE; receiving an indication of rate matching information for a downlink shared channel for the UE; determining an antenna port configuration for the downlink shared channel based at least in part on the transceiver node operation mode and the rate matching information; and monitoring for the downlink shared channel based at least in part on the antenna port configuration. 2. The method of claim 1, further comprising:
identifying an antenna port mapping table of a plurality of antenna port mapping tables based at least in part on the transceiver node operation mode; and determining the antenna port configuration for the downlink shared channel based at least in part on the antenna port mapping table. 3. The method of claim 2, further comprising:
receiving a downlink control channel that comprises the indication of rate matching information, wherein the antenna port mapping table is identified based at least in part on the downlink control channel. 4. The method of claim 2, wherein the antenna port mapping table comprises a demodulation reference signal port mapping table indicating a number of demodulation reference signal code division multiplexing groups and a set of demodulation reference signal port indices. 5. The method of claim 2, wherein:
the antenna port mapping table of the plurality of antenna port mapping tables is associated with the transceiver node operation mode; and a second antenna port mapping table of the plurality of antenna port mapping tables is associated with a second transceiver node operation mode different from the transceiver node operation mode. 6. The method of claim 1, further comprising:
receiving the downlink shared channel based at least in part on the monitoring, wherein the downlink shared channel is received via a set of resource elements allocated for demodulation reference signal transmission from another transceiver node based at least in part on the antenna port configuration; identifying a set of demodulation reference signals and a set of demodulation reference signal port indices based at least in part on the antenna port configuration; and monitoring for data of the downlink shared channel via a set of resources allocated based at least in part on the antenna port configuration. 7. The method of claim 1, wherein the transceiver node operation mode comprises one of a single transmission reception point operation mode associated with a first antenna port mapping table or a multiple transmission reception point operation mode associated with a plurality of antenna port mapping tables including at least a second antenna port mapping table different from the first antenna port mapping table. 8. The method of claim 1, wherein identifying the transceiver node operation mode comprises:
receiving an indication of the transceiver node operation mode or a change in mode operation via control signaling. 9. A method for wireless communications at a transceiver node, comprising:
identifying a transceiver node operation mode for a user equipment (UE) in communication with the transceiver node; determining an antenna port configuration for a downlink shared channel for the UE based at least in part on the transceiver node operation mode; transmitting, to the UE, an indication of rate matching information for the downlink shared channel, the rate matching information indicating the antenna port configuration; and transmitting the downlink shared channel to the UE according to the antenna port configuration. 10. The method of claim 9, further comprising:
identifying an antenna port mapping table of a plurality of antenna port mapping tables based at least in part on the transceiver node operation mode; and determining the antenna port configuration for the downlink shared channel based at least in part on the antenna port mapping table. 11. The method of claim 10, further comprising:
transmitting, to the UE, a downlink control channel that comprises the indication of rate matching information and the antenna port mapping table. 12. The method of claim 10, wherein the antenna port mapping table comprises a demodulation reference signal port mapping table indicating a number of demodulation reference signal code division multiplexing groups and a set of demodulation reference signal port indices. 13. The method of claim 10, wherein:
the antenna port mapping table of the plurality of antenna port mapping tables is associated with the transceiver node operation mode; and a second antenna port mapping table of the plurality of antenna port mapping tables is associated with a second transceiver node operation mode different from the transceiver node operation mode. 14. The method of claim 9, further comprising:
transmitting the downlink shared channel via a set of resources over which an associated demodulation reference signal is transmitted. 15. The method of claim 9, further comprising:
identifying a set of resource elements allocated for demodulation reference signal transmission from another transceiver node based at least in part on the antenna port configuration; and allocating the set of resource elements to at least a portion of data based at least in part on the antenna port configuration and the transceiver node operation mode. 16. The method of claim 15, further comprising:
emptying the set of resource elements based at least in part on the antenna port configuration and the transceiver node operation mode; or identifying a set of demodulation reference signals and a set of demodulation reference signal port indices based at least in part on the antenna port configuration; and transmitting the downlink shared channel based at least in part on the set of demodulation reference signals and the set of demodulation reference signal port indices. 17. The method of claim 9, wherein the transceiver node operation mode comprises one of a single transmission reception point operation mode associated with a first antenna port mapping table or a multiple transmission reception point operation mode associated with a plurality of antenna port mapping tables including at least a second antenna port mapping table different from the first antenna port mapping table. 18. A method for wireless communications at a first transceiver node of a plurality of transceiver nodes, comprising:
identifying a buffer of data for transmission to a user equipment (UE) in communication with the first transceiver node; receiving, from a second transceiver node of the plurality of transceiver nodes, an indication to switch between rate matching states at the first transceiver node; switching from a first rate matching state to a second rate matching state based at least in part on receiving the indication; and transmitting, to the UE, a downlink shared channel transmission based at least in part on a resource configuration associated with the second rate matching state. 19. The method of claim 18, further comprising:
delaying switching from the first rate matching state to the second rate matching state for a number of slots after receiving the indication; and switching from the first rate matching state to the second rate matching state after the number of slots. 20. The method of claim 19, further comprising:
transmitting a second downlink shared channel transmission based at least in part on a resource configuration associated with the first rate matching state, wherein the second downlink shared channel transmission is transmitted after receiving the indication and before switching from the first rate matching state to the second rate matching state. 21. The method of claim 18, further comprising:
switching from the first rate matching state to the second rate matching state in a first slot consecutive to a slot in which the indication is received. 22. The method of claim 21, further comprising:
transmitting the downlink shared channel transmission in the first slot based at least in part on the buffer of data being empty. 23. The method of claim 18, further comprising:
determining, after transmitting the downlink shared channel transmission, that the buffer of data has changed from non-empty to empty; and transmitting, to the second transceiver node, a second indication to switch between rate matching states at the second transceiver node. 24. The method of claim 18, further comprising:
determining that the buffer of data has changed from empty to non-empty; transmitting, to the second transceiver node, a second indication to switch between rate matching states at the second transceiver node; and transmitting a second downlink shared channel transmission to the UE after transmitting the second indication to switch between rate matching states at the second transceiver node. 25. The method of claim 24, further comprising:
delaying transmission of the second downlink shared channel transmission for a number of slots after transmitting the second indication to switch between rate matching states at the second transceiver node, wherein delaying the transmission is based at least in part on a rate matching state of the first transceiver node at a time of receipt of the indication to switch between rate matching states at the first transceiver node; and transmitting the downlink shared channel transmission after the number of slots. 26. The method of claim 24, further comprising:
monitoring for a response to the second indication to switch between rate matching states at the second transceiver node, wherein monitoring for the response is based at least in part on a rate matching state of the first transceiver node at a time of receipt of the indication to switch between rate matching states at the first transceiver node; and transmitting the second downlink shared channel transmission upon receiving the response. 27. The method of claim 18, further comprising:
transmitting an acknowledgement to the second transceiver node in response to receiving the indication. 28. The method of claim 18, further comprising:
transmitting a non-acknowledgement to the second transceiver node after receiving the indication; and receiving, from the second transceiver node, a third indication to switch between rate matching states at the first transceiver node. 29. The method of claim 18, wherein:
the resource configuration comprises a set of resource elements allocated for a plurality of demodulation reference signal resources and a plurality of data resources; and downlink shared channel transmissions from the first transceiver node in the first rate matching state are associated with a second resource configuration that comprises a second set of resource elements, the second set of resource elements comprising a second plurality of demodulation reference signal resources and a second plurality of data resources. 30. An apparatus for wireless communications at a user equipment (UE), comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify a transceiver node operation mode for the UE;
receive an indication of rate matching information for a downlink shared channel for the UE;
determine an antenna port configuration for the downlink shared channel based at least in part on the transceiver node operation mode and the rate matching information; and
monitor for the downlink shared channel based at least in part on the antenna port configuration. | 3,700 |
347,144 | 16,805,640 | 3,784 | A user equipment (UE) for receiving control information in a wireless communication system includes a transceiver configured to receive a synchronization signal/physical broadcasting channel (SS/PBCH) block of an index i from a BS, wherein SS/PBCH block comprises a PBCH carrying master information block (MIB). The UE includes a processor configured to for the SS/PBCH block of the index i, determine a slot index no as a sum of an offset value and [i*M]. The offset value is determined based on a first value O determined according to the index indicated in the MIB, wherein the index configures PDCCH monitoring occasions, and a second value μ indicated in the MIB, wherein the second value μ represents a subcarrier spacing configuration, wherein M is a positive number determined according to the index indicated in the MIB, and cause the transceiver to decode a PDCCH in the slot index no. | 1. A method for operating a user equipment (UE) in a wireless communication system, the method comprising:
receiving, from a base station (BS), a synchronization signal/physical broadcasting channel (SS/PBCH) block; determining at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH; and receiving, from the BS, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 2. The method of claim 1, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and determining the at least one parameter comprises determining the starting slot index for the PDCCH based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 3. The method of claim 2, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 4. The method of claim 1, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
determining the at least one parameter comprises determining the first symbol index based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 5. The method of claim 1, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and determining the at least one parameter comprises determining the slot index for the PDCCH to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 6. The method of claim 1, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and determining the at least one parameter comprises determining the first symbol index for the PDCCH based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 7. The method of claim 6, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is determined as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 8. The method of claim 7, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is determined as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 9. The method of claim 7, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 10. A user equipment (UE) in a wireless communication system, the UE comprising:
a transceiver configured to receive, from a base station (BS), a synchronization signal/physical broadcasting channel (SS/PBCH) block; and a processor operably connected to the transceiver, the processor configured to determine at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH, wherein the transceiver is further configured to receive, from the BS, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 11. The UE of claim 10, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and the processor is configured to determine the starting slot index for the PDCCH based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 12. The UE of claim 11, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 13. The UE of claim 10, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
the processor is configured to determine the first symbol index based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 14. The UE of claim 10, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and the processor is configured to determine the slot index for the PDCCH to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 15. The UE of claim 10, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and the processor is configured to determine the first symbol index for the PDCCH based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 16. The UE of claim 15, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is determined as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 17. The UE of claim 16, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is determined as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 18. The UE of claim 16, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 19. A base station (BS) in a wireless communication system, the BS comprising:
a processor configured to generate a synchronization signal/physical broadcasting channel (SS/PBCH) block, a transceiver operably connected to the processor, the transceiver configured to:
transmit, to a user equipment (UE), the SS/PBCH block, wherein at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions is indicated based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH; and
transmit, to the UE, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 20. The BS of claim 19, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and the starting slot index for the PDCCH is indicated based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 21. The BS of claim 20, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 22. The BS of claim 19, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
the first symbol index is indicated based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 23. The BS of claim 19, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and the slot index for the PDCCH is indicated to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 24. The BS of claim 19, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and the the first symbol index for the PDCCH is indicated based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 25. The BS of claim 24, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is indicated as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 26. The BS of claim 25, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is indicated as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is indicated as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 27. The BS of claim 25, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is indicated as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. | A user equipment (UE) for receiving control information in a wireless communication system includes a transceiver configured to receive a synchronization signal/physical broadcasting channel (SS/PBCH) block of an index i from a BS, wherein SS/PBCH block comprises a PBCH carrying master information block (MIB). The UE includes a processor configured to for the SS/PBCH block of the index i, determine a slot index no as a sum of an offset value and [i*M]. The offset value is determined based on a first value O determined according to the index indicated in the MIB, wherein the index configures PDCCH monitoring occasions, and a second value μ indicated in the MIB, wherein the second value μ represents a subcarrier spacing configuration, wherein M is a positive number determined according to the index indicated in the MIB, and cause the transceiver to decode a PDCCH in the slot index no.1. A method for operating a user equipment (UE) in a wireless communication system, the method comprising:
receiving, from a base station (BS), a synchronization signal/physical broadcasting channel (SS/PBCH) block; determining at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH; and receiving, from the BS, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 2. The method of claim 1, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and determining the at least one parameter comprises determining the starting slot index for the PDCCH based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 3. The method of claim 2, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 4. The method of claim 1, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
determining the at least one parameter comprises determining the first symbol index based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 5. The method of claim 1, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and determining the at least one parameter comprises determining the slot index for the PDCCH to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 6. The method of claim 1, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and determining the at least one parameter comprises determining the first symbol index for the PDCCH based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 7. The method of claim 6, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is determined as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 8. The method of claim 7, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is determined as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 9. The method of claim 7, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 10. A user equipment (UE) in a wireless communication system, the UE comprising:
a transceiver configured to receive, from a base station (BS), a synchronization signal/physical broadcasting channel (SS/PBCH) block; and a processor operably connected to the transceiver, the processor configured to determine at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH, wherein the transceiver is further configured to receive, from the BS, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 11. The UE of claim 10, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and the processor is configured to determine the starting slot index for the PDCCH based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 12. The UE of claim 11, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 13. The UE of claim 10, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
the processor is configured to determine the first symbol index based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 14. The UE of claim 10, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and the processor is configured to determine the slot index for the PDCCH to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 15. The UE of claim 10, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and the processor is configured to determine the first symbol index for the PDCCH based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 16. The UE of claim 15, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is determined as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 17. The UE of claim 16, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is determined as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 18. The UE of claim 16, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is determined as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 19. A base station (BS) in a wireless communication system, the BS comprising:
a processor configured to generate a synchronization signal/physical broadcasting channel (SS/PBCH) block, a transceiver operably connected to the processor, the transceiver configured to:
transmit, to a user equipment (UE), the SS/PBCH block, wherein at least one parameter for a physical downlink control channel (PDCCH) monitoring occasions is indicated based on at least one of a multiplexing pattern, an index of the SS/PBCH block, and a subcarrier spacing for the PDCCH; and
transmit, to the UE, the PDCCH on the PDCCH monitoring occasions based on the at least one parameter. 20. The BS of claim 19, wherein, when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a starting slot index for the PDCCH, and the starting slot index for the PDCCH is indicated based on the index of SS/PBCH block, an offset indicated by master information block (MIB) comprised in the SS/PBCH block, and a value of numerology indicated by a subcarrier spacing for the PDCCH. 21. The BS of claim 20, wherein:
the offset is from a set of candidate offsets, and the set of candidate offsets comprises {0, 2, 5, 7} or {0, 2.5, 5, 7.5}. 22. The BS of claim 19, wherein:
when the multiplexing pattern is a first multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and
the first symbol index is indicated based on a number of search space sets per slot, and
the number of search space sets per slot is 1 or 2. 23. The BS of claim 19, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a slot index for the PDCCH, and the slot index for the PDCCH is indicated to be a same value as a slot index for the SS/PBCH block or a value of the slot index for the SS/PBCH block minus 1 based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH, and the index of the SS/PBCH block. 24. The BS of claim 19, wherein, when the multiplexing pattern is a second multiplexing pattern or a third multiplexing pattern:
the at least one parameter comprises a first symbol index for the PDCCH, and the the first symbol index for the PDCCH is indicated based on a first subcarrier spacing for the SS/PBCH block, a second subcarrier spacing for the PDCCH and the index of the SS/PBCH block. 25. The BS of claim 24, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 60 kHz:
the first symbol index is indicated as 0, 1, 6, 7, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. 26. The BS of claim 25, wherein, when the multiplexing pattern is the second multiplexing pattern, the first subcarrier spacing value is 240 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is indicated as 0, 1, 2, 3, 0, 1, when the index of the SS/PBCH block is equal to 8k, 8k+1, 8k+2, 8k+3, 8k+6, 8k+8, respectively, where k is an integer, and a slot index for the PDCCH is a same value as a slot index for the SS/PBCH block, the first symbol index is indicated as 12, 13, when the index of the SS/PBCH block is equal to 8k+4, 8k+5, respectively, where k is an integer, and the slot index for the PDCCH is a value of the slot index for the SS/PBCH block minus 1. 27. The BS of claim 25, wherein, when the multiplexing pattern is the third multiplexing pattern, the first subcarrier spacing value is 120 kHz, and the second subcarrier spacing value is 120 kHz:
the first symbol index is indicated as 4, 8, 2, 6, when the index of the SS/PBCH block is equal to 4k, 4k+1, 4k+2, 4k+3, respectively, where k is an integer. | 3,700 |
347,145 | 16,805,597 | 3,784 | A data generation method, a method for configuring logical channel, a terminal device, and a chip are provided. The terminal device has m logical channels and a plurality of carriers, each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of the m logical channels, and m>0. The method comprises: receiving RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generating a MAC protocol data unit PDU, wherein the MAC PDU comprises RLC PDUs on the k logical channels. The terminal device can determine a carrier for transmitting the MAC PDU. | 1. A data generation method applied to a terminal device, wherein the terminal device has m logical channels and a plurality of carriers, each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of the m logical channels, and m>0, and the method comprises:
receiving radio link control RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generating a media access control (MAC) protocol data unit (PDU), wherein the MAC PDU comprises RLC PDUs on the k logical channels. 2. The data generation method of claim 1 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises determining the k logical channels in the n logical channels, wherein a priority of each of the k logical channels belongs to the priority correlated to the first carrier. 3. The data generation method of claim 1 wherein when a priority correlated to a second carrier in the plurality of carriers comprises a priority of a first logical channel in the m logical channels, the priority correlated to the second carrier further comprises a priority that is of a logical channel in the m logical channels and that is lower than the priority of the first logical channel. 4. The data generation method of claim 1 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises:
determining a second logical channel in the n logical channels, wherein a priority of the second logical channel belongs to the priority correlated to the first carrier; and
determining the k logical channels according to the priority of the second logical channel. 5. The data generation method of claim 1 further comprising determining,
according to a channel busy ratio of the first carrier and a first threshold, whether carrier re-election is allowed. 6. The data generation method of claim 5 wherein a priority of each logical channel is correlated to one threshold. 7. The data generation method of claim 5 wherein the first threshold is a minimum value of a threshold correlated to the priority of the first carrier. 8. A terminal device including:
m logical channels and a plurality of carriers, wherein each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of them logical channels, and m>0; one or more processors; and one or more memories storing computer-readable instructions that, upon execution by the one or more processors, configure the terminal device to: receive radio link control RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determine k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generate a media access control (MAC) protocol data unit (PDU), wherein the MAC PDU comprises RLC PDUs on the k logical channels. 9. The terminal device of claim 8 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises determining the k logical channels in the n logical channels, wherein a priority of each of the k logical channels belongs to the priority correlated to the first carrier. 10. The terminal device of claim 8 wherein, when a priority correlated to a second carrier in the plurality of carriers comprises a priority of a first logical channel in the m logical channels, the priority correlated to the second carrier further comprises a priority that is of a logical channel in the m logical channels and that is lower than the priority of the first logical channel. 11. The terminal device of claim 8 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises:
determining a second logical channel in the n logical channels, wherein a priority of the second logical channel belongs to the priority correlated to the first carrier; and
determining the k logical channels according to the priority of the second logical channel. 12. The terminal device of claim 8 wherein the computer-readable instructions further configure the terminal device to determine, according to a channel busy ratio of the first carrier and a first threshold, whether carrier re-election is allowed. 13. The terminal device of claim 12 wherein a priority of each logical channel is correlated to one threshold. 14. The terminal device of claim 12 wherein the first threshold is a minimum value of a threshold correlated to the priority of the first carrier. 15. A method for configuring a logical channel, applied to a terminal device, wherein the terminal device is configured with at least one logical channel including a first logical channel correlated to at least one first reliability requirement. 16. The method for configuring a logical channel of claim 15 further comprising determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group. 17. The method for configuring a logical channel of claim 16 wherein determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group comprises:
determining to correlate the first logical channel to the logical channel group when the at least one second reliability requirement comprises at least one of the at least one first reliability requirement. 18. The method for configuring a logical channel of claim 16 wherein determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group comprises:
determining not to correlate the first logical channel to the logical channel group when the at least one second reliability requirement does not comprise the at least one first reliability requirement. 19. The method for configuring a logical channel of claim 15 wherein the method further comprises triggering a data cache report according to a reliability requirement correlated to the at least one logical channel. 20. The method for configuring a logical channel of claim 19 wherein the triggering a data cache report according to a reliability requirement correlated to the at least one logical channel comprises, when data arrives on the first logical channel, triggering the data cache report if a reliability requirement correlated to the first logical channel is higher than that of another logical channel already having to-be-transmitted data. | A data generation method, a method for configuring logical channel, a terminal device, and a chip are provided. The terminal device has m logical channels and a plurality of carriers, each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of the m logical channels, and m>0. The method comprises: receiving RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generating a MAC protocol data unit PDU, wherein the MAC PDU comprises RLC PDUs on the k logical channels. The terminal device can determine a carrier for transmitting the MAC PDU.1. A data generation method applied to a terminal device, wherein the terminal device has m logical channels and a plurality of carriers, each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of the m logical channels, and m>0, and the method comprises:
receiving radio link control RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generating a media access control (MAC) protocol data unit (PDU), wherein the MAC PDU comprises RLC PDUs on the k logical channels. 2. The data generation method of claim 1 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises determining the k logical channels in the n logical channels, wherein a priority of each of the k logical channels belongs to the priority correlated to the first carrier. 3. The data generation method of claim 1 wherein when a priority correlated to a second carrier in the plurality of carriers comprises a priority of a first logical channel in the m logical channels, the priority correlated to the second carrier further comprises a priority that is of a logical channel in the m logical channels and that is lower than the priority of the first logical channel. 4. The data generation method of claim 1 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises:
determining a second logical channel in the n logical channels, wherein a priority of the second logical channel belongs to the priority correlated to the first carrier; and
determining the k logical channels according to the priority of the second logical channel. 5. The data generation method of claim 1 further comprising determining,
according to a channel busy ratio of the first carrier and a first threshold, whether carrier re-election is allowed. 6. The data generation method of claim 5 wherein a priority of each logical channel is correlated to one threshold. 7. The data generation method of claim 5 wherein the first threshold is a minimum value of a threshold correlated to the priority of the first carrier. 8. A terminal device including:
m logical channels and a plurality of carriers, wherein each of the m logical channels is configured with a priority, each of the plurality of carriers is correlated to a priority of at least one of them logical channels, and m>0; one or more processors; and one or more memories storing computer-readable instructions that, upon execution by the one or more processors, configure the terminal device to: receive radio link control RLC data on n logical channels, wherein the n logical channels belong to the m logical channels, and m≥n>0; determine k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers, wherein n≥k>0; and generate a media access control (MAC) protocol data unit (PDU), wherein the MAC PDU comprises RLC PDUs on the k logical channels. 9. The terminal device of claim 8 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises determining the k logical channels in the n logical channels, wherein a priority of each of the k logical channels belongs to the priority correlated to the first carrier. 10. The terminal device of claim 8 wherein, when a priority correlated to a second carrier in the plurality of carriers comprises a priority of a first logical channel in the m logical channels, the priority correlated to the second carrier further comprises a priority that is of a logical channel in the m logical channels and that is lower than the priority of the first logical channel. 11. The terminal device of claim 8 wherein determining k logical channels in the n logical channels according to priorities of the n logical channels and a priority correlated to a first carrier in the plurality of carriers comprises:
determining a second logical channel in the n logical channels, wherein a priority of the second logical channel belongs to the priority correlated to the first carrier; and
determining the k logical channels according to the priority of the second logical channel. 12. The terminal device of claim 8 wherein the computer-readable instructions further configure the terminal device to determine, according to a channel busy ratio of the first carrier and a first threshold, whether carrier re-election is allowed. 13. The terminal device of claim 12 wherein a priority of each logical channel is correlated to one threshold. 14. The terminal device of claim 12 wherein the first threshold is a minimum value of a threshold correlated to the priority of the first carrier. 15. A method for configuring a logical channel, applied to a terminal device, wherein the terminal device is configured with at least one logical channel including a first logical channel correlated to at least one first reliability requirement. 16. The method for configuring a logical channel of claim 15 further comprising determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group. 17. The method for configuring a logical channel of claim 16 wherein determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group comprises:
determining to correlate the first logical channel to the logical channel group when the at least one second reliability requirement comprises at least one of the at least one first reliability requirement. 18. The method for configuring a logical channel of claim 16 wherein determining, according to a correlation between a logical channel group configured by a network and at least one second reliability requirement, whether to correlate the first logical channel to the logical channel group comprises:
determining not to correlate the first logical channel to the logical channel group when the at least one second reliability requirement does not comprise the at least one first reliability requirement. 19. The method for configuring a logical channel of claim 15 wherein the method further comprises triggering a data cache report according to a reliability requirement correlated to the at least one logical channel. 20. The method for configuring a logical channel of claim 19 wherein the triggering a data cache report according to a reliability requirement correlated to the at least one logical channel comprises, when data arrives on the first logical channel, triggering the data cache report if a reliability requirement correlated to the first logical channel is higher than that of another logical channel already having to-be-transmitted data. | 3,700 |
347,146 | 16,805,591 | 3,784 | The present disclosure provides methods, systems, and non-transitory computer readable media for efficiently storing data. The methods include segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk. | 1. A method for storing data in a secondary storage unit, the method comprising:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block- sized data chunk. 2. The method of claim 1, further comprising:
segmenting the parcel of data into two or more sub-parcels; and selecting two or more secondary storage units to store the sub-parcels of data on. 3. The method of claim 1, wherein the secondary storage units are selected on the basis of:
current or historical IO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 4. The method of claim 1, further comprising:
recording, for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 5. The method of claim 4, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 6. The method of claim 5, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 7. The method of claim 1, further comprising sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 8. The method of claim 7, wherein the exceptional event is one of a loss of power, a time out of a timer, or a command to flush the collection buffer. 9. A non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer system to cause the computer system to perform a method for storing data in a secondary storage unit, the method comprising:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block- sized data chunk. 10. The non-transitory computer readable medium of claim 9, wherein the secondary storage units are selected on the basis of:
current or historical TO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 11. The non-transitory computer readable medium of claim 9, wherein the set of instructions is executable by the at least one processor of the computer system to cause the computer system to further perform:
recording for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 12. The non-transitory computer readable medium of claim 11, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 13. The non-transitory computer readable medium of claim 12, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 14. The non-transitory computer readable medium of claim 9, wherein the set of instructions is executable by the at least one processor of the computer system to cause the computer system to further perform sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 15. A system for storing data in a secondary storage unit, comprising:
a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the system to perform:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks;
sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit;
collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and
sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk. 16. The system of claim 15, wherein the secondary storage units are selected on the basis of:
current or historical IO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 17. The system of claim 15, wherein the one or more processors are configured to execute the set of instructions to cause the system to further perform:
recording, for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 18. The system of claim 17, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 19. The system of claim 18, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 20. The system of claim 15, wherein the one or more processors are configured to execute the set of instructions to cause the system to further perform sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 21. A system comprising:
a host device; and a secondary storage unit communicatively coupled to the host device, wherein the host device is configured to:
segment a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks,
send each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit,
collect, in a collection buffer, the current partial data chunk and at least another partial data chunk; and
send a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk; and
the secondary storage unit is configured to:
write each received full data chunk of the zero or more full data chunks to the selected physical block of the secondary storage unit,
write the combination of the current partial data chunk and the subset of the plurality of other partial data chunks to the selected physical block of the secondary storage unit. | The present disclosure provides methods, systems, and non-transitory computer readable media for efficiently storing data. The methods include segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk.1. A method for storing data in a secondary storage unit, the method comprising:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block- sized data chunk. 2. The method of claim 1, further comprising:
segmenting the parcel of data into two or more sub-parcels; and selecting two or more secondary storage units to store the sub-parcels of data on. 3. The method of claim 1, wherein the secondary storage units are selected on the basis of:
current or historical IO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 4. The method of claim 1, further comprising:
recording, for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 5. The method of claim 4, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 6. The method of claim 5, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 7. The method of claim 1, further comprising sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 8. The method of claim 7, wherein the exceptional event is one of a loss of power, a time out of a timer, or a command to flush the collection buffer. 9. A non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer system to cause the computer system to perform a method for storing data in a secondary storage unit, the method comprising:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks; sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit; collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block- sized data chunk. 10. The non-transitory computer readable medium of claim 9, wherein the secondary storage units are selected on the basis of:
current or historical TO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 11. The non-transitory computer readable medium of claim 9, wherein the set of instructions is executable by the at least one processor of the computer system to cause the computer system to further perform:
recording for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 12. The non-transitory computer readable medium of claim 11, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 13. The non-transitory computer readable medium of claim 12, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 14. The non-transitory computer readable medium of claim 9, wherein the set of instructions is executable by the at least one processor of the computer system to cause the computer system to further perform sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 15. A system for storing data in a secondary storage unit, comprising:
a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the system to perform:
segmenting a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks;
sending each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit;
collecting, in a collection buffer, the current partial data chunk and at least another partial data chunk; and
sending a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk. 16. The system of claim 15, wherein the secondary storage units are selected on the basis of:
current or historical IO utilization of the secondary storage unit, current or historical capacity utilization of the secondary storage unit, performance characteristics of the secondary storage unit, or characteristics of the parcel of data. 17. The system of claim 15, wherein the one or more processors are configured to execute the set of instructions to cause the system to further perform:
recording, for the parcel of data, metadata that maps the parcel of data to the physical blocks where the file's data chunks were written. 18. The system of claim 17, wherein the metadata includes physical block addresses for the physical block where the parcel of data's data chunks were written and indexes of the parcel of data's data chunks in each of the physical blocks. 19. The system of claim 18, wherein:
each written data chunk starts with a header and ends with a footer; the header and footer are unique within their respective data chunk; and the header marks the index of the data chunk. 20. The system of claim 15, wherein the one or more processors are configured to execute the set of instructions to cause the system to further perform sending the partial data chunks collected in the collection buffer to the secondary storage unit to be written to selected physical blocks of the secondary storage unit in response to an exceptional event. 21. A system comprising:
a host device; and a secondary storage unit communicatively coupled to the host device, wherein the host device is configured to:
segment a parcel of data into one or more data chunks according to a physical block size of the secondary storage unit, wherein the one or more data chunks include a partial data chunk and zero or more full data chunks,
send each full data chunk of the zero or more full data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit,
collect, in a collection buffer, the current partial data chunk and at least another partial data chunk; and
send a combination of the current partial data chunk and a subset of the plurality of other partial data chunks to the secondary storage unit to be written to a selected physical block of the secondary storage unit, wherein said combination fills substantially all of a physical-block-sized data chunk; and
the secondary storage unit is configured to:
write each received full data chunk of the zero or more full data chunks to the selected physical block of the secondary storage unit,
write the combination of the current partial data chunk and the subset of the plurality of other partial data chunks to the selected physical block of the secondary storage unit. | 3,700 |
347,147 | 16,805,656 | 3,784 | A method including extracting, from an input, supported data. The input includes outputs from machine learning models in different formats. The supported data includes a subset of the input after data normalization. The method also includes inferring, from the supported data, data types to be used with respect to generating metrics for the machine learning models. The method also includes generating, from the supported data and using the data types, a relational event including the supported data. The relational event further includes a first data structure object including the types and having a first data structure different than the different formats. The method also includes calculating, using the supported data in the first data structure, the metrics for the machine learning models. The method also includes generating, from the relational event, a monitoring event. The monitoring event includes a second data structure object segmented into data buckets storing the metrics. | 1. A method comprising:
extracting, from an input, supported data,
wherein the input comprises a plurality of outputs from a plurality of machine learning models in a plurality of different formats, and
wherein the supported data comprises at least a subset of the input after data normalization;
inferring, from the supported data, a plurality of data types to be used with respect to generating a plurality of metrics for the plurality of machine learning models; generating, from the supported data and using the plurality of data types, a relational event comprising the supported data, wherein the relational event further comprises a first data structure object including the plurality of data types and having a first data structure different than the plurality of different formats; calculating, using the supported data in the first data structure, the plurality of metrics for the plurality of machine learning models; generating, from the relational event, a monitoring event, wherein the monitoring event comprises a second data structure object segmented into a plurality of data buckets which store the plurality of metrics. 2. The method of claim 1, further comprising:
presenting the monitoring event. 3. The method of claim 2, wherein presenting the monitoring event comprises at least one of:
storing the monitoring event; displaying the monitoring event to a user on a computer display; feeding the monitoring event to a monitoring service comprising software for generating an alert when data in the monitoring event satisfies a condition; and changing one or more of the plurality of the machine learning models using the data in the monitoring event. 4. The method of claim 1, further comprising:
prior to extracting, normalizing the input. 5. The method of claim 4 wherein normalizing comprises:
flattening the input such that the input comprises only numerical type data, categorical type data, and lists of numerical or categorical type data. 6. The method of claim 4, wherein extracting the supported data comprises:
extracting only data in the input compatible with the relational event. 7. The method of claim 1, wherein the first machine learning model and the second machine learning model comprise one machine learning model outputting different data at different times. 8. The method of claim 1, further comprising:
modifying the monitoring event to have an original format matching at least one of the plurality of machine learning models; and modifying the at least one of the plurality of machine learning models using the monitoring event. 9. The method of claim 1, wherein the input further comprises previously generated monitoring events, and wherein the supported data includes at least some information from the previously generated monitoring events. 10. The method of claim 1,
wherein calculating the plurality of metrics is performed by a metric pipeline, and wherein the method further comprises executing the metric pipeline to:
sequentially execute a workflow to produce the plurality of metrics,
exclude a portion of the plurality of metrics, and
after sequentially executing the workflow, segment remaining metrics into the plurality of data buckets. 11. A system comprising:
a data repository storing:
a first result of a first machine learning model, the first result comprising a first initial data structure having a first format,
a second result of a second machine learning model, the second result comprising a second initial data structure having a second format different than the first format,
supported data comprising at least a subset of the first result and the second result after data normalization,
a relational event, comprising a first data structure which stores the supported data,
a plurality of metrics for the first machine learning model and the second machine learning model, and
a monitoring event, comprising a second data structure storing the plurality of metrics in a plurality of data buckets;
a data pipeline programmed, when executed, to generate the relational event by extracting the supported data from the first result and the second result into the relational event; a metric pipeline programmed, when executed, to calculate the plurality of metrics, and generate the monitoring event from the plurality of metrics; a model monitoring service comprising the data pipeline and the metric pipeline; and an application programming interface (API) in communication with the model monitoring service, the API configured to allow a user to modify or monitor operation of the model monitoring service. 12. The system of claim 11 wherein the model monitoring service is further configured to present the monitoring event. 13. The system of claim 12, wherein the model monitoring service is further configured to present the monitoring event by performing, when executed, at least one of:
storing the monitoring event, displaying the monitoring event to a user on a computer display, feeding the monitoring event to a monitoring service comprising software for generating an alert when data in the monitoring event satisfies a condition, and changing one or more of the plurality of the machine learning models using the data in the monitoring event. 14. The system of claim 11, wherein the data pipeline is further configured to, prior to extracting, normalize the input. 15. The system of claim 11, wherein the data pipeline is further configured to extract only data in the input compatible with the relational event. 16. The system of claim 11, wherein the model monitoring service is further configured, when executed, to:
modify the monitoring event to have an original format matching at least one of the plurality of machine learning models, and modify the at least one of the plurality of machine learning models using the monitoring event. 17. The system of claim 11, wherein:
the metric pipeline comprises a plurality of modules, each of the plurality of modules is configured to generate a different type of metric, and the metric pipeline is further configured to segment each of the different types of metrics into corresponding ones of the plurality of data buckets. 18. The system of claim 11, wherein the relational event further stores information from past monitoring events. 19. A method comprising:
extracting, from an input, supported data, wherein the input comprises a plurality of outputs from a plurality of machine learning models in a plurality of different formats, and wherein the supported data comprises at least a subset of the input after data normalization; inferring, from the supported data, a plurality of data types to be used with respect to generating a plurality of metrics for the plurality of machine learning models; generating, from the supported data and using the plurality of data types, a relational event comprising the supported data, wherein the relational event further comprises a first data structure object including the plurality of data types and having a first data structure different than the plurality of different formats; calculating, using the supported data in the first data structure, the plurality of metrics for at least one of the plurality of machine learning models, wherein calculating further comprises:
identifying dependent metrics in the plurality of metrics,
using intervening metrics computed from previous steps within an execution pipeline that calculates the plurality of metrics to calculate the dependent metrics; and
generating, from the relational event, a monitoring event, wherein the monitoring event comprises a second data structure object segmented into a plurality of data buckets which store the plurality of metrics. 20. The method of claim 19, further comprising:
presenting the monitoring event. | A method including extracting, from an input, supported data. The input includes outputs from machine learning models in different formats. The supported data includes a subset of the input after data normalization. The method also includes inferring, from the supported data, data types to be used with respect to generating metrics for the machine learning models. The method also includes generating, from the supported data and using the data types, a relational event including the supported data. The relational event further includes a first data structure object including the types and having a first data structure different than the different formats. The method also includes calculating, using the supported data in the first data structure, the metrics for the machine learning models. The method also includes generating, from the relational event, a monitoring event. The monitoring event includes a second data structure object segmented into data buckets storing the metrics.1. A method comprising:
extracting, from an input, supported data,
wherein the input comprises a plurality of outputs from a plurality of machine learning models in a plurality of different formats, and
wherein the supported data comprises at least a subset of the input after data normalization;
inferring, from the supported data, a plurality of data types to be used with respect to generating a plurality of metrics for the plurality of machine learning models; generating, from the supported data and using the plurality of data types, a relational event comprising the supported data, wherein the relational event further comprises a first data structure object including the plurality of data types and having a first data structure different than the plurality of different formats; calculating, using the supported data in the first data structure, the plurality of metrics for the plurality of machine learning models; generating, from the relational event, a monitoring event, wherein the monitoring event comprises a second data structure object segmented into a plurality of data buckets which store the plurality of metrics. 2. The method of claim 1, further comprising:
presenting the monitoring event. 3. The method of claim 2, wherein presenting the monitoring event comprises at least one of:
storing the monitoring event; displaying the monitoring event to a user on a computer display; feeding the monitoring event to a monitoring service comprising software for generating an alert when data in the monitoring event satisfies a condition; and changing one or more of the plurality of the machine learning models using the data in the monitoring event. 4. The method of claim 1, further comprising:
prior to extracting, normalizing the input. 5. The method of claim 4 wherein normalizing comprises:
flattening the input such that the input comprises only numerical type data, categorical type data, and lists of numerical or categorical type data. 6. The method of claim 4, wherein extracting the supported data comprises:
extracting only data in the input compatible with the relational event. 7. The method of claim 1, wherein the first machine learning model and the second machine learning model comprise one machine learning model outputting different data at different times. 8. The method of claim 1, further comprising:
modifying the monitoring event to have an original format matching at least one of the plurality of machine learning models; and modifying the at least one of the plurality of machine learning models using the monitoring event. 9. The method of claim 1, wherein the input further comprises previously generated monitoring events, and wherein the supported data includes at least some information from the previously generated monitoring events. 10. The method of claim 1,
wherein calculating the plurality of metrics is performed by a metric pipeline, and wherein the method further comprises executing the metric pipeline to:
sequentially execute a workflow to produce the plurality of metrics,
exclude a portion of the plurality of metrics, and
after sequentially executing the workflow, segment remaining metrics into the plurality of data buckets. 11. A system comprising:
a data repository storing:
a first result of a first machine learning model, the first result comprising a first initial data structure having a first format,
a second result of a second machine learning model, the second result comprising a second initial data structure having a second format different than the first format,
supported data comprising at least a subset of the first result and the second result after data normalization,
a relational event, comprising a first data structure which stores the supported data,
a plurality of metrics for the first machine learning model and the second machine learning model, and
a monitoring event, comprising a second data structure storing the plurality of metrics in a plurality of data buckets;
a data pipeline programmed, when executed, to generate the relational event by extracting the supported data from the first result and the second result into the relational event; a metric pipeline programmed, when executed, to calculate the plurality of metrics, and generate the monitoring event from the plurality of metrics; a model monitoring service comprising the data pipeline and the metric pipeline; and an application programming interface (API) in communication with the model monitoring service, the API configured to allow a user to modify or monitor operation of the model monitoring service. 12. The system of claim 11 wherein the model monitoring service is further configured to present the monitoring event. 13. The system of claim 12, wherein the model monitoring service is further configured to present the monitoring event by performing, when executed, at least one of:
storing the monitoring event, displaying the monitoring event to a user on a computer display, feeding the monitoring event to a monitoring service comprising software for generating an alert when data in the monitoring event satisfies a condition, and changing one or more of the plurality of the machine learning models using the data in the monitoring event. 14. The system of claim 11, wherein the data pipeline is further configured to, prior to extracting, normalize the input. 15. The system of claim 11, wherein the data pipeline is further configured to extract only data in the input compatible with the relational event. 16. The system of claim 11, wherein the model monitoring service is further configured, when executed, to:
modify the monitoring event to have an original format matching at least one of the plurality of machine learning models, and modify the at least one of the plurality of machine learning models using the monitoring event. 17. The system of claim 11, wherein:
the metric pipeline comprises a plurality of modules, each of the plurality of modules is configured to generate a different type of metric, and the metric pipeline is further configured to segment each of the different types of metrics into corresponding ones of the plurality of data buckets. 18. The system of claim 11, wherein the relational event further stores information from past monitoring events. 19. A method comprising:
extracting, from an input, supported data, wherein the input comprises a plurality of outputs from a plurality of machine learning models in a plurality of different formats, and wherein the supported data comprises at least a subset of the input after data normalization; inferring, from the supported data, a plurality of data types to be used with respect to generating a plurality of metrics for the plurality of machine learning models; generating, from the supported data and using the plurality of data types, a relational event comprising the supported data, wherein the relational event further comprises a first data structure object including the plurality of data types and having a first data structure different than the plurality of different formats; calculating, using the supported data in the first data structure, the plurality of metrics for at least one of the plurality of machine learning models, wherein calculating further comprises:
identifying dependent metrics in the plurality of metrics,
using intervening metrics computed from previous steps within an execution pipeline that calculates the plurality of metrics to calculate the dependent metrics; and
generating, from the relational event, a monitoring event, wherein the monitoring event comprises a second data structure object segmented into a plurality of data buckets which store the plurality of metrics. 20. The method of claim 19, further comprising:
presenting the monitoring event. | 3,700 |
347,148 | 16,805,638 | 3,784 | Example caching systems and methods are described. In one implementation, a method identifies multiple files used to process a query and distributes each of the multiple files to a particular execution node to execute the query. Each execution node determines whether the distributed file is stored in the execution node's cache. If the execution node determines that the file is stored in the cache, it processes the query using the cached file. If the file is not stored in the cache, the execution node retrieves the file from a remote storage device, stores the file in the execution node's cache, and processes the query using the file. | 1. A non-transitory computer-readable medium storing instructions which, when executed by one or more processors of a computing device, cause the one or more second processors to:
receive a query for information stored in one or more databases; identify a plurality of tasks associated with the query; distribute, with the one or more second processors, the plurality of tasks to a first plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; execute the plurality of tasks with the first plurality of processors; update at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 2. The machine-readable medium of claim 1, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 3. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 4. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 5. The machine-readable medium of claim 2, wherein each of the plurality of first processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processor. 6. The machine-readable medium of claim 1, wherein the query is received from a client, and wherein the instructions further cause the one or more second processors to:
generate a result from the execution of the plurality of tasks, and return data from the result to the client associated with the query. 7. The machine-readable medium of claim 1, wherein the instructions further cause the one or more second processors to:
optimize the query. 8. The non-transitory computer-readable medium of claim 1, wherein the set of data is stored in a relational database. 9. The non-transitory computer-readable medium of claim 8, wherein the relational database is a structured query language database. 10. The non-transitory computer-readable medium of claim 1, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 11. The non-transitory computer-readable medium of claim 1 wherein at least one of the databases is external to a system that includes the first plurality of processors. 12. The non-transitory computer-readable medium of claim 1, wherein the statistics comprise metadata related to the one or more databases. 13. The non-transitory computer-readable medium of claim 1, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 14. The non-transitory computer-readable medium of claim 1 wherein the updating of the at least the portion of the set of statistics occurs automatically. 15. A method comprising:
receiving a query for information stored in one or more databases; identifying a plurality of tasks associated with the query; distributing, with one or more second processors, the plurality of tasks to a plurality of first processors using at least a set of statistics associated with the plurality of first processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of first processors; executing the plurality of tasks with the first plurality of processors; updating at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 16. The method of claim 15, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 17. The method of claim 16, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 18. The method of claim 16, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 19. The method of claim 16, wherein each of the plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processors. 20. The method of claim 15, wherein the query is received from a client, and further comprising:
generate a result from the execution of the plurality of tasks, and returning data from the result to the client associated with the query. 21. The method of claim 15, further comprising:
optimizing the query. 22. The method of claim 15, wherein the set of data is stored in a relational database. 23. The method of claim 22, wherein the relational database is a structured query language database. 24. The method of claim 15, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 25. The method of claim 15, wherein at least one of the databases is external to a system that includes the first plurality of processors. 26. The method of claim 15, wherein the statistics comprise metadata related to the one or more databases. 27. The method of claim 15, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 28. The method of claim 15, wherein the updating of the at least the portion of the set of statistics occurs automatically. 29. A system comprising:
a parsing process programmed to:
receive a query for information stored in one or more databases,
identify a plurality of tasks associated with the query,
distribute the plurality of tasks to a plurality of processors using at least a set of statistics associated with the plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of processors; and
the plurality of processors programmed to:
execute the plurality of tasks, wherein the parsing process is further programmed to update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 30. The system of claim 29, wherein the executing of the plurality of tasks uses at least a plurality of database tables. | Example caching systems and methods are described. In one implementation, a method identifies multiple files used to process a query and distributes each of the multiple files to a particular execution node to execute the query. Each execution node determines whether the distributed file is stored in the execution node's cache. If the execution node determines that the file is stored in the cache, it processes the query using the cached file. If the file is not stored in the cache, the execution node retrieves the file from a remote storage device, stores the file in the execution node's cache, and processes the query using the file.1. A non-transitory computer-readable medium storing instructions which, when executed by one or more processors of a computing device, cause the one or more second processors to:
receive a query for information stored in one or more databases; identify a plurality of tasks associated with the query; distribute, with the one or more second processors, the plurality of tasks to a first plurality of processors using at least a set of statistics associated with the first plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the first plurality of processors; execute the plurality of tasks with the first plurality of processors; update at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 2. The machine-readable medium of claim 1, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 3. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 4. The machine-readable medium of claim 2, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 5. The machine-readable medium of claim 2, wherein each of the plurality of first processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processor. 6. The machine-readable medium of claim 1, wherein the query is received from a client, and wherein the instructions further cause the one or more second processors to:
generate a result from the execution of the plurality of tasks, and return data from the result to the client associated with the query. 7. The machine-readable medium of claim 1, wherein the instructions further cause the one or more second processors to:
optimize the query. 8. The non-transitory computer-readable medium of claim 1, wherein the set of data is stored in a relational database. 9. The non-transitory computer-readable medium of claim 8, wherein the relational database is a structured query language database. 10. The non-transitory computer-readable medium of claim 1, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 11. The non-transitory computer-readable medium of claim 1 wherein at least one of the databases is external to a system that includes the first plurality of processors. 12. The non-transitory computer-readable medium of claim 1, wherein the statistics comprise metadata related to the one or more databases. 13. The non-transitory computer-readable medium of claim 1, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 14. The non-transitory computer-readable medium of claim 1 wherein the updating of the at least the portion of the set of statistics occurs automatically. 15. A method comprising:
receiving a query for information stored in one or more databases; identifying a plurality of tasks associated with the query; distributing, with one or more second processors, the plurality of tasks to a plurality of first processors using at least a set of statistics associated with the plurality of first processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of first processors; executing the plurality of tasks with the first plurality of processors; updating at least a portion of the set of statistics based on at least one of the executed tasks with the first plurality of processors. 16. The method of claim 15, wherein the executing of the plurality of tasks uses at least a plurality of database tables. 17. The method of claim 16, wherein at least some of the plurality of database tables are encrypted and are subsequently decrypted before the executing of the plurality of tasks. 18. The method of claim 16, wherein at least some of the plurality of database tables are compressed and are subsequently decompressed before the executing of the plurality of tasks. 19. The method of claim 16, wherein each of the plurality of processors processes a corresponding one of the plurality of database tables, and wherein data from the plurality of database tables is stored in a cache associated with that processors. 20. The method of claim 15, wherein the query is received from a client, and further comprising:
generate a result from the execution of the plurality of tasks, and returning data from the result to the client associated with the query. 21. The method of claim 15, further comprising:
optimizing the query. 22. The method of claim 15, wherein the set of data is stored in a relational database. 23. The method of claim 22, wherein the relational database is a structured query language database. 24. The method of claim 15, wherein the database system is a multi-tenant database that isolates computing resources and data between different customers. 25. The method of claim 15, wherein at least one of the databases is external to a system that includes the first plurality of processors. 26. The method of claim 15, wherein the statistics comprise metadata related to the one or more databases. 27. The method of claim 15, wherein the accumulation of the set of statistics from the at least one of the previously executed tasks occurs automatically. 28. The method of claim 15, wherein the updating of the at least the portion of the set of statistics occurs automatically. 29. A system comprising:
a parsing process programmed to:
receive a query for information stored in one or more databases,
identify a plurality of tasks associated with the query,
distribute the plurality of tasks to a plurality of processors using at least a set of statistics associated with the plurality of processors, wherein the set of statistics is accumulated from at least one of the previously executed tasks by at least one of the plurality of processors; and
the plurality of processors programmed to:
execute the plurality of tasks, wherein the parsing process is further programmed to update at least a portion of the set of statistics based on at least one of the executed tasks with the plurality of processors. 30. The system of claim 29, wherein the executing of the plurality of tasks uses at least a plurality of database tables. | 3,700 |
347,149 | 16,805,650 | 3,784 | A lid for secure engagement with a disposable plastic cup to prevent spilling and allow for vigorous mixing of enclosed contents. The lid includes a guidance skirt, an orientation securing layer, and a secure engagement layer. The guidance skirt provides guidance of the rim of the cup into the orientation securing layer. The orientation securing layer helps stabilize the orientation of the lid during transition into the secure engagement layer. Furthermore, the lid has good flight characteristics when tossed as a flying disk because the profile of its cross-section roughly approximates the shape of an airfoil, and multiple substantially vertical portions near the perimeter of the lid augment the moment of inertia. | 1. A securely-engaging removable lid for a cup having a cup rim, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer, an inside contour of said secure engagement layer having an overhang having cylindrical symmetry, said overhang protruding towards the axis of said cylindrical symmetry, a dimensionless tightness-of-fit ratio Ψ being defined as
Ψ=δ E d3 C/4 m g L3 2. The securely-engaging removable lid of claim 1 wherein said dimensionless tightness-of-fit ratio Ψ has a value greater than 1600. 3. A securely-engaging removable lid for a cup having a cup rim and having a capacity of holding m grams of a beverage, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer, an inside contour of said secure engagement layer having an overhang having cylindrical symmetry, said overhang protruding towards the axis of said cylindrical symmetry and being a distance below a top inside edge of said secure engagement layer so as to be adapted to engage with a lower edge of said cup rim, said overhang having a placement and size such that a dimensionless tightness-of-fit multiple φ defined as a force f applied at an edge of the lid required to remove the lid from said cup divided by said mass m times acceleration due to gravity g of 980 cm/s2 is greater than 2.8. 4. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple φ has a value greater than 3.0. 5. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple φ has a value greater than 3.2. 6. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple 5 φ has a value greater than 3.4. 7. A securely-engaging removable lid for a cup having a cup rim, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer; and an orientation securing layer adjoining said secure engagement layer for stabilizing an orientation of the lid relative to said cup rim during first transition of said cup rim from said orientation securing layer into said secure engagement layer. 8. The securely-engaging removable lid of claim 7 further including a guidance skirt adjoining said orientation securing layer for providing guidance of said cup rim during second transition of said cup rim from contact with said guidance skirt into said orientation securing layer. 9. The securely-engaging removable lid of claim 7 further including a force limiting wing adjoining said guidance skirt, said force limiting wing having a default upwards slanting orientation, and a portion of said force limiting wing being flippable into a downwards slanting orientation. 10. The securely-engaging removable lid of claim 7 wherein said first transition of said cup rim from said orientation securing layer into said secure engagement layer requires a force FS; and said second transition of said cup rim from said guidance skirt into said orientation securing layer requiring a force Fo, where Fs>Fo, where Fs is less than a force Fx-c which causes crumpling of said cup, where Fs is less than a force FX-L which causes crumpling of the lid, and where Fs>W where W is the weight of a beverage having a specific gravity of unity in said cup when said cup is full of said beverage. 11. The securely-engaging removable lid of claim 10 wherein said first transition of said cup rim from said orientation securing layer into said secure engagement layer requires a force Fs; and said second transition of said cup rim from said guidance skirt into said orientation securing layer requiring a force Fo, here Fs>Fo, where Fs is less than a force Fx-c which causes crumpling of said cup, where Fs is less than a force FX-L which causes crumpling of the lid, where Fs>W where W is the weight of a beverage having a specific gravity of unity in said cup when said cup is full of said beverage, and where said portion of said force limiting wing being flippable into a downwards slanting orientation with a force Fw such that Fw>Fs, Fw<FX-L , and Fw<Fx-c. | A lid for secure engagement with a disposable plastic cup to prevent spilling and allow for vigorous mixing of enclosed contents. The lid includes a guidance skirt, an orientation securing layer, and a secure engagement layer. The guidance skirt provides guidance of the rim of the cup into the orientation securing layer. The orientation securing layer helps stabilize the orientation of the lid during transition into the secure engagement layer. Furthermore, the lid has good flight characteristics when tossed as a flying disk because the profile of its cross-section roughly approximates the shape of an airfoil, and multiple substantially vertical portions near the perimeter of the lid augment the moment of inertia.1. A securely-engaging removable lid for a cup having a cup rim, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer, an inside contour of said secure engagement layer having an overhang having cylindrical symmetry, said overhang protruding towards the axis of said cylindrical symmetry, a dimensionless tightness-of-fit ratio Ψ being defined as
Ψ=δ E d3 C/4 m g L3 2. The securely-engaging removable lid of claim 1 wherein said dimensionless tightness-of-fit ratio Ψ has a value greater than 1600. 3. A securely-engaging removable lid for a cup having a cup rim and having a capacity of holding m grams of a beverage, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer, an inside contour of said secure engagement layer having an overhang having cylindrical symmetry, said overhang protruding towards the axis of said cylindrical symmetry and being a distance below a top inside edge of said secure engagement layer so as to be adapted to engage with a lower edge of said cup rim, said overhang having a placement and size such that a dimensionless tightness-of-fit multiple φ defined as a force f applied at an edge of the lid required to remove the lid from said cup divided by said mass m times acceleration due to gravity g of 980 cm/s2 is greater than 2.8. 4. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple φ has a value greater than 3.0. 5. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple φ has a value greater than 3.2. 6. The securely-engaging removable lid of claim 3 wherein said dimensionless tightness-of-fit multiple 5 φ has a value greater than 3.4. 7. A securely-engaging removable lid for a cup having a cup rim, comprising:
a central portion; a secure engagement layer at the periphery of said central portion for secure engagement with said cup rim when said cup rim is seated in an interior contour of said secure engagement layer; and an orientation securing layer adjoining said secure engagement layer for stabilizing an orientation of the lid relative to said cup rim during first transition of said cup rim from said orientation securing layer into said secure engagement layer. 8. The securely-engaging removable lid of claim 7 further including a guidance skirt adjoining said orientation securing layer for providing guidance of said cup rim during second transition of said cup rim from contact with said guidance skirt into said orientation securing layer. 9. The securely-engaging removable lid of claim 7 further including a force limiting wing adjoining said guidance skirt, said force limiting wing having a default upwards slanting orientation, and a portion of said force limiting wing being flippable into a downwards slanting orientation. 10. The securely-engaging removable lid of claim 7 wherein said first transition of said cup rim from said orientation securing layer into said secure engagement layer requires a force FS; and said second transition of said cup rim from said guidance skirt into said orientation securing layer requiring a force Fo, where Fs>Fo, where Fs is less than a force Fx-c which causes crumpling of said cup, where Fs is less than a force FX-L which causes crumpling of the lid, and where Fs>W where W is the weight of a beverage having a specific gravity of unity in said cup when said cup is full of said beverage. 11. The securely-engaging removable lid of claim 10 wherein said first transition of said cup rim from said orientation securing layer into said secure engagement layer requires a force Fs; and said second transition of said cup rim from said guidance skirt into said orientation securing layer requiring a force Fo, here Fs>Fo, where Fs is less than a force Fx-c which causes crumpling of said cup, where Fs is less than a force FX-L which causes crumpling of the lid, where Fs>W where W is the weight of a beverage having a specific gravity of unity in said cup when said cup is full of said beverage, and where said portion of said force limiting wing being flippable into a downwards slanting orientation with a force Fw such that Fw>Fs, Fw<FX-L , and Fw<Fx-c. | 3,700 |
347,150 | 16,805,644 | 3,784 | The technology disclosed relates to automatically (e.g., programmatically) initializing predictive information for tracking a complex control object (e.g., hand, hand and tool combination, robot end effector) based upon information about characteristics of the object determined from sets of collected observed information. Automated initialization techniques obviate the need for special and often bizarre start-up rituals (place your hands on the screen at the places indicated during a full moon, and so forth) required by conventional techniques. In implementations, systems can refine initial predictive information to reflect an observed condition based on comparison of the observed with an analysis of sets of collected observed information. | 1. A method of initializing predictive information that models a complex control object in a three dimensional (3D) sensory space, the method including:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space; sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space; sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed; obtaining a second reference frame calculated to account for apparent position of the complex control object; obtaining (i) the actual and apparent positions of the complex control object transformed into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points; obtaining a selection of an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. 2. The method of claim 1, wherein the common reference frame has a fixed point of reference and an initial orientation of axes. 3. The method of claim 1, wherein the common reference frame is a world reference frame that does not change. 4. The method of claim 1, wherein the actual and apparent positions of the complex control object are transformed into the common reference frame by applying an affine transformation. 5. The method of claim 1, further including obtaining the orientation of the complex control object at the actual position with respect to the first reference frame. 6. The method of claim 1, further including obtaining the orientation of the complex control object at the apparent position with respect to the second reference frame. 7. The method of claim 1, further including obtaining a position of the complex control object at the actual position determined from calculating a translation of the complex control object with respect to the common reference frame. 8. The method of claim 1, further including obtaining a position of the complex control object at the apparent position determined from calculating a translation of the complex control object with respect to the common reference frame. 9. The method of claim 1, wherein the archetype is selected from the plurality of observed information archetypes by traversing a linked data structure. 10. The method of claim 9, wherein the archetype as selected is found from traversing that further includes:
visiting a node in the data structure; comparing transformed ones of the contour points sets to one or more pluralities of observed information archetypes associated with the node; and selecting, from the pluralities, at least one archetype having highest conformance with the transformed contour points sets of the control object. 11. The method of claim 9, wherein the linked data structure includes a plurality of nodes representing observed information archetypes in parent-child relationship and the archetype as selected is found from traversing that further includes:
visiting a plurality of parent nodes, each parent node in the plurality identifying one or more variants of one or more poses, and calculating a ranked list of parent nodes having highest conformance with transformed ones of the contour points sets of the control object; and visiting a plurality of child nodes related to the parent nodes in the ranked list, each child node identifying one or more variants of one or more poses different from the one or more poses of the parent nodes, and calculating a ranked list of child nodes having highest conformance with the transformed contour points sets of the control object. 12. The method of claim 1, wherein the initializing predictive information further includes:
aligning one or more model portions based at least in part upon one or more initialization parameters associated with the archetype selected. 13. The method of claim 1, wherein the complex control object is a hand and the initialization parameters include:
at least one of:
edge information for at least fingers of the hand;
edge information for a palm of the hand;
finger segment length information for fingers of the hand;
joint angle and segment orientation information of the hand;
a distance between adjoining base points of fingers of the hand;
a ratio of distance between adjoining base points of fingers of the hand to minimal distance between adjoining base points of the fingers;
one or more joint angles between finger segments of fingers of the hand;
a pitch angle between finger segments of fingers of the hand; and
a yaw angle between finger segments of fingers of the hand. 14. The method of claim 1, wherein the complex control object is a hand and the poses identify:
at least one of:
an angle between adjacent fingers of the hand;
a joint angle between adjacent finger segments of the hand;
a ratio of hand's fingers' thickness to a maximal finger's thickness;
span lengths between opposing sides of the hand;
finger diameter length fingers of the hand;
palm length of palm of the hand;
palm to thumb distance of the hand;
wrist length of wrist of the hand; and
wrist width of wrist of the hand. 15. The method of claim 1, wherein the complex control object is a hand and further including:
using the archetype selected, determining at least one of:
whether one or more fingers of the hand are extended or non-extended;
one or more angles of bend for one or more fingers;
a direction to which one or more fingers point; and
a configuration indicating a pinch, a grab, an outside pinch, or a pointing finger. 16. The method of claim 1, wherein the complex control object is an automobile and the initialization parameters include:
at least one of:
cabin of the automobile;
windshield to rear distance of the automobile;
front bumper to rear bumper distance of the automobile; and
distance between front of a tire and rear of the tire of the automobile. 17. The method of claim 1, wherein sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space is performed at training time t0. 18. The method of claim 1, wherein sensing in the 3D sensory space, an apparent position of the complex control object different from the actual position is performed at initialization time t1. 19. A non-transitory computer readable medium having instructions to initialize predictive information that models a complex control object in a three dimensional (3D) sensory space stored thereon, which instructions when executed by a processor, perform actions including:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space; sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space; sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed; obtaining a second reference frame calculated to account for apparent position of the complex control object; obtaining (i) the actual and apparent positions of the complex control object into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, transforming, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points; obtaining a selection an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. 20. A system including:
an optical sensor; a processor; and a memory storing instructions to initialize predictive information that models a complex control object in a three dimensional (3D) sensory space, which instructions when executed by the processor perform:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space;
sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space;
sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed;
obtaining a second reference frame calculated to account for apparent position of the complex control object;
obtaining (i) the actual and apparent positions of the complex control object into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, transforming, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points;
obtaining a selection of an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and
initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. | The technology disclosed relates to automatically (e.g., programmatically) initializing predictive information for tracking a complex control object (e.g., hand, hand and tool combination, robot end effector) based upon information about characteristics of the object determined from sets of collected observed information. Automated initialization techniques obviate the need for special and often bizarre start-up rituals (place your hands on the screen at the places indicated during a full moon, and so forth) required by conventional techniques. In implementations, systems can refine initial predictive information to reflect an observed condition based on comparison of the observed with an analysis of sets of collected observed information.1. A method of initializing predictive information that models a complex control object in a three dimensional (3D) sensory space, the method including:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space; sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space; sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed; obtaining a second reference frame calculated to account for apparent position of the complex control object; obtaining (i) the actual and apparent positions of the complex control object transformed into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points; obtaining a selection of an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. 2. The method of claim 1, wherein the common reference frame has a fixed point of reference and an initial orientation of axes. 3. The method of claim 1, wherein the common reference frame is a world reference frame that does not change. 4. The method of claim 1, wherein the actual and apparent positions of the complex control object are transformed into the common reference frame by applying an affine transformation. 5. The method of claim 1, further including obtaining the orientation of the complex control object at the actual position with respect to the first reference frame. 6. The method of claim 1, further including obtaining the orientation of the complex control object at the apparent position with respect to the second reference frame. 7. The method of claim 1, further including obtaining a position of the complex control object at the actual position determined from calculating a translation of the complex control object with respect to the common reference frame. 8. The method of claim 1, further including obtaining a position of the complex control object at the apparent position determined from calculating a translation of the complex control object with respect to the common reference frame. 9. The method of claim 1, wherein the archetype is selected from the plurality of observed information archetypes by traversing a linked data structure. 10. The method of claim 9, wherein the archetype as selected is found from traversing that further includes:
visiting a node in the data structure; comparing transformed ones of the contour points sets to one or more pluralities of observed information archetypes associated with the node; and selecting, from the pluralities, at least one archetype having highest conformance with the transformed contour points sets of the control object. 11. The method of claim 9, wherein the linked data structure includes a plurality of nodes representing observed information archetypes in parent-child relationship and the archetype as selected is found from traversing that further includes:
visiting a plurality of parent nodes, each parent node in the plurality identifying one or more variants of one or more poses, and calculating a ranked list of parent nodes having highest conformance with transformed ones of the contour points sets of the control object; and visiting a plurality of child nodes related to the parent nodes in the ranked list, each child node identifying one or more variants of one or more poses different from the one or more poses of the parent nodes, and calculating a ranked list of child nodes having highest conformance with the transformed contour points sets of the control object. 12. The method of claim 1, wherein the initializing predictive information further includes:
aligning one or more model portions based at least in part upon one or more initialization parameters associated with the archetype selected. 13. The method of claim 1, wherein the complex control object is a hand and the initialization parameters include:
at least one of:
edge information for at least fingers of the hand;
edge information for a palm of the hand;
finger segment length information for fingers of the hand;
joint angle and segment orientation information of the hand;
a distance between adjoining base points of fingers of the hand;
a ratio of distance between adjoining base points of fingers of the hand to minimal distance between adjoining base points of the fingers;
one or more joint angles between finger segments of fingers of the hand;
a pitch angle between finger segments of fingers of the hand; and
a yaw angle between finger segments of fingers of the hand. 14. The method of claim 1, wherein the complex control object is a hand and the poses identify:
at least one of:
an angle between adjacent fingers of the hand;
a joint angle between adjacent finger segments of the hand;
a ratio of hand's fingers' thickness to a maximal finger's thickness;
span lengths between opposing sides of the hand;
finger diameter length fingers of the hand;
palm length of palm of the hand;
palm to thumb distance of the hand;
wrist length of wrist of the hand; and
wrist width of wrist of the hand. 15. The method of claim 1, wherein the complex control object is a hand and further including:
using the archetype selected, determining at least one of:
whether one or more fingers of the hand are extended or non-extended;
one or more angles of bend for one or more fingers;
a direction to which one or more fingers point; and
a configuration indicating a pinch, a grab, an outside pinch, or a pointing finger. 16. The method of claim 1, wherein the complex control object is an automobile and the initialization parameters include:
at least one of:
cabin of the automobile;
windshield to rear distance of the automobile;
front bumper to rear bumper distance of the automobile; and
distance between front of a tire and rear of the tire of the automobile. 17. The method of claim 1, wherein sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space is performed at training time t0. 18. The method of claim 1, wherein sensing in the 3D sensory space, an apparent position of the complex control object different from the actual position is performed at initialization time t1. 19. A non-transitory computer readable medium having instructions to initialize predictive information that models a complex control object in a three dimensional (3D) sensory space stored thereon, which instructions when executed by a processor, perform actions including:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space; sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space; sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed; obtaining a second reference frame calculated to account for apparent position of the complex control object; obtaining (i) the actual and apparent positions of the complex control object into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, transforming, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points; obtaining a selection an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. 20. A system including:
an optical sensor; a processor; and a memory storing instructions to initialize predictive information that models a complex control object in a three dimensional (3D) sensory space, which instructions when executed by the processor perform:
accessing observed information including a set of contour points corresponding to surface points on a surface of a complex control object in a three dimensional (3D) sensory space;
sensing an actual position of at least one complex control object in a first reference frame of the 3D sensory space;
sensing an apparent position of the complex control object, wherein the apparent position sensed is different from the actual position sensed;
obtaining a second reference frame calculated to account for apparent position of the complex control object;
obtaining (i) the actual and apparent positions of the complex control object into a common reference frame using a transformation that renders the actual position in the first reference frame and the apparent position in the second reference frame into a common reference frame, transforming, (ii) an actual position transformed from the sensed apparent position and (iii) a normalized orientation of the control object transformed from the set of contour points;
obtaining a selection of an archetype that represents a pose of the control object in the normalized orientation selected from a plurality of observed information archetypes; and
initializing predictive information that models the complex control object from initialization parameters associated with the archetype selected. | 3,700 |
347,151 | 16,805,646 | 3,784 | An example of an apparatus to manage a construction project is provided. The apparatus includes a communications interface to communicate with a plurality of portable electronic device. The communications interface is to transmit a job request to the plurality of portable electronic devices and to receive a plurality of responses to the job request. Each response of the plurality of responses includes an identifier and a resource request. The apparatus also includes a memory storage unit to store the job request and the plurality of responses. The memory storage unit is to maintain a database of resources. In addition, the apparatus includes a matching engine to select a response from the plurality of responses based on the database of resources. The apparatus further includes an assignment engine to transmit, via the communications interface, an acceptance of the response selected by the matching engine. | 1. An apparatus to manage a construction project, the apparatus comprising:
a communications interface to communicate with a plurality of portable electronic devices, wherein the communications interface is to transmit a job request to the plurality of portable electronic devices and to receive a plurality of responses to the job request, wherein each response of the plurality of responses includes an identifier and a resource request; a memory storage unit to store the job request and the plurality of responses, the memory storage unit to maintain a database of resources; a matching engine to select a response from the plurality of responses based on the database of resources; and an assignment engine to transmit, via the communications interface, an acceptance of the response selected by the matching engine. 2. The apparatus of claim 1, wherein the acceptance includes an allocation of resources based on the resource request. 3. The apparatus of claim 2, wherein the assignment engine is to update the database of resources based on the resource request associated with the response selected from the plurality of responses. 4. The apparatus of claim 1, further comprising a monitoring system, wherein the monitoring system is to monitor a resource. 5. The apparatus of claim 4, wherein the resource is a person with a tracking device. 6. The apparatus of claim 5, wherein the monitoring system is to track movements of the tracking device within a work site. 7. The apparatus of claim 6, wherein the monitoring system is to track an entry of the tracking device into the work site and an exit of the tracking device from the work site. 8. The apparatus of claim 7, wherein the monitoring system includes an authenticator to verify the person with the tracking device is authorized to enter the work site. 9. The apparatus of claim 8, wherein the authenticator is to carry out a biometric authentication process. 10. A portable electronic device to be used at a work site of a construction project, the portable electronic device comprising:
a communications interface to communicate with a central server, wherein the communications interface is to receive a job request; an input device to receive input used to generate a response to the job request, wherein the response includes an identifier and a resource request, the response to be transmitted to the central server via the communications interface; and a tracking engine to monitor for entry into the work site and exit from the work site, wherein the tracking engine is to transmit data to the central server automatically. 11. The portable electronic device of claim 10, wherein the tracking engine is to track movement within the work site. 12. The portable electronic device of claim 11, further comprising a GPS receiver, wherein the GPS receiver is to collect positional data for the tracking engine to record movement within the work site. 13. The portable electronic device of claim 12, further comprising a verification engine to authenticate a user. 14. The portable electronic device of claim 13, wherein the verification engine is to transmit collected verification data to the central server for authentication. 15. The portable electronic device of claim 14, further comprising a biometric scanner to collect the verification data. 16. The portable electronic device of claim 15, wherein the biometric scanner is a retinal scanner. 17. The portable electronic device of claim 16, wherein the biometric scanner is a facial recognition system. 18. The portable electronic device of claim 13, wherein the verification engine is authenticate collected verification data locally and to transmit a result to the central server. 19. A method of managing a construction project, the method comprising:
transmitting a job request to a plurality of portable electronic devices; receiving a plurality of responses to the job request from the plurality of portable electronic devices, wherein each response of the plurality of responses includes an identifier and a resource request; selecting a response from the plurality of responses based on a database of resources, wherein the database of resources is maintained on a memory storage unit; and transmitting an acceptance to a portable electronic device associated with the response selected from the plurality of responses. 20. The method of claim 19, further comprising allocating resources based on the resource request and updating a database of resources based on the resources allocated by the acceptance. | An example of an apparatus to manage a construction project is provided. The apparatus includes a communications interface to communicate with a plurality of portable electronic device. The communications interface is to transmit a job request to the plurality of portable electronic devices and to receive a plurality of responses to the job request. Each response of the plurality of responses includes an identifier and a resource request. The apparatus also includes a memory storage unit to store the job request and the plurality of responses. The memory storage unit is to maintain a database of resources. In addition, the apparatus includes a matching engine to select a response from the plurality of responses based on the database of resources. The apparatus further includes an assignment engine to transmit, via the communications interface, an acceptance of the response selected by the matching engine.1. An apparatus to manage a construction project, the apparatus comprising:
a communications interface to communicate with a plurality of portable electronic devices, wherein the communications interface is to transmit a job request to the plurality of portable electronic devices and to receive a plurality of responses to the job request, wherein each response of the plurality of responses includes an identifier and a resource request; a memory storage unit to store the job request and the plurality of responses, the memory storage unit to maintain a database of resources; a matching engine to select a response from the plurality of responses based on the database of resources; and an assignment engine to transmit, via the communications interface, an acceptance of the response selected by the matching engine. 2. The apparatus of claim 1, wherein the acceptance includes an allocation of resources based on the resource request. 3. The apparatus of claim 2, wherein the assignment engine is to update the database of resources based on the resource request associated with the response selected from the plurality of responses. 4. The apparatus of claim 1, further comprising a monitoring system, wherein the monitoring system is to monitor a resource. 5. The apparatus of claim 4, wherein the resource is a person with a tracking device. 6. The apparatus of claim 5, wherein the monitoring system is to track movements of the tracking device within a work site. 7. The apparatus of claim 6, wherein the monitoring system is to track an entry of the tracking device into the work site and an exit of the tracking device from the work site. 8. The apparatus of claim 7, wherein the monitoring system includes an authenticator to verify the person with the tracking device is authorized to enter the work site. 9. The apparatus of claim 8, wherein the authenticator is to carry out a biometric authentication process. 10. A portable electronic device to be used at a work site of a construction project, the portable electronic device comprising:
a communications interface to communicate with a central server, wherein the communications interface is to receive a job request; an input device to receive input used to generate a response to the job request, wherein the response includes an identifier and a resource request, the response to be transmitted to the central server via the communications interface; and a tracking engine to monitor for entry into the work site and exit from the work site, wherein the tracking engine is to transmit data to the central server automatically. 11. The portable electronic device of claim 10, wherein the tracking engine is to track movement within the work site. 12. The portable electronic device of claim 11, further comprising a GPS receiver, wherein the GPS receiver is to collect positional data for the tracking engine to record movement within the work site. 13. The portable electronic device of claim 12, further comprising a verification engine to authenticate a user. 14. The portable electronic device of claim 13, wherein the verification engine is to transmit collected verification data to the central server for authentication. 15. The portable electronic device of claim 14, further comprising a biometric scanner to collect the verification data. 16. The portable electronic device of claim 15, wherein the biometric scanner is a retinal scanner. 17. The portable electronic device of claim 16, wherein the biometric scanner is a facial recognition system. 18. The portable electronic device of claim 13, wherein the verification engine is authenticate collected verification data locally and to transmit a result to the central server. 19. A method of managing a construction project, the method comprising:
transmitting a job request to a plurality of portable electronic devices; receiving a plurality of responses to the job request from the plurality of portable electronic devices, wherein each response of the plurality of responses includes an identifier and a resource request; selecting a response from the plurality of responses based on a database of resources, wherein the database of resources is maintained on a memory storage unit; and transmitting an acceptance to a portable electronic device associated with the response selected from the plurality of responses. 20. The method of claim 19, further comprising allocating resources based on the resource request and updating a database of resources based on the resources allocated by the acceptance. | 3,700 |
347,152 | 16,805,635 | 3,784 | A display device includes a substrate including a first pixel region, a second pixel region connected to the first pixel region and having a smaller area than the first pixel region, and a peripheral region surrounding the first and second pixel regions, a first pixel in the first pixel region, a second pixel in the second pixel region, a first line connected to the first pixel, a second line connected to the second pixel, an extending line extending to the peripheral region and connected to any one of the first and second lines, a dummy part overlapping with the extending line for compensating a difference between load values of the first and second lines, a first power line in the peripheral region, and a conductive pattern overlapping with at least one region of the dummy part, and electrically connected to the first power line. | 1. A display device comprising:
a substrate comprising:
a first pixel region;
a second pixel region extended in a first direction and having a smaller area than the first pixel region;
a third pixel region spaced from the second pixel region and extended in a second direction different from the first direction; and
a peripheral region including a first peripheral region surrounding the first pixel region, a second peripheral region adjacent to the second pixel region, and a third peripheral region adjacent to the third pixel region;
a first pixel in the first pixel region and in a first row or column of pixels; a second pixel in the second pixel region and in a second row or column of pixels that is substantially parallel to the first row or column of pixels; and a conductive pattern in the peripheral region, and electrically connected to the second pixel through a bridge pattern, wherein a number of pixels in the first row or column of pixels is greater than a number of pixels in the second row or column of pixels that is substantially parallel to the first row or column of pixels. 2. The display device of claim 1, further comprising:
a dummy part overlapping with the conductive pattern, a first power line in the peripheral region and electrically connected to the conductive pattern; a second power line in the first, second, and third pixel regions and electrically connected to each of the first and second pixels; and a first contact line in at least one of the second peripheral region and the third peripheral region. 3. The display device of claim 2, wherein:
the first contact line extends from the second power line to be integrally formed with the second power line, and the first contact line and the dummy part are electrically separated from each other. 4. The display device of claim 3, wherein:
a first fixed voltage is applied to the first power line and a second fixed voltage having a different level from the first fixed voltage is applied to the second power line, the second fixed voltage is higher than the first fixed voltage, and the first fixed voltage is applied to the conductive pattern through the first power line. 5. The display device of claim 3, further comprising:
a first line electrically connected to the first pixel; a second line electrically connected to the second pixel; and an extending line extending to the peripheral region and electrically connected to the second line, wherein the extending line overlaps with the dummy part. 6. The display device of claim 5, wherein the dummy part compensates for a difference between a load value of the first line and a load value of the second line. 7. The display device of claim 6, wherein:
the first line extends along a first direction on the substrate and provides a scan signal to the first pixel, and the second line provides a scan signal to the second pixel and extends along the first direction. 8. The display device of claim 7, wherein a length of the second line is shorter than a length of the first line. 9. The display device of claim 6, wherein the dummy part comprises:
a dummy active pattern on the substrate; an insulating layer over the dummy active pattern, and defining a first contact hole through which a portion of the dummy active pattern is exposed; the extending line on the insulating layer; and a second contact line on the extending line, connected to the dummy active pattern through the first contact hole, and electrically connected to the conductive pattern, wherein the second contact line is provided at a same layer as the first contact line. 10. The display device of claim 9, wherein the first power line comprises:
a first metal layer at the same layer as the first and second contact lines; and a second metal layer on the first metal layer and electrically connected to the first metal layer, wherein the second metal layer of the first power line is electrically connected to the conductive pattern. 11. The display device of claim 10, wherein:
the bridge pattern is located between the second contact line of the dummy part and the conductive pattern, and the bridge pattern is located at a same layer as the second metal layer of the first power line. 12. The display device of claim 11, wherein a first end of the conductive pattern is electrically connected to the second contact line and a second end of the conductive pattern is electrically connected to the first power line. 13. The display device of claim 11, further comprising:
an interlayer insulating layer on the first contact line, the second contact line, and the first metal layer of the first power line, wherein:
the interlayer insulating layer includes a second contact hole exposing a portion of the second contact line and a third contact hole exposing a portion of the first metal layer of the first power line, and
the second contact hole and the third contact hole are separated from each other when viewed in a plane. 14. The display device of claim 13, further comprising:
a passivation layer on the bridge pattern and the second metal layer of the first power line, wherein:
the passivation layer includes a fourth contact hole exposing a portion of the bridge pattern and a fifth contact hole exposing a portion of the second metal layer of the first power line, and
the fourth contact hole and the fifth contact hole are separated from each other when viewed in the plane. 15. The display device of claim 14, wherein:
the first contact hole and the second contact hole overlap each other when viewed in the plane, and the third contact hole and the fifth contact hole overlap each other when viewed in the plane. 16. The display device of claim 9, wherein each of the first and second pixels comprises at least one transistor, the at least one transistor comprising:
an active pattern on the substrate; a gate electrode on the active pattern with the insulating layer interposed therebetween; and source and drain electrodes each connected to the active pattern. 17. The display device of claim 16, further comprising a light emitting element connected to the at least one transistor, the light emitting element comprising:
an anode electrode electrically connected to the at least one transistor; a light emitting layer on the anode electrode; and a cathode electrode on the light emitting layer. 18. The display device of claim 17, wherein the conductive pattern is at a same layer as the anode electrode. 19. A display device comprising:
a substrate comprising:
a first pixel region;
a second pixel region extended in a first direction and having a smaller area than the first pixel region;
a third pixel region spaced from the second pixel region and extended in a second direction different from the first direction; and
a peripheral region including a first peripheral region surrounding the first pixel region, a second peripheral region adjacent to the second pixel region, and a third peripheral region adjacent to the third pixel region;
a first pixel in the first pixel region and in a first row or column of pixels; a second pixel in the second pixel region and in a second row or column of pixels that is substantially parallel to the first row or column of pixels; a conductive pattern in the peripheral region, and electrically connected to the second pixel through a bridge pattern; a first power line in the peripheral region and electrically connected to the conductive pattern; a second power line in the first to third pixel regions and electrically connected to each of the first and second pixels; and a first contact line in at least one of the second peripheral region and the third peripheral region. 20. The display device of claim 19, further comprising:
a first line electrically connected to the first pixel; a second line electrically connected to the second pixel; and an extending line extending to the peripheral region and electrically connected to the second line. 21. The display device of claim 20, further comprising:
a dummy part overlapping with the conductive pattern, wherein:
the extending line overlaps with the dummy part;
a length of the second line is shorter than a length of the first line; and
the dummy part compensates for a difference between a load value of the first line and a load value of the second line. | A display device includes a substrate including a first pixel region, a second pixel region connected to the first pixel region and having a smaller area than the first pixel region, and a peripheral region surrounding the first and second pixel regions, a first pixel in the first pixel region, a second pixel in the second pixel region, a first line connected to the first pixel, a second line connected to the second pixel, an extending line extending to the peripheral region and connected to any one of the first and second lines, a dummy part overlapping with the extending line for compensating a difference between load values of the first and second lines, a first power line in the peripheral region, and a conductive pattern overlapping with at least one region of the dummy part, and electrically connected to the first power line.1. A display device comprising:
a substrate comprising:
a first pixel region;
a second pixel region extended in a first direction and having a smaller area than the first pixel region;
a third pixel region spaced from the second pixel region and extended in a second direction different from the first direction; and
a peripheral region including a first peripheral region surrounding the first pixel region, a second peripheral region adjacent to the second pixel region, and a third peripheral region adjacent to the third pixel region;
a first pixel in the first pixel region and in a first row or column of pixels; a second pixel in the second pixel region and in a second row or column of pixels that is substantially parallel to the first row or column of pixels; and a conductive pattern in the peripheral region, and electrically connected to the second pixel through a bridge pattern, wherein a number of pixels in the first row or column of pixels is greater than a number of pixels in the second row or column of pixels that is substantially parallel to the first row or column of pixels. 2. The display device of claim 1, further comprising:
a dummy part overlapping with the conductive pattern, a first power line in the peripheral region and electrically connected to the conductive pattern; a second power line in the first, second, and third pixel regions and electrically connected to each of the first and second pixels; and a first contact line in at least one of the second peripheral region and the third peripheral region. 3. The display device of claim 2, wherein:
the first contact line extends from the second power line to be integrally formed with the second power line, and the first contact line and the dummy part are electrically separated from each other. 4. The display device of claim 3, wherein:
a first fixed voltage is applied to the first power line and a second fixed voltage having a different level from the first fixed voltage is applied to the second power line, the second fixed voltage is higher than the first fixed voltage, and the first fixed voltage is applied to the conductive pattern through the first power line. 5. The display device of claim 3, further comprising:
a first line electrically connected to the first pixel; a second line electrically connected to the second pixel; and an extending line extending to the peripheral region and electrically connected to the second line, wherein the extending line overlaps with the dummy part. 6. The display device of claim 5, wherein the dummy part compensates for a difference between a load value of the first line and a load value of the second line. 7. The display device of claim 6, wherein:
the first line extends along a first direction on the substrate and provides a scan signal to the first pixel, and the second line provides a scan signal to the second pixel and extends along the first direction. 8. The display device of claim 7, wherein a length of the second line is shorter than a length of the first line. 9. The display device of claim 6, wherein the dummy part comprises:
a dummy active pattern on the substrate; an insulating layer over the dummy active pattern, and defining a first contact hole through which a portion of the dummy active pattern is exposed; the extending line on the insulating layer; and a second contact line on the extending line, connected to the dummy active pattern through the first contact hole, and electrically connected to the conductive pattern, wherein the second contact line is provided at a same layer as the first contact line. 10. The display device of claim 9, wherein the first power line comprises:
a first metal layer at the same layer as the first and second contact lines; and a second metal layer on the first metal layer and electrically connected to the first metal layer, wherein the second metal layer of the first power line is electrically connected to the conductive pattern. 11. The display device of claim 10, wherein:
the bridge pattern is located between the second contact line of the dummy part and the conductive pattern, and the bridge pattern is located at a same layer as the second metal layer of the first power line. 12. The display device of claim 11, wherein a first end of the conductive pattern is electrically connected to the second contact line and a second end of the conductive pattern is electrically connected to the first power line. 13. The display device of claim 11, further comprising:
an interlayer insulating layer on the first contact line, the second contact line, and the first metal layer of the first power line, wherein:
the interlayer insulating layer includes a second contact hole exposing a portion of the second contact line and a third contact hole exposing a portion of the first metal layer of the first power line, and
the second contact hole and the third contact hole are separated from each other when viewed in a plane. 14. The display device of claim 13, further comprising:
a passivation layer on the bridge pattern and the second metal layer of the first power line, wherein:
the passivation layer includes a fourth contact hole exposing a portion of the bridge pattern and a fifth contact hole exposing a portion of the second metal layer of the first power line, and
the fourth contact hole and the fifth contact hole are separated from each other when viewed in the plane. 15. The display device of claim 14, wherein:
the first contact hole and the second contact hole overlap each other when viewed in the plane, and the third contact hole and the fifth contact hole overlap each other when viewed in the plane. 16. The display device of claim 9, wherein each of the first and second pixels comprises at least one transistor, the at least one transistor comprising:
an active pattern on the substrate; a gate electrode on the active pattern with the insulating layer interposed therebetween; and source and drain electrodes each connected to the active pattern. 17. The display device of claim 16, further comprising a light emitting element connected to the at least one transistor, the light emitting element comprising:
an anode electrode electrically connected to the at least one transistor; a light emitting layer on the anode electrode; and a cathode electrode on the light emitting layer. 18. The display device of claim 17, wherein the conductive pattern is at a same layer as the anode electrode. 19. A display device comprising:
a substrate comprising:
a first pixel region;
a second pixel region extended in a first direction and having a smaller area than the first pixel region;
a third pixel region spaced from the second pixel region and extended in a second direction different from the first direction; and
a peripheral region including a first peripheral region surrounding the first pixel region, a second peripheral region adjacent to the second pixel region, and a third peripheral region adjacent to the third pixel region;
a first pixel in the first pixel region and in a first row or column of pixels; a second pixel in the second pixel region and in a second row or column of pixels that is substantially parallel to the first row or column of pixels; a conductive pattern in the peripheral region, and electrically connected to the second pixel through a bridge pattern; a first power line in the peripheral region and electrically connected to the conductive pattern; a second power line in the first to third pixel regions and electrically connected to each of the first and second pixels; and a first contact line in at least one of the second peripheral region and the third peripheral region. 20. The display device of claim 19, further comprising:
a first line electrically connected to the first pixel; a second line electrically connected to the second pixel; and an extending line extending to the peripheral region and electrically connected to the second line. 21. The display device of claim 20, further comprising:
a dummy part overlapping with the conductive pattern, wherein:
the extending line overlaps with the dummy part;
a length of the second line is shorter than a length of the first line; and
the dummy part compensates for a difference between a load value of the first line and a load value of the second line. | 3,700 |
347,153 | 16,805,538 | 3,784 | A graphical structure model trained by using labeled samples is obtained. The graphical structure model is defined based on an enterprise relationship network that includes nodes and edges. Each labeled sample includes a label indicating whether a corresponding node is a risky credit node. The graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node. An embedding vector corresponding to a test-sample is calculated by using the graphical structure model. Credit risk analysis is performed on the test-sample. The credit risk analysis is performed based on a feature of the test-sample represented in the embedding vector. A node corresponding to the test-sample is labeled as a credit risk node. | 1. A computer-implemented method, comprising:
obtaining a graphical structure model trained by using labeled samples, wherein the graphical structure model is defined based on an enterprise relationship network, wherein the enterprise relationship network comprises nodes and edges, wherein the nodes represent one or more of the following: an enterprise, an account, an executive, a civil servant, and a legal person, wherein the edges represent relationships between the nodes, wherein each labeled sample comprises a label indicating whether a corresponding node in the graphical structure model is a risky credit node, wherein the graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node, and wherein the embedding vector represents a feature of the at least one node embedded in the hidden feature space; calculating an embedding vector corresponding to a test-sample by using the graphical structure model; performing credit risk analysis on the test-sample to determine that the test-sample represents a credit risk, wherein the credit risk analysis is performed based on a feature of the test-sample in the hidden feature space, wherein the feature is represented in the embedding vector corresponding to the test-sample; and labeling a node corresponding to the test-sample as a credit risk node. 2. The computer-implemented method of claim 1, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. 3. The computer-implemented method of claim 1, wherein the enterprise relationship network comprises one or more of the following networks: a shareholding relationship network between enterprises, a shareholding relationship network between a legal person and an enterprise, an employment relationship network between an executive and an enterprise, an association relationship network between an executive and a civil servant, an association relationship network between an executive and a civil servant, a belonging relationship network between an executive and an account, a family relationship network between accounts, a friend relationship network between accounts, a fund transfer network between accounts, and a labeling network between accounts. 4. The computer-implemented method of claim 1, wherein the feature of the edge comprises at least one of the following types of data involved in the at least one node that is connected to the edge: shareholding relationship data, subordinate relationship data, interpersonal relationship data, service relationship data, and evaluation data. 5. The computer-implemented method of claim 1, wherein the embedding vector of the at least one node after a tth iteration in the hidden feature space is calculated based on the original feature of the at least one node, the feature of the edge associated with the at least one node, and an embedding vector of the at least one node after a (t−1)th iteration in the hidden feature space. 6. The computer-implemented method of claim 2, wherein training the graphical structure model by using the labeled samples comprises:
training the graphical structure model by using the labeled samples with a training objective that a consistency between the predicted probability and a corresponding sample label is maximized. 7. The computer-implemented method of claim 2, wherein iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the original feature of the at least one node and the feature of the edge associated with the at least one node comprises:
iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the following equation: 8. The computer-implemented method of claim 7, wherein calculating the predicted probability of the at least one node based on the embedding vector comprises:
calculating the predicted probability of the at least one node based on the following equation:
predi=softmax(W 4 *H i T), 9. The computer-implemented method of claim 8, wherein training the graphical structure model by using the labeled samples comprises:
optimizing arg minw 1 ,w 2 ,w 3 ,w 4 Σicorss_entrep(predi,yi) by using a back-propagation algorithm and the labeled samples, to obtain optimal W1, W2, W3, and W4, wherein corss_entrep represents a function that is used to calculate cross entropy. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining a graphical structure model trained by using labeled samples, wherein the graphical structure model is defined based on an enterprise relationship network, wherein the enterprise relationship network comprises nodes and edges, wherein the nodes represent one or more of the following: an enterprise, an account, an executive, a civil servant, and a legal person, wherein the edges represent relationships between the nodes, wherein each labeled sample comprises a label indicating whether a corresponding node in the graphical structure model is a risky credit node, wherein the graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node, and wherein the embedding vector represents a feature of the at least one node embedded in the hidden feature space; calculating an embedding vector corresponding to a test-sample by using the graphical structure model; performing credit risk analysis on the test-sample to determine that the test-sample represents a credit risk, wherein the credit risk analysis is performed based on a feature of the test-sample in the hidden feature space, wherein the feature is represented in the embedding vector corresponding to the test-sample; and labeling a node corresponding to the test-sample as a credit risk node. 11. The non-transitory, computer-readable medium of claim 10, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. 12. The non-transitory, computer-readable medium of claim 10, wherein the enterprise relationship network comprises one or more of the following networks: a shareholding relationship network between enterprises, a shareholding relationship network between a legal person and an enterprise, an employment relationship network between an executive and an enterprise, an association relationship network between an executive and a civil servant, an association relationship network between an executive and a civil servant, a belonging relationship network between an executive and an account, a family relationship network between accounts, a friend relationship network between accounts, a fund transfer network between accounts, and a labeling network between accounts. 13. The non-transitory, computer-readable medium of claim 10, wherein the feature of the edge comprises at least one of the following types of data involved in the at least one node that is connected to the edge: shareholding relationship data, subordinate relationship data, interpersonal relationship data, service relationship data, and evaluation data. 14. The non-transitory, computer-readable medium of claim 10, wherein the embedding vector of the at least one node after a tth iteration in the hidden feature space is calculated based on the original feature of the at least one node, the feature of the edge associated with the at least one node, and an embedding vector of the at least one node after a (t−1)th iteration in the hidden feature space. 15. The non-transitory, computer-readable medium of claim 11, wherein training the graphical structure model by using the labeled samples comprises:
training the graphical structure model by using the labeled samples with a training objective that a consistency between the predicted probability and a corresponding sample label is maximized. 16. The non-transitory, computer-readable medium of claim 11, wherein iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the original feature of the at least one node and the feature of the edge associated with the at least one node comprises:
iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the following equation: 17. The non-transitory, computer-readable medium of claim 16, wherein calculating the predicted probability of the at least one node based on the embedding vector comprises:
calculating the predicted probability of the at least one node based on the following equation:
predi=softmax(W 4 *H i T), 18. The non-transitory, computer-readable medium of claim 17, wherein training the graphical structure model by using the labeled samples comprises:
optimizing arg minw 1 ,w 2 ,w 3 ,w 4 Σicorss_entrep(predi,yi) by using a back-propagation algorithm and the labeled samples, to obtain optimal W1, W2, W3, and W4, wherein corss_entrep represents a function that is used to calculate cross entropy. 19. A computer-implemented system, comprising:
one or more computers; and 20. The computer-implemented system of claim 19, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. | A graphical structure model trained by using labeled samples is obtained. The graphical structure model is defined based on an enterprise relationship network that includes nodes and edges. Each labeled sample includes a label indicating whether a corresponding node is a risky credit node. The graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node. An embedding vector corresponding to a test-sample is calculated by using the graphical structure model. Credit risk analysis is performed on the test-sample. The credit risk analysis is performed based on a feature of the test-sample represented in the embedding vector. A node corresponding to the test-sample is labeled as a credit risk node.1. A computer-implemented method, comprising:
obtaining a graphical structure model trained by using labeled samples, wherein the graphical structure model is defined based on an enterprise relationship network, wherein the enterprise relationship network comprises nodes and edges, wherein the nodes represent one or more of the following: an enterprise, an account, an executive, a civil servant, and a legal person, wherein the edges represent relationships between the nodes, wherein each labeled sample comprises a label indicating whether a corresponding node in the graphical structure model is a risky credit node, wherein the graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node, and wherein the embedding vector represents a feature of the at least one node embedded in the hidden feature space; calculating an embedding vector corresponding to a test-sample by using the graphical structure model; performing credit risk analysis on the test-sample to determine that the test-sample represents a credit risk, wherein the credit risk analysis is performed based on a feature of the test-sample in the hidden feature space, wherein the feature is represented in the embedding vector corresponding to the test-sample; and labeling a node corresponding to the test-sample as a credit risk node. 2. The computer-implemented method of claim 1, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. 3. The computer-implemented method of claim 1, wherein the enterprise relationship network comprises one or more of the following networks: a shareholding relationship network between enterprises, a shareholding relationship network between a legal person and an enterprise, an employment relationship network between an executive and an enterprise, an association relationship network between an executive and a civil servant, an association relationship network between an executive and a civil servant, a belonging relationship network between an executive and an account, a family relationship network between accounts, a friend relationship network between accounts, a fund transfer network between accounts, and a labeling network between accounts. 4. The computer-implemented method of claim 1, wherein the feature of the edge comprises at least one of the following types of data involved in the at least one node that is connected to the edge: shareholding relationship data, subordinate relationship data, interpersonal relationship data, service relationship data, and evaluation data. 5. The computer-implemented method of claim 1, wherein the embedding vector of the at least one node after a tth iteration in the hidden feature space is calculated based on the original feature of the at least one node, the feature of the edge associated with the at least one node, and an embedding vector of the at least one node after a (t−1)th iteration in the hidden feature space. 6. The computer-implemented method of claim 2, wherein training the graphical structure model by using the labeled samples comprises:
training the graphical structure model by using the labeled samples with a training objective that a consistency between the predicted probability and a corresponding sample label is maximized. 7. The computer-implemented method of claim 2, wherein iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the original feature of the at least one node and the feature of the edge associated with the at least one node comprises:
iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the following equation: 8. The computer-implemented method of claim 7, wherein calculating the predicted probability of the at least one node based on the embedding vector comprises:
calculating the predicted probability of the at least one node based on the following equation:
predi=softmax(W 4 *H i T), 9. The computer-implemented method of claim 8, wherein training the graphical structure model by using the labeled samples comprises:
optimizing arg minw 1 ,w 2 ,w 3 ,w 4 Σicorss_entrep(predi,yi) by using a back-propagation algorithm and the labeled samples, to obtain optimal W1, W2, W3, and W4, wherein corss_entrep represents a function that is used to calculate cross entropy. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining a graphical structure model trained by using labeled samples, wherein the graphical structure model is defined based on an enterprise relationship network, wherein the enterprise relationship network comprises nodes and edges, wherein the nodes represent one or more of the following: an enterprise, an account, an executive, a civil servant, and a legal person, wherein the edges represent relationships between the nodes, wherein each labeled sample comprises a label indicating whether a corresponding node in the graphical structure model is a risky credit node, wherein the graphical structure model is configured to iteratively calculate an embedding vector of at least one node in a hidden feature space based on an original feature of the at least one node and/or a feature of an edge associated with the at least one node, and wherein the embedding vector represents a feature of the at least one node embedded in the hidden feature space; calculating an embedding vector corresponding to a test-sample by using the graphical structure model; performing credit risk analysis on the test-sample to determine that the test-sample represents a credit risk, wherein the credit risk analysis is performed based on a feature of the test-sample in the hidden feature space, wherein the feature is represented in the embedding vector corresponding to the test-sample; and labeling a node corresponding to the test-sample as a credit risk node. 11. The non-transitory, computer-readable medium of claim 10, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. 12. The non-transitory, computer-readable medium of claim 10, wherein the enterprise relationship network comprises one or more of the following networks: a shareholding relationship network between enterprises, a shareholding relationship network between a legal person and an enterprise, an employment relationship network between an executive and an enterprise, an association relationship network between an executive and a civil servant, an association relationship network between an executive and a civil servant, a belonging relationship network between an executive and an account, a family relationship network between accounts, a friend relationship network between accounts, a fund transfer network between accounts, and a labeling network between accounts. 13. The non-transitory, computer-readable medium of claim 10, wherein the feature of the edge comprises at least one of the following types of data involved in the at least one node that is connected to the edge: shareholding relationship data, subordinate relationship data, interpersonal relationship data, service relationship data, and evaluation data. 14. The non-transitory, computer-readable medium of claim 10, wherein the embedding vector of the at least one node after a tth iteration in the hidden feature space is calculated based on the original feature of the at least one node, the feature of the edge associated with the at least one node, and an embedding vector of the at least one node after a (t−1)th iteration in the hidden feature space. 15. The non-transitory, computer-readable medium of claim 11, wherein training the graphical structure model by using the labeled samples comprises:
training the graphical structure model by using the labeled samples with a training objective that a consistency between the predicted probability and a corresponding sample label is maximized. 16. The non-transitory, computer-readable medium of claim 11, wherein iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the original feature of the at least one node and the feature of the edge associated with the at least one node comprises:
iteratively calculating the embedding vector of the at least one node in the hidden feature space based on the following equation: 17. The non-transitory, computer-readable medium of claim 16, wherein calculating the predicted probability of the at least one node based on the embedding vector comprises:
calculating the predicted probability of the at least one node based on the following equation:
predi=softmax(W 4 *H i T), 18. The non-transitory, computer-readable medium of claim 17, wherein training the graphical structure model by using the labeled samples comprises:
optimizing arg minw 1 ,w 2 ,w 3 ,w 4 Σicorss_entrep(predi,yi) by using a back-propagation algorithm and the labeled samples, to obtain optimal W1, W2, W3, and W4, wherein corss_entrep represents a function that is used to calculate cross entropy. 19. A computer-implemented system, comprising:
one or more computers; and 20. The computer-implemented system of claim 19, wherein the graphical structure model is further used to calculate a predicted probability of the at least one node based on the embedding vector, wherein the predicted probability represents a probability that the at least one node is a risky credit node; and
performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk comprises: calculating a predicted probability corresponding to the test-sample by using the graphical structure model based on the embedding vector corresponding to the test-sample; and performing the credit risk analysis on the test-sample to determine that the test-sample represents the credit risk, wherein the credit risk analysis is performed based on the predicted probability corresponding to the test-sample. | 3,700 |
347,154 | 16,805,654 | 3,784 | An approach is provided for managing the configurations of printing devices in a distributed environment where printing devices are initially configured at a first physical location and then reconfigured at a second physical location. A configuration manager provides configuration data to a configuration system at the first location to be used to initially configure printing devices. The configuration manager also provides the configuration data to a device management system at the second physical location. The configuration manager receives changes to the configuration data from the device management system at the second physical location and propagates the changes to the configuration system at the first physical location. The configuration manager also tracks the configuration state of printing devices at both the first physical location and the second physical location. | 1. An apparatus comprising:
one or more processors; one or more memories; and a configuration manager executing on the apparatus and configured to:
receive, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
cause the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receive the second configuration data from the device management system via the one or more networks, and
cause the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 2. The apparatus as recited in claim 1, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 3. The apparatus as recited in claim 2, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 4. The apparatus as recited in claim 1, wherein the configuration manager executing on the apparatus is further configured to determine whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 5. The apparatus as recited in claim 1, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 6. The apparatus as recited in claim 4, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. 7. The apparatus as recited in claim 1, wherein the configuration manager executing on the apparatus further receives, from the configuration system via the one or more computer networks, configuration identification that that uniquely corresponds to the first plurality of printing device settings specified by the first configuration data. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
a configuration manager executing on the apparatus to:
receive, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
cause the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receive the second configuration data from the device management system via the one or more networks, and
cause the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 10. The one or more non-transitory computer-readable media as recited in claim 9, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 11. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processes further causes the configuration manager executing on the apparatus to determine whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 12. The one or more non-transitory computer-readable media as recited in claim 8, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 13. The one or more non-transitory computer-readable media as recited in claim 11, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein the configuration manager executing on the apparatus further receives, from the configuration system via the one or more computer networks, configuration identification that that uniquely corresponds to the first plurality of printing device settings specified by the first configuration data. 15. A computer-implemented method comprising:
a configuration manager executing on an apparatus:
receiving, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
causing the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receiving the second configuration data from the device management system via the one or more networks, and
causing the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 16. The computer-implemented method as recited in claim 15, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 17. The computer-implemented method as recited in claim 16, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 18. The computer-implemented method as recited in claim 15, further comprising the configuration manager executing on the apparatus determining whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 19. The computer-implemented method as recited in claim 15, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 20. The computer-implemented method as recited in claim 18, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. | An approach is provided for managing the configurations of printing devices in a distributed environment where printing devices are initially configured at a first physical location and then reconfigured at a second physical location. A configuration manager provides configuration data to a configuration system at the first location to be used to initially configure printing devices. The configuration manager also provides the configuration data to a device management system at the second physical location. The configuration manager receives changes to the configuration data from the device management system at the second physical location and propagates the changes to the configuration system at the first physical location. The configuration manager also tracks the configuration state of printing devices at both the first physical location and the second physical location.1. An apparatus comprising:
one or more processors; one or more memories; and a configuration manager executing on the apparatus and configured to:
receive, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
cause the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receive the second configuration data from the device management system via the one or more networks, and
cause the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 2. The apparatus as recited in claim 1, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 3. The apparatus as recited in claim 2, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 4. The apparatus as recited in claim 1, wherein the configuration manager executing on the apparatus is further configured to determine whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 5. The apparatus as recited in claim 1, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 6. The apparatus as recited in claim 4, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. 7. The apparatus as recited in claim 1, wherein the configuration manager executing on the apparatus further receives, from the configuration system via the one or more computer networks, configuration identification that that uniquely corresponds to the first plurality of printing device settings specified by the first configuration data. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
a configuration manager executing on the apparatus to:
receive, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
cause the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receive the second configuration data from the device management system via the one or more networks, and
cause the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 10. The one or more non-transitory computer-readable media as recited in claim 9, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 11. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processes further causes the configuration manager executing on the apparatus to determine whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 12. The one or more non-transitory computer-readable media as recited in claim 8, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 13. The one or more non-transitory computer-readable media as recited in claim 11, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein the configuration manager executing on the apparatus further receives, from the configuration system via the one or more computer networks, configuration identification that that uniquely corresponds to the first plurality of printing device settings specified by the first configuration data. 15. A computer-implemented method comprising:
a configuration manager executing on an apparatus:
receiving, from a configuration system via one or more computer networks, first configuration data that specifies a first plurality of printing device settings,
causing the first configuration data to be transmitted, via the one or more computer networks, to a device management system that includes a capability for a user to create, based upon the first configuration data, second configuration data that specifies a second plurality of printing device settings that is different than the first plurality of printing device settings,
receiving the second configuration data from the device management system via the one or more networks, and
causing the second configuration data to be transmitted to the configuration system via the one or more networks, wherein the configuration system applies the second configuration data to one or more printing devices. 16. The computer-implemented method as recited in claim 15, wherein:
the second configuration data is assigned to a particular customer, and the configuration manager executing on the apparatus notifies the configuration system that the second configuration data is assigned to the particular customer so that the configuration system applies the second configuration data to printing devices of the particular customer. 17. The computer-implemented method as recited in claim 16, wherein the configuration system applies the second configuration data instead of the first configuration data to printing devices of the particular customer. 18. The computer-implemented method as recited in claim 15, further comprising the configuration manager executing on the apparatus determining whether the second plurality of printing device settings specified by the second configuration data is compatible with a particular printing device. 19. The computer-implemented method as recited in claim 15, wherein the configuration manager determines the first configuration data as a recommended configuration for a particular printing device based upon one or more factors. 20. The computer-implemented method as recited in claim 18, wherein the one or more factors include one or more of customer usage, industry trends, or user ratings. | 3,700 |
347,155 | 16,805,667 | 3,784 | Techniques for creating compelling extended reality (XR) environments, including virtual reality (VR) and mixed reality (MR), and other computer-generated experiences, are provided. In some embodiments, a VR and MR system, including a computer hardware- and software-based control system, controls a specialized headset, hand controls, and a distributed array of sensors and actuators to produce a VR or MR environment with compelling VR and MR display and social interaction features. In some embodiments, the VR and MR system creates and provides escalating levels of data access, permissions and experiences for users, based on different, multi-phased ratings. In some embodiments, a first rating sets a level of access to gameplay leading to a second rating. In some such embodiments, one user's VR or MR experience related to another user is modified aesthetically, haptically or otherwise, depending on the levels granted by another user, and other attributes. | 1. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. 2. The extended reality system of claim 1, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user and said second user directly selecting a level of access to personal information provided to each other. 3. The extended reality system of claim 1, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 4. The extended reality system of claim 3, wherein:
said computer hardware and software provide said control-system-managed level of access for said first user to said second user's personal information based on a fifth rating based on gameplay by said first user in said game. 5. The extended reality system of claim 1, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said first rating and/or said third rating. 6. The extended reality system of claim 4, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said fifth rating. 7. The extended reality system of claim 1, wherein:
said first user's activity and second user's activity are not a pre-determined gesture, but are newly defined and identified as an ad hoc action or event by the control system, in real time. 8. The extended reality system of claim 7, wherein:
said third rating or said fourth rating are determined based on an identified characteristic of said ad hoc action(s). 9. The extended reality system of claim 1, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 10. The extended reality system of claim 9, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 11. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from at least a first user of the system; create a first, coin rating, for said first user, based on the type and amount of personal information provided by said first user; track and record data related to said first user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine another, gameplay rating for said first user's activity based on one or more qualities of said activity; determine a second, V-Score rating, based on all personal information and gameplay data related to said first user; determine a control-system-managed level of access for said first user to another user's personal information, based on an algorithm based on each of the first rating and the second rating. 12. The extended reality system of claim 11, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user directly selecting a level of access to personal information provided to said another user. 13. The extended reality system of claim 11, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 14. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said first rating. 15. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said second rating. 16. The extended reality system of claim 11, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 17. The extended reality system of claim 16, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 18. A method for managing extended reality computer hardware, comprising the following steps:
providing an extended reality system to a user, wherein the extended reality system comprises specialized computer hardware and software configured to: collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. | Techniques for creating compelling extended reality (XR) environments, including virtual reality (VR) and mixed reality (MR), and other computer-generated experiences, are provided. In some embodiments, a VR and MR system, including a computer hardware- and software-based control system, controls a specialized headset, hand controls, and a distributed array of sensors and actuators to produce a VR or MR environment with compelling VR and MR display and social interaction features. In some embodiments, the VR and MR system creates and provides escalating levels of data access, permissions and experiences for users, based on different, multi-phased ratings. In some embodiments, a first rating sets a level of access to gameplay leading to a second rating. In some such embodiments, one user's VR or MR experience related to another user is modified aesthetically, haptically or otherwise, depending on the levels granted by another user, and other attributes.1. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. 2. The extended reality system of claim 1, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user and said second user directly selecting a level of access to personal information provided to each other. 3. The extended reality system of claim 1, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 4. The extended reality system of claim 3, wherein:
said computer hardware and software provide said control-system-managed level of access for said first user to said second user's personal information based on a fifth rating based on gameplay by said first user in said game. 5. The extended reality system of claim 1, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said first rating and/or said third rating. 6. The extended reality system of claim 4, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said fifth rating. 7. The extended reality system of claim 1, wherein:
said first user's activity and second user's activity are not a pre-determined gesture, but are newly defined and identified as an ad hoc action or event by the control system, in real time. 8. The extended reality system of claim 7, wherein:
said third rating or said fourth rating are determined based on an identified characteristic of said ad hoc action(s). 9. The extended reality system of claim 1, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 10. The extended reality system of claim 9, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 11. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from at least a first user of the system; create a first, coin rating, for said first user, based on the type and amount of personal information provided by said first user; track and record data related to said first user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine another, gameplay rating for said first user's activity based on one or more qualities of said activity; determine a second, V-Score rating, based on all personal information and gameplay data related to said first user; determine a control-system-managed level of access for said first user to another user's personal information, based on an algorithm based on each of the first rating and the second rating. 12. The extended reality system of claim 11, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user directly selecting a level of access to personal information provided to said another user. 13. The extended reality system of claim 11, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 14. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said first rating. 15. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said second rating. 16. The extended reality system of claim 11, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 17. The extended reality system of claim 16, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 18. A method for managing extended reality computer hardware, comprising the following steps:
providing an extended reality system to a user, wherein the extended reality system comprises specialized computer hardware and software configured to: collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. | 3,700 |
347,156 | 16,805,662 | 3,784 | Techniques for creating compelling extended reality (XR) environments, including virtual reality (VR) and mixed reality (MR), and other computer-generated experiences, are provided. In some embodiments, a VR and MR system, including a computer hardware- and software-based control system, controls a specialized headset, hand controls, and a distributed array of sensors and actuators to produce a VR or MR environment with compelling VR and MR display and social interaction features. In some embodiments, the VR and MR system creates and provides escalating levels of data access, permissions and experiences for users, based on different, multi-phased ratings. In some embodiments, a first rating sets a level of access to gameplay leading to a second rating. In some such embodiments, one user's VR or MR experience related to another user is modified aesthetically, haptically or otherwise, depending on the levels granted by another user, and other attributes. | 1. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. 2. The extended reality system of claim 1, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user and said second user directly selecting a level of access to personal information provided to each other. 3. The extended reality system of claim 1, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 4. The extended reality system of claim 3, wherein:
said computer hardware and software provide said control-system-managed level of access for said first user to said second user's personal information based on a fifth rating based on gameplay by said first user in said game. 5. The extended reality system of claim 1, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said first rating and/or said third rating. 6. The extended reality system of claim 4, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said fifth rating. 7. The extended reality system of claim 1, wherein:
said first user's activity and second user's activity are not a pre-determined gesture, but are newly defined and identified as an ad hoc action or event by the control system, in real time. 8. The extended reality system of claim 7, wherein:
said third rating or said fourth rating are determined based on an identified characteristic of said ad hoc action(s). 9. The extended reality system of claim 1, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 10. The extended reality system of claim 9, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 11. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from at least a first user of the system; create a first, coin rating, for said first user, based on the type and amount of personal information provided by said first user; track and record data related to said first user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine another, gameplay rating for said first user's activity based on one or more qualities of said activity; determine a second, V-Score rating, based on all personal information and gameplay data related to said first user; determine a control-system-managed level of access for said first user to another user's personal information, based on an algorithm based on each of the first rating and the second rating. 12. The extended reality system of claim 11, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user directly selecting a level of access to personal information provided to said another user. 13. The extended reality system of claim 11, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 14. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said first rating. 15. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said second rating. 16. The extended reality system of claim 11, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 17. The extended reality system of claim 16, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 18. A method for managing extended reality computer hardware, comprising the following steps:
providing an extended reality system to a user, wherein the extended reality system comprises specialized computer hardware and software configured to: collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. | Techniques for creating compelling extended reality (XR) environments, including virtual reality (VR) and mixed reality (MR), and other computer-generated experiences, are provided. In some embodiments, a VR and MR system, including a computer hardware- and software-based control system, controls a specialized headset, hand controls, and a distributed array of sensors and actuators to produce a VR or MR environment with compelling VR and MR display and social interaction features. In some embodiments, the VR and MR system creates and provides escalating levels of data access, permissions and experiences for users, based on different, multi-phased ratings. In some embodiments, a first rating sets a level of access to gameplay leading to a second rating. In some such embodiments, one user's VR or MR experience related to another user is modified aesthetically, haptically or otherwise, depending on the levels granted by another user, and other attributes.1. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. 2. The extended reality system of claim 1, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user and said second user directly selecting a level of access to personal information provided to each other. 3. The extended reality system of claim 1, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 4. The extended reality system of claim 3, wherein:
said computer hardware and software provide said control-system-managed level of access for said first user to said second user's personal information based on a fifth rating based on gameplay by said first user in said game. 5. The extended reality system of claim 1, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said first rating and/or said third rating. 6. The extended reality system of claim 4, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to the second user, based on said fifth rating. 7. The extended reality system of claim 1, wherein:
said first user's activity and second user's activity are not a pre-determined gesture, but are newly defined and identified as an ad hoc action or event by the control system, in real time. 8. The extended reality system of claim 7, wherein:
said third rating or said fourth rating are determined based on an identified characteristic of said ad hoc action(s). 9. The extended reality system of claim 1, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 10. The extended reality system of claim 9, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 11. An extended reality system, comprising specialized computer hardware and software configured to:
collect voluntarily-provided personal information from at least a first user of the system; create a first, coin rating, for said first user, based on the type and amount of personal information provided by said first user; track and record data related to said first user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine another, gameplay rating for said first user's activity based on one or more qualities of said activity; determine a second, V-Score rating, based on all personal information and gameplay data related to said first user; determine a control-system-managed level of access for said first user to another user's personal information, based on an algorithm based on each of the first rating and the second rating. 12. The extended reality system of claim 11, wherein:
said specialized computer hardware and software are configured to present a GUI facilitating the first user directly selecting a level of access to personal information provided to said another user. 13. The extended reality system of claim 11, wherein:
said computer hardware and software provide an amount of access to a game hosted on said computer hardware to said first user, based on said first rating. 14. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said first rating. 15. The extended reality system of claim 11, wherein:
said computer hardware and software provide an MR augmentation of the first user's appearance to said another user, based on said second rating. 16. The extended reality system of claim 11, wherein the personal information includes a spectrum of personal information types, and personal information is factored into a ratings algorithm differently depending on its position on that spectrum. 17. The extended reality system of claim 16, wherein the spectrum ranges from qualitative information, on the one hand, to quantitative information, on the other hand. 18. A method for managing extended reality computer hardware, comprising the following steps:
providing an extended reality system to a user, wherein the extended reality system comprises specialized computer hardware and software configured to: collect voluntarily-provided personal information from a first user of the system; collect voluntarily-provided personal information from a second user of the system; create a first rating, for said first user, based on the type and amount of personal information provided by said first user; create a second rating, for said second user, based on the type and amount of personal information provided by said second user; track and record data related to said first user's activity and said second user's activity interacting with a three-dimensional environment created, at least in part, by said system; determine a third rating for said first user's and said second user's activity based on one or more qualities of said activity; determine a fourth rating for said second user's and said second user's activity based on one or more qualities of said activity; determine a control-system-managed level of access for said first user to said second user's personal information, based on an algorithm based on each of the first rating, second rating, third rating and fourth rating. | 3,700 |
347,157 | 16,805,665 | 3,784 | An approach is provided for using parsing rules to automatically identify attributes and attribute values from documents and generate metadata that maps attribute values to display labels that may be searched, filtered, and sorted upon within an external storage service. A document processing system maintains parsing rules that define how to identify field labels, which represent attributes, and corresponding field values, which represent attribute values, and metadata mappings that map associations between field values and display labels. The display labels are used within the graphical user interface of the external storage service. The system receives a batch of multiple documents and uses the parsing rules to identify field labels and field values. The system generates metadata using the defined metadata mappings and associates the metadata to the documents processed. The system then sends the documents and their associated metadata to the external storage service for storage. | 1. An apparatus comprising:
one or more processors; and one or more memories storing instructions which, when processed by the one or more processors, cause:
maintaining:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving a batch of two or more scanned documents for processing;
for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 2. The apparatus of claim 1, wherein maintaining comprises further instructions which, when processed by the one or more processors, cause:
maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 3. The apparatus of claim 1, wherein maintaining comprises further instructions which, when processed by the one or more processors, cause:
maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 4. The apparatus of claim 1, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises further instructions which, when processed by the one or more processors, cause:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 5. The apparatus of claim 4, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 6. The apparatus of claim 1, wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders. 7. The apparatus of claim 6, the one or more memories store additional instructions which, when processed by the one or more processors, cause:
in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
maintaining:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving a batch of two or more scanned documents for processing; for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 9. The one or more non-transitory computer-readable media of claim 8, wherein maintaining, by the document processing cloud server, further comprises maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 10. The one or more non-transitory computer-readable media of claim 8, wherein maintaining, by the document cloud processing server, further comprises maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 11. The one or more non-transitory computer-readable media of claim 8, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 12. The one or more non-transitory computer-readable media of claim 11, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 13. The one or more non-transitory computer-readable media of claim 8, wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders. 14. The one or more non-transitory computer-readable media of claim 13, further comprising additional instructions which, when processed by the one or more processors, cause:
in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. 15. A method comprising:
maintaining, by a document processing cloud server:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving, by the document processing cloud server, a batch of two or more scanned documents for processing; for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 16. The method of claim 15, wherein maintaining, by the document processing cloud server, further comprises maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 17. The method of claim 15, wherein maintaining, by the document cloud processing server, further comprises maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 18. The method of claim 15, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 19. The method of claim 18, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 20. The method of claim 6, further comprising:
wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders; in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. | An approach is provided for using parsing rules to automatically identify attributes and attribute values from documents and generate metadata that maps attribute values to display labels that may be searched, filtered, and sorted upon within an external storage service. A document processing system maintains parsing rules that define how to identify field labels, which represent attributes, and corresponding field values, which represent attribute values, and metadata mappings that map associations between field values and display labels. The display labels are used within the graphical user interface of the external storage service. The system receives a batch of multiple documents and uses the parsing rules to identify field labels and field values. The system generates metadata using the defined metadata mappings and associates the metadata to the documents processed. The system then sends the documents and their associated metadata to the external storage service for storage.1. An apparatus comprising:
one or more processors; and one or more memories storing instructions which, when processed by the one or more processors, cause:
maintaining:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving a batch of two or more scanned documents for processing;
for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 2. The apparatus of claim 1, wherein maintaining comprises further instructions which, when processed by the one or more processors, cause:
maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 3. The apparatus of claim 1, wherein maintaining comprises further instructions which, when processed by the one or more processors, cause:
maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 4. The apparatus of claim 1, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises further instructions which, when processed by the one or more processors, cause:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 5. The apparatus of claim 4, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 6. The apparatus of claim 1, wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders. 7. The apparatus of claim 6, the one or more memories store additional instructions which, when processed by the one or more processors, cause:
in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
maintaining:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving a batch of two or more scanned documents for processing; for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 9. The one or more non-transitory computer-readable media of claim 8, wherein maintaining, by the document processing cloud server, further comprises maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 10. The one or more non-transitory computer-readable media of claim 8, wherein maintaining, by the document cloud processing server, further comprises maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 11. The one or more non-transitory computer-readable media of claim 8, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 12. The one or more non-transitory computer-readable media of claim 11, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 13. The one or more non-transitory computer-readable media of claim 8, wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders. 14. The one or more non-transitory computer-readable media of claim 13, further comprising additional instructions which, when processed by the one or more processors, cause:
in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. 15. A method comprising:
maintaining, by a document processing cloud server:
one or more parsing rules that define how to identify one or more field labels and corresponding one or more field values within one or more scanned documents; and
one or more metadata mappings that map associations between one or more display labels and the one or more field values;
receiving, by the document processing cloud server, a batch of two or more scanned documents for processing; for each document in the batch of two or more documents:
using the one or more parsing rules to identify a subset of field labels and a subset of corresponding field values;
using the one or more metadata mappings to generate metadata comprising the subset of field values mapped to a subset of display labels of the one or more display labels;
associating the metadata to the document;
sending each of the documents, of the two or more documents, and the metadata associated with each of the documents to a third-party file storage server, wherein the third-party storage server is configured to process the associated metadata and display the subset of display labels and the subset of field values within a graphical user interface of the third-party storage server. 16. The method of claim 15, wherein maintaining, by the document processing cloud server, further comprises maintaining one or more document naming rules defining a file naming conventions for received documents, wherein the one or more document naming rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more document naming rules to generate a filename for the document based upon one or more particular field values corresponding to the one or more parsing rules. 17. The method of claim 15, wherein maintaining, by the document cloud processing server, further comprises maintaining one or more destination folder generation rules defining a folder structure that contains a location for the destination folder, wherein the one or more destination folder generation rules are based upon the one or more parsing rules; and
wherein the for each document in the batch of the two or more documents, further comprises using the one or more destination folder generation rules to determine a location of the destination folder for the document based upon one or more particular field values corresponding to the one or more parsing rules. 18. The method of claim 15, wherein using the one or more parsing rules to identify the subset of field labels and the subset of corresponding field values comprises:
wherein each of the one or more parsing rules includes instructions that define a relative position of an associated field value with respect to an associated field label; for each particular parsing rule of the one or more parsing rules:
identifying, within the document, a portion of text that matches the associated field label defined in the particular parsing rule;
determining an area within the document that contains a target field value defined in the particular parsing rule, wherein the area is determined by the relative position defined in the particular parsing rule; and
identifying, within the document, a particular field value in the area that matches a format defined by the associated field value of the particular parsing rule. 19. The method of claim 18, wherein the relative position corresponds to a location for the associated field value as being located either to a right, left, above, or below the associated field label. 20. The method of claim 6, further comprising:
wherein the batch of the two or more scanned documents contain multiple pages comprising at least two different types of documents that are to be routed to different destination folders; in response to receiving the batch of two or more scanned documents, using a particular parsing rule to identify a particular field value, which has been designated as a primary key, in each of the pages that make up the batch of two or more scanned documents; and aggregating pages that have matching field values based on the particular parsing rule and the particular field value to identify each of the pages that belong to each of the two or more scanned documents. | 3,700 |
347,158 | 16,805,637 | 3,784 | The present disclosure provides technologies for target entity detection. One aspect of the present disclosure provides technologies for detection (e.g., early detection) of a disease, disorder, or condition (e.g., cancer). In another aspect, technologies provided herein are useful for selecting and/or monitoring and/or evaluating efficacy of, a treatment administered to a subject in need thereof, e.g., a subject determined to have or susceptible to cancer. In some embodiments, technologies provided herein are useful for development of companion diagnostics, e.g., by measuring tumor burdens and changes in tumor burdens in conjunction with therapeutics. | 1. A method comprising:
(a) contacting a sample that may comprise a biological entity of interest with at least one set of detection probes, each directed to a target, which set comprises at least a first detection probe for a first target and a second detection probe for a second target, so that a combination comprising the entity of interest and the set of detection probes is generated, wherein the first detection probe comprises a first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; wherein the second detection probe comprises a second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, wherein the second single-stranded overhang comprises a nucleotide sequence complementary to at least a portion of the first single-stranded overhang and can thereby hybridize to the first single-stranded overhang; and wherein the first oligonucleotide domain and the second oligonucleotide domain have a combined length such that, when the first and second targets are simultaneously present on the entity of interest and the probes of the set of detection probes are bound to their respective targets on the entity of interest, the first single-stranded overhang and the second single-stranded overhang can hybridize together; (b) maintaining the combination under conditions that permit binding of the set of detection probes to their respective targets on the entity of interest such that, when the entity of interest comprises the first target and the second target, the first detection probe and the second detection probe bind to the entity of interest to form a double-stranded complex; (c) contacting the double-stranded complex with a nucleic acid ligase to generate a ligated template comprising a strand of the first double-stranded portion and a strand of the second double-stranded portion; and (d) detecting the ligated template, wherein presence of the ligated template is indicative of presence in the sample of the entity of interest comprising the first target and the second target. 2. The method of claim 1, wherein the detecting comprises performing amplification of the ligated template and detecting the presence of the amplification product. 3. The method of claim 2, wherein the amplification is or comprises quantitative polymerase chain reaction. 4.-6. (canceled) 7. The method of claim 1, wherein the entity of interest is immobilized on a solid substrate. 8. The method of claim 7, wherein the solid substrate is or comprises a bead. 9.-10. (canceled) 11. The method of claim 1, wherein method does not comprise, prior to the contacting of step (c), contacting the double-stranded complex with a connector oligonucleotide that associates the first oligonucleotide with the second oligonucleotide domain. 12. The method of claim 11, wherein the connector oligonucleotide hybridizes to at least a portion of the first oligonucleotide domain and at least a portion of the second oligonucleotide domain. 13. The method of claim 1, wherein the first target-binding moiety and/or the second target-binding moiety comprise(s) an antibody agent. 14. The method of claim 1, wherein the set of detection probes further comprises an additional detection probe for a third target, the additional detection probe comprising a third target-binding moiety and a third oligonucleotide domain coupled to the third target-binding moiety, the third oligonucleotide domain comprising a double-stranded portion and a third single-stranded overhang extended from each end of the third oligonucleotide domain. 15. The method of claim 1, wherein the set of detection probes comprises 2-20 detection probes each for a specific target, each of the detection probes comprising a target-binding moiety and an oligonucleotide domain coupled to the target-binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang extended from at least one end of the oligonucleotide domain. 16.-18. (canceled) 19. The method of claim 1, wherein the set of detection probes further comprises a control probe, wherein the control probe is characterized in that binding of the control probe to the entity of interest inhibits generation of a ligated template and/or inhibits amplification of a ligated template from a non-target biological entity. 20. The method of claim 19, wherein the control probe is configured to bind to a control reference. 21.-47. (canceled) 48. A kit comprising at least one set of detection probes, each directed to a target, which set comprises:
a. a first detection probe for a first target, wherein the first detection probe comprises a first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; and b. a second detection probe for a second target, wherein the second detection probe comprises a second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, wherein the second single-stranded overhang comprises a nucleotide sequence complementary to at least a portion of the first single-stranded overhang and can thereby hybridize to the first single-stranded overhang; wherein the first oligonucleotide domain and the second oligonucleotide domain have a combined length such that, when the first target and the second target are simultaneously present on an entity of interest (e.g., a biological entity of interest) and the probes of the set of detection probes are bound to their respective targets on the entity of interest, the first single-stranded overhang and the second single-stranded overhang can hybridize together. 49. (canceled) 50. The kit of claim 48, comprising a plurality of sets of detection probes, wherein the plurality of sets of detection probes is characterized in that:
(a) each set recognizes at least one distinct biomarker for the same cancer; or (b) each set recognizes at least one distinct biomarker for a different cancer; or (c) each set recognizes a distinct combination of (e.g., at least two) biomarkers for the same cancer; or (d) each set recognizes a distinct combination of (e.g., at least two) biomarkers for a different cancer;
wherein each set of (a), (b), (c) or (d) comprises at least 2 or more detection probes, each of the detection probes comprising a target-binding moiety and an oligonucleotide domain coupled to the target-binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang extended from at least one end of the oligonucleotide domain. 51.-69. (canceled) 70. A double-stranded complex comprising:
(a) an entity of interest (e.g., a biological entity of interest) comprising a first target and a second target; (b) a first detection probe bound to the first target through a first target-binding moiety, wherein the first detection probe comprises the first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; and (c) a second detection probe bound to the second target through a second target-binding moiety, wherein the second detection probe comprises the second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, and wherein the first single-stranded overhang is hybridized to the second single-stranded overhang. 71. The double-stranded complex of claim 70, further comprising a third detection probe bound to a third target present on the entity of interest through a third target-binding moiety, wherein the third detection probe comprises the third target-binding moiety and a third oligonucleotide domain coupled to the third target-binding moiety, the third oligonucleotide domain comprising a third double-stranded portion and a third single-stranded overhang extended from at least one end of the third oligonucleotide domain, and
wherein the third single-stranded overhang is hybridized to the first and/or second single-stranded overhang; and wherein one strand of the double-stranded complex comprising strands of the oligonucleotide domains is ligatable in the presence of a nucleic acid ligase, while another strand of the double-stranded complex comprising strands of the oligonucleotide domains is not ligatable in the presence of a nucleic acid ligase. 72. The double-stranded complex of claim 71, wherein the non-ligatable strand comprises a gap. 73.-80. (canceled) 81. A method comprising steps of:
(A) providing or obtaining a blood-derived sample from a subject; (B) detecting, in the blood-derived sample, extracellular vesicles expressing a target biomarker signature for a disease, disorder, or condition (“target biomarker signature-expressing extracellular vesicles”) wherein the step of detecting includes a detection assay comprising:
(a) contacting the target biomarker signature-expressing extracellular vesicles with a set of detection probes, each directed to a target biomarker of the target biomarker signature, which set comprises at least two detection probes, so that a combination comprising the extracellular vesicles and the set of detection probes is generated,
wherein each of the at least two detection probes in the set comprises:
(i) a target binding moiety directed to a target biomarker of the target biomarker signature; and
(ii) an oligonucleotide domain coupled to the target binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang portion extended from one end of the oligonucleotide domain,
wherein the single-stranded overhang portions of the at least two detection probes are characterized in that they can hybridize to each other when the at least two detection probes are bound to the same extracellular vesicle,
(b) maintaining the combination under conditions that permit binding of the at least two detection probes to their respective targets on the extracellular vesicles such that the at least two detection probes can bind to the same extracellular vesicle that expresses the target biomarker signature to form a double-stranded complex;
(c) contacting the double-stranded complex with a nucleic acid ligase to generate a ligated template; and
(d) detecting/measuring the ligated template, wherein presence of the ligated template is indicative of presence and/or level in the blood-derived sample of the target biomarker signature-expressing extracellular vesicles;
(C) comparing sample information obtained from the detection assay to reference information including a reference threshold level; (D) classifying the subject as having or being susceptible to a disease, disorder, or condition when the blood-derived sample shows an elevated level of target biomarker signature-expressing extracellular vesicles relative to the reference threshold level. 82.-87. (canceled) 88. The method of claim 81, wherein the target biomarker signature comprises (1) a first target biomarker comprising an extracellular vesicle-associated membrane-bound polypeptide; and (2) a second target biomarker comprising a target biomarker selected from the group consisting of: surface protein biomarkers, intravesicular protein biomarkers, and intravesicular RNA biomarkers. 89. The method of claim 81, wherein the blood-derived sample has been subjected to size exclusion chromatography to isolate (e.g., directly from the blood-derived sample) nanoparticles having a size range of interest that includes extracellular vesicles. 90. The method of claim 81, wherein the step of detecting further comprises a capture assay. 91. The method of claim 90, wherein the capture assay is performed prior to the detection assay. 92. The method of claim 90, wherein the capture assay involves contacting the blood-derived sample with a capture agent comprising a target-capture moiety that binds to the first target biomarker comprising an extracellular vesicle-associated membrane-bound polypeptide. 93.-102. (canceled) 103. The method of claim 81, wherein the disease, disorder, or condition for which the target biomarker signature is specific to cancer. 104. The method of claim 103, wherein the method is performed to screen for early-stage cancer, late-stage cancer, or recurrent cancer in the subject. 105. The method of claim 103, wherein the cancer is selected from the group consisting of acute lymphocytic leukemia, acute myeloid leukemia, bile duct cancer, bladder cancer, brain cancer, breast cancer, cervical cancer, chronic lymphocytic leukemia, chronic myeloid leukemia, colorectal cancer, endometrial cancer, esophageal cancer, gastrointestinal cancer, Hodgkin lymphoma, kidney cancer, liver cancer, lung cancer, multiple myeloma, non-Hodgkin lymphoma, ovarian cancer, pancreatic cancer, prostate cancer, sarcomas, skin cancer, and stomach cancer. 106. The method of claim 103, wherein the subject has at least one or more of the following characteristics:
(i) an asymptomatic subject who is susceptible to cancer (e.g., at an average population risk (i.e., without hereditary risk) or with hereditary risk for cancer); (ii) a subject with a family history of cancer (e.g., a subject having one or more first-degree relatives with a history of cancer); (iii) a subject determined to have one or more germline mutations in one or more cancer-associated genes; (iv) an elderly subject, e.g., age 65 or above; (v) a subject with one or more non-specific symptoms of cancer; and (vi) a subject recommended for periodic cancer screening; (vii) a subject diagnosed with an imaging-confirmed mass; (viii) a subject at hereditary risk for cancer before undergoing a risk-reducing surgical intervention; (ix) a subject with a benign tumor; and (x) a subject who has been previously treated for cancer. 107. The method of claim 103, wherein the method is used in combination with one or more of the following diagnostic assays:
(i) the subject's annual physical examination; (ii) a cancer screening test; (iii) a genetic assay to screen blood plasma for genetic mutations in circulating tumor DNA and/or protein biomarkers linked to cancer; (iv) an assay involving immunofluorescent staining to identify cell phenotype and marker expression, followed by amplification and analysis by next-generation sequencing; and (v) germline and somatic mutation assays, or assays involving cell-free tumor DNA, liquid biopsy, serum protein and cell-free DNA, and/or circulating tumor cells. 108. The method of claim 103, wherein the method is performed to monitor a cancer patient for response to treatment of an anti-cancer therapy and/or for cancer recurrence/metastasis. 109.-119. (canceled) | The present disclosure provides technologies for target entity detection. One aspect of the present disclosure provides technologies for detection (e.g., early detection) of a disease, disorder, or condition (e.g., cancer). In another aspect, technologies provided herein are useful for selecting and/or monitoring and/or evaluating efficacy of, a treatment administered to a subject in need thereof, e.g., a subject determined to have or susceptible to cancer. In some embodiments, technologies provided herein are useful for development of companion diagnostics, e.g., by measuring tumor burdens and changes in tumor burdens in conjunction with therapeutics.1. A method comprising:
(a) contacting a sample that may comprise a biological entity of interest with at least one set of detection probes, each directed to a target, which set comprises at least a first detection probe for a first target and a second detection probe for a second target, so that a combination comprising the entity of interest and the set of detection probes is generated, wherein the first detection probe comprises a first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; wherein the second detection probe comprises a second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, wherein the second single-stranded overhang comprises a nucleotide sequence complementary to at least a portion of the first single-stranded overhang and can thereby hybridize to the first single-stranded overhang; and wherein the first oligonucleotide domain and the second oligonucleotide domain have a combined length such that, when the first and second targets are simultaneously present on the entity of interest and the probes of the set of detection probes are bound to their respective targets on the entity of interest, the first single-stranded overhang and the second single-stranded overhang can hybridize together; (b) maintaining the combination under conditions that permit binding of the set of detection probes to their respective targets on the entity of interest such that, when the entity of interest comprises the first target and the second target, the first detection probe and the second detection probe bind to the entity of interest to form a double-stranded complex; (c) contacting the double-stranded complex with a nucleic acid ligase to generate a ligated template comprising a strand of the first double-stranded portion and a strand of the second double-stranded portion; and (d) detecting the ligated template, wherein presence of the ligated template is indicative of presence in the sample of the entity of interest comprising the first target and the second target. 2. The method of claim 1, wherein the detecting comprises performing amplification of the ligated template and detecting the presence of the amplification product. 3. The method of claim 2, wherein the amplification is or comprises quantitative polymerase chain reaction. 4.-6. (canceled) 7. The method of claim 1, wherein the entity of interest is immobilized on a solid substrate. 8. The method of claim 7, wherein the solid substrate is or comprises a bead. 9.-10. (canceled) 11. The method of claim 1, wherein method does not comprise, prior to the contacting of step (c), contacting the double-stranded complex with a connector oligonucleotide that associates the first oligonucleotide with the second oligonucleotide domain. 12. The method of claim 11, wherein the connector oligonucleotide hybridizes to at least a portion of the first oligonucleotide domain and at least a portion of the second oligonucleotide domain. 13. The method of claim 1, wherein the first target-binding moiety and/or the second target-binding moiety comprise(s) an antibody agent. 14. The method of claim 1, wherein the set of detection probes further comprises an additional detection probe for a third target, the additional detection probe comprising a third target-binding moiety and a third oligonucleotide domain coupled to the third target-binding moiety, the third oligonucleotide domain comprising a double-stranded portion and a third single-stranded overhang extended from each end of the third oligonucleotide domain. 15. The method of claim 1, wherein the set of detection probes comprises 2-20 detection probes each for a specific target, each of the detection probes comprising a target-binding moiety and an oligonucleotide domain coupled to the target-binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang extended from at least one end of the oligonucleotide domain. 16.-18. (canceled) 19. The method of claim 1, wherein the set of detection probes further comprises a control probe, wherein the control probe is characterized in that binding of the control probe to the entity of interest inhibits generation of a ligated template and/or inhibits amplification of a ligated template from a non-target biological entity. 20. The method of claim 19, wherein the control probe is configured to bind to a control reference. 21.-47. (canceled) 48. A kit comprising at least one set of detection probes, each directed to a target, which set comprises:
a. a first detection probe for a first target, wherein the first detection probe comprises a first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; and b. a second detection probe for a second target, wherein the second detection probe comprises a second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, wherein the second single-stranded overhang comprises a nucleotide sequence complementary to at least a portion of the first single-stranded overhang and can thereby hybridize to the first single-stranded overhang; wherein the first oligonucleotide domain and the second oligonucleotide domain have a combined length such that, when the first target and the second target are simultaneously present on an entity of interest (e.g., a biological entity of interest) and the probes of the set of detection probes are bound to their respective targets on the entity of interest, the first single-stranded overhang and the second single-stranded overhang can hybridize together. 49. (canceled) 50. The kit of claim 48, comprising a plurality of sets of detection probes, wherein the plurality of sets of detection probes is characterized in that:
(a) each set recognizes at least one distinct biomarker for the same cancer; or (b) each set recognizes at least one distinct biomarker for a different cancer; or (c) each set recognizes a distinct combination of (e.g., at least two) biomarkers for the same cancer; or (d) each set recognizes a distinct combination of (e.g., at least two) biomarkers for a different cancer;
wherein each set of (a), (b), (c) or (d) comprises at least 2 or more detection probes, each of the detection probes comprising a target-binding moiety and an oligonucleotide domain coupled to the target-binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang extended from at least one end of the oligonucleotide domain. 51.-69. (canceled) 70. A double-stranded complex comprising:
(a) an entity of interest (e.g., a biological entity of interest) comprising a first target and a second target; (b) a first detection probe bound to the first target through a first target-binding moiety, wherein the first detection probe comprises the first target-binding moiety and a first oligonucleotide domain coupled to the first target-binding moiety, the first oligonucleotide domain comprising a first double-stranded portion and a first single-stranded overhang extended from one end of the first oligonucleotide domain; and (c) a second detection probe bound to the second target through a second target-binding moiety, wherein the second detection probe comprises the second target-binding moiety and a second oligonucleotide domain coupled to the second target-binding moiety, the second oligonucleotide domain comprising a second double-stranded portion and a second single-stranded overhang extended from one end of the second oligonucleotide domain, and wherein the first single-stranded overhang is hybridized to the second single-stranded overhang. 71. The double-stranded complex of claim 70, further comprising a third detection probe bound to a third target present on the entity of interest through a third target-binding moiety, wherein the third detection probe comprises the third target-binding moiety and a third oligonucleotide domain coupled to the third target-binding moiety, the third oligonucleotide domain comprising a third double-stranded portion and a third single-stranded overhang extended from at least one end of the third oligonucleotide domain, and
wherein the third single-stranded overhang is hybridized to the first and/or second single-stranded overhang; and wherein one strand of the double-stranded complex comprising strands of the oligonucleotide domains is ligatable in the presence of a nucleic acid ligase, while another strand of the double-stranded complex comprising strands of the oligonucleotide domains is not ligatable in the presence of a nucleic acid ligase. 72. The double-stranded complex of claim 71, wherein the non-ligatable strand comprises a gap. 73.-80. (canceled) 81. A method comprising steps of:
(A) providing or obtaining a blood-derived sample from a subject; (B) detecting, in the blood-derived sample, extracellular vesicles expressing a target biomarker signature for a disease, disorder, or condition (“target biomarker signature-expressing extracellular vesicles”) wherein the step of detecting includes a detection assay comprising:
(a) contacting the target biomarker signature-expressing extracellular vesicles with a set of detection probes, each directed to a target biomarker of the target biomarker signature, which set comprises at least two detection probes, so that a combination comprising the extracellular vesicles and the set of detection probes is generated,
wherein each of the at least two detection probes in the set comprises:
(i) a target binding moiety directed to a target biomarker of the target biomarker signature; and
(ii) an oligonucleotide domain coupled to the target binding moiety, the oligonucleotide domain comprising a double-stranded portion and a single-stranded overhang portion extended from one end of the oligonucleotide domain,
wherein the single-stranded overhang portions of the at least two detection probes are characterized in that they can hybridize to each other when the at least two detection probes are bound to the same extracellular vesicle,
(b) maintaining the combination under conditions that permit binding of the at least two detection probes to their respective targets on the extracellular vesicles such that the at least two detection probes can bind to the same extracellular vesicle that expresses the target biomarker signature to form a double-stranded complex;
(c) contacting the double-stranded complex with a nucleic acid ligase to generate a ligated template; and
(d) detecting/measuring the ligated template, wherein presence of the ligated template is indicative of presence and/or level in the blood-derived sample of the target biomarker signature-expressing extracellular vesicles;
(C) comparing sample information obtained from the detection assay to reference information including a reference threshold level; (D) classifying the subject as having or being susceptible to a disease, disorder, or condition when the blood-derived sample shows an elevated level of target biomarker signature-expressing extracellular vesicles relative to the reference threshold level. 82.-87. (canceled) 88. The method of claim 81, wherein the target biomarker signature comprises (1) a first target biomarker comprising an extracellular vesicle-associated membrane-bound polypeptide; and (2) a second target biomarker comprising a target biomarker selected from the group consisting of: surface protein biomarkers, intravesicular protein biomarkers, and intravesicular RNA biomarkers. 89. The method of claim 81, wherein the blood-derived sample has been subjected to size exclusion chromatography to isolate (e.g., directly from the blood-derived sample) nanoparticles having a size range of interest that includes extracellular vesicles. 90. The method of claim 81, wherein the step of detecting further comprises a capture assay. 91. The method of claim 90, wherein the capture assay is performed prior to the detection assay. 92. The method of claim 90, wherein the capture assay involves contacting the blood-derived sample with a capture agent comprising a target-capture moiety that binds to the first target biomarker comprising an extracellular vesicle-associated membrane-bound polypeptide. 93.-102. (canceled) 103. The method of claim 81, wherein the disease, disorder, or condition for which the target biomarker signature is specific to cancer. 104. The method of claim 103, wherein the method is performed to screen for early-stage cancer, late-stage cancer, or recurrent cancer in the subject. 105. The method of claim 103, wherein the cancer is selected from the group consisting of acute lymphocytic leukemia, acute myeloid leukemia, bile duct cancer, bladder cancer, brain cancer, breast cancer, cervical cancer, chronic lymphocytic leukemia, chronic myeloid leukemia, colorectal cancer, endometrial cancer, esophageal cancer, gastrointestinal cancer, Hodgkin lymphoma, kidney cancer, liver cancer, lung cancer, multiple myeloma, non-Hodgkin lymphoma, ovarian cancer, pancreatic cancer, prostate cancer, sarcomas, skin cancer, and stomach cancer. 106. The method of claim 103, wherein the subject has at least one or more of the following characteristics:
(i) an asymptomatic subject who is susceptible to cancer (e.g., at an average population risk (i.e., without hereditary risk) or with hereditary risk for cancer); (ii) a subject with a family history of cancer (e.g., a subject having one or more first-degree relatives with a history of cancer); (iii) a subject determined to have one or more germline mutations in one or more cancer-associated genes; (iv) an elderly subject, e.g., age 65 or above; (v) a subject with one or more non-specific symptoms of cancer; and (vi) a subject recommended for periodic cancer screening; (vii) a subject diagnosed with an imaging-confirmed mass; (viii) a subject at hereditary risk for cancer before undergoing a risk-reducing surgical intervention; (ix) a subject with a benign tumor; and (x) a subject who has been previously treated for cancer. 107. The method of claim 103, wherein the method is used in combination with one or more of the following diagnostic assays:
(i) the subject's annual physical examination; (ii) a cancer screening test; (iii) a genetic assay to screen blood plasma for genetic mutations in circulating tumor DNA and/or protein biomarkers linked to cancer; (iv) an assay involving immunofluorescent staining to identify cell phenotype and marker expression, followed by amplification and analysis by next-generation sequencing; and (v) germline and somatic mutation assays, or assays involving cell-free tumor DNA, liquid biopsy, serum protein and cell-free DNA, and/or circulating tumor cells. 108. The method of claim 103, wherein the method is performed to monitor a cancer patient for response to treatment of an anti-cancer therapy and/or for cancer recurrence/metastasis. 109.-119. (canceled) | 3,700 |
347,159 | 16,805,666 | 2,422 | A system and method for altering the visual appearance of moving physical forms is disclosed. The moving physical forms may include solids, liquids, gasses and any combination thereof. The system and method may include video capturing devices for capturing video footage of the moving forms, a controller for altering the captured video footage of the moving forms, and video projecting devices for projecting the altered video footage back onto the moving forms. | 1. A method of altering the visual appearance of a moving physical form, the method comprising:
(A) capturing video footage of the moving physical form; (B) altering a first portion of the captured video footage to create a first altered video sequence; and (C) projecting the first altered video sequence onto the moving physical form. 2. The method of claim 1 further comprising:
(D) altering a second portion of the captured video footage to create a second altered video sequence; and
(E) projecting the second altered video sequence onto the moving physical form. 3. The method of claim 1 wherein the moving physical form is selected from the group: gas, sand, pebbles, balls and water. 4. The method of claim 1 wherein the altering a first portion of the captured video footage in (B) includes decreasing the playback speed of at least a portion of the captured video footage or increasing the playback speed of at least a portion of the captured video footage. 5. The method of claim 1 wherein the altering of the first portion of the captured video footage in (B) includes altering the orientation of the captured video footage. 6. The method of claim 1 wherein the moving physical form is selected from the group: water droplets falling through the air, water flowing down a structure, a parabolic water stream, and a water spray. 7. The method of claim 1 wherein the altering a first portion of the captured video footage in (B) is performed by a controller. 8. The method of claim 1 wherein the capturing of video footage in (A) is performed by one or more video cameras. 9. The method of claim 1 wherein the projecting the first altered video sequence in (C) is performed by one or more video projectors. 10. A system for altering the appearance of moving water, the system comprising:
at least one video capturing device for capturing video footage of the moving water; a controller for altering the captured video footage; and at least one video projecting device for projecting the altered video footage onto the moving water; wherein the at least one video capturing device captures video footage of the moving water, the controller alters at least a portion of the captured video footage, and the at least one video projecting device projects at least a portion of the altered portion of video footage onto at least a portion of the moving water. 11. The system of claim 10 wherein the controller alters at least a portion of the captured video footage by decreasing the playback speed of the at least a portion of the captured video footage, by increasing the playback speed of the at least a portion of the captured video footage, or by altering the orientation of the at least a portion of the captured video footage. 12. The system of claim 10 wherein the moving water is selected from the group: water droplets falling through the air, water flowing down a structure, a parabolic water stream, and a water spray. 13. The system of claim 10 wherein the at least one video capturing device includes a visible light video camera or a non-visible light video camera. 14. The system of claim 10 wherein the video capturing device is a digital or analog video camera. | A system and method for altering the visual appearance of moving physical forms is disclosed. The moving physical forms may include solids, liquids, gasses and any combination thereof. The system and method may include video capturing devices for capturing video footage of the moving forms, a controller for altering the captured video footage of the moving forms, and video projecting devices for projecting the altered video footage back onto the moving forms.1. A method of altering the visual appearance of a moving physical form, the method comprising:
(A) capturing video footage of the moving physical form; (B) altering a first portion of the captured video footage to create a first altered video sequence; and (C) projecting the first altered video sequence onto the moving physical form. 2. The method of claim 1 further comprising:
(D) altering a second portion of the captured video footage to create a second altered video sequence; and
(E) projecting the second altered video sequence onto the moving physical form. 3. The method of claim 1 wherein the moving physical form is selected from the group: gas, sand, pebbles, balls and water. 4. The method of claim 1 wherein the altering a first portion of the captured video footage in (B) includes decreasing the playback speed of at least a portion of the captured video footage or increasing the playback speed of at least a portion of the captured video footage. 5. The method of claim 1 wherein the altering of the first portion of the captured video footage in (B) includes altering the orientation of the captured video footage. 6. The method of claim 1 wherein the moving physical form is selected from the group: water droplets falling through the air, water flowing down a structure, a parabolic water stream, and a water spray. 7. The method of claim 1 wherein the altering a first portion of the captured video footage in (B) is performed by a controller. 8. The method of claim 1 wherein the capturing of video footage in (A) is performed by one or more video cameras. 9. The method of claim 1 wherein the projecting the first altered video sequence in (C) is performed by one or more video projectors. 10. A system for altering the appearance of moving water, the system comprising:
at least one video capturing device for capturing video footage of the moving water; a controller for altering the captured video footage; and at least one video projecting device for projecting the altered video footage onto the moving water; wherein the at least one video capturing device captures video footage of the moving water, the controller alters at least a portion of the captured video footage, and the at least one video projecting device projects at least a portion of the altered portion of video footage onto at least a portion of the moving water. 11. The system of claim 10 wherein the controller alters at least a portion of the captured video footage by decreasing the playback speed of the at least a portion of the captured video footage, by increasing the playback speed of the at least a portion of the captured video footage, or by altering the orientation of the at least a portion of the captured video footage. 12. The system of claim 10 wherein the moving water is selected from the group: water droplets falling through the air, water flowing down a structure, a parabolic water stream, and a water spray. 13. The system of claim 10 wherein the at least one video capturing device includes a visible light video camera or a non-visible light video camera. 14. The system of claim 10 wherein the video capturing device is a digital or analog video camera. | 2,400 |
347,160 | 16,805,663 | 2,422 | An approach is provided for generating parsing rules that automatically identify attributes and attribute values from documents and generates metadata mapping information that is associated with electronic versions of documents processed. A graphical user interface (GUI) is displayed on a client device that contains a sample document containing field labels and field values, which represent attributes and attribute values. The GUI is configured to receive a first set of inputs identify field labels and field values. In response to receiving the first set of inputs, parsing rules are generated that define the relationships between the field labels and corresponding field values. A second set of inputs are received that include a selection of a subset of the parsing rules to generate metadata mapping that maps a subset of the field values to display labels. The metadata mapping is associated to a document library that manages views of the destination folder such that the parsing rules and the metadata mapping are applied to each document routed to the destination folder. | 1. An apparatus comprising:
one or more processors; and one or more memories storing instructions which, when processed by the one or more processors, cause:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder;
receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected;
in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values;
receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 2. The apparatus of claim 1, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected comprises further instructions which, when processed by the one or more processors, cause:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 3. The apparatus of claim 2, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 4. The apparatus of claim 1, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 5. The apparatus of claim 1, the one or more memories store additional instructions which, when processed by the one or more processors, cause receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 6. The apparatus of claim 1, the one or more memories store additional instructions which, when processed by the one or more processors, cause receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. 7. The apparatus of claim 6, the one or more memories store additional instructions which, when processed by the one or more processors, cause:
receiving a fifth input that specifies a naming convention for the destination folder based upon syntax of a field value associated with the parsing rule selected; and updating the naming convention of the destination folder based on the fifth input. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder; receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected; in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values; receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 9. The one or more non-transitory computer-readable media of claim 8, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected, comprises:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 10. The one or more non-transitory computer-readable media of claim 9, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 11. The one or more non-transitory computer-readable media of claim 8, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 12. The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 13. The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. 14. The one or more non-transitory computer-readable media of claim 13, further comprising additional instructions which, when processed by the one or more processors, cause:
receiving a fifth input that specifies a naming convention for the destination folder based upon syntax of a field value associated with the parsing rule selected; and updating the naming convention of the destination folder based on the fifth input. 15. A method comprising:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder; receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected; in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values; receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 16. The method of claim 15, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected, comprises:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 17. The method of claim 16, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 18. The method of claim 15, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 19. The method of claim 15, further comprising receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 20. The method of claim 15, further comprising receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. | An approach is provided for generating parsing rules that automatically identify attributes and attribute values from documents and generates metadata mapping information that is associated with electronic versions of documents processed. A graphical user interface (GUI) is displayed on a client device that contains a sample document containing field labels and field values, which represent attributes and attribute values. The GUI is configured to receive a first set of inputs identify field labels and field values. In response to receiving the first set of inputs, parsing rules are generated that define the relationships between the field labels and corresponding field values. A second set of inputs are received that include a selection of a subset of the parsing rules to generate metadata mapping that maps a subset of the field values to display labels. The metadata mapping is associated to a document library that manages views of the destination folder such that the parsing rules and the metadata mapping are applied to each document routed to the destination folder.1. An apparatus comprising:
one or more processors; and one or more memories storing instructions which, when processed by the one or more processors, cause:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder;
receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected;
in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values;
receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 2. The apparatus of claim 1, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected comprises further instructions which, when processed by the one or more processors, cause:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 3. The apparatus of claim 2, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 4. The apparatus of claim 1, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 5. The apparatus of claim 1, the one or more memories store additional instructions which, when processed by the one or more processors, cause receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 6. The apparatus of claim 1, the one or more memories store additional instructions which, when processed by the one or more processors, cause receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. 7. The apparatus of claim 6, the one or more memories store additional instructions which, when processed by the one or more processors, cause:
receiving a fifth input that specifies a naming convention for the destination folder based upon syntax of a field value associated with the parsing rule selected; and updating the naming convention of the destination folder based on the fifth input. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder; receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected; in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values; receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 9. The one or more non-transitory computer-readable media of claim 8, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected, comprises:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 10. The one or more non-transitory computer-readable media of claim 9, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 11. The one or more non-transitory computer-readable media of claim 8, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 12. The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 13. The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. 14. The one or more non-transitory computer-readable media of claim 13, further comprising additional instructions which, when processed by the one or more processors, cause:
receiving a fifth input that specifies a naming convention for the destination folder based upon syntax of a field value associated with the parsing rule selected; and updating the naming convention of the destination folder based on the fifth input. 15. A method comprising:
causing a graphical user interface to display a sample document containing a plurality field labels and a corresponding plurality of field values, wherein the sample document represents a particular type of document to be routed to a destination folder; receiving a first set of inputs that include a selection of one or more field labels, of the plurality of field labels, and indicators that identify one or more field values, of the plurality of field values, that correspond to the one or more field labels selected; in response to receiving the first set of inputs, generating one or more parsing rules that define one or more field label-to-field value relationships, the one or more parsing rules are based on the one or more field labels and the one or more corresponding field values; receiving a second set of inputs that include a selection of a subset of the one or more parsing rules to generate one or more metadata mappings used by a document library to manage documents routed to the destination folder. 16. The method of claim 15, wherein receiving the first set of inputs that include the selection of the one or more field labels of the plurality of field labels and the indicators that identify the one or more field values, of the plurality of field values, that correspond to the one or more field labels selected, comprises:
receiving selection input, of the first set of inputs, that selects an area within the sample document containing the one or more field labels; causing the graphical user interface to display, within a first panel, each of the one or more field labels detected from the selection input; and for each particular field label of the one or more field labels, receiving a particular indicator, of the indicators, that specifies a relative position for a particular field value that corresponds to the particular field label. 17. The method of claim 16, wherein the particular indicator indicates that the relative position of the particular field value as being located either to a right, left, above, or below the particular field label. 18. The method of claim 15, wherein the second set of inputs comprise one or more select-and-drag actions on the subset of the one or more parsing rules to drag the subset of the one or more parsing rules into a first area of the graphical user interface designated for metadata mapping. 19. The method of claim 15, further comprising receiving a third set of inputs that includes one or more select-and-drag actions on a second subset of the one or more parsing rules to drag the second subset of the one or more parsing rules into a second area of the graphical user interface, which is designated for defining document naming conventions, to generate a document naming structure for documents generated from a scan of one or more physical documents. 20. The method of claim 15, further comprising receiving a fourth input that is a select-and-drag action on a parsing rule from the one or more parsing rules to drag the parsing rule into to a third area of the graphical user interface, which is designated for defining a folder structure, to generate a folder structure that specifies routing processed documents to a location corresponding to the destination folder. | 2,400 |
347,161 | 16,805,660 | 2,422 | A method of training machine learning models (MLMs). An issue vector is generated using an issue MLM to generate a first output including first embedded natural language issue statements. An action vector is generated using an action MLM to generate a second output including related embedded natural language action statements. The issue and action MLMs are of a same type. An inner product of the first and second output is calculated, forming a third output. The third output is processed according to a sigmoid gate process to predict whether a given issue statement and corresponding action statement relate to a same call, resulting in a fourth output. A loss function is calculated from the fourth output by comparing the fourth output to a known result. The issue MLM and the action MLM are modified using the loss function to obtain a trained issue MLM and a trained action MLM. | 1. A method of training a plurality of machine learning models (MLMs), comprising:
generating an issue vector using an issue MLM to generate a first output, wherein the issue vector comprises a first plurality of embedded natural language issue statements; generating an action vector using an action MLM to generate a second output,
wherein the action vector comprises a second plurality of embedded natural language action statements related to the first plurality of natural language issue statements, and
wherein the issue MLM and the action MLM are a same type of MLM;
calculating an inner product of the first output and the second output resulting in a third output; processing the third output according to a sigmoid gate process to predict whether a given natural language issue statement in the first plurality of natural language issue statements and a corresponding given action statement in the second plurality of natural language action statements relate to a same call placed by a prior user, wherein processing the third output results in a fourth output; calculating a loss function from the fourth output by comparing the fourth output to a known result in which known data indicates whether the given natural language issue statement and the given natural language action statement are both contained in the same call placed by the prior user; and after calculating the loss function, modifying the issue MLM and the action MLM using the loss function to obtain a trained issue MLM and a trained action MLM. 2. The method of claim 1, wherein:
generating the issue vector embeds first plurality of natural language issue statements into a first vector space; the first output is defined in the first vector space; generating the action vector embeds the second plurality of natural language action statements into the first vector space; and the second output is defined in the first vector space. 3. The method of claim 2, wherein the trained issue MLM is trained to embed new natural language issue statements into a new vector in the first vector space. 4. The method of claim 2, wherein:
the second plurality of natural language action statements comprise call summaries; the trained action MLM is trained to encode the call summaries in the first vector space; and a final output of the trained action MLM comprises an output vector containing all of the call summaries embedded in the first vector space. 5. The method of claim 4, further comprising:
clustering individual call summaries in the second output into a plurality of centroid vectors. 6. The method of claim 5, further comprising:
storing the plurality of centroid vectors as an actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 7. The method of claim 1, further comprising:
iterating the generating of the issue vector, the generating of the action vector, the calculating the inner product, the processing the third output according to the sigmoid gate process, the calculating the loss function, and the modifying the issue MLM and the action MLM until convergence. 8. A method of using a trained issue machine learning model (MLM), comprising:
embedding, by the trained issue MLM, a new natural language issue statement into an issue vector; calculating an inner product of the issue vector with an actions matrix,
wherein the actions matrix comprises a plurality of centroid-vectors calculated using a clustering method from a second output of a trained action MLM which embedded a plurality of prior actions expressed in natural language action statements taken as a result of prior natural issue statements,
wherein calculating the inner product results in a plurality of probabilities associated with the plurality of prior actions, and
wherein each of the plurality of probabilities represents a corresponding estimate that a corresponding prior action is relevant to the issue vector;
generating a list of proposed actions relevant to the issue vector by comparing the plurality of probabilities to a threshold value and selecting a subset of the plurality of prior actions with corresponding probabilities above the threshold; and transmitting, to a user device, the list of proposed actions. 9. The method of claim 8, further comprising:
receiving a call from a user via a call service; and performing speech recognition to convert words spoken by the user into the new natural language text. 10. The method of claim 8, further comprising generating the actions matrix by:
clustering individual call summaries of prior calls stored as an actions vector into a plurality of centroid vectors. 11. The method of claim 10, wherein generating the actions matrix further comprises:
storing the plurality of centroid vectors as the actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 12. The method of claim 8, wherein calculating the inner product forms a result comprising the plurality of probabilities associated with the plurality of prior actions, and wherein the method further comprises:
prior to generating the list of proposed actions, applying a sigmoid gate function to the result to form a modified result having modified probabilities, and wherein the modified probabilities are compared to the threshold when generating the list of proposed actions. 13. The method of claim 8, further comprising:
ordering the list of proposed actions from highest probability to lowest probability. 14. The method of claim 12, further comprising:
displaying, on a display device, additional detail regarding an action selected from the list of proposed actions. 15. A system comprising:
a data repository storing:
a new natural language issue statement,
a trained issue machine learning model (MLM),
an issue vector comprising an embedded version of the new natural language issue statement,
an actions matrix comprising a plurality of centroid-vectors calculated using a clustering method from a second output of a trained action MLM applied to a plurality of prior actions taken as a result of prior natural language issue statements;
a plurality of probabilities associated with the plurality of prior actions,
wherein each of the plurality of probabilities represents a corresponding estimate that a corresponding prior action is relevant to the issue vector,
a threshold value,
a subset of the plurality of prior actions having probabilities above the threshold, and
a list of proposed actions relevant to the issue vector;
a machine learning execution engine, wherein the machine learning execution engine is configured to:
embed, by the trained issue MLM, the new natural language issue statement into the issue vector, and
calculate an inner product of the issue vector and the actions matrix to form the plurality of probabilities; and
an action selection engine executable by a processor to:
compare the plurality of probabilities to the threshold value,
select the subset of the plurality of prior actions with corresponding probabilities above the threshold, wherein selecting the subset forms a list of proposed actions, and
transmit the list of proposed actions to a user device. 16. The system of claim 15, wherein the storage device further stores individual call summaries of prior calls stored as an actions vector, and wherein the system further comprises:
an actions matrix generator configured to:
cluster the individual call summaries into a plurality of centroid vectors, and
store the plurality of centroid vectors as the actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 17. The system of claim 15, further comprising:
a speech recognition engine configured to:
receive a call from a user via a call service, and
convert speech of the user into the new natural language issue statement. 18. The system of claim 15, wherein the trained issue MLM comprises a deep learning neural network. 19. The system of claim 15, further comprising:
the user device, wherein the user device is remote from the data repository, the machine learning execution engine, and the action selection engine. 20. The system of claim 19, further comprising:
a display device operably connected to the user device, wherein the display device is configured to display the list of proposed actions; and a user input device operably connected to the user device, wherein the user input device is configured to receive user input comprising a selection of one of the list of proposed actions. | A method of training machine learning models (MLMs). An issue vector is generated using an issue MLM to generate a first output including first embedded natural language issue statements. An action vector is generated using an action MLM to generate a second output including related embedded natural language action statements. The issue and action MLMs are of a same type. An inner product of the first and second output is calculated, forming a third output. The third output is processed according to a sigmoid gate process to predict whether a given issue statement and corresponding action statement relate to a same call, resulting in a fourth output. A loss function is calculated from the fourth output by comparing the fourth output to a known result. The issue MLM and the action MLM are modified using the loss function to obtain a trained issue MLM and a trained action MLM.1. A method of training a plurality of machine learning models (MLMs), comprising:
generating an issue vector using an issue MLM to generate a first output, wherein the issue vector comprises a first plurality of embedded natural language issue statements; generating an action vector using an action MLM to generate a second output,
wherein the action vector comprises a second plurality of embedded natural language action statements related to the first plurality of natural language issue statements, and
wherein the issue MLM and the action MLM are a same type of MLM;
calculating an inner product of the first output and the second output resulting in a third output; processing the third output according to a sigmoid gate process to predict whether a given natural language issue statement in the first plurality of natural language issue statements and a corresponding given action statement in the second plurality of natural language action statements relate to a same call placed by a prior user, wherein processing the third output results in a fourth output; calculating a loss function from the fourth output by comparing the fourth output to a known result in which known data indicates whether the given natural language issue statement and the given natural language action statement are both contained in the same call placed by the prior user; and after calculating the loss function, modifying the issue MLM and the action MLM using the loss function to obtain a trained issue MLM and a trained action MLM. 2. The method of claim 1, wherein:
generating the issue vector embeds first plurality of natural language issue statements into a first vector space; the first output is defined in the first vector space; generating the action vector embeds the second plurality of natural language action statements into the first vector space; and the second output is defined in the first vector space. 3. The method of claim 2, wherein the trained issue MLM is trained to embed new natural language issue statements into a new vector in the first vector space. 4. The method of claim 2, wherein:
the second plurality of natural language action statements comprise call summaries; the trained action MLM is trained to encode the call summaries in the first vector space; and a final output of the trained action MLM comprises an output vector containing all of the call summaries embedded in the first vector space. 5. The method of claim 4, further comprising:
clustering individual call summaries in the second output into a plurality of centroid vectors. 6. The method of claim 5, further comprising:
storing the plurality of centroid vectors as an actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 7. The method of claim 1, further comprising:
iterating the generating of the issue vector, the generating of the action vector, the calculating the inner product, the processing the third output according to the sigmoid gate process, the calculating the loss function, and the modifying the issue MLM and the action MLM until convergence. 8. A method of using a trained issue machine learning model (MLM), comprising:
embedding, by the trained issue MLM, a new natural language issue statement into an issue vector; calculating an inner product of the issue vector with an actions matrix,
wherein the actions matrix comprises a plurality of centroid-vectors calculated using a clustering method from a second output of a trained action MLM which embedded a plurality of prior actions expressed in natural language action statements taken as a result of prior natural issue statements,
wherein calculating the inner product results in a plurality of probabilities associated with the plurality of prior actions, and
wherein each of the plurality of probabilities represents a corresponding estimate that a corresponding prior action is relevant to the issue vector;
generating a list of proposed actions relevant to the issue vector by comparing the plurality of probabilities to a threshold value and selecting a subset of the plurality of prior actions with corresponding probabilities above the threshold; and transmitting, to a user device, the list of proposed actions. 9. The method of claim 8, further comprising:
receiving a call from a user via a call service; and performing speech recognition to convert words spoken by the user into the new natural language text. 10. The method of claim 8, further comprising generating the actions matrix by:
clustering individual call summaries of prior calls stored as an actions vector into a plurality of centroid vectors. 11. The method of claim 10, wherein generating the actions matrix further comprises:
storing the plurality of centroid vectors as the actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 12. The method of claim 8, wherein calculating the inner product forms a result comprising the plurality of probabilities associated with the plurality of prior actions, and wherein the method further comprises:
prior to generating the list of proposed actions, applying a sigmoid gate function to the result to form a modified result having modified probabilities, and wherein the modified probabilities are compared to the threshold when generating the list of proposed actions. 13. The method of claim 8, further comprising:
ordering the list of proposed actions from highest probability to lowest probability. 14. The method of claim 12, further comprising:
displaying, on a display device, additional detail regarding an action selected from the list of proposed actions. 15. A system comprising:
a data repository storing:
a new natural language issue statement,
a trained issue machine learning model (MLM),
an issue vector comprising an embedded version of the new natural language issue statement,
an actions matrix comprising a plurality of centroid-vectors calculated using a clustering method from a second output of a trained action MLM applied to a plurality of prior actions taken as a result of prior natural language issue statements;
a plurality of probabilities associated with the plurality of prior actions,
wherein each of the plurality of probabilities represents a corresponding estimate that a corresponding prior action is relevant to the issue vector,
a threshold value,
a subset of the plurality of prior actions having probabilities above the threshold, and
a list of proposed actions relevant to the issue vector;
a machine learning execution engine, wherein the machine learning execution engine is configured to:
embed, by the trained issue MLM, the new natural language issue statement into the issue vector, and
calculate an inner product of the issue vector and the actions matrix to form the plurality of probabilities; and
an action selection engine executable by a processor to:
compare the plurality of probabilities to the threshold value,
select the subset of the plurality of prior actions with corresponding probabilities above the threshold, wherein selecting the subset forms a list of proposed actions, and
transmit the list of proposed actions to a user device. 16. The system of claim 15, wherein the storage device further stores individual call summaries of prior calls stored as an actions vector, and wherein the system further comprises:
an actions matrix generator configured to:
cluster the individual call summaries into a plurality of centroid vectors, and
store the plurality of centroid vectors as the actions matrix, wherein each row of the actions matrix corresponds to one of a plurality of available actions expressed in natural language. 17. The system of claim 15, further comprising:
a speech recognition engine configured to:
receive a call from a user via a call service, and
convert speech of the user into the new natural language issue statement. 18. The system of claim 15, wherein the trained issue MLM comprises a deep learning neural network. 19. The system of claim 15, further comprising:
the user device, wherein the user device is remote from the data repository, the machine learning execution engine, and the action selection engine. 20. The system of claim 19, further comprising:
a display device operably connected to the user device, wherein the display device is configured to display the list of proposed actions; and a user input device operably connected to the user device, wherein the user input device is configured to receive user input comprising a selection of one of the list of proposed actions. | 2,400 |
347,162 | 16,805,657 | 2,422 | A tool is provided for applying fasteners to a workpiece. The tool as a magazine that carries multiple fasteners and is carried by a housing. A driver blade is provided to drive a lead fastener into a workpiece. The driver blade has a driving edge with a profile that includes driving projections, having curved contact surface for contact with curved edges of the fastener, and a relief portion therebetween that is recessed relative to both projections and contact surfaces. Further, the tool includes a lockout assembly for limiting movement of the driver blade and contact trip, thereby limiting activation of the motor. The pusher may include a pusher lockout surface that is designed for movement in an opposite direction to a feed direction by the contact trip as well as configured to slide over a locking art of the contact trip when the fasteners are empty or nearly empty. | 1. A tool comprising:
a housing; a magazine carried by the housing, the magazine configured to hold a plurality of fasteners and configured to present a lead fastener of the plurality of fasteners into a drive channel; a driver blade provided in the housing and configured for movement within the drive channel to drive the lead fastener into a workpiece; a drive system configured to drive the movement of the driver blade; the driver blade having a driving edge configured for contact with the lead fastener, the driving edge comprising:
a pair of driving projections each configured for contact with curved edges of either side of the lead fastener above its legs, each of the driving projections comprising a driving contact surface, at least a portion of each of the driving contact surfaces having a curvature, the driving contact surfaces being configured to contact the curved edges of the lead fastener;
a relief portion provided between the pair of driving projections, the relief portion being recessed relative to both of the driving contact surfaces of the pair of driving projections. 2. The tool according to claim 1, wherein the relief portion is centered in a lateral direction relative to the pair of driving projections of the driver blade. 3. The tool according to claim 2, wherein a center of the relief portion is provided at an axial length of approximately 2.9+/−0.4 mm from a plane positioned across bottom edges of the pair of driving projections. 4. The tool according to claim 1, wherein the driving edge comprises a ratio of non-contact surface length to contact surface length in a range of approximately 1.1 to approximately 1.8. 5. The tool according to claim 1, wherein a radius of curvature of the driving contact surfaces is approximately 2.5 mm to approximately 3.1 mm. 6. The tool according to claim 1, wherein, in a lateral direction of the driver blade when the driver blade is provided in the housing, the curvature of each of the driving contact surfaces has a lower end further away from the relief portion and a higher end closest to the relief portion. 7. The tool according to claim 6, wherein an axial length between the higher end of the curvature to a plane positioned across bottom edges of the pair of driving projections is approximately 1.9+/−0.2 mm. 8. The tool according to claim 6, wherein an axial length between the higher end of the curvature to a plane positioned across a center of the relief portion is approximately 1.0+/−0.2 mm. 9. The tool according to claim 1, wherein each driving projection has a lateral length of approximately 1.0 mm to approximately 1.4 mm. 10. The tool according to claim 1, wherein each driving projection has a bottom edge comprising a radius of curvature of approximately 0.30 mm to approximately 0.70 mm. 11. The tool according to claim 6, wherein a lateral length between the higher end of the curvature to an outer edge of the driving projection is approximately 5.2 mm to approximately 5.6 mm. 12. The tool according to claim 6, wherein transition surfaces are provided on the driving edge of the driver blade between the higher ends of the driving contact surfaces and the relief portion, and wherein the transition surfaces are curved. 13. The tool according to claim 12, wherein each of the transition surfaces comprises a radius of curvature of approximately 0.3 mm to approximately 0.7 mm. 14. A tool comprising:
a housing; a magazine carried by the housing, the magazine configured to hold a plurality of fasteners and configured to present a lead fastener of the plurality of fasteners into a drive channel; a driver blade provided in the housing and configured for movement within the drive channel to drive the lead fastener into a workpiece; a drive system configured to drive the movement of the driver blade; the driver blade having a driving edge configured for contact with the lead fastener, the driving edge comprising:
a pair of driving projections each configured for contact with curved edges of either side of the lead fastener above its legs;
a pair of driving contact surfaces, at least a portion of each of the driving contact surfaces having a curvature, the driving contact surfaces being configured to contact the curved edges of the lead fastener; and
a relief portion provided between the pair of driving projections and in a center of the driving edge, the relief portion being recessed relative to both of the driving contact surfaces and the pair of driving projections. 15. The tool according to claim 14, wherein the pair of driving contact surfaces are provided on the pair of driving projections. 16. The tool according to claim 14, wherein the center of the relief portion is provided at an axial length of approximately 2.9+/−0.4 mm from a plane positioned across bottom edges of the pair of driving projections. 17. The tool according to claim 14, wherein the driving edge comprises a ratio of non-contact surface length to contact surface length in a range of approximately 1.1 to approximately 1.8. 18. The tool according to claim 14, wherein a radius of curvature of the driving contact surfaces is approximately 2.5 mm to approximately 3.1 mm. 19. The tool according to claim 14, wherein, in a lateral direction of the driver blade when the driver blade is provided in the housing, the curvature of each of the driving contact surfaces has a lower end further away from the relief portion and a higher end closest to the relief portion. 20. The tool according to claim 19, wherein an axial length between the higher end of the curvature to a plane positioned across bottom edges of the pair of driving projections is approximately 1.9+/−0.2 mm. | A tool is provided for applying fasteners to a workpiece. The tool as a magazine that carries multiple fasteners and is carried by a housing. A driver blade is provided to drive a lead fastener into a workpiece. The driver blade has a driving edge with a profile that includes driving projections, having curved contact surface for contact with curved edges of the fastener, and a relief portion therebetween that is recessed relative to both projections and contact surfaces. Further, the tool includes a lockout assembly for limiting movement of the driver blade and contact trip, thereby limiting activation of the motor. The pusher may include a pusher lockout surface that is designed for movement in an opposite direction to a feed direction by the contact trip as well as configured to slide over a locking art of the contact trip when the fasteners are empty or nearly empty.1. A tool comprising:
a housing; a magazine carried by the housing, the magazine configured to hold a plurality of fasteners and configured to present a lead fastener of the plurality of fasteners into a drive channel; a driver blade provided in the housing and configured for movement within the drive channel to drive the lead fastener into a workpiece; a drive system configured to drive the movement of the driver blade; the driver blade having a driving edge configured for contact with the lead fastener, the driving edge comprising:
a pair of driving projections each configured for contact with curved edges of either side of the lead fastener above its legs, each of the driving projections comprising a driving contact surface, at least a portion of each of the driving contact surfaces having a curvature, the driving contact surfaces being configured to contact the curved edges of the lead fastener;
a relief portion provided between the pair of driving projections, the relief portion being recessed relative to both of the driving contact surfaces of the pair of driving projections. 2. The tool according to claim 1, wherein the relief portion is centered in a lateral direction relative to the pair of driving projections of the driver blade. 3. The tool according to claim 2, wherein a center of the relief portion is provided at an axial length of approximately 2.9+/−0.4 mm from a plane positioned across bottom edges of the pair of driving projections. 4. The tool according to claim 1, wherein the driving edge comprises a ratio of non-contact surface length to contact surface length in a range of approximately 1.1 to approximately 1.8. 5. The tool according to claim 1, wherein a radius of curvature of the driving contact surfaces is approximately 2.5 mm to approximately 3.1 mm. 6. The tool according to claim 1, wherein, in a lateral direction of the driver blade when the driver blade is provided in the housing, the curvature of each of the driving contact surfaces has a lower end further away from the relief portion and a higher end closest to the relief portion. 7. The tool according to claim 6, wherein an axial length between the higher end of the curvature to a plane positioned across bottom edges of the pair of driving projections is approximately 1.9+/−0.2 mm. 8. The tool according to claim 6, wherein an axial length between the higher end of the curvature to a plane positioned across a center of the relief portion is approximately 1.0+/−0.2 mm. 9. The tool according to claim 1, wherein each driving projection has a lateral length of approximately 1.0 mm to approximately 1.4 mm. 10. The tool according to claim 1, wherein each driving projection has a bottom edge comprising a radius of curvature of approximately 0.30 mm to approximately 0.70 mm. 11. The tool according to claim 6, wherein a lateral length between the higher end of the curvature to an outer edge of the driving projection is approximately 5.2 mm to approximately 5.6 mm. 12. The tool according to claim 6, wherein transition surfaces are provided on the driving edge of the driver blade between the higher ends of the driving contact surfaces and the relief portion, and wherein the transition surfaces are curved. 13. The tool according to claim 12, wherein each of the transition surfaces comprises a radius of curvature of approximately 0.3 mm to approximately 0.7 mm. 14. A tool comprising:
a housing; a magazine carried by the housing, the magazine configured to hold a plurality of fasteners and configured to present a lead fastener of the plurality of fasteners into a drive channel; a driver blade provided in the housing and configured for movement within the drive channel to drive the lead fastener into a workpiece; a drive system configured to drive the movement of the driver blade; the driver blade having a driving edge configured for contact with the lead fastener, the driving edge comprising:
a pair of driving projections each configured for contact with curved edges of either side of the lead fastener above its legs;
a pair of driving contact surfaces, at least a portion of each of the driving contact surfaces having a curvature, the driving contact surfaces being configured to contact the curved edges of the lead fastener; and
a relief portion provided between the pair of driving projections and in a center of the driving edge, the relief portion being recessed relative to both of the driving contact surfaces and the pair of driving projections. 15. The tool according to claim 14, wherein the pair of driving contact surfaces are provided on the pair of driving projections. 16. The tool according to claim 14, wherein the center of the relief portion is provided at an axial length of approximately 2.9+/−0.4 mm from a plane positioned across bottom edges of the pair of driving projections. 17. The tool according to claim 14, wherein the driving edge comprises a ratio of non-contact surface length to contact surface length in a range of approximately 1.1 to approximately 1.8. 18. The tool according to claim 14, wherein a radius of curvature of the driving contact surfaces is approximately 2.5 mm to approximately 3.1 mm. 19. The tool according to claim 14, wherein, in a lateral direction of the driver blade when the driver blade is provided in the housing, the curvature of each of the driving contact surfaces has a lower end further away from the relief portion and a higher end closest to the relief portion. 20. The tool according to claim 19, wherein an axial length between the higher end of the curvature to a plane positioned across bottom edges of the pair of driving projections is approximately 1.9+/−0.2 mm. | 2,400 |
347,163 | 16,805,605 | 2,422 | A noninvasive physiological sensor for measuring one or more physiological parameters of a medical patient can include a bump interposed between a light source and a photodetector. The bump can be placed in contact with body tissue of a patient and thereby reduce a thickness of the body tissue. As a result, an optical pathlength between the light source and the photodetector can be reduced. In addition, the sensor can include a heat sink that can direct heat away from the light source. Moreover, the sensor can include shielding in the optical path between the light source and the photodetector. The shielding can reduce noise received by the photodetector. | 1. An optical medical sensor configured to detect light attenuated by body tissue of a patient, the sensor comprising:
a sensor housing comprising a first shell and a second shell pivotally connected together, the first and second shells each shaped to accept body tissue of a medical patient; an emitter disposed in the first shell, the emitter configured to emit light on the body tissue of the medical patient; a detector disposed in the second shell, the detector configured to receive light attenuated by the body tissue along an optical path; and shielding disposed between the emitter and the detector, the shielding comprising a substantially-transparent, electrically-conductive material in the optical path. 2. The sensor of claim 1, wherein the shielding is configured to reduce noise received by the detector. 3. The sensor of claim 1, further comprising a housing coupled to the shielding. 4. The sensor of claim 3, wherein the housing is further coupled to a submount of the emitter, such that the housing, submount, and shielding provide a substantially airtight seal to protect the emitter from fluids and vapors. 5. The sensor of claim 3, wherein the housing is further coupled to a submount of the detector, such that the housing, submount, and shielding provide a substantially airtight seal to protect the detector from fluids and vapors. 6. The sensor of claim 1, wherein the shielding comprises conductive-coated glass. 7. The sensor of claim 1, wherein the shielding comprises conductive-coated plastic. 8. The sensor of claim 1, wherein the electrically-conductive material comprises indium tin oxide. 9. The sensor of claim 1, wherein the substantially-transparent portion comprises a protrusion. 10. A conductive shield configured to shield noise interference from a light sensitive detector, the shield comprising:
a substantially transparent material; and a conductive material disposed on at least a portion of the substantially transparent material; wherein the conductive shield is configured to be positioned between a light source and a light detector such that at least some light from said light source passes through said conductive shield and impinges on said light detector. 11. The conductive shield of claim 10, wherein the conductive material is configured to be in electrical communication with a ground conductor. 12. The conductive shield of claim 11, wherein the conductive material conducts noise away from said detector toward the ground conductor. 13. The conductive detector shield of claim 10, wherein the substantially transparent material comprises plastic. 14. The conductive detector shield of claim 10, wherein the substantially transparent material comprises glass. 15. The conductive detector shield of claim 10, wherein a surface resistivity of the conductive material ranges from about 30 ohms per square inch to about 500 ohms per square inch. 16. The conductive detector shield of claim 10, wherein the conductive material comprises indium tin oxide. 17. The conductive detector shield of claim 10, wherein the conductive material is a coating on the substantially transparent material, said coating being distributed over the substantially transparent material in a manner selected from the group consisting of: distributed with an even thickness, distributed in varying thicknesses, distributed over the periphery edges of the transparent portion, distributed in a speckled pattern, distributed in a grid, and distributed in lines. 18. A system for shielding one or more photocommunicative devices, comprising:
an emitter configured to emit optical radiation; a detector; and a shielding device disposed between the emitter and the detector, the shielding device comprising a substantially-transparent, electrically-conductive material, the shielding device configured to pass at least a portion of the optical radiation to the detector and to reduce a noise received by the detector. 19. The system of claim 18, wherein the transparent portion comprises a layer of transparent material and a layer of conductive material. 20. The system of claim 19, wherein the layer of transparent material comprises a material selected from the group consisting of plastic and glass. | A noninvasive physiological sensor for measuring one or more physiological parameters of a medical patient can include a bump interposed between a light source and a photodetector. The bump can be placed in contact with body tissue of a patient and thereby reduce a thickness of the body tissue. As a result, an optical pathlength between the light source and the photodetector can be reduced. In addition, the sensor can include a heat sink that can direct heat away from the light source. Moreover, the sensor can include shielding in the optical path between the light source and the photodetector. The shielding can reduce noise received by the photodetector.1. An optical medical sensor configured to detect light attenuated by body tissue of a patient, the sensor comprising:
a sensor housing comprising a first shell and a second shell pivotally connected together, the first and second shells each shaped to accept body tissue of a medical patient; an emitter disposed in the first shell, the emitter configured to emit light on the body tissue of the medical patient; a detector disposed in the second shell, the detector configured to receive light attenuated by the body tissue along an optical path; and shielding disposed between the emitter and the detector, the shielding comprising a substantially-transparent, electrically-conductive material in the optical path. 2. The sensor of claim 1, wherein the shielding is configured to reduce noise received by the detector. 3. The sensor of claim 1, further comprising a housing coupled to the shielding. 4. The sensor of claim 3, wherein the housing is further coupled to a submount of the emitter, such that the housing, submount, and shielding provide a substantially airtight seal to protect the emitter from fluids and vapors. 5. The sensor of claim 3, wherein the housing is further coupled to a submount of the detector, such that the housing, submount, and shielding provide a substantially airtight seal to protect the detector from fluids and vapors. 6. The sensor of claim 1, wherein the shielding comprises conductive-coated glass. 7. The sensor of claim 1, wherein the shielding comprises conductive-coated plastic. 8. The sensor of claim 1, wherein the electrically-conductive material comprises indium tin oxide. 9. The sensor of claim 1, wherein the substantially-transparent portion comprises a protrusion. 10. A conductive shield configured to shield noise interference from a light sensitive detector, the shield comprising:
a substantially transparent material; and a conductive material disposed on at least a portion of the substantially transparent material; wherein the conductive shield is configured to be positioned between a light source and a light detector such that at least some light from said light source passes through said conductive shield and impinges on said light detector. 11. The conductive shield of claim 10, wherein the conductive material is configured to be in electrical communication with a ground conductor. 12. The conductive shield of claim 11, wherein the conductive material conducts noise away from said detector toward the ground conductor. 13. The conductive detector shield of claim 10, wherein the substantially transparent material comprises plastic. 14. The conductive detector shield of claim 10, wherein the substantially transparent material comprises glass. 15. The conductive detector shield of claim 10, wherein a surface resistivity of the conductive material ranges from about 30 ohms per square inch to about 500 ohms per square inch. 16. The conductive detector shield of claim 10, wherein the conductive material comprises indium tin oxide. 17. The conductive detector shield of claim 10, wherein the conductive material is a coating on the substantially transparent material, said coating being distributed over the substantially transparent material in a manner selected from the group consisting of: distributed with an even thickness, distributed in varying thicknesses, distributed over the periphery edges of the transparent portion, distributed in a speckled pattern, distributed in a grid, and distributed in lines. 18. A system for shielding one or more photocommunicative devices, comprising:
an emitter configured to emit optical radiation; a detector; and a shielding device disposed between the emitter and the detector, the shielding device comprising a substantially-transparent, electrically-conductive material, the shielding device configured to pass at least a portion of the optical radiation to the detector and to reduce a noise received by the detector. 19. The system of claim 18, wherein the transparent portion comprises a layer of transparent material and a layer of conductive material. 20. The system of claim 19, wherein the layer of transparent material comprises a material selected from the group consisting of plastic and glass. | 2,400 |
347,164 | 16,805,636 | 2,422 | Methods, systems, and devices for wireless communications are described. In some systems, a first device may transmit a signal to a second device including a number of error detection bits interleaved with a number of information bits. The second device may use the error detection bits to determine if the signal was received correctly, where each error detection bit may be associated with a set of information bits. The second device may progressively decode the signal and continuously perform an error detection calculation based on a first set of information bits associated with a first error detection bit. Based on the error detection calculation, the second device may calculate an expected error detection bit corresponding to the first error detection bit. The second device may compare the first error detection bit to the expected error detection bit. Other aspects and features are also claimed and described. | 1. A method for wireless communication, comprising:
receiving, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; decoding, using a polar code, one or more information values of the plurality of information values received in the signal; determining one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; determining a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; decoding, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; determining that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and terminating a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 2. The method of claim 1, further comprising:
determining one or more index values associated with the one or more information values based at least in part on receiving the signal, each index value of the one or more index values associated with a different information value of the one or more information values, wherein determining the one or more coefficients is based at least in part on determining the one or more index values. 3. The method of claim 2, wherein determining the one or more coefficients further comprises:
retrieving the one or more coefficients from a memory based at least in part on the determined one or more index values. 4. The method of claim 2, wherein determining the one or more coefficients further comprises:
determining, for a first information value of the one or more information values, a second index value and a third index value based at least in part on a first index value associated with the first information value; and retrieving a value from a memory based at least in part on the second index value, wherein a coefficient for the first information value is determined based at least in part on the value retrieved from the memory and the third index value. 5. The method of claim 4, further comprising:
applying a division operation using a second value to the first index value to generate the second index value, wherein determining the second index value is based at least in part on applying the division operation; and applying a modulo operation using the second value to the first index value to generate the third index value, wherein determining the third index value is based at least in part on applying the modulo operation. 6. The method of claim 4, wherein the memory stores a down-sampled set of coefficients associated with the plurality of information values. 7. (canceled) 8. The method of claim 1, further comprising:
deinterleaving the second error detection value from the plurality of information values of the signal based at least in part on decoding the signal using the polar code. 9. The method of claim 1, wherein the method is performed at a user equipment, the method further comprising:
entering a lower power mode of the user equipment based at least in part on terminating the decoding of the remaining portions of the signal. 10. The method of claim 9, wherein the lower power mode is a micro-sleep mode of the user equipment. 11. The method of claim 1, further comprising:
applying an identifier mask to the first error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on applying the identifier mask to the first error detection value. 12. The method of claim 1, further comprising:
applying a plurality of identifier masks to the first error detection value to generate a plurality of candidate values, respectively; and comparing each value of the plurality of candidate values to the second error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on comparing each value of the plurality of candidate values to the second error detection value. 13. The method of claim 1, further comprising:
accumulating the one or more information values and the one or more coefficients, wherein determining the first error detection value is based at least in part on accumulating the plurality of information values and the one or more coefficients. 14. The method of claim 1, further comprising:
identifying a set of information values of the signal associated with the second error detection value based at least in part on receiving the signal, wherein the set of information values comprises the one or more information values; and determining a set of coefficients, each coefficient of the set of coefficients associated with a second information value of the set of information values based at least in part on identifying the set of information values, wherein determining the first error detection value is based at least in part on the set of coefficients and the set of information values. 15. The method of claim 1, further comprising:
comparing the first error detection value with the second error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on comparing the first error detection value with the second error detection value. 16. The method of claim 1, wherein an error detection value comprises an error detection bit and the information value comprises an information bit. 17. The method of claim 1, wherein the first error detection value is determined using the one or more coefficients and the one or more information values. 18. The method of claim 1, wherein the plurality of error detection values is interleaved with the plurality of information values. 19. An apparatus for wireless communication, comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values;
decode, using a polar code, one or more information values of the plurality of information values received in the signal;
determine one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values;
determine a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value;
decode, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal;
determine that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and
terminate a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 20. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
determine one or more index values associated with the one or more information values based at least in part on receiving the signal, each index value of the one or more index values associated with a different information value of the one or more information values, wherein determining the one or more coefficients is based at least in part on determining the one or more index values. 21. The apparatus of claim 20, wherein the instructions to determine the one or more coefficients are further executable by the processor to cause the apparatus to:
retrieve the one or more coefficients from the memory based at least in part on the determined one or more index values. 22. The apparatus of claim 20, wherein the instructions to determine the one or more coefficients are further executable by the processor to cause the apparatus to:
determine, for a first information value of the one or more information values, a second index value and a third index value based at least in part on a first index value associated with the first information value; and retrieve a value from the memory based at least in part on the second index value, wherein a coefficient for the first information value is determined based at least in part on the value retrieved from the memory and the third index value. 23. The apparatus of claim 22, wherein the instructions are further executable by the processor to cause the apparatus to:
apply a division operation using a second value to the first index value to generate the second index value, wherein determining the second index value is based at least in part on applying the division operation; and apply a modulo operation using the second value to the first index value to generate the third index value, wherein determining the third index value is based at least in part on applying the modulo operation. 24. The apparatus of claim 22, wherein the memory stores a down-sampled set of coefficients associated with the plurality of information values. 25. (canceled) 26. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
deinterleave the second error detection value from the plurality of information values of the signal based at least in part on decoding the signal using the polar code. 27. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
enter a lower power mode based at least in part on terminating the decoding of the remaining portions of the signal. 28. The apparatus of claim 27, wherein the lower power mode is a micro-sleep mode of a user equipment. 29. An apparatus for wireless communication, comprising:
means for receiving, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; means for decoding, using a polar code, one or more information values of the plurality of information values received in the signal; means for determining one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; means for determining a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; means for decoding, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; means for determining that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and means for terminating a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 30. A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to:
receive, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; decode, using a polar code, one or more information values of the plurality of information values received in the signal; determine one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; determine a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; decode, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; determine that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and terminate a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. | Methods, systems, and devices for wireless communications are described. In some systems, a first device may transmit a signal to a second device including a number of error detection bits interleaved with a number of information bits. The second device may use the error detection bits to determine if the signal was received correctly, where each error detection bit may be associated with a set of information bits. The second device may progressively decode the signal and continuously perform an error detection calculation based on a first set of information bits associated with a first error detection bit. Based on the error detection calculation, the second device may calculate an expected error detection bit corresponding to the first error detection bit. The second device may compare the first error detection bit to the expected error detection bit. Other aspects and features are also claimed and described.1. A method for wireless communication, comprising:
receiving, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; decoding, using a polar code, one or more information values of the plurality of information values received in the signal; determining one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; determining a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; decoding, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; determining that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and terminating a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 2. The method of claim 1, further comprising:
determining one or more index values associated with the one or more information values based at least in part on receiving the signal, each index value of the one or more index values associated with a different information value of the one or more information values, wherein determining the one or more coefficients is based at least in part on determining the one or more index values. 3. The method of claim 2, wherein determining the one or more coefficients further comprises:
retrieving the one or more coefficients from a memory based at least in part on the determined one or more index values. 4. The method of claim 2, wherein determining the one or more coefficients further comprises:
determining, for a first information value of the one or more information values, a second index value and a third index value based at least in part on a first index value associated with the first information value; and retrieving a value from a memory based at least in part on the second index value, wherein a coefficient for the first information value is determined based at least in part on the value retrieved from the memory and the third index value. 5. The method of claim 4, further comprising:
applying a division operation using a second value to the first index value to generate the second index value, wherein determining the second index value is based at least in part on applying the division operation; and applying a modulo operation using the second value to the first index value to generate the third index value, wherein determining the third index value is based at least in part on applying the modulo operation. 6. The method of claim 4, wherein the memory stores a down-sampled set of coefficients associated with the plurality of information values. 7. (canceled) 8. The method of claim 1, further comprising:
deinterleaving the second error detection value from the plurality of information values of the signal based at least in part on decoding the signal using the polar code. 9. The method of claim 1, wherein the method is performed at a user equipment, the method further comprising:
entering a lower power mode of the user equipment based at least in part on terminating the decoding of the remaining portions of the signal. 10. The method of claim 9, wherein the lower power mode is a micro-sleep mode of the user equipment. 11. The method of claim 1, further comprising:
applying an identifier mask to the first error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on applying the identifier mask to the first error detection value. 12. The method of claim 1, further comprising:
applying a plurality of identifier masks to the first error detection value to generate a plurality of candidate values, respectively; and comparing each value of the plurality of candidate values to the second error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on comparing each value of the plurality of candidate values to the second error detection value. 13. The method of claim 1, further comprising:
accumulating the one or more information values and the one or more coefficients, wherein determining the first error detection value is based at least in part on accumulating the plurality of information values and the one or more coefficients. 14. The method of claim 1, further comprising:
identifying a set of information values of the signal associated with the second error detection value based at least in part on receiving the signal, wherein the set of information values comprises the one or more information values; and determining a set of coefficients, each coefficient of the set of coefficients associated with a second information value of the set of information values based at least in part on identifying the set of information values, wherein determining the first error detection value is based at least in part on the set of coefficients and the set of information values. 15. The method of claim 1, further comprising:
comparing the first error detection value with the second error detection value, wherein determining that the first error detection value is different than the second error detection value is based at least in part on comparing the first error detection value with the second error detection value. 16. The method of claim 1, wherein an error detection value comprises an error detection bit and the information value comprises an information bit. 17. The method of claim 1, wherein the first error detection value is determined using the one or more coefficients and the one or more information values. 18. The method of claim 1, wherein the plurality of error detection values is interleaved with the plurality of information values. 19. An apparatus for wireless communication, comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values;
decode, using a polar code, one or more information values of the plurality of information values received in the signal;
determine one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values;
determine a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value;
decode, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal;
determine that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and
terminate a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 20. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
determine one or more index values associated with the one or more information values based at least in part on receiving the signal, each index value of the one or more index values associated with a different information value of the one or more information values, wherein determining the one or more coefficients is based at least in part on determining the one or more index values. 21. The apparatus of claim 20, wherein the instructions to determine the one or more coefficients are further executable by the processor to cause the apparatus to:
retrieve the one or more coefficients from the memory based at least in part on the determined one or more index values. 22. The apparatus of claim 20, wherein the instructions to determine the one or more coefficients are further executable by the processor to cause the apparatus to:
determine, for a first information value of the one or more information values, a second index value and a third index value based at least in part on a first index value associated with the first information value; and retrieve a value from the memory based at least in part on the second index value, wherein a coefficient for the first information value is determined based at least in part on the value retrieved from the memory and the third index value. 23. The apparatus of claim 22, wherein the instructions are further executable by the processor to cause the apparatus to:
apply a division operation using a second value to the first index value to generate the second index value, wherein determining the second index value is based at least in part on applying the division operation; and apply a modulo operation using the second value to the first index value to generate the third index value, wherein determining the third index value is based at least in part on applying the modulo operation. 24. The apparatus of claim 22, wherein the memory stores a down-sampled set of coefficients associated with the plurality of information values. 25. (canceled) 26. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
deinterleave the second error detection value from the plurality of information values of the signal based at least in part on decoding the signal using the polar code. 27. The apparatus of claim 19, wherein the instructions are further executable by the processor to cause the apparatus to:
enter a lower power mode based at least in part on terminating the decoding of the remaining portions of the signal. 28. The apparatus of claim 27, wherein the lower power mode is a micro-sleep mode of a user equipment. 29. An apparatus for wireless communication, comprising:
means for receiving, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; means for decoding, using a polar code, one or more information values of the plurality of information values received in the signal; means for determining one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; means for determining a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; means for decoding, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; means for determining that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and means for terminating a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. 30. A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to:
receive, at a decoder, a signal that comprises a plurality of error detection values and a plurality of information values; decode, using a polar code, one or more information values of the plurality of information values received in the signal; determine one or more coefficients associated with an expected error detection value as part of an error check for the one or more information values, wherein each coefficient of the one or more coefficients is associated with an information value of the one or more information values; determine a first error detection value based at least in part on the one or more coefficients associated with the one or more information values, wherein the first error detection value comprises the expected error detection value; decode, using the polar code, a second error detection value of the plurality of error detection values received in the signal, the second error detection value associated with the error check for the one or more information values received in the signal; determine that the second error detection value received in the signal and associated with the error check for the one or more information values is different than the first error detection value; and terminate a decoding of remaining portions of the signal at the decoder that uses the polar code based at least in part on the first error detection value and the second error detection value. | 2,400 |
347,165 | 16,805,643 | 2,422 | Systems and methods provide for efficiently and accurately determining a simplified path that conforms to the geometry of an original path by simultaneously minimizing the deviation from the original path and reducing the number of anchor points in the simplified path. A simplified path may be iteratively generated by updating parametric values and anchor points for candidate simplified paths at epochs. A deviation in distance between points on the original path and corresponding points on candidate paths may be iteratively decreased to ensure that the resulting simplified path follows the geometry of the original path to a predetermined threshold. Continuity constrains can also be applied to ensure smoothness of the simplified path. | 1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:
obtaining an original path comprising initial segments and their corresponding initial anchor points; determining a simplified path corresponding with the original path and having a set of anchor points that is less than the initial anchor points of the original path, wherein determining the simplified path comprises iteratively:
determining a candidate simplified path using parametric values and anchor points associated with a previous candidate simplified path of a previous iteration; and
at each iteration, identifying a deviation between the candidate simplified path and the original path; and
based on a particular deviation of a particular iteration being below a deviation threshold, providing the corresponding candidate simplified path as the simplified path. 2. The computer storage media of claim 1, wherein the parametric values correspond to end points of subdivided segments of the candidate simplified path. 3. The computer storage media of claim 1, the operation further comprising:
dividing the original path into subdivided segments, each subdivided segment represented by a pair of original end points; determining an initial simplified path with initial subdivided segments corresponding to initial end points, the initial end points having a corresponding one-to-one correspondence with the original end points; determining an initial parametric value for each of the initial end points; and for a first iteration, determining anchor points for the candidate simplified path based on the initial parametric values and the initial end points. 4. The computer storage media of claim 3, wherein dividing the original path into the subdivided segments is based at least in part on a length and curvature of the original path. 5. The computer storage media of claim 3, wherein the initial parametric values are determined using an arc length parameterization algorithm. 6. The computer storage media of claim 1, wherein the deviation threshold is a predetermined threshold value determined based at least in part on a user provided accuracy value. 7. The computer storage media of claim 1, wherein the deviation is a Euclidian distance between the candidate simplified path and the original path. 8. The computer storage media of claim 1, the operations further comprising further comprising determining, at each iteration, the deviation between the candidate simplified path and the original path based at least in path on a Euclidian distance between at least one end point on the original path and a corresponding candidate end point on the candidate simplified path. 9. The computer storage media of claim 1, the operations further comprising updating the parametric values at each iteration based at least in part on gradient descent. 10. The computer storage media of claim 9, wherein the gradient descent includes a velocity that is modulated based on a linesearch algorithm. 11. The computer storage media of claim 1, the operations further comprising updating the anchor points at each iteration based at least in part on a least square method. 12. The computer storage media of claim 1, further comprising:
applying a continuity constraint to the candidate simplified path, the continuity constraint ensuring continuity between two adjacent anchor points; and causing for display the candidate simplified path associated with the particular iteration. 13. The computer storage media of claim 1, further comprising causing for display the candidate simplified path associated with the particular iteration by appending the candidate simplified path and corresponding anchor points to the original path. 14. A method comprising:
accessing an original path representative of an original geometry to be simplified, the original path comprising initial anchor points and initial segments connecting the anchor points; simplifying the original path by decreasing a number of initial anchor points connecting initial segments by:
generating an initial simplified path comprising a selection of initial parametric values and initial candidate anchor points, wherein a number of the initial candidate anchor points is less than a number of the initial anchor points;
based on a deviation of the initial simplified path from the original path being above a predetermined threshold, iteratively generating candidate simplified paths, each candidate simplified path generated in response to a deviation value of a current candidate simplified path being over the predetermined threshold, by updating candidate parametric values and candidate anchor points defining the candidate simplified path at each iteration, the deviation value representing a deviation between the current candidate simplified path and the original path; and
in response to the deviation value at a current iteration being below the predetermined threshold, causing presentation of a representation of the candidate simplified path associated with the current iteration as a simplified path corresponding to the original path. 15. The method of claim 14, further comprising:
dividing the original path into subdivided segments, each subdivided segment represented by a pair of end points, the initial parametric values associated with candidate end points on the initial simplified path corresponding to the end points of the original path; at each iteration, determining the deviation value by calculating, for each end point on the original path, a distance between the end point and corresponding candidate end point on the candidate simplified path, the deviation value being the sum of the distances. 16. The method of claim 14, further comprising:
at each iteration, in response to the deviation value being above an error threshold, determining an end point on the original path where a distance between the end point and a corresponding candidate end point on the candidate simplified path is above a predetermined fraction of the deviation value; and determining two resulting paths of the original path based on the end point, the two resulting paths being a first portion and a second portion of the original path separated at the end point. 17. The method of claim 16, further comprising:
iteratively generating candidate simplified paths over iterations for each of the two resulting paths; and for each of the two resulting paths, in response to the deviation value at a particular iteration being less than the predetermined threshold, causing presentation of a representation of the candidate simplified path associated with the particular iteration as a simplified path corresponding to the original path, wherein the candidate simplified paths for the two resulting paths are caused to be presented with a last end point of a first candidate simplified path joined with a beginning end point of a second candidate simplified path. 18. The method of claim 17, further comprising applying a linearized continuity constraint to the last end point and the beginning end point prior to causing presentation of the candidate simplified paths. 19. The method of claim 14, wherein updating candidate parametric values and candidate anchor points defining the candidate simplified path at each iteration comprises performing a least square solve on the candidate anchor points associated with a previous candidate simplified path and computing updated candidate parametric values based on the least square solve and a gradient descent. 20. A computing system comprising:
one or more hardware processors and memory configured to provide computer program instructions to the one or more hardware processors; a learning engine configured to use the one or more hardware processors to:
access an original path comprising initial segments associated with corresponding initial anchor points representing an input geometry;
divide the original path into a set of subdivided segments associated with corresponding set of end points based at least in part on one of a length of the original path, a curvature of the original path, and a predetermined deviation threshold;
generate an initial simplified path comprising a selection of initial parametric values for the set of end points and initial candidate anchor points, wherein a number of initial candidate anchor points is less than a number of initial anchor points in the original path;
in response to a deviation value between the original path and the initial simplified path being over the predetermined deviation threshold, determine two paths of the original path based on an end point of the set of end points where a distance between the end point and a corresponding point on the initial simplified path is more than a predetermined fraction of the deviation value; and
for each path of the two paths, determine a simplified path with a deviation from the respective paths being less than the predetermined deviation threshold. | Systems and methods provide for efficiently and accurately determining a simplified path that conforms to the geometry of an original path by simultaneously minimizing the deviation from the original path and reducing the number of anchor points in the simplified path. A simplified path may be iteratively generated by updating parametric values and anchor points for candidate simplified paths at epochs. A deviation in distance between points on the original path and corresponding points on candidate paths may be iteratively decreased to ensure that the resulting simplified path follows the geometry of the original path to a predetermined threshold. Continuity constrains can also be applied to ensure smoothness of the simplified path.1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:
obtaining an original path comprising initial segments and their corresponding initial anchor points; determining a simplified path corresponding with the original path and having a set of anchor points that is less than the initial anchor points of the original path, wherein determining the simplified path comprises iteratively:
determining a candidate simplified path using parametric values and anchor points associated with a previous candidate simplified path of a previous iteration; and
at each iteration, identifying a deviation between the candidate simplified path and the original path; and
based on a particular deviation of a particular iteration being below a deviation threshold, providing the corresponding candidate simplified path as the simplified path. 2. The computer storage media of claim 1, wherein the parametric values correspond to end points of subdivided segments of the candidate simplified path. 3. The computer storage media of claim 1, the operation further comprising:
dividing the original path into subdivided segments, each subdivided segment represented by a pair of original end points; determining an initial simplified path with initial subdivided segments corresponding to initial end points, the initial end points having a corresponding one-to-one correspondence with the original end points; determining an initial parametric value for each of the initial end points; and for a first iteration, determining anchor points for the candidate simplified path based on the initial parametric values and the initial end points. 4. The computer storage media of claim 3, wherein dividing the original path into the subdivided segments is based at least in part on a length and curvature of the original path. 5. The computer storage media of claim 3, wherein the initial parametric values are determined using an arc length parameterization algorithm. 6. The computer storage media of claim 1, wherein the deviation threshold is a predetermined threshold value determined based at least in part on a user provided accuracy value. 7. The computer storage media of claim 1, wherein the deviation is a Euclidian distance between the candidate simplified path and the original path. 8. The computer storage media of claim 1, the operations further comprising further comprising determining, at each iteration, the deviation between the candidate simplified path and the original path based at least in path on a Euclidian distance between at least one end point on the original path and a corresponding candidate end point on the candidate simplified path. 9. The computer storage media of claim 1, the operations further comprising updating the parametric values at each iteration based at least in part on gradient descent. 10. The computer storage media of claim 9, wherein the gradient descent includes a velocity that is modulated based on a linesearch algorithm. 11. The computer storage media of claim 1, the operations further comprising updating the anchor points at each iteration based at least in part on a least square method. 12. The computer storage media of claim 1, further comprising:
applying a continuity constraint to the candidate simplified path, the continuity constraint ensuring continuity between two adjacent anchor points; and causing for display the candidate simplified path associated with the particular iteration. 13. The computer storage media of claim 1, further comprising causing for display the candidate simplified path associated with the particular iteration by appending the candidate simplified path and corresponding anchor points to the original path. 14. A method comprising:
accessing an original path representative of an original geometry to be simplified, the original path comprising initial anchor points and initial segments connecting the anchor points; simplifying the original path by decreasing a number of initial anchor points connecting initial segments by:
generating an initial simplified path comprising a selection of initial parametric values and initial candidate anchor points, wherein a number of the initial candidate anchor points is less than a number of the initial anchor points;
based on a deviation of the initial simplified path from the original path being above a predetermined threshold, iteratively generating candidate simplified paths, each candidate simplified path generated in response to a deviation value of a current candidate simplified path being over the predetermined threshold, by updating candidate parametric values and candidate anchor points defining the candidate simplified path at each iteration, the deviation value representing a deviation between the current candidate simplified path and the original path; and
in response to the deviation value at a current iteration being below the predetermined threshold, causing presentation of a representation of the candidate simplified path associated with the current iteration as a simplified path corresponding to the original path. 15. The method of claim 14, further comprising:
dividing the original path into subdivided segments, each subdivided segment represented by a pair of end points, the initial parametric values associated with candidate end points on the initial simplified path corresponding to the end points of the original path; at each iteration, determining the deviation value by calculating, for each end point on the original path, a distance between the end point and corresponding candidate end point on the candidate simplified path, the deviation value being the sum of the distances. 16. The method of claim 14, further comprising:
at each iteration, in response to the deviation value being above an error threshold, determining an end point on the original path where a distance between the end point and a corresponding candidate end point on the candidate simplified path is above a predetermined fraction of the deviation value; and determining two resulting paths of the original path based on the end point, the two resulting paths being a first portion and a second portion of the original path separated at the end point. 17. The method of claim 16, further comprising:
iteratively generating candidate simplified paths over iterations for each of the two resulting paths; and for each of the two resulting paths, in response to the deviation value at a particular iteration being less than the predetermined threshold, causing presentation of a representation of the candidate simplified path associated with the particular iteration as a simplified path corresponding to the original path, wherein the candidate simplified paths for the two resulting paths are caused to be presented with a last end point of a first candidate simplified path joined with a beginning end point of a second candidate simplified path. 18. The method of claim 17, further comprising applying a linearized continuity constraint to the last end point and the beginning end point prior to causing presentation of the candidate simplified paths. 19. The method of claim 14, wherein updating candidate parametric values and candidate anchor points defining the candidate simplified path at each iteration comprises performing a least square solve on the candidate anchor points associated with a previous candidate simplified path and computing updated candidate parametric values based on the least square solve and a gradient descent. 20. A computing system comprising:
one or more hardware processors and memory configured to provide computer program instructions to the one or more hardware processors; a learning engine configured to use the one or more hardware processors to:
access an original path comprising initial segments associated with corresponding initial anchor points representing an input geometry;
divide the original path into a set of subdivided segments associated with corresponding set of end points based at least in part on one of a length of the original path, a curvature of the original path, and a predetermined deviation threshold;
generate an initial simplified path comprising a selection of initial parametric values for the set of end points and initial candidate anchor points, wherein a number of initial candidate anchor points is less than a number of initial anchor points in the original path;
in response to a deviation value between the original path and the initial simplified path being over the predetermined deviation threshold, determine two paths of the original path based on an end point of the set of end points where a distance between the end point and a corresponding point on the initial simplified path is more than a predetermined fraction of the deviation value; and
for each path of the two paths, determine a simplified path with a deviation from the respective paths being less than the predetermined deviation threshold. | 2,400 |
347,166 | 16,805,651 | 2,674 | An approach is provided for configuring printing devices. A configuration manager maintains configuration data for a printing device and provides the configuration data to a configuration agent executing on the printing device. The configuration agent applies the settings specified by the configuration data to the printing device and generates configuration identification data that uniquely identifies the settings. The configuration agent uses the configuration identification data to determine whether the current configuration of the printing device has changed. If so, then the configuration agent acquires and applies configuration data from the configuration manager. | 1. A printing device comprising:
one or more processors; one or more memories; a print process executing on the printing device for printing print jobs at the printing device; and a configuration agent executing on the printing device and configured to:
receive, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
apply the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generate configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
store the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 2. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to, upon satisfaction of one or more criteria:
retrieve a current plurality of settings being used by the printing device, generate, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, compare the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 3. The printing device as recited in claim 2, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 4. The printing device as recited in claim 2, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 5. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to:
determine whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 6. The printing device as recited in claim 1, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. 7. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to generate and transmit to the configuration manager a request for the configuration data, wherein the request includes printing device identification data that uniquely identifies the printing device. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors cause:
a configuration agent executing on a printing device to:
receive, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
apply the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generate configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
store the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to, upon satisfaction of one or more criteria:
retrieve a current plurality of settings being used by the printing device, generate, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, compare the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 10. The one or more non-transitory computer-readable media as recited in claim 9, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 11. The one or more non-transitory computer-readable media as recited in claim 9, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 12. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to:
determine whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 13. The one or more non-transitory computer-readable media as recited in claim 8, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to generate and transmit to the configuration manager a request for the configuration data, wherein the request includes printing device identification data that uniquely identifies the printing device. 15. A computer-implemented method comprising:
a configuration agent executing on a printing device:
receiving, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
applying the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generating configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
storing the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 16. The computer-implemented method as recited in claim 15, further comprising the configuration agent executing on the printing device, upon satisfaction of one or more criteria:
retrieving a current plurality of settings being used by the printing device, generating, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, comparing the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generating and transmitting a request for configuration data to the configuration manager. 17. The computer-implemented method as recited in claim 16, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 18. The computer-implemented method as recited in claim 16, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 19. The computer-implemented method as recited in claim 15, further comprising the configuration agent executing on the printing device:
determining whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generating and transmitting a request for configuration data to the configuration manager. 20. The computer-implemented method as recited in claim 15, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. | An approach is provided for configuring printing devices. A configuration manager maintains configuration data for a printing device and provides the configuration data to a configuration agent executing on the printing device. The configuration agent applies the settings specified by the configuration data to the printing device and generates configuration identification data that uniquely identifies the settings. The configuration agent uses the configuration identification data to determine whether the current configuration of the printing device has changed. If so, then the configuration agent acquires and applies configuration data from the configuration manager.1. A printing device comprising:
one or more processors; one or more memories; a print process executing on the printing device for printing print jobs at the printing device; and a configuration agent executing on the printing device and configured to:
receive, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
apply the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generate configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
store the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 2. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to, upon satisfaction of one or more criteria:
retrieve a current plurality of settings being used by the printing device, generate, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, compare the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 3. The printing device as recited in claim 2, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 4. The printing device as recited in claim 2, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 5. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to:
determine whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 6. The printing device as recited in claim 1, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. 7. The printing device as recited in claim 1, wherein the configuration agent executing on the printing device is further configured to generate and transmit to the configuration manager a request for the configuration data, wherein the request includes printing device identification data that uniquely identifies the printing device. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors cause:
a configuration agent executing on a printing device to:
receive, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
apply the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generate configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
store the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to, upon satisfaction of one or more criteria:
retrieve a current plurality of settings being used by the printing device, generate, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, compare the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 10. The one or more non-transitory computer-readable media as recited in claim 9, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 11. The one or more non-transitory computer-readable media as recited in claim 9, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 12. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to:
determine whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generate and transmit a request for configuration data to the configuration manager. 13. The one or more non-transitory computer-readable media as recited in claim 8, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration agent executing on the printing device to generate and transmit to the configuration manager a request for the configuration data, wherein the request includes printing device identification data that uniquely identifies the printing device. 15. A computer-implemented method comprising:
a configuration agent executing on a printing device:
receiving, from a configuration manager via one or more computer networks, configuration data for the printing device, wherein the configuration data specifies a plurality of settings for the printing device,
applying the plurality of settings from the configuration data to the printing device so that the printing device operates in accordance with the plurality of settings,
generating configuration identification data that uniquely corresponds to the plurality of settings specified by the configuration data, and
storing the configuration identification data that uniquely identifies the plurality of settings specified by the configuration data in the one or more memories of the printing device. 16. The computer-implemented method as recited in claim 15, further comprising the configuration agent executing on the printing device, upon satisfaction of one or more criteria:
retrieving a current plurality of settings being used by the printing device, generating, based upon the current plurality of settings being used by the printing device, current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device, comparing the current configuration identification data to the stored configuration identification data, in response to the current configuration identification data being different than the stored configuration identification data, generating and transmitting a request for configuration data to the configuration manager. 17. The computer-implemented method as recited in claim 16, wherein the one or more criteria include one or more of a startup of the configuration agent, an expiration of a specified amount of time, or a current time equalizing a specified time. 18. The computer-implemented method as recited in claim 16, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data or hash results data generated based upon the current plurality of settings. 19. The computer-implemented method as recited in claim 15, further comprising the configuration agent executing on the printing device:
determining whether the one or more memories comprise stored configuration identification data, and in response to determining that the one or more memories do not comprise stored configuration identification data, generating and transmitting a request for configuration data to the configuration manager. 20. The computer-implemented method as recited in claim 15, wherein:
the plurality of settings specified by the configuration data for the printing device includes a plurality of security settings, and applying the plurality of settings from the configuration data to the printing device includes applying the plurality of security settings to the printing device so that the printing device operates in accordance with the plurality of security settings. | 2,600 |
347,167 | 16,805,573 | 2,674 | The present disclosure provides systems, devices, and methods for determining prediction weight for merge mode. One exemplary method comprises: determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. The weight of a current coding unit can be determined through explicitly signaling a weight index in the bitstream, or through implicit derivation at the decoder side. | 1. A method for processing video data, the method comprising:
determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. 2. The method according to claim 1, wherein the weight is determined based on a weight index signaled in a bitstream. 3. The method according to claim 1, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
in response to a plurality of control points associated with the constructed affine merge candidate having one or more weights, determining the weight for the constructed affine merge candidate based on a weight associated with a top left control point or a weight associated with a top right control point. 4. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
in response to a plurality of control points associated with the constructed affine merge candidate having a same weight, determining the weight of the plurality of control points as a weight of the constructed affine merge candidate; or in response to the plurality of control points having different weights, determining a default value as the weight of the constructed affine merge candidate. 5. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining, among weights of a plurality of control points corresponding to the constructed affine merge candidate, a weight used by most of the plurality of control points; and setting the determined weight as the weight of the constructed affine merge candidate. 6. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining differences between an equal weight and weights of the plurality of control points, respectively; determining, among the plurality of control points, a first control point with a weight having a smallest difference from the equal weight; and setting the weight of the first control point as the weight of the constructed affine merge candidate. 7. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining an average weight for a plurality of control points corresponding to the constructed affine merge candidate; and setting the average weight as the weight of the constructed affine merge candidate. 8. The method according to claim 1, wherein the bi-predicting the coding unit based on the determined weight comprises processing the video data using an affine merge mode, and the method further comprises:
inserting, when constructing an affine merge candidate list, a zero motion vector with equal weight into the affine merge candidate list before inserting a zero motion vector with unequal weight. 9. The method according to claim 1, wherein the bi-predicting the coding unit based on the determined weight comprises processing the video data using an affine merge mode, and the method further comprises:
determining, when constructing an affine merge candidate list, an order of a plurality of constructed affine merge candidates based on weights of control points corresponding to each of the plurality of constructed affine merge candidates, wherein
a constructed affine merge candidate having control points with less diverse weights is assigned a higher priority than a constructed affine merge candidate having control points with more diverse weights. 10. The method of claim 9, wherein the determining the order of the plurality of constructed affine merge candidates comprises:
in response to weights of control points corresponding to each of two constructed merge candidates having a same level of diversity, using a default order for the two constructed merge candidates. 11. The method of claim 9, further comprising:
determining an availability of a first constructed affine merge candidate based on weights of control points corresponding to the first constructed affine merge candidate; and in response to a determination that the first constructed affine merge candidate is available, adding the first constructed affine merge candidate to the affine merge candidate list. 12. The method of claim 11, wherein the determining the availability of the first constructed affine merge candidate comprises:
determining whether weights of two control points corresponding to the first constructed affine merge candidate have different signs; and in response to a determination that the weights of the two control points corresponding to the first constructed affine merge candidate have different signs, determining that the first constructed affine merge candidate is not available. 13. A method for processing video data, the method comprising:
determining a weight of a first sub-block within a coding unit, based on weights of control points of the coding unit; bi-predicting the first sub-block based on the determined weight. 14. The method according to claim 13, wherein the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising one of the control points, using a weight of the one of the control points as the weight of the first sub-block, or in response to the first sub-block not comprising the control points, determining the weight of the first sub-block according to a pre-defined rule. 15. The method according to claim 13, wherein:
the coding unit is partitioned into four sub-blocks and has two control points; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising one of the two control points, using a weight of the one of the two control points as the weight of the first sub-block, or
in response to the first sub-block not comprising the two control points, setting the weight of the first sub-block to be one of:
a weight of one of the two control points with a shorter distance to the first sub-block, or
a default value. 16. The method according to claim 13, wherein:
the coding unit is partitioned into two sub-blocks and has three control points; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block including only one of the three control points, using a weight of the one of the control points as the weight of the first sub-block, or
in response to the first sub-block comprising at least two of the three control points, using a default value or a weight of one of the two control points as the weight of the first sub-block. 17. The method according to claim 13, wherein:
the coding unit is partitioned into four sub-blocks and has three control points, the three control points having a first, a second, and a third weight, respectively; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising at least one of the three control points, using a weight of the one of the control points as the weight of the first sub-block, or
in response to the sub-block not comprising the three control points, setting the weight of the first sub-block to be one of:
an average value of the first, second, and third weights,
a middle value of the first, second, and third weights,
an equal weight of the coding unit,
one of the first, second, and third weights which has a smallest difference from the equal weight,
one of the first and second weights which has a smaller difference from the equal weight, or
a default value. 18. A video processing apparatus, comprising:
a memory storing instructions; and a processor configured to execute the instructions to cause the device to:
determine a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and
bi-predict the coding unit based on the determined weight. 19. A video processing apparatus, comprising:
a memory storing instructions; and a processor configured to execute the instructions to cause the device to:
determine a weight of a first sub-block within a coding unit, based on weights of control points of the coding unit;
bi-predict the first sub-block based on the determined weight. 20. A non-transitory computer-readable medium storing a set of instructions that is executable by one or more processors of a video processing device to cause the device to perform a method comprising:
determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. | The present disclosure provides systems, devices, and methods for determining prediction weight for merge mode. One exemplary method comprises: determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. The weight of a current coding unit can be determined through explicitly signaling a weight index in the bitstream, or through implicit derivation at the decoder side.1. A method for processing video data, the method comprising:
determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. 2. The method according to claim 1, wherein the weight is determined based on a weight index signaled in a bitstream. 3. The method according to claim 1, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
in response to a plurality of control points associated with the constructed affine merge candidate having one or more weights, determining the weight for the constructed affine merge candidate based on a weight associated with a top left control point or a weight associated with a top right control point. 4. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
in response to a plurality of control points associated with the constructed affine merge candidate having a same weight, determining the weight of the plurality of control points as a weight of the constructed affine merge candidate; or in response to the plurality of control points having different weights, determining a default value as the weight of the constructed affine merge candidate. 5. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining, among weights of a plurality of control points corresponding to the constructed affine merge candidate, a weight used by most of the plurality of control points; and setting the determined weight as the weight of the constructed affine merge candidate. 6. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining differences between an equal weight and weights of the plurality of control points, respectively; determining, among the plurality of control points, a first control point with a weight having a smallest difference from the equal weight; and setting the weight of the first control point as the weight of the constructed affine merge candidate. 7. The method according to claim 3, wherein the determined weight comprises a weight for the constructed affine merge candidate, and the method further comprises:
determining an average weight for a plurality of control points corresponding to the constructed affine merge candidate; and setting the average weight as the weight of the constructed affine merge candidate. 8. The method according to claim 1, wherein the bi-predicting the coding unit based on the determined weight comprises processing the video data using an affine merge mode, and the method further comprises:
inserting, when constructing an affine merge candidate list, a zero motion vector with equal weight into the affine merge candidate list before inserting a zero motion vector with unequal weight. 9. The method according to claim 1, wherein the bi-predicting the coding unit based on the determined weight comprises processing the video data using an affine merge mode, and the method further comprises:
determining, when constructing an affine merge candidate list, an order of a plurality of constructed affine merge candidates based on weights of control points corresponding to each of the plurality of constructed affine merge candidates, wherein
a constructed affine merge candidate having control points with less diverse weights is assigned a higher priority than a constructed affine merge candidate having control points with more diverse weights. 10. The method of claim 9, wherein the determining the order of the plurality of constructed affine merge candidates comprises:
in response to weights of control points corresponding to each of two constructed merge candidates having a same level of diversity, using a default order for the two constructed merge candidates. 11. The method of claim 9, further comprising:
determining an availability of a first constructed affine merge candidate based on weights of control points corresponding to the first constructed affine merge candidate; and in response to a determination that the first constructed affine merge candidate is available, adding the first constructed affine merge candidate to the affine merge candidate list. 12. The method of claim 11, wherein the determining the availability of the first constructed affine merge candidate comprises:
determining whether weights of two control points corresponding to the first constructed affine merge candidate have different signs; and in response to a determination that the weights of the two control points corresponding to the first constructed affine merge candidate have different signs, determining that the first constructed affine merge candidate is not available. 13. A method for processing video data, the method comprising:
determining a weight of a first sub-block within a coding unit, based on weights of control points of the coding unit; bi-predicting the first sub-block based on the determined weight. 14. The method according to claim 13, wherein the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising one of the control points, using a weight of the one of the control points as the weight of the first sub-block, or in response to the first sub-block not comprising the control points, determining the weight of the first sub-block according to a pre-defined rule. 15. The method according to claim 13, wherein:
the coding unit is partitioned into four sub-blocks and has two control points; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising one of the two control points, using a weight of the one of the two control points as the weight of the first sub-block, or
in response to the first sub-block not comprising the two control points, setting the weight of the first sub-block to be one of:
a weight of one of the two control points with a shorter distance to the first sub-block, or
a default value. 16. The method according to claim 13, wherein:
the coding unit is partitioned into two sub-blocks and has three control points; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block including only one of the three control points, using a weight of the one of the control points as the weight of the first sub-block, or
in response to the first sub-block comprising at least two of the three control points, using a default value or a weight of one of the two control points as the weight of the first sub-block. 17. The method according to claim 13, wherein:
the coding unit is partitioned into four sub-blocks and has three control points, the three control points having a first, a second, and a third weight, respectively; and the determining the weight of the first sub-block within the coding unit comprises:
in response to the first sub-block comprising at least one of the three control points, using a weight of the one of the control points as the weight of the first sub-block, or
in response to the sub-block not comprising the three control points, setting the weight of the first sub-block to be one of:
an average value of the first, second, and third weights,
a middle value of the first, second, and third weights,
an equal weight of the coding unit,
one of the first, second, and third weights which has a smallest difference from the equal weight,
one of the first and second weights which has a smaller difference from the equal weight, or
a default value. 18. A video processing apparatus, comprising:
a memory storing instructions; and a processor configured to execute the instructions to cause the device to:
determine a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and
bi-predict the coding unit based on the determined weight. 19. A video processing apparatus, comprising:
a memory storing instructions; and a processor configured to execute the instructions to cause the device to:
determine a weight of a first sub-block within a coding unit, based on weights of control points of the coding unit;
bi-predict the first sub-block based on the determined weight. 20. A non-transitory computer-readable medium storing a set of instructions that is executable by one or more processors of a video processing device to cause the device to perform a method comprising:
determining a weight for at least one of an inherited affine merge candidate, a constructed affine merge candidate, or a zero motion vector of a coding unit; and bi-predicting the coding unit based on the determined weight. | 2,600 |
347,168 | 16,805,645 | 2,674 | A resource allocation method includes: receiving, by a first radio access network node in a first-type radio access network node, resource configuration information, where the resource configuration information includes at least two groups of resource information; and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node. | 1. A resource allocation method, comprising:
receiving, by a first radio access network node in a first-type radio access network node, resource configuration information, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node; and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node. 2. The resource allocation method according to claim 1,
wherein the resource configuration information comprises a combination of any one or more pieces of the following information: global resource configuration information, transmission resource information used in a first link of a previous-hop radio access network node accessed by the first radio access network node, or transmission resource information used in a second link of the previous-hop radio access network node; and wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 3. The resource allocation method according to claim 2, further comprising:
receiving, by the first radio access network node, group attribute information, wherein the group attribute information comprises a combination of any one or more pieces of the following information: a group index of the previous-hop radio access network node, a quantity of hops of the previous-hop radio access network node, parity of the quantity of hops of the previous-hop radio access network node, a group index of the first radio access network node, a quantity of hops of the first radio access network node, or parity of the quantity of hops of the first radio access network node. 4. The resource allocation method according to claim 2, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, and a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 5. The resource allocation method according to claim 2, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a subset of the transmission resource used in the second link of the next-hop radio access network node. 6. The resource allocation method according to claim 3, wherein receiving, by the first radio access network node in a first-type radio access network node, the resource configuration information, and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node further comprise:
receiving, by the first radio access network node, the resource configuration information from the previous-hop radio access network node, wherein the resource configuration information is the global resource configuration information; determining, by the first radio access network node based on the group attribute information, a transmission resource group used in the second link of the first radio access network node; and determining, by the first radio access network node, that a resource indicated by one group of resource information corresponding to the transmission resource group that is used in the second link and that is comprised in the global resource configuration information is the transmission resource used in the second link of the first radio access network node. 7. A resource allocation method, comprising:
sending, by a second radio access network node in a second-type radio access network node, resource configuration information to a first radio access network node in a first-type radio access network node, wherein wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node. 8. The resource allocation method according to claim 7, wherein the resource configuration information comprises global resource configuration information; and
wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 9. The resource allocation method according to claim 8, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, and a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 10. The resource allocation method according to claim 8,
wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a part of the transmission resource used in the second link of the next-hop radio access network node. 11. A resource allocation apparatus, comprising:
at least one processor; and a memory storing instructions executable by the at least one processor, wherein the instructions instruct the at least one processor to perform operations comprising: receiving, by the apparatus in a first-type radio access network node, resource configuration information, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the apparatus, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the apparatus; and using, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the apparatus. 12. The resource allocation apparatus according to claim 11,
wherein the resource configuration information comprises a combination of any one or more pieces of the following information: global resource configuration information, transmission resource information used in a first link of a previous-hop radio access network node accessed by the first radio access network node, or transmission resource information used in a second link of the previous-hop radio access network node; and wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 13. The resource allocation apparatus according to claim 12, further comprising:
receiving, group attribute information, wherein the group attribute information comprises a combination of any one or more pieces of the following information: a group index of the previous-hop radio access network node, a quantity of hops of the previous-hop radio access network node, parity of the quantity of hops of the previous-hop radio access network node, a group index of the apparatus, a quantity of hops of the apparatus, or parity of the quantity of hops of the apparatus. 14. The resource allocation apparatus according to claim 12,
wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, or a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 15. The resource allocation apparatus according to claim 12, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the apparatus is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the apparatus is a subset of the transmission resource used in the second link of the next-hop radio access network node. 16. The resource allocation apparatus according to claim 13, wherein
receiving, by the apparatus in a first-type radio access network node, the resource configuration information and using the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the apparatus further comprise: receiving, resource configuration information from the previous-hop radio access network node, wherein the resource configuration information is the global resource configuration information; determining, based on the group attribute information, a transmission resource group used in the second link of the apparatus; and determining, that a resource indicated by one group of resource information corresponding to the transmission resource group that is used in the second link and that is comprised in the global resource configuration information is the transmission resource used in the second link of the apparatus. 17. A resource allocation apparatus, comprising:
at least one processor; and a memory storing instructions executable by the at least one processor, wherein the instructions instruct the at least one processor to perform operations comprising: sending, by the apparatus in a second-type radio access network node, resource configuration information to a first radio access network node in a first-type radio access network node, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node. 18. The resource allocation apparatus according to claim 17, wherein the resource configuration information comprises global resource configuration information; and
the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 19. The resource allocation apparatus according to claim 18, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, or a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 20. The resource allocation apparatus according to claim 18, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a part of the transmission resource used in the second link of the next-hop radio access network node. | A resource allocation method includes: receiving, by a first radio access network node in a first-type radio access network node, resource configuration information, where the resource configuration information includes at least two groups of resource information; and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node.1. A resource allocation method, comprising:
receiving, by a first radio access network node in a first-type radio access network node, resource configuration information, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node; and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node. 2. The resource allocation method according to claim 1,
wherein the resource configuration information comprises a combination of any one or more pieces of the following information: global resource configuration information, transmission resource information used in a first link of a previous-hop radio access network node accessed by the first radio access network node, or transmission resource information used in a second link of the previous-hop radio access network node; and wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 3. The resource allocation method according to claim 2, further comprising:
receiving, by the first radio access network node, group attribute information, wherein the group attribute information comprises a combination of any one or more pieces of the following information: a group index of the previous-hop radio access network node, a quantity of hops of the previous-hop radio access network node, parity of the quantity of hops of the previous-hop radio access network node, a group index of the first radio access network node, a quantity of hops of the first radio access network node, or parity of the quantity of hops of the first radio access network node. 4. The resource allocation method according to claim 2, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, and a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 5. The resource allocation method according to claim 2, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a subset of the transmission resource used in the second link of the next-hop radio access network node. 6. The resource allocation method according to claim 3, wherein receiving, by the first radio access network node in a first-type radio access network node, the resource configuration information, and using, by the first radio access network node, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the first radio access network node further comprise:
receiving, by the first radio access network node, the resource configuration information from the previous-hop radio access network node, wherein the resource configuration information is the global resource configuration information; determining, by the first radio access network node based on the group attribute information, a transmission resource group used in the second link of the first radio access network node; and determining, by the first radio access network node, that a resource indicated by one group of resource information corresponding to the transmission resource group that is used in the second link and that is comprised in the global resource configuration information is the transmission resource used in the second link of the first radio access network node. 7. A resource allocation method, comprising:
sending, by a second radio access network node in a second-type radio access network node, resource configuration information to a first radio access network node in a first-type radio access network node, wherein wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node. 8. The resource allocation method according to claim 7, wherein the resource configuration information comprises global resource configuration information; and
wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 9. The resource allocation method according to claim 8, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, and a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 10. The resource allocation method according to claim 8,
wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a part of the transmission resource used in the second link of the next-hop radio access network node. 11. A resource allocation apparatus, comprising:
at least one processor; and a memory storing instructions executable by the at least one processor, wherein the instructions instruct the at least one processor to perform operations comprising: receiving, by the apparatus in a first-type radio access network node, resource configuration information, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the apparatus, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the apparatus; and using, the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the apparatus. 12. The resource allocation apparatus according to claim 11,
wherein the resource configuration information comprises a combination of any one or more pieces of the following information: global resource configuration information, transmission resource information used in a first link of a previous-hop radio access network node accessed by the first radio access network node, or transmission resource information used in a second link of the previous-hop radio access network node; and wherein the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 13. The resource allocation apparatus according to claim 12, further comprising:
receiving, group attribute information, wherein the group attribute information comprises a combination of any one or more pieces of the following information: a group index of the previous-hop radio access network node, a quantity of hops of the previous-hop radio access network node, parity of the quantity of hops of the previous-hop radio access network node, a group index of the apparatus, a quantity of hops of the apparatus, or parity of the quantity of hops of the apparatus. 14. The resource allocation apparatus according to claim 12,
wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, or a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 15. The resource allocation apparatus according to claim 12, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the apparatus is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the apparatus is a subset of the transmission resource used in the second link of the next-hop radio access network node. 16. The resource allocation apparatus according to claim 13, wherein
receiving, by the apparatus in a first-type radio access network node, the resource configuration information and using the resource indicated by one group of resource information in the resource configuration information as the transmission resource used in the second link of the apparatus further comprise: receiving, resource configuration information from the previous-hop radio access network node, wherein the resource configuration information is the global resource configuration information; determining, based on the group attribute information, a transmission resource group used in the second link of the apparatus; and determining, that a resource indicated by one group of resource information corresponding to the transmission resource group that is used in the second link and that is comprised in the global resource configuration information is the transmission resource used in the second link of the apparatus. 17. A resource allocation apparatus, comprising:
at least one processor; and a memory storing instructions executable by the at least one processor, wherein the instructions instruct the at least one processor to perform operations comprising: sending, by the apparatus in a second-type radio access network node, resource configuration information to a first radio access network node in a first-type radio access network node, wherein the resource configuration information comprises at least two groups of resource information, wherein one group of resource information indicates a resource that is a transmission resource used in a second link of the first radio access network node, and wherein the other group of resource information indicates a resource that is a transmission resource used in a second link of a next-hop radio access network node accessing the first radio access network node. 18. The resource allocation apparatus according to claim 17, wherein the resource configuration information comprises global resource configuration information; and
the global resource configuration information comprises a combination of any one or more pieces of the following information: a transmission resource group used in a second link, one group of resource information that is in the at least two groups of resource information and that corresponds to a transmission resource group used in each second link, a grouping mode of a transmission resource used in the second link, an index value of the grouping mode of the transmission resource used in the second link, a configuration manner of a transmission resource used in the first link and transmission resources used in second links of various groups of first-type radio access network nodes, an index value of the configuration manner of the transmission resource used in the first link and the transmission resources used in the second links of the various groups of first-type radio access network nodes, a configuration manner of transmission resources used in various groups of second links, or an index value of the configuration manner of the transmission resources used in the various groups of second links. 19. The resource allocation apparatus according to claim 18, wherein the global resource configuration information further comprises a transmission resource group used in the first link or the transmission resource information used in the first link, the transmission resource group used in the first link comprises the transmission resource information used in the first link, or a resource indicated by the transmission resource information used in the first link is a transmission resource used in a first link of each hop of radio access network node in the first-type radio access network node. 20. The resource allocation apparatus according to claim 18, wherein the global resource configuration information further comprises transmission resource indication information used in the first link, wherein
the transmission resource indication information used in the first link indicates that a transmission resource used in a first link of the first radio access network node is the same as the transmission resource used in the second link of the next-hop radio access network node; or a transmission resource used in a first link of the first radio access network node is a part of the transmission resource used in the second link of the next-hop radio access network node. | 2,600 |
347,169 | 16,805,685 | 1,783 | Embodiments relate to a multilayer film for food packaging applications, the multilayer film having chemical resistance to products having low to high pH from about 1 pH to about 13 pH, the multilayer film comprising a base layer and a top layer; wherein the base layer comprises polyethylene terephthalate, and optionally polybutylene terephthalate; and the top layer comprises low density polyethylene; wherein the multilayer film optionally has a thickness of 80 G (20 μm) or less. | 1. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer and a top layer; wherein the base layer comprises 60-99.99 wt % of polyethylene terephthalate, 20-40 wt % of polybutylene terephthalate and 0.01-1 wt % silica; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less; wherein the multilayer film has a thickness of 80 G (20 μm) or less. 2. The can liner of claim 1, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 3. The can liner of claim 2, wherein the top layer has a melt index of about 10 gm/10 min or less. 4. The can liner of claim 1, further comprising a primer layer between the base layer and the top layer, wherein the primer layer comprises polyethylenimine. 5. (canceled) 6. (canceled) 7. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, a primer layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 8. The can liner of claim 7, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 9. The can liner of claim 8, wherein the top layer has a melt index of about 10 gm/10 min or less. 10. The can liner of claim 9, wherein the top layer has the melt index of about 9 gm/10 min or less. 11. The can liner of claim 10, wherein the top layer has the melt index of about 8 gm/10 min or less. 12. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, a primer layer and a top layer in this order; wherein the base layer comprises 60-99.99 wt % of polyethylene terephthalate, 20-40 wt % of polybutylene terephthalate and 0.01-1 wt % silica; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 13. The can liner of claim 12, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 14. The can liner of claim 13, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 15. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, an intermediate layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the intermediate layer comprises 90-100 wt % of isophthalic acid modified polyethylene terephthalate; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 16. The can liner of claim 15, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 17. The can liner of claim 15, further comprising a primer layer between the intermediate layer and the top layer, wherein the primer layer comprises polyethylenimine. 18. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, an intermediate layer, a primer layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the intermediate layer comprises 40-60 wt % of polyethylene terephthalate and 40-60 wt % of amorphous copolyester; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 19. The can liner of claim 18, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 20. The can liner of claim 19, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 21. The can liner of claim 7, wherein the top layer has a melt index of about 10 gm/10 min or less and the low density polyethylene has a thickness of about 4-6 μm. 22. The can liner of claim 12, wherein the top layer has a melt index of about 10 gm/10 min or less and the low density polyethylene has a thickness of about 4-6 μm. | Embodiments relate to a multilayer film for food packaging applications, the multilayer film having chemical resistance to products having low to high pH from about 1 pH to about 13 pH, the multilayer film comprising a base layer and a top layer; wherein the base layer comprises polyethylene terephthalate, and optionally polybutylene terephthalate; and the top layer comprises low density polyethylene; wherein the multilayer film optionally has a thickness of 80 G (20 μm) or less.1. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer and a top layer; wherein the base layer comprises 60-99.99 wt % of polyethylene terephthalate, 20-40 wt % of polybutylene terephthalate and 0.01-1 wt % silica; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less; wherein the multilayer film has a thickness of 80 G (20 μm) or less. 2. The can liner of claim 1, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 3. The can liner of claim 2, wherein the top layer has a melt index of about 10 gm/10 min or less. 4. The can liner of claim 1, further comprising a primer layer between the base layer and the top layer, wherein the primer layer comprises polyethylenimine. 5. (canceled) 6. (canceled) 7. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, a primer layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 8. The can liner of claim 7, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 9. The can liner of claim 8, wherein the top layer has a melt index of about 10 gm/10 min or less. 10. The can liner of claim 9, wherein the top layer has the melt index of about 9 gm/10 min or less. 11. The can liner of claim 10, wherein the top layer has the melt index of about 8 gm/10 min or less. 12. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, a primer layer and a top layer in this order; wherein the base layer comprises 60-99.99 wt % of polyethylene terephthalate, 20-40 wt % of polybutylene terephthalate and 0.01-1 wt % silica; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 13. The can liner of claim 12, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 14. The can liner of claim 13, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 15. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, an intermediate layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the intermediate layer comprises 90-100 wt % of isophthalic acid modified polyethylene terephthalate; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 16. The can liner of claim 15, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 17. The can liner of claim 15, further comprising a primer layer between the intermediate layer and the top layer, wherein the primer layer comprises polyethylenimine. 18. A can liner comprising a laminated metal sheet comprising a tin-free metal sheet and a multilayer film comprising a base layer, an intermediate layer, a primer layer and a top layer in this order; wherein the base layer comprises 90-99.99 wt % of polyethylene terephthalate and 0.01-1 wt % silica; the intermediate layer comprises 40-60 wt % of polyethylene terephthalate and 40-60 wt % of amorphous copolyester; the primer layer comprises polyethylenimine; and the top layer comprises 90-100 wt % low density polyethylene having a thickness of about 6 μm or less. 19. The can liner of claim 18, wherein the multilayer film has a thickness of 80 G (20 μm) or less. 20. The can liner of claim 19, wherein the multilayer film has the thickness of about 60 G (15 μm) or less. 21. The can liner of claim 7, wherein the top layer has a melt index of about 10 gm/10 min or less and the low density polyethylene has a thickness of about 4-6 μm. 22. The can liner of claim 12, wherein the top layer has a melt index of about 10 gm/10 min or less and the low density polyethylene has a thickness of about 4-6 μm. | 1,700 |
347,170 | 16,805,653 | 1,783 | The disclosed computer-implemented method may include a magnetic insertable lock component with a magnet-sensing lock housing. By using a magnet within a pin and a magnetic field sensor within the lock housing, the apparatus may accurately detect the state of the lock. In some embodiments, the apparatus may determine the pin is inserted fully into the lock, the pin is inserted partially into the lock, the pin is not inserted in the lock, and/or that a foreign object that is not the pin is inserted into the lock. By using a magnet within the pin to track the state of the lock, the apparatus may improve both the user experience and the security of the lock. Various other methods, systems, and computer-readable media are also disclosed. | 1. (canceled) 2. A personal mobility vehicle locking system comprising:
a pin comprising a magnet and an undercut along a shaft of the pin, the undercut configured to secure the pin in a locked position; and a lock for a wheel of a personal mobility vehicle, the lock comprising:
a locking mechanism comprising a slider and configured to secure the pin in the locked position by positioning the slider into the undercut; and
a sensor adjacent to the locking mechanism and configured to detect one or more positions of the pin relative to the sensor based on a magnetic field generated by the magnet that is detected by the sensor at the one or more positions,
wherein the sensor is further configured to output one or more visual notifications via a visual output device on the personal mobility vehicle based on the one or more positions. 3. The personal mobility vehicle locking system of claim 2, wherein a visual notification of the one or more visual notifications indicates an end to a use of the personal mobility vehicle in response to the sensor detecting the locked position of the pin based on the magnetic field. 4. The personal mobility vehicle locking system of claim 2, wherein the visual output device comprises a portion of a fender of the personal mobility vehicle. 5. The personal mobility vehicle locking system of claim 2, wherein a visual notification of the one or more visual notifications indicates a start to a use of the personal mobility vehicle in response to the sensor detecting a removed position of the pin relative to the sensor based on the magnetic field. 6. The personal mobility vehicle locking system of claim 2, wherein the locking mechanism further comprises a motor and a cam connected to the slider, and wherein the motor is configured to drive the slider into the undercut using the cam. 7. The personal mobility vehicle locking system of claim 2, wherein the pin further comprises a bevel along the shaft adjacent to the undercut, and wherein the locking mechanism further comprises a spring configured to move the slider over the bevel and engage the slider into the undercut in the locked position. 8. The personal mobility vehicle locking system of claim 2, further comprising a release component configured to disengage the slider from the undercut. 9. The personal mobility vehicle locking system of claim 2, wherein the sensor is further configured to detect a foreign object within the lock, wherein an alert is transmitted by the personal mobility vehicle locking system to a transportation service provider based on detecting the foreign object. 10. The personal mobility vehicle locking system of claim 2, further comprising:
a communication module configured to receive a detection of the locked position of the one or more positions from the sensor and transmit a request to end a billing process for a use of the personal mobility vehicle. 11. The personal mobility vehicle locking system of claim 2, further comprising:
a holster configured to secure the pin when the pin is removed from the lock. 12. The personal mobility vehicle locking system of claim 11, wherein the holster comprises an additional sensor configured to detect the magnetic field generated by the magnet in a secured position within the holster, and wherein the holster is further configured to output one or more additional notifications via the visual output device based on the secured position. 13. A method comprising:
detecting, by a sensor of a lock for a personal mobility vehicle, a strength of a magnetic field generated by a magnet within a pin of the lock; determining a position of the pin relative to the sensor based on the strength of the magnetic field at the position; and outputting, through a visual output device of the personal mobility vehicle, a visual indication corresponding to the position. 14. The method of claim 13, wherein the strength is a maximum strength at the position relative to strengths of the magnetic field at other positions of the pin relative to the sensor and the position indicates the pin is fully inserted into the lock. 15. The method of claim 14, further comprising terminating a billing for a user of the personal mobility vehicle based on the strength being the maximum strength. 16. A locking pin for a personal mobility vehicle, the locking pin comprising:
a shaft having a first end of the locking pin and configured to be insertable into a lock; a handle at a second end of the locking pin; and a magnet within the shaft and spanning in a longitudinal direction of the shaft, wherein the magnet extends past an undercut of the shaft. 17. The locking pin of claim 16, wherein the shaft further comprises a bevel portion adjacent the undercut and tapering down toward the first end. 18. The locking pin of claim 16, wherein the magnet has a first end extending toward the first end of the locking pin and a second end extending toward the second end of the locking pin, and wherein the first end of the magnet and the second end of the magnet have opposite polarities. 19. The locking pin of claim 16, wherein the handle is wider than the shaft. 20. The locking pin of claim 16, wherein the shaft has a bevel portion tapering down toward the first end. | The disclosed computer-implemented method may include a magnetic insertable lock component with a magnet-sensing lock housing. By using a magnet within a pin and a magnetic field sensor within the lock housing, the apparatus may accurately detect the state of the lock. In some embodiments, the apparatus may determine the pin is inserted fully into the lock, the pin is inserted partially into the lock, the pin is not inserted in the lock, and/or that a foreign object that is not the pin is inserted into the lock. By using a magnet within the pin to track the state of the lock, the apparatus may improve both the user experience and the security of the lock. Various other methods, systems, and computer-readable media are also disclosed.1. (canceled) 2. A personal mobility vehicle locking system comprising:
a pin comprising a magnet and an undercut along a shaft of the pin, the undercut configured to secure the pin in a locked position; and a lock for a wheel of a personal mobility vehicle, the lock comprising:
a locking mechanism comprising a slider and configured to secure the pin in the locked position by positioning the slider into the undercut; and
a sensor adjacent to the locking mechanism and configured to detect one or more positions of the pin relative to the sensor based on a magnetic field generated by the magnet that is detected by the sensor at the one or more positions,
wherein the sensor is further configured to output one or more visual notifications via a visual output device on the personal mobility vehicle based on the one or more positions. 3. The personal mobility vehicle locking system of claim 2, wherein a visual notification of the one or more visual notifications indicates an end to a use of the personal mobility vehicle in response to the sensor detecting the locked position of the pin based on the magnetic field. 4. The personal mobility vehicle locking system of claim 2, wherein the visual output device comprises a portion of a fender of the personal mobility vehicle. 5. The personal mobility vehicle locking system of claim 2, wherein a visual notification of the one or more visual notifications indicates a start to a use of the personal mobility vehicle in response to the sensor detecting a removed position of the pin relative to the sensor based on the magnetic field. 6. The personal mobility vehicle locking system of claim 2, wherein the locking mechanism further comprises a motor and a cam connected to the slider, and wherein the motor is configured to drive the slider into the undercut using the cam. 7. The personal mobility vehicle locking system of claim 2, wherein the pin further comprises a bevel along the shaft adjacent to the undercut, and wherein the locking mechanism further comprises a spring configured to move the slider over the bevel and engage the slider into the undercut in the locked position. 8. The personal mobility vehicle locking system of claim 2, further comprising a release component configured to disengage the slider from the undercut. 9. The personal mobility vehicle locking system of claim 2, wherein the sensor is further configured to detect a foreign object within the lock, wherein an alert is transmitted by the personal mobility vehicle locking system to a transportation service provider based on detecting the foreign object. 10. The personal mobility vehicle locking system of claim 2, further comprising:
a communication module configured to receive a detection of the locked position of the one or more positions from the sensor and transmit a request to end a billing process for a use of the personal mobility vehicle. 11. The personal mobility vehicle locking system of claim 2, further comprising:
a holster configured to secure the pin when the pin is removed from the lock. 12. The personal mobility vehicle locking system of claim 11, wherein the holster comprises an additional sensor configured to detect the magnetic field generated by the magnet in a secured position within the holster, and wherein the holster is further configured to output one or more additional notifications via the visual output device based on the secured position. 13. A method comprising:
detecting, by a sensor of a lock for a personal mobility vehicle, a strength of a magnetic field generated by a magnet within a pin of the lock; determining a position of the pin relative to the sensor based on the strength of the magnetic field at the position; and outputting, through a visual output device of the personal mobility vehicle, a visual indication corresponding to the position. 14. The method of claim 13, wherein the strength is a maximum strength at the position relative to strengths of the magnetic field at other positions of the pin relative to the sensor and the position indicates the pin is fully inserted into the lock. 15. The method of claim 14, further comprising terminating a billing for a user of the personal mobility vehicle based on the strength being the maximum strength. 16. A locking pin for a personal mobility vehicle, the locking pin comprising:
a shaft having a first end of the locking pin and configured to be insertable into a lock; a handle at a second end of the locking pin; and a magnet within the shaft and spanning in a longitudinal direction of the shaft, wherein the magnet extends past an undercut of the shaft. 17. The locking pin of claim 16, wherein the shaft further comprises a bevel portion adjacent the undercut and tapering down toward the first end. 18. The locking pin of claim 16, wherein the magnet has a first end extending toward the first end of the locking pin and a second end extending toward the second end of the locking pin, and wherein the first end of the magnet and the second end of the magnet have opposite polarities. 19. The locking pin of claim 16, wherein the handle is wider than the shaft. 20. The locking pin of claim 16, wherein the shaft has a bevel portion tapering down toward the first end. | 1,700 |
347,171 | 16,805,664 | 1,783 | A method for using piecewise forecasts involves obtaining, by a model discovery service, a plurality of models and generating, by a demand prediction service, a plurality of values for a time series variable. The plurality of values corresponding to a plurality of days to be predicted. The method further involves inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. | 1. A method comprising:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 2. The method of claim 1, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 3. The method of claim 1, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one of a group comprising a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 4. The method of claim 1, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 5. The method of claim 1, further comprising:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 6. The method of claim 1, wherein the selected model is an autoregressive model. 7. The method of claim 1, wherein the selected model includes one or more lags from a target time series. 8. A system comprising:
a processor; a memory coupled to the processor; the memory comprising an application, wherein the application executes on the processor, uses the memory, and is configured for:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and
generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 9. The system of claim 8, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 10. The system of claim 8, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one selected from a group consisting of a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 11. The system of claim 8, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 12. The system of claim 8, wherein the application is further configured for:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 13. The system of claim 8, wherein the selected model is an autoregressive model. 14. The system of claim 8, wherein the selected model includes one or more lags from a target time series. 15. A non-transitory computer readable medium comprising computer readable program code for:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 16. The non-transitory computer readable medium of claim 15, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 17. The non-transitory computer readable medium of claim 15, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one of a group comprising a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 18. The non-transitory computer readable medium of claim 15, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 19. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 20. The non-transitory computer readable medium of claim 15, wherein the selected model is an autoregressive model. | A method for using piecewise forecasts involves obtaining, by a model discovery service, a plurality of models and generating, by a demand prediction service, a plurality of values for a time series variable. The plurality of values corresponding to a plurality of days to be predicted. The method further involves inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable.1. A method comprising:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 2. The method of claim 1, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 3. The method of claim 1, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one of a group comprising a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 4. The method of claim 1, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 5. The method of claim 1, further comprising:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 6. The method of claim 1, wherein the selected model is an autoregressive model. 7. The method of claim 1, wherein the selected model includes one or more lags from a target time series. 8. A system comprising:
a processor; a memory coupled to the processor; the memory comprising an application, wherein the application executes on the processor, uses the memory, and is configured for:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and
generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 9. The system of claim 8, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 10. The system of claim 8, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one selected from a group consisting of a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 11. The system of claim 8, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 12. The system of claim 8, wherein the application is further configured for:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 13. The system of claim 8, wherein the selected model is an autoregressive model. 14. The system of claim 8, wherein the selected model includes one or more lags from a target time series. 15. A non-transitory computer readable medium comprising computer readable program code for:
obtaining, by a model discovery service, a plurality of models comprising:
for each model horizon of a plurality of model horizons,
training a plurality of training models having the model horizon;
generating a plurality of cross validation metrics from the plurality of training models;
selecting a training model of the plurality of training models as a selected model for the model horizon using the plurality of cross validation metrics;
generating, by a demand prediction service, a plurality of values for a time series variable, the plurality of values corresponding to a plurality of days to be predicted, wherein generating the plurality of values comprises:
selecting, for a day of the plurality of days, the selected model having the model horizon with a lowest value that is greater than or equal to an ordinal value of the day;
inputting the plurality of values for the time series variable as part of a piecewise forecast to a headcount estimation service; and generating, by the headcount estimation service with the piecewise forecast, an estimated headcount from the time series variable. 16. The non-transitory computer readable medium of claim 15, wherein selecting the training model further comprises:
testing the selected model against one of in-season training data and out-of-season training data. 17. The non-transitory computer readable medium of claim 15, wherein generating the plurality of cross validation metrics further comprises:
generating a cross validation metric of the plurality of cross validation metrics as one of a group comprising a mean absolute scaled error (MASE) and a weighted mean absolute percentage error (wMAPE). 18. The non-transitory computer readable medium of claim 15, wherein selecting the plurality of models further comprises:
training a plurality of training models with training data that includes historical time series data for at least two years. 19. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
combining a machine learning forecast, generated from the plurality of values, with an alternative forecast to form the piecewise forecast as a combined forecast. 20. The non-transitory computer readable medium of claim 15, wherein the selected model is an autoregressive model. | 1,700 |
347,172 | 16,805,694 | 3,735 | A mug cap apparatus comprises a mug cap and a mug. The mug cap comprises a base cylindrical body having a hollow opening in the center. The base cylindrical body has a narrow portion and a wide portion. A sealer ring seals the base cylindrical body to the mug. The wider portion engages the rim of the mug and the narrow portion engages the inner perimeter portion of the mug. The hollow opening has threads to engage a compartment's cylindrical body. The compartment's cylindrical body has an outer perimeter that has threads to engage the threads of the base cylindrical body, and an inner compartment. A lid engages said compartment cylindrical body and seals said inner compartment when said lid is in its closed configuration. | 1. A mug cap apparatus comprising a mug cap and a mug;
said mug having a rim on top of said mug; an outer perimeter portion and an inner perimeter portion; said mug cap is comprised of a base cylindrical body having a hallow opening in the center; said base cylindrical body having a narrow portion and a wide portion; a sealer ring along the perimeter of said narrow portion; said sealer seals said base cylindrical body to said mug; said wider portion engages the rim of said mug and said narrow portion engages said inner perimeter portion of said mug; said hallow opening having threads to engage a compartment cylindrical body; said compartment cylindrical body having an outer perimeter and an inner compartment wherein said outer perimeter has threads to engage said threads of said base cylindrical body; a lid engages said compartment cylindrical body and seals said inner compartment when said lid is in its closed configuration. 2. The mug apparatus of claim 1 wherein said compartment cylindrical body seals said hallow opening of said a base cylindrical body when said compartment cylindrical body is engaged via said threads of said base cylindrical body. 3. The mug apparatus of claim 1 wherein said lid further comprise a ledge for ease of opening. | A mug cap apparatus comprises a mug cap and a mug. The mug cap comprises a base cylindrical body having a hollow opening in the center. The base cylindrical body has a narrow portion and a wide portion. A sealer ring seals the base cylindrical body to the mug. The wider portion engages the rim of the mug and the narrow portion engages the inner perimeter portion of the mug. The hollow opening has threads to engage a compartment's cylindrical body. The compartment's cylindrical body has an outer perimeter that has threads to engage the threads of the base cylindrical body, and an inner compartment. A lid engages said compartment cylindrical body and seals said inner compartment when said lid is in its closed configuration.1. A mug cap apparatus comprising a mug cap and a mug;
said mug having a rim on top of said mug; an outer perimeter portion and an inner perimeter portion; said mug cap is comprised of a base cylindrical body having a hallow opening in the center; said base cylindrical body having a narrow portion and a wide portion; a sealer ring along the perimeter of said narrow portion; said sealer seals said base cylindrical body to said mug; said wider portion engages the rim of said mug and said narrow portion engages said inner perimeter portion of said mug; said hallow opening having threads to engage a compartment cylindrical body; said compartment cylindrical body having an outer perimeter and an inner compartment wherein said outer perimeter has threads to engage said threads of said base cylindrical body; a lid engages said compartment cylindrical body and seals said inner compartment when said lid is in its closed configuration. 2. The mug apparatus of claim 1 wherein said compartment cylindrical body seals said hallow opening of said a base cylindrical body when said compartment cylindrical body is engaged via said threads of said base cylindrical body. 3. The mug apparatus of claim 1 wherein said lid further comprise a ledge for ease of opening. | 3,700 |
347,173 | 16,805,642 | 3,735 | A UE detects a beam failure on a first CC. The UE determines whether to transmit a BFRQ to a base station on the first CC or a second CC. The UE determines whether to include a NBI report in the BFRQ. The UE transmits the BFRQ to the base station on the first CC or the second CC. The base station receives a BFRQ from a UE on a first CC or a second CC. The base station determines a new beam for the first CC, where the determination of the new beam is based on a RACH procedure when the BFRQ is received on the first CC or a NBI report in the BFRQ when the BFRQ is received on the second CC. The base station initiates a BFR procedure with the UE for the first CC based on the BFRQ and the new beam determination. | 1. A method of wireless communication at a user equipment (UE), comprising:
detecting a beam failure on a first component carrier (CC); determining whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; determining whether to include a new beam information (NBI) report in the BFRQ; and transmitting the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 2. The method of claim 1, wherein the first CC is a secondary cell and the second CC is a primary cell. 3. The method of claim 1, wherein the determination to include the NBI report in the BFRQ is based on the determination to transmit the BFRQ to the base station on the first CC or the second CC. 4. The method of claim 1, wherein the BFRQ including the NBI report is transmitted to the base station on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 5. The method of claim 1, wherein the BFRQ without the NBI report is transmitted to the base station on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 6. The method of claim 1, further comprising:
identifying the new beam for the first CC. 7. The method of claim 6, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure when the new beam for the first CC is identified. 8. The method of claim 1, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure; or
wherein the BFRQ is transmitted to the base station on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 9. The method of claim 8, wherein the resource configuration for the first CC is indicated using a contention free RACH (CFRA) procedure, wherein the BFRQ is transmitted on the first CC based on the indicated resource configuration. 10. The method of claim 8, wherein the resource configuration for the second CC is indicated using the PUCCH or the MAC-CE in the PUSCH, wherein the BFRQ is transmitted on the second CC based on the indicated resource configuration. 11. The method of claim 1, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 12. The method of claim 1, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 13. The method of claim 1, wherein the BFRQ indicates whether the new beam is identified based on at least one BFRQ format. 14. The method of claim 13, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 15. The method of claim 1, further comprising:
measuring a beam failure detection (BFD) RS on the first CC, wherein the beam failure is detected on the first CC by measuring the BFD RS. 16. A method of wireless communication at a base station, comprising:
receiving a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; determining a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and initiating a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 17. The method of claim 16, wherein the first CC is a secondary cell and the second CC is a primary cell. 18. The method of claim 16, wherein the BFRQ including the NBI report is received from the UE on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 19. The method of claim 16, wherein the BFRQ without the NBI report is received from the UE on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 20. The method of claim 16, wherein the determination of the new beam for the first CC is based on whether the BFRQ indicates the new beam. 21. The method of claim 16, wherein determining the new beam for the first CC further comprises:
identifying whether the BFRQ indicates the new beam for the first CC. 22. The method of claim 16, wherein the BFRQ is received from the UE on the first CC using the RACH procedure; or
wherein the BFRQ is received from the UE on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 23. The method of claim 16, wherein the BFRQ includes the NBI report when a candidate RS or RSRP threshold on the first CC is configured. 24. The method of claim 16, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 25. The method of claim 16, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 26. The method of claim 16, further comprising:
transmitting a physical downlink control channel (PDCCH) to the UE when the BFRQ is received on the second CC; and instructing the UE to perform the RACH procedure on the first CC based on the determined new beam. 27. The method of claim 16, further comprising:
determining at least one BFRQ format of the BFRQ; and identifying whether the BFRQ indicates the new beam for the first CC based on the determined at least one BFRQ format. 28. The method of claim 27, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 29. An apparatus for wireless communication at a user equipment (UE), comprising:
a memory; and at least one processor coupled to the memory and configured to:
detect a beam failure on a first component carrier (CC);
determine whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC;
determine whether to include a new beam information (NBI) report in the BFRQ; and
transmit the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 30. The apparatus of claim 29, wherein the first CC is a secondary cell and the second CC is a primary cell. 31. The apparatus of claim 29, wherein the determination to include the NBI report in the BFRQ is based on the determination to transmit the BFRQ to the base station on the first CC or the second CC. 32. The apparatus of claim 29, wherein the BFRQ including the NBI report is transmitted to the base station on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 33. The apparatus of claim 29, wherein the BFRQ without the NBI report is transmitted to the base station on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 34. The apparatus of claim 29, wherein the at least one processor is further configured to:
identify the new beam for the first CC. 35. The apparatus of claim 34, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure when the new beam for the first CC is identified. 36. The apparatus of claim 29, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure; or
wherein the BFRQ is transmitted to the base station on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 37. The apparatus of claim 36, wherein the resource configuration for the first CC is indicated using a contention free RACH (CFRA) procedure, wherein the BFRQ is transmitted on the first CC based on the indicated resource configuration. 38. The apparatus of claim 36, wherein the resource configuration for the second CC is indicated using the PUCCH or the MAC-CE in the PUSCH, wherein the BFRQ is transmitted on the second CC based on the indicated resource configuration. 39. The apparatus of claim 29, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 40. The apparatus of claim 29, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 41. The apparatus of claim 29, wherein the BFRQ indicates whether the new beam is identified based on at least one BFRQ format. 42. The apparatus of claim 41, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 43. The apparatus of claim 29, wherein the at least one processor is further configured to:
measure a beam failure detection (BFD) RS on the first CC, wherein the beam failure is detected on the first CC by measuring the BFD RS. 44. An apparatus for wireless communication at a base station, comprising:
a memory; and at least one processor coupled to the memory and configured to:
receive a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC;
determine a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and
initiate a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 45. The apparatus of claim 44, wherein the first CC is a secondary cell and the second CC is a primary cell. 46. The apparatus of claim 44, wherein the BFRQ including the NBI report is received from the UE on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 47. The apparatus of claim 44, wherein the BFRQ without the NBI report is received from the UE on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 48. The apparatus of claim 44, wherein the determination of the new beam for the first CC is based on whether the BFRQ indicates the new beam. 49. The apparatus of claim 44, wherein to determine a new beam for the first CC the at least one processor is further configured to:
identify whether the BFRQ indicates the new beam for the first CC. 50. The apparatus of claim 44, wherein the BFRQ is received from the UE on the first CC using the RACH procedure; or
wherein the BFRQ is received from the UE on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 51. The apparatus of claim 44, wherein the BFRQ includes the NBI report when a candidate RS or RSRP threshold on the first CC is configured. 52. The apparatus of claim 44, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 53. The apparatus of claim 44, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 54. The apparatus of claim 44, wherein the at least one processor is further configured to:
transmit a physical downlink control channel (PDCCH) to the UE when the BFRQ is received on the second CC; and instruct the UE to perform the RACH procedure on the first CC based on the determined new beam. 55. The apparatus of claim 44, wherein the at least one processor is further configured to:
determine at least one BFRQ format of the BFRQ; and identify whether the BFRQ indicates the new beam for the first CC based on the determined at least one BFRQ format. 56. The apparatus of claim 55, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 57. An apparatus for wireless communication at a user equipment (UE), comprising:
means for detecting a beam failure on a first component carrier (CC); means for determining whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; means for determining whether to include a new beam information (NBI) report in the BFRQ; and means for transmitting the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 58. An apparatus for wireless communication at a base station, comprising:
means for receiving a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; means for determining a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and means for initiating a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 59. A computer-readable medium storing computer executable code for wireless communication at a user equipment (UE), the code when executed by a processor causes the processor to:
detect a beam failure on a first component carrier (CC); determine whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; determine whether to include a new beam information (NBI) report in the BFRQ; and transmit the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 60. A computer-readable medium storing computer executable code for wireless communication at a base station, the code when executed by a processor causes the processor to:
receive a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; determine a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and initiate a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. | A UE detects a beam failure on a first CC. The UE determines whether to transmit a BFRQ to a base station on the first CC or a second CC. The UE determines whether to include a NBI report in the BFRQ. The UE transmits the BFRQ to the base station on the first CC or the second CC. The base station receives a BFRQ from a UE on a first CC or a second CC. The base station determines a new beam for the first CC, where the determination of the new beam is based on a RACH procedure when the BFRQ is received on the first CC or a NBI report in the BFRQ when the BFRQ is received on the second CC. The base station initiates a BFR procedure with the UE for the first CC based on the BFRQ and the new beam determination.1. A method of wireless communication at a user equipment (UE), comprising:
detecting a beam failure on a first component carrier (CC); determining whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; determining whether to include a new beam information (NBI) report in the BFRQ; and transmitting the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 2. The method of claim 1, wherein the first CC is a secondary cell and the second CC is a primary cell. 3. The method of claim 1, wherein the determination to include the NBI report in the BFRQ is based on the determination to transmit the BFRQ to the base station on the first CC or the second CC. 4. The method of claim 1, wherein the BFRQ including the NBI report is transmitted to the base station on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 5. The method of claim 1, wherein the BFRQ without the NBI report is transmitted to the base station on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 6. The method of claim 1, further comprising:
identifying the new beam for the first CC. 7. The method of claim 6, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure when the new beam for the first CC is identified. 8. The method of claim 1, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure; or
wherein the BFRQ is transmitted to the base station on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 9. The method of claim 8, wherein the resource configuration for the first CC is indicated using a contention free RACH (CFRA) procedure, wherein the BFRQ is transmitted on the first CC based on the indicated resource configuration. 10. The method of claim 8, wherein the resource configuration for the second CC is indicated using the PUCCH or the MAC-CE in the PUSCH, wherein the BFRQ is transmitted on the second CC based on the indicated resource configuration. 11. The method of claim 1, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 12. The method of claim 1, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 13. The method of claim 1, wherein the BFRQ indicates whether the new beam is identified based on at least one BFRQ format. 14. The method of claim 13, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 15. The method of claim 1, further comprising:
measuring a beam failure detection (BFD) RS on the first CC, wherein the beam failure is detected on the first CC by measuring the BFD RS. 16. A method of wireless communication at a base station, comprising:
receiving a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; determining a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and initiating a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 17. The method of claim 16, wherein the first CC is a secondary cell and the second CC is a primary cell. 18. The method of claim 16, wherein the BFRQ including the NBI report is received from the UE on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 19. The method of claim 16, wherein the BFRQ without the NBI report is received from the UE on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 20. The method of claim 16, wherein the determination of the new beam for the first CC is based on whether the BFRQ indicates the new beam. 21. The method of claim 16, wherein determining the new beam for the first CC further comprises:
identifying whether the BFRQ indicates the new beam for the first CC. 22. The method of claim 16, wherein the BFRQ is received from the UE on the first CC using the RACH procedure; or
wherein the BFRQ is received from the UE on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 23. The method of claim 16, wherein the BFRQ includes the NBI report when a candidate RS or RSRP threshold on the first CC is configured. 24. The method of claim 16, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 25. The method of claim 16, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 26. The method of claim 16, further comprising:
transmitting a physical downlink control channel (PDCCH) to the UE when the BFRQ is received on the second CC; and instructing the UE to perform the RACH procedure on the first CC based on the determined new beam. 27. The method of claim 16, further comprising:
determining at least one BFRQ format of the BFRQ; and identifying whether the BFRQ indicates the new beam for the first CC based on the determined at least one BFRQ format. 28. The method of claim 27, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 29. An apparatus for wireless communication at a user equipment (UE), comprising:
a memory; and at least one processor coupled to the memory and configured to:
detect a beam failure on a first component carrier (CC);
determine whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC;
determine whether to include a new beam information (NBI) report in the BFRQ; and
transmit the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 30. The apparatus of claim 29, wherein the first CC is a secondary cell and the second CC is a primary cell. 31. The apparatus of claim 29, wherein the determination to include the NBI report in the BFRQ is based on the determination to transmit the BFRQ to the base station on the first CC or the second CC. 32. The apparatus of claim 29, wherein the BFRQ including the NBI report is transmitted to the base station on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 33. The apparatus of claim 29, wherein the BFRQ without the NBI report is transmitted to the base station on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 34. The apparatus of claim 29, wherein the at least one processor is further configured to:
identify the new beam for the first CC. 35. The apparatus of claim 34, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure when the new beam for the first CC is identified. 36. The apparatus of claim 29, wherein the BFRQ is transmitted to the base station on the first CC using a random access channel (RACH) procedure; or
wherein the BFRQ is transmitted to the base station on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 37. The apparatus of claim 36, wherein the resource configuration for the first CC is indicated using a contention free RACH (CFRA) procedure, wherein the BFRQ is transmitted on the first CC based on the indicated resource configuration. 38. The apparatus of claim 36, wherein the resource configuration for the second CC is indicated using the PUCCH or the MAC-CE in the PUSCH, wherein the BFRQ is transmitted on the second CC based on the indicated resource configuration. 39. The apparatus of claim 29, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 40. The apparatus of claim 29, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 41. The apparatus of claim 29, wherein the BFRQ indicates whether the new beam is identified based on at least one BFRQ format. 42. The apparatus of claim 41, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 43. The apparatus of claim 29, wherein the at least one processor is further configured to:
measure a beam failure detection (BFD) RS on the first CC, wherein the beam failure is detected on the first CC by measuring the BFD RS. 44. An apparatus for wireless communication at a base station, comprising:
a memory; and at least one processor coupled to the memory and configured to:
receive a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC;
determine a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and
initiate a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 45. The apparatus of claim 44, wherein the first CC is a secondary cell and the second CC is a primary cell. 46. The apparatus of claim 44, wherein the BFRQ including the NBI report is received from the UE on the second CC, wherein the NBI report includes at least one field or index indicating beam information or indicating there is no new beam. 47. The apparatus of claim 44, wherein the BFRQ without the NBI report is received from the UE on the first CC, wherein the new beam is indicated based on one or more resources of the BFRQ. 48. The apparatus of claim 44, wherein the determination of the new beam for the first CC is based on whether the BFRQ indicates the new beam. 49. The apparatus of claim 44, wherein to determine a new beam for the first CC the at least one processor is further configured to:
identify whether the BFRQ indicates the new beam for the first CC. 50. The apparatus of claim 44, wherein the BFRQ is received from the UE on the first CC using the RACH procedure; or
wherein the BFRQ is received from the UE on the second CC in a physical uplink control channel (PUCCH) or a medium access control (MAC) control element (MAC-CE) in a physical uplink shared channel (PUSCH). 51. The apparatus of claim 44, wherein the BFRQ includes the NBI report when a candidate RS or RSRP threshold on the first CC is configured. 52. The apparatus of claim 44, wherein an index in the NBI report of the BFRQ indicates the new beam is not identified. 53. The apparatus of claim 44, wherein a reserved field in a PUCCH or a MAC-CE in a PUSCH of the BFRQ indicates the new beam is not identified. 54. The apparatus of claim 44, wherein the at least one processor is further configured to:
transmit a physical downlink control channel (PDCCH) to the UE when the BFRQ is received on the second CC; and instruct the UE to perform the RACH procedure on the first CC based on the determined new beam. 55. The apparatus of claim 44, wherein the at least one processor is further configured to:
determine at least one BFRQ format of the BFRQ; and identify whether the BFRQ indicates the new beam for the first CC based on the determined at least one BFRQ format. 56. The apparatus of claim 55, wherein the at least one BFRQ format without a field or index indicates the new beam is not identified. 57. An apparatus for wireless communication at a user equipment (UE), comprising:
means for detecting a beam failure on a first component carrier (CC); means for determining whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; means for determining whether to include a new beam information (NBI) report in the BFRQ; and means for transmitting the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 58. An apparatus for wireless communication at a base station, comprising:
means for receiving a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; means for determining a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and means for initiating a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. 59. A computer-readable medium storing computer executable code for wireless communication at a user equipment (UE), the code when executed by a processor causes the processor to:
detect a beam failure on a first component carrier (CC); determine whether to transmit a beam failure recovery request (BFRQ) to a base station on the first CC or a second CC, wherein the determination to transmit the BFRQ on the first CC or the second CC is based on whether a new beam for the first CC is identified or is based on a resource configuration for the first CC or the second CC; determine whether to include a new beam information (NBI) report in the BFRQ; and transmit the BFRQ to the base station on the first CC or the second CC, wherein the BFRQ indicates there is no new beam when the new beam for the first CC is not identified. 60. A computer-readable medium storing computer executable code for wireless communication at a base station, the code when executed by a processor causes the processor to:
receive a beam failure recovery request (BFRQ) from a user equipment (UE) on a first component carrier (CC) or a second CC, wherein the BFRQ indicates a beam failure on the first CC; determine a new beam for the first CC, wherein the determination of the new beam is based on a random access channel (RACH) procedure when the BFRQ is received on the first CC or is based on a new beam information (NBI) report in the BFRQ when the BFRQ is received on the second CC; and initiate a beam failure recovery (BFR) procedure with the UE for the first CC based on the BFRQ and the determination of the new beam. | 3,700 |
347,174 | 16,805,606 | 3,735 | Compositions with fulvate fractions alone or in combination with growth factors, bioactive fragmented peptides, or combinations thereof are disclosed herein. Also disclosed are methods of using said compositions for the catalyzing cellular regeneration, including the healing, treatment, or prevention of skin disorders. Also disclosed are methods for extracting, isolating, and purifying fulvate fractions for use in the manufacture of said compositions. | 1. A composition for treatment of a subject in need of cell regeneration comprising an isolated fulvate fraction having an average molecular weight ranging from 80 to 1200 Da, as measured by vapor pressure osmometry. 2. A method of treating a wound in a subject, comprising:
applying a topical composition to a subject in need thereof, wherein the topical composition comprises an isolated fulvate fraction in an amount of about 0.5% to about 7% by weight, wherein the isolated fulvate fraction has an average molecular weight ranging from 300 to 320 Da, and wherein the isolated fulvate fraction has an approximate molecular formula of C12H16O9. 3. A method of treating a skin or scalp condition in a subject comprising:
applying a therapeutically effective amount of a topical composition to a subject in need thereof, wherein the topical composition comprises an isolated fulvate fraction having an average molecular weight ranging from 80 to 350 Da. 4. The method of claim 3, wherein the topical composition further comprises a growth factor or a bioactive peptide. 5. The method of claim 3, wherein the skin condition is a wound. 6. The method of claim 3, wherein the skin or scalp condition is rhytide, non-enzymatic glycosylation of the skin, sun damage, smoking damage, fibrosis of the skin, acne aestivalis (Mallorca acne), acne conglobate, acne cosmetica (cosmetic acne), acne fulminans (acute febrile ulcerative acne), acne keloidalis nuchae (acne keloidalis, dermatitis papillaris capillitii, folliculitis keloidalis, folliculitis keloidis nuchae, nuchal keloid acne), adult forehead with scattered red pimples, acne vulgaris, dyshidrosis, acne mechanica, acne medicamentosa, acne miliaris necrotica (acne varioliformis), acne vulgaris, acne with facial edema (solid facial edema), blepharophyma, erythrotelangiectatic rosacea (erythematotelangiectatic rosacea, vascular rosacea), excoriated acne (acne excoriée des jeunes filles, Picker's acne), glandular rosacea, gnathophyma, gram-negative rosacea, granulomatous facial dermatitis, adult male with a large, red, bulbous nose, rhinophyma, granulomatous perioral dermatitis, halogen acne, hidradenitis suppurativa (acne inversa, pyoderma fistulans significa, Verneuil's disease), idiopathic facial aseptic granuloma, infantile acne, lupoid rosacea (granulomatous rosacea, micropapular tuberculid, rosacea-like tuberculid of Lewandowsky), lupus miliaris disseminatus faciei, metophyma, neonatal acne (acne infantum, acne neonatorum, neonatal cephalic pustulosis), occupational acne, oil acne, ocular rosacea (ophthalmic rosacea, ophthalmorosacea), otophyma, periorificial dermatitis, persistent edema of rosacea (chronic upper facial erythematous edema, Morbihan's disease, rosaceous lymphedema), phymatous rosacea, pomade acne, papulopustular rosacea (inflammatory rosacea), perifolliculitis capitis abscedens et suffodiens (dissecting cellulitis of the scalp, dissecting folliculitis, perifolliculitis capitis abscedens et suffodiens of Hoffman), perioral dermatitis, periorbital dermatitis (periocular dermatitis), pyoderma faciale (rosacea fulminans), rhinophyma, rosacea (acne rosacea), rosacea conglobate, synovitis-acne-pustulosis-hyperostosis-osteomyelitis syndrome (SAPHO syndrome), steroid rosacea, tar acne, skin cancer (carcinoma and melanoma), tropical acne, psoriasis, including plaque psoriasis, guttate psoriasis, inverse psoriasis, pustular psoriasis, erythrodermic psoriasis, nail psoriasis, psoriatic arthritis, or combinations thereof. 7. The method of claim 3, wherein the skin condition is psoriasis, skin cancer, acne, alopecia, carbuncles, dermatitis, eczema, atopic dermatitis, contact dermatitis, seborrheic dermatitis, cradle cap, perioral dermatitis, shingles, ringworm, melisma, and impetigo. 8. The method of claim 3, wherein the isolated fulvate fraction has an approximate molecular formula of C12H16O9. 9. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight ranging from 300 to 320 Da. 10. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight of about 308.24 Da. 11. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight of about 309 Da. 12. The method of claim 3, wherein the isolated fulvate fraction is present in the topical composition in an amount ranging from about 0.5% to about 65% by weight. 13. The method of claim 4, wherein the growth factor is EGF, PDGF, FGF, TGF-α, TGF-β, NGF, EPO, IGF-I, IGF-II, IL-1α, IL-1β, IL-2, IL-3, IL-4, IL-5, IL-6, IL-7, IL-8, IL-9, IL-10, IL-11, IL-12, IL-13, IFN-α, IFN-β, IFN-γ, TNFα, TNF-β, GM-CSF, M-CSF, VEGF, HGF, KGF, or combinations thereof. 14. The method of claim 4, wherein the bioactive peptide is a tigerinin-based peptide. 15. The method of claim 4, wherein the bioactive peptide is Syndermin palmitoyl tripeptide-1 amide, Synepin palmitoyl sh-tripeptide-3 amide, Binterin palmitoyl sh-tripeptide-4 amide, Winhibin palmitoyl sh-tripeptide-53 amide, Adiponin palmitoyl sh-tripeptide-1 amide, or combinations thereof. 16. The method of claim 3, wherein the topical composition is formulated as a liquid, lotion, cream, gel, cosmetic, or serum. 17. The method of claim 3, wherein applying the topical composition induces recruitment of macrophages, promotes migration and proliferation of keratinocytes and fibroblasts, and promotes cytokine secretion. | Compositions with fulvate fractions alone or in combination with growth factors, bioactive fragmented peptides, or combinations thereof are disclosed herein. Also disclosed are methods of using said compositions for the catalyzing cellular regeneration, including the healing, treatment, or prevention of skin disorders. Also disclosed are methods for extracting, isolating, and purifying fulvate fractions for use in the manufacture of said compositions.1. A composition for treatment of a subject in need of cell regeneration comprising an isolated fulvate fraction having an average molecular weight ranging from 80 to 1200 Da, as measured by vapor pressure osmometry. 2. A method of treating a wound in a subject, comprising:
applying a topical composition to a subject in need thereof, wherein the topical composition comprises an isolated fulvate fraction in an amount of about 0.5% to about 7% by weight, wherein the isolated fulvate fraction has an average molecular weight ranging from 300 to 320 Da, and wherein the isolated fulvate fraction has an approximate molecular formula of C12H16O9. 3. A method of treating a skin or scalp condition in a subject comprising:
applying a therapeutically effective amount of a topical composition to a subject in need thereof, wherein the topical composition comprises an isolated fulvate fraction having an average molecular weight ranging from 80 to 350 Da. 4. The method of claim 3, wherein the topical composition further comprises a growth factor or a bioactive peptide. 5. The method of claim 3, wherein the skin condition is a wound. 6. The method of claim 3, wherein the skin or scalp condition is rhytide, non-enzymatic glycosylation of the skin, sun damage, smoking damage, fibrosis of the skin, acne aestivalis (Mallorca acne), acne conglobate, acne cosmetica (cosmetic acne), acne fulminans (acute febrile ulcerative acne), acne keloidalis nuchae (acne keloidalis, dermatitis papillaris capillitii, folliculitis keloidalis, folliculitis keloidis nuchae, nuchal keloid acne), adult forehead with scattered red pimples, acne vulgaris, dyshidrosis, acne mechanica, acne medicamentosa, acne miliaris necrotica (acne varioliformis), acne vulgaris, acne with facial edema (solid facial edema), blepharophyma, erythrotelangiectatic rosacea (erythematotelangiectatic rosacea, vascular rosacea), excoriated acne (acne excoriée des jeunes filles, Picker's acne), glandular rosacea, gnathophyma, gram-negative rosacea, granulomatous facial dermatitis, adult male with a large, red, bulbous nose, rhinophyma, granulomatous perioral dermatitis, halogen acne, hidradenitis suppurativa (acne inversa, pyoderma fistulans significa, Verneuil's disease), idiopathic facial aseptic granuloma, infantile acne, lupoid rosacea (granulomatous rosacea, micropapular tuberculid, rosacea-like tuberculid of Lewandowsky), lupus miliaris disseminatus faciei, metophyma, neonatal acne (acne infantum, acne neonatorum, neonatal cephalic pustulosis), occupational acne, oil acne, ocular rosacea (ophthalmic rosacea, ophthalmorosacea), otophyma, periorificial dermatitis, persistent edema of rosacea (chronic upper facial erythematous edema, Morbihan's disease, rosaceous lymphedema), phymatous rosacea, pomade acne, papulopustular rosacea (inflammatory rosacea), perifolliculitis capitis abscedens et suffodiens (dissecting cellulitis of the scalp, dissecting folliculitis, perifolliculitis capitis abscedens et suffodiens of Hoffman), perioral dermatitis, periorbital dermatitis (periocular dermatitis), pyoderma faciale (rosacea fulminans), rhinophyma, rosacea (acne rosacea), rosacea conglobate, synovitis-acne-pustulosis-hyperostosis-osteomyelitis syndrome (SAPHO syndrome), steroid rosacea, tar acne, skin cancer (carcinoma and melanoma), tropical acne, psoriasis, including plaque psoriasis, guttate psoriasis, inverse psoriasis, pustular psoriasis, erythrodermic psoriasis, nail psoriasis, psoriatic arthritis, or combinations thereof. 7. The method of claim 3, wherein the skin condition is psoriasis, skin cancer, acne, alopecia, carbuncles, dermatitis, eczema, atopic dermatitis, contact dermatitis, seborrheic dermatitis, cradle cap, perioral dermatitis, shingles, ringworm, melisma, and impetigo. 8. The method of claim 3, wherein the isolated fulvate fraction has an approximate molecular formula of C12H16O9. 9. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight ranging from 300 to 320 Da. 10. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight of about 308.24 Da. 11. The method of claim 3, wherein the isolated fulvate fraction has an average molecular weight of about 309 Da. 12. The method of claim 3, wherein the isolated fulvate fraction is present in the topical composition in an amount ranging from about 0.5% to about 65% by weight. 13. The method of claim 4, wherein the growth factor is EGF, PDGF, FGF, TGF-α, TGF-β, NGF, EPO, IGF-I, IGF-II, IL-1α, IL-1β, IL-2, IL-3, IL-4, IL-5, IL-6, IL-7, IL-8, IL-9, IL-10, IL-11, IL-12, IL-13, IFN-α, IFN-β, IFN-γ, TNFα, TNF-β, GM-CSF, M-CSF, VEGF, HGF, KGF, or combinations thereof. 14. The method of claim 4, wherein the bioactive peptide is a tigerinin-based peptide. 15. The method of claim 4, wherein the bioactive peptide is Syndermin palmitoyl tripeptide-1 amide, Synepin palmitoyl sh-tripeptide-3 amide, Binterin palmitoyl sh-tripeptide-4 amide, Winhibin palmitoyl sh-tripeptide-53 amide, Adiponin palmitoyl sh-tripeptide-1 amide, or combinations thereof. 16. The method of claim 3, wherein the topical composition is formulated as a liquid, lotion, cream, gel, cosmetic, or serum. 17. The method of claim 3, wherein applying the topical composition induces recruitment of macrophages, promotes migration and proliferation of keratinocytes and fibroblasts, and promotes cytokine secretion. | 3,700 |
347,175 | 16,805,631 | 3,735 | This disclosure provides systems, methods and apparatus where a user equipment (UE) may indicate different physical downlink control channel (PDCCH) monitoring capabilities (such as UE capabilities in terms of the number of control channel elements (CCEs), blind decodes (BDs), number of downlink control information (DCI) formats, etc.) per monitoring span or slot. For example, a UE may support a different number of CCEs per slot or a different number of DCIs per monitoring span for different service types (such as a different number of CCEs for enhanced mobile broadband (eMBB) and for ultra-reliable low latency communications (URLLC)). A UE may indicate different sets of PDCCH monitoring capabilities (such as sets of PDCCH monitoring capabilities for different service types, monitoring spans, slots, etc.). A base station may receive the indication of UE PDCCH monitoring capability information, and may configure the UE with one or more monitoring occasions accordingly. | 1. An apparatus for wireless communications at a user equipment (UE), comprising:
a processor; memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify a first set of physical downlink control channel (PDCCH) monitoring capabilities indicating PDCCH monitoring per span and a second set of PDCCH monitoring capabilities indicating PDCCH monitoring per slot;
transmit an indication of PDCCH monitoring capabilities for transmission, wherein the indication includes both the first set and the second set of PDCCH monitoring capabilities;
receive a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the indication;
monitor one or more search space sets, in accordance with the received configuration, for control information during the one or more PDCCH monitoring occasions; and
decode the control information within the one or more PDCCH monitoring occasions. 2. (canceled) 3. The apparatus of claim 1, wherein the PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a span pattern, a number of blind decodes, a number of downlink control information formats configurable for monitoring, or some combination thereof. 4. The apparatus of claim 1, wherein the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities are associated with a service type, a number of downlink control information formats, or some combination thereof. 5. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus configured to:
identify one or more component carriers in a band or band combination that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the one or more component carriers in the band or band combination that are supported for each of the first set and the second set. 6. The apparatus of claim 1, wherein the configuration includes a first configuration for a first set of PDCCH monitoring occasions based at least in part on the first set of PDCCH monitoring capabilities, a second configuration for a second set of PDCCH monitoring occasions based at least in part on the second set of PDCCH monitoring capabilities, or both. 7. The apparatus of claim 6, wherein the first configuration and the second configuration indicate two or more monitoring occasions or two or more monitoring spans that collide in time. 8. The apparatus of claim 7, wherein the instructions are further executable by the processor to cause the apparatus to:
monitor for one or more downlink control information formats associated with each of the two or more monitoring occasions or the two or more monitoring spans that collide in time during the two or more monitoring occasions or the two or more monitoring spans. 9. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus configured to:
identify a number of multiple input multiple output layers, a transport block size, a number of resource blocks, a processing timing parameter, or some combination thereof, that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the number of multiple input multiple output layers, the transport block size, the number of resource blocks, the processing timing parameter, or some combination thereof, that are supported for each of the first set and the second set. 10. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus to:
identify a band or band combination associated with a first PDCCH monitoring occasion; and identify PDCCH monitoring capability information based at least in part on the band or band combination, wherein the indication includes the PDCCH monitoring capability information. 11. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus to:
identify PDCCH monitoring capability information based at least in part on a minimum time separation between the start of two spans, a maximum span length in which PDCCH is configured to be monitored with same start symbol, a carrier aggregation capability, a multiple input multiple output capability, shared channel limitations, processing power capability, or some combination thereof, wherein the indication includes the PDCCH monitoring capability information. 12. The apparatus of claim 11, wherein the PDCCH monitoring capability information includes a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, or both. 13. The apparatus of claim 1, wherein the configuration includes, for each of the one or more PDCCH monitoring occasions, an identification parameter associated with the base station, a PDCCH monitoring occasion identification parameter, a PDCCH monitoring occasion index value, a PDCCH monitoring occasion frequency parameter, a number of consecutive symbols parameter, a number of different search space sets, one or more component carriers, an identification parameter associated with one or more downlink control information formats, an identification parameter associated with one or more service types, an identification parameter associated with one or more UE PDCCH monitoring capabilities, or any combination thereof. 14. A method for wireless communications at an apparatus of a user equipment (UE), comprising:
identifying a first set of physical downlink control channel (PDCCH) monitoring capabilities indicating PDCCH monitoring per span and a second set of PDCCH monitoring capabilities indicating PDCCH monitoring per slot; transmitting an indication of PDCCH monitoring capabilities to a base station, wherein the indication includes both the first set and the second set; receiving a configuration for one or more PDCCH monitoring occasions from the base station, wherein the configuration is based at least in part on the transmitted indication; monitoring one or more search space sets, in accordance with the received configuration, for control information during the one or more PDCCH monitoring occasions; and decoding the control information within the one or more PDCCH monitoring occasions. 15. (canceled) 16. The method of claim 14, wherein the PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a number of blind decodes, a number of downlink control information formats configurable for monitoring, or some combination thereof. 17. The method of claim 14, wherein the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities are associated with a service type, a number of downlink control information formats, or some combination thereof. 18. The method of claim 14, further comprising:
identifying one or more component carriers in a band or band combination that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the one or more component carriers in the band or band combination that are supported for each of the first set and the second set. 19. The method of claim 14, wherein the received configuration includes a first configuration for a first set of PDCCH monitoring occasions based at least in part on the first set of PDCCH monitoring capabilities, a second configuration for a second set of PDCCH monitoring occasions based at least in part on the second set of PDCCH monitoring capabilities, or both. 20. The method of claim 19, wherein the first configuration and the second configuration indicate two or more monitoring occasions or two or more monitoring spans that collide in time. 21. The method of claim 20, further comprising:
monitoring for one or more downlink control information formats associated with each of the two or more monitoring occasions or the two or more monitoring spans that collide in time during the two or more monitoring occasions or the two or more monitoring spans. 22. The method of claim 14, further comprising:
identifying a number of multiple input multiple output layers, a transport block size, a number of resource blocks, a processing timing parameter, or some combination thereof, that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the number of multiple input multiple output layers, the transport block size, the number of resource blocks, the processing timing parameter, or some combination thereof, that are supported for each of the first set and the second set. 23. The method of claim 14, further comprising:
identifying a band or band combination associated with a first PDCCH monitoring occasion; and identifying PDCCH capability information based at least in part on the band or band combination, wherein the indication includes the PDCCH monitoring capability information. 24. The method of claim 14, further comprising:
identifying PDCCH monitoring capability information based at least in part on a minimum time separation between the start of two spans, a maximum span length in which PDCCH is configured to be monitored with same start symbol, a carrier aggregation capability, a multiple input multiple output capability, shared channel limitations, processing power capability, or some combination thereof, wherein the indication includes the PDCCH monitoring capability information. 25. The method of claim 24, wherein the PDCCH monitoring capability information includes a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, or both. 26. The method of claim 14, wherein the configuration includes, for each of the one or more PDCCH monitoring occasions, an identification parameter associated with the base station, a PDCCH monitoring occasion identification parameter, a PDCCH monitoring occasion index value, a PDCCH monitoring occasion frequency parameter, a number of consecutive symbols parameter, a number of different search space sets, one or more component carriers, an identification parameter associated with one or more downlink control information formats, an identification parameter associated with one or more service types, an identification parameter associated with one or more UE PDCCH monitoring capabilities, or any combination thereof. 27. An apparatus for wireless communications at a base station, comprising:
a processor; memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive an indication of user equipment (UE) physical downlink control channel (PDCCH) monitoring capabilities;
identify a first set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per span and a second set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per slot based at least in part on the received indication;
determine a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the received indication;
transmit the configuration for transmission; and
transmit, in accordance with the transmitted configuration, control information for transmission during the one or more PDCCH monitoring occasions. 28. The apparatus of claim 27, wherein the instructions are further executable by the processor to cause the apparatus to:
identify UE PDCCH monitoring capability information based at least in part on the indication, wherein the configuration for one or more PDCCH monitoring occasions is determined based at least in part on the UE PDCCH monitoring capability information. 29. The apparatus of claim 28, wherein the UE PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, a number of downlink control information formats configurable for monitoring, or some combination thereof. 30-36. (canceled) 37. A method for wireless communications at an apparatus of a base station, comprising:
receiving an indication of user equipment (UE) physical downlink control channel (PDCCH) monitoring capabilities from a UE; identifying a first set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per span and a second set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per slot based at least in part on the received indication; determining a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the received indication; transmitting the configuration to the UE; and transmitting, in accordance with the transmitted configuration, control information during the one or more PDCCH monitoring occasions. 38. The method of claim 37, further comprising:
identifying UE PDCCH monitoring capability information based at least in part on the received indication, wherein the configuration for one or more PDCCH monitoring occasions is determined based at least in part on the UE PDCCH monitoring capability information. 39-40. (canceled) 41. The method of claim 37, further comprising:
determining a first configuration for a first set of one or more PDCCH monitoring occasions based at least in part on the first set of UE PDCCH monitoring capabilities; and determining a second configuration for a second set of one or more PDCCH monitoring occasions based at least in part on the second set of UE PDCCH monitoring capabilities, wherein the configuration transmitted to the UE includes the first configuration and the second configuration. 42-92. (canceled) | This disclosure provides systems, methods and apparatus where a user equipment (UE) may indicate different physical downlink control channel (PDCCH) monitoring capabilities (such as UE capabilities in terms of the number of control channel elements (CCEs), blind decodes (BDs), number of downlink control information (DCI) formats, etc.) per monitoring span or slot. For example, a UE may support a different number of CCEs per slot or a different number of DCIs per monitoring span for different service types (such as a different number of CCEs for enhanced mobile broadband (eMBB) and for ultra-reliable low latency communications (URLLC)). A UE may indicate different sets of PDCCH monitoring capabilities (such as sets of PDCCH monitoring capabilities for different service types, monitoring spans, slots, etc.). A base station may receive the indication of UE PDCCH monitoring capability information, and may configure the UE with one or more monitoring occasions accordingly.1. An apparatus for wireless communications at a user equipment (UE), comprising:
a processor; memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify a first set of physical downlink control channel (PDCCH) monitoring capabilities indicating PDCCH monitoring per span and a second set of PDCCH monitoring capabilities indicating PDCCH monitoring per slot;
transmit an indication of PDCCH monitoring capabilities for transmission, wherein the indication includes both the first set and the second set of PDCCH monitoring capabilities;
receive a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the indication;
monitor one or more search space sets, in accordance with the received configuration, for control information during the one or more PDCCH monitoring occasions; and
decode the control information within the one or more PDCCH monitoring occasions. 2. (canceled) 3. The apparatus of claim 1, wherein the PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a span pattern, a number of blind decodes, a number of downlink control information formats configurable for monitoring, or some combination thereof. 4. The apparatus of claim 1, wherein the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities are associated with a service type, a number of downlink control information formats, or some combination thereof. 5. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus configured to:
identify one or more component carriers in a band or band combination that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the one or more component carriers in the band or band combination that are supported for each of the first set and the second set. 6. The apparatus of claim 1, wherein the configuration includes a first configuration for a first set of PDCCH monitoring occasions based at least in part on the first set of PDCCH monitoring capabilities, a second configuration for a second set of PDCCH monitoring occasions based at least in part on the second set of PDCCH monitoring capabilities, or both. 7. The apparatus of claim 6, wherein the first configuration and the second configuration indicate two or more monitoring occasions or two or more monitoring spans that collide in time. 8. The apparatus of claim 7, wherein the instructions are further executable by the processor to cause the apparatus to:
monitor for one or more downlink control information formats associated with each of the two or more monitoring occasions or the two or more monitoring spans that collide in time during the two or more monitoring occasions or the two or more monitoring spans. 9. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus configured to:
identify a number of multiple input multiple output layers, a transport block size, a number of resource blocks, a processing timing parameter, or some combination thereof, that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the number of multiple input multiple output layers, the transport block size, the number of resource blocks, the processing timing parameter, or some combination thereof, that are supported for each of the first set and the second set. 10. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus to:
identify a band or band combination associated with a first PDCCH monitoring occasion; and identify PDCCH monitoring capability information based at least in part on the band or band combination, wherein the indication includes the PDCCH monitoring capability information. 11. The apparatus of claim 1, wherein the instructions are further executable by the processor to cause the apparatus to:
identify PDCCH monitoring capability information based at least in part on a minimum time separation between the start of two spans, a maximum span length in which PDCCH is configured to be monitored with same start symbol, a carrier aggregation capability, a multiple input multiple output capability, shared channel limitations, processing power capability, or some combination thereof, wherein the indication includes the PDCCH monitoring capability information. 12. The apparatus of claim 11, wherein the PDCCH monitoring capability information includes a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, or both. 13. The apparatus of claim 1, wherein the configuration includes, for each of the one or more PDCCH monitoring occasions, an identification parameter associated with the base station, a PDCCH monitoring occasion identification parameter, a PDCCH monitoring occasion index value, a PDCCH monitoring occasion frequency parameter, a number of consecutive symbols parameter, a number of different search space sets, one or more component carriers, an identification parameter associated with one or more downlink control information formats, an identification parameter associated with one or more service types, an identification parameter associated with one or more UE PDCCH monitoring capabilities, or any combination thereof. 14. A method for wireless communications at an apparatus of a user equipment (UE), comprising:
identifying a first set of physical downlink control channel (PDCCH) monitoring capabilities indicating PDCCH monitoring per span and a second set of PDCCH monitoring capabilities indicating PDCCH monitoring per slot; transmitting an indication of PDCCH monitoring capabilities to a base station, wherein the indication includes both the first set and the second set; receiving a configuration for one or more PDCCH monitoring occasions from the base station, wherein the configuration is based at least in part on the transmitted indication; monitoring one or more search space sets, in accordance with the received configuration, for control information during the one or more PDCCH monitoring occasions; and decoding the control information within the one or more PDCCH monitoring occasions. 15. (canceled) 16. The method of claim 14, wherein the PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a number of blind decodes, a number of downlink control information formats configurable for monitoring, or some combination thereof. 17. The method of claim 14, wherein the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities are associated with a service type, a number of downlink control information formats, or some combination thereof. 18. The method of claim 14, further comprising:
identifying one or more component carriers in a band or band combination that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the one or more component carriers in the band or band combination that are supported for each of the first set and the second set. 19. The method of claim 14, wherein the received configuration includes a first configuration for a first set of PDCCH monitoring occasions based at least in part on the first set of PDCCH monitoring capabilities, a second configuration for a second set of PDCCH monitoring occasions based at least in part on the second set of PDCCH monitoring capabilities, or both. 20. The method of claim 19, wherein the first configuration and the second configuration indicate two or more monitoring occasions or two or more monitoring spans that collide in time. 21. The method of claim 20, further comprising:
monitoring for one or more downlink control information formats associated with each of the two or more monitoring occasions or the two or more monitoring spans that collide in time during the two or more monitoring occasions or the two or more monitoring spans. 22. The method of claim 14, further comprising:
identifying a number of multiple input multiple output layers, a transport block size, a number of resource blocks, a processing timing parameter, or some combination thereof, that are supported for each of the first set of PDCCH monitoring capabilities and the second set of PDCCH monitoring capabilities, wherein the indication includes the number of multiple input multiple output layers, the transport block size, the number of resource blocks, the processing timing parameter, or some combination thereof, that are supported for each of the first set and the second set. 23. The method of claim 14, further comprising:
identifying a band or band combination associated with a first PDCCH monitoring occasion; and identifying PDCCH capability information based at least in part on the band or band combination, wherein the indication includes the PDCCH monitoring capability information. 24. The method of claim 14, further comprising:
identifying PDCCH monitoring capability information based at least in part on a minimum time separation between the start of two spans, a maximum span length in which PDCCH is configured to be monitored with same start symbol, a carrier aggregation capability, a multiple input multiple output capability, shared channel limitations, processing power capability, or some combination thereof, wherein the indication includes the PDCCH monitoring capability information. 25. The method of claim 24, wherein the PDCCH monitoring capability information includes a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, or both. 26. The method of claim 14, wherein the configuration includes, for each of the one or more PDCCH monitoring occasions, an identification parameter associated with the base station, a PDCCH monitoring occasion identification parameter, a PDCCH monitoring occasion index value, a PDCCH monitoring occasion frequency parameter, a number of consecutive symbols parameter, a number of different search space sets, one or more component carriers, an identification parameter associated with one or more downlink control information formats, an identification parameter associated with one or more service types, an identification parameter associated with one or more UE PDCCH monitoring capabilities, or any combination thereof. 27. An apparatus for wireless communications at a base station, comprising:
a processor; memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive an indication of user equipment (UE) physical downlink control channel (PDCCH) monitoring capabilities;
identify a first set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per span and a second set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per slot based at least in part on the received indication;
determine a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the received indication;
transmit the configuration for transmission; and
transmit, in accordance with the transmitted configuration, control information for transmission during the one or more PDCCH monitoring occasions. 28. The apparatus of claim 27, wherein the instructions are further executable by the processor to cause the apparatus to:
identify UE PDCCH monitoring capability information based at least in part on the indication, wherein the configuration for one or more PDCCH monitoring occasions is determined based at least in part on the UE PDCCH monitoring capability information. 29. The apparatus of claim 28, wherein the UE PDCCH monitoring capability information includes a number of control channel elements per slot, a number of control channel elements per PDCCH monitoring span, a number of control channel elements supported per PDCCH monitoring occasion, a number of blind decodes supported per PDCCH monitoring occasion, a number of downlink control information formats configurable for monitoring, or some combination thereof. 30-36. (canceled) 37. A method for wireless communications at an apparatus of a base station, comprising:
receiving an indication of user equipment (UE) physical downlink control channel (PDCCH) monitoring capabilities from a UE; identifying a first set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per span and a second set of UE PDCCH monitoring capabilities indicating PDCCH monitoring per slot based at least in part on the received indication; determining a configuration for one or more PDCCH monitoring occasions, wherein the configuration is based at least in part on the received indication; transmitting the configuration to the UE; and transmitting, in accordance with the transmitted configuration, control information during the one or more PDCCH monitoring occasions. 38. The method of claim 37, further comprising:
identifying UE PDCCH monitoring capability information based at least in part on the received indication, wherein the configuration for one or more PDCCH monitoring occasions is determined based at least in part on the UE PDCCH monitoring capability information. 39-40. (canceled) 41. The method of claim 37, further comprising:
determining a first configuration for a first set of one or more PDCCH monitoring occasions based at least in part on the first set of UE PDCCH monitoring capabilities; and determining a second configuration for a second set of one or more PDCCH monitoring occasions based at least in part on the second set of UE PDCCH monitoring capabilities, wherein the configuration transmitted to the UE includes the first configuration and the second configuration. 42-92. (canceled) | 3,700 |
347,176 | 16,805,670 | 3,735 | A plasma generating system includes a waveguide for transmitting a microwave energy therethrough and an inner wall disposed within the waveguide to define a plasma cavity, where a plasma is generated within the plasma cavity using the microwave energy. The plasma generating system further includes: an adaptor having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and a recuperator directly attached to the adaptor and having a gas passageway that is in fluid communication with the gas outlet in the adaptor. The recuperator recovers heat energy from the exhaust gas and heats an input gas using the heat energy. | 1. A plasma generating system, comprising:
a plasma cavity for generating a plasma therewithin; an adaptor having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and a recuperator directly attached to the adaptor and having a gas passageway that is in fluid communication with the gas outlet in the adaptor, the recuperator being configured to recover heat energy from the exhaust gas and to heat an input gas using the heat energy, where the input gas heated by the recuperator is input to the plasma cavity. 2. A plasma generating system as recited in claim 1, wherein the recuperator has an enclosed space thereinside and one or more baffles that are disposed inside the enclosed space and transfer heat energy to the input gas. 3. A plasma generating system as recited in claim 1, wherein the recuperator has one or more baffles that are disposed in the gas passageway and wherein the one or more baffles recover heat energy from the exhaust gas. 4. A plasma generating system as recited in claim 3, wherein each of the one or more baffles is arranged in parallel to a flow direction of the exhaust gas exiting the gas outlet. 5. A plasma generating system as recited in claim 3, wherein each of the one or more baffles is rifled relative to a flow direction of the exhaust gas exiting the gas outlet. 6. A plasma generating system as recited in claim 1, wherein the recuperator has an enclosed space thereinside, a gas inlet through which the input gas flows into the enclosed space and a gas outlet through the input gas heated using the heat energy exits the enclosed space. 7. A plasma generating system as recited in claim 6, wherein the recuperator has a cap that is in direct contact with a bottom wall of the adaptor and the gas outlet of the recuperator is formed in the cap and wherein the bottom wall of the adaptor has a gas inlet and wherein the gas outlet of the recuperator is aligned with the gas inlet of the adaptor so that the input gas heated in the enclosed space flows into the adaptor through gas outlet of the recuperator and the gas inlet of the adaptor. 8. A plasma generating system as recited in claim 6, further comprising:
a flow inlet configured to introduce the input gas heated by the recuperator into the plasma cavity; and a pipe having one end coupled to the gas outlet of the recuperator and an other end to the flow inlet, wherein the input gas heated by the recuperator passes through the pipe. 9. A plasma generating system as recited in claim 8, further comprising:
a waveguide for transmitting a microwave energy therethrough; and an inner wall disposed within the waveguide to define the plasma cavity, a plasma being generated within the plasma cavity using the microwave energy, wherein the adaptor is mounted on a bottom side of the waveguide and the flow inlet is mounted on a top side of the waveguide. 10. A plasma generating system as recited in claim 8, wherein the flow inlet introduces the input gas as a vortex flow into the plasma cavity. 11. A plasma generating system as recited in claim 8, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and protruding into the plasma cavity, wherein a portion of the flow inlet is disposed inside the plasma stabilizer. 12. A plasma generating system as recited in claim 1, wherein the adaptor is configured to generate a vortex flow within the plasma cavity using the input gas heated by the recuperator. 13. A plasma generating system as recited in claim 12, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and disposed on the adaptor, wherein a longitudinal direction of the plasma stabilizer is parallel to a rotational axis of the vortex flow. 14. A plasma generating system as recited in claim 1, wherein the adaptor and the recuperator are formed as one monolithic body. 15. A plasma generating system, comprising:
a waveguide for transmitting a microwave energy therethrough; an inner wall disposed within the waveguide to define a plasma cavity, a plasma being generated within the plasma cavity using the microwave energy, the waveguide having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; a recuperator directly attached to the waveguide and having a gas passageway that is in fluid communication with the gas outlet in the waveguide, the recuperator being configured to recover heat energy from the exhaust gas and to heat an input gas using the heat energy; a gas inlet mounted on the waveguide and configured to receive the input gas from the recuperator and introduce the input gas into the plasma cavity; and a pipe having one end coupled to the recuperator and an other end coupled to the gas inlet, wherein the input gas flows from the recuperator to the gas inlet through the pipe. 16. A plasma generating system as recited in claim 15, wherein the recuperator has an enclosed space thereinside and one or more baffles disposed inside the enclosed space and wherein heat energy is transferred from the one or more baffles to the inlet gas. 17. A plasma generating system as recited in claim 15, wherein the recuperator has one or more baffles that are disposed in the gas passageway and wherein the one or more baffles recover heat energy from the exhaust gas. 18. A plasma generating system as recited in claim 15, wherein each of the one or more baffles is arranged in parallel to a flow direction of the exhaust gas exiting the gas outlet. 19. A plasma generating system as recited in claim 15, wherein each of the one or more baffles is rifled relative to a flow direction of the exhaust gas exiting the gas outlet. 20. A plasma generating system as recited in claim 15, wherein the gas inlet is configured to introduce the input gas into the plasma cavity as a vortex flow. 21. A plasma generating system as recited in claim 15, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and protruding into the plasma cavity, wherein as portion of the gas inlet is disposed inside the plasma stabilizer. | A plasma generating system includes a waveguide for transmitting a microwave energy therethrough and an inner wall disposed within the waveguide to define a plasma cavity, where a plasma is generated within the plasma cavity using the microwave energy. The plasma generating system further includes: an adaptor having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and a recuperator directly attached to the adaptor and having a gas passageway that is in fluid communication with the gas outlet in the adaptor. The recuperator recovers heat energy from the exhaust gas and heats an input gas using the heat energy.1. A plasma generating system, comprising:
a plasma cavity for generating a plasma therewithin; an adaptor having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and a recuperator directly attached to the adaptor and having a gas passageway that is in fluid communication with the gas outlet in the adaptor, the recuperator being configured to recover heat energy from the exhaust gas and to heat an input gas using the heat energy, where the input gas heated by the recuperator is input to the plasma cavity. 2. A plasma generating system as recited in claim 1, wherein the recuperator has an enclosed space thereinside and one or more baffles that are disposed inside the enclosed space and transfer heat energy to the input gas. 3. A plasma generating system as recited in claim 1, wherein the recuperator has one or more baffles that are disposed in the gas passageway and wherein the one or more baffles recover heat energy from the exhaust gas. 4. A plasma generating system as recited in claim 3, wherein each of the one or more baffles is arranged in parallel to a flow direction of the exhaust gas exiting the gas outlet. 5. A plasma generating system as recited in claim 3, wherein each of the one or more baffles is rifled relative to a flow direction of the exhaust gas exiting the gas outlet. 6. A plasma generating system as recited in claim 1, wherein the recuperator has an enclosed space thereinside, a gas inlet through which the input gas flows into the enclosed space and a gas outlet through the input gas heated using the heat energy exits the enclosed space. 7. A plasma generating system as recited in claim 6, wherein the recuperator has a cap that is in direct contact with a bottom wall of the adaptor and the gas outlet of the recuperator is formed in the cap and wherein the bottom wall of the adaptor has a gas inlet and wherein the gas outlet of the recuperator is aligned with the gas inlet of the adaptor so that the input gas heated in the enclosed space flows into the adaptor through gas outlet of the recuperator and the gas inlet of the adaptor. 8. A plasma generating system as recited in claim 6, further comprising:
a flow inlet configured to introduce the input gas heated by the recuperator into the plasma cavity; and a pipe having one end coupled to the gas outlet of the recuperator and an other end to the flow inlet, wherein the input gas heated by the recuperator passes through the pipe. 9. A plasma generating system as recited in claim 8, further comprising:
a waveguide for transmitting a microwave energy therethrough; and an inner wall disposed within the waveguide to define the plasma cavity, a plasma being generated within the plasma cavity using the microwave energy, wherein the adaptor is mounted on a bottom side of the waveguide and the flow inlet is mounted on a top side of the waveguide. 10. A plasma generating system as recited in claim 8, wherein the flow inlet introduces the input gas as a vortex flow into the plasma cavity. 11. A plasma generating system as recited in claim 8, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and protruding into the plasma cavity, wherein a portion of the flow inlet is disposed inside the plasma stabilizer. 12. A plasma generating system as recited in claim 1, wherein the adaptor is configured to generate a vortex flow within the plasma cavity using the input gas heated by the recuperator. 13. A plasma generating system as recited in claim 12, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and disposed on the adaptor, wherein a longitudinal direction of the plasma stabilizer is parallel to a rotational axis of the vortex flow. 14. A plasma generating system as recited in claim 1, wherein the adaptor and the recuperator are formed as one monolithic body. 15. A plasma generating system, comprising:
a waveguide for transmitting a microwave energy therethrough; an inner wall disposed within the waveguide to define a plasma cavity, a plasma being generated within the plasma cavity using the microwave energy, the waveguide having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; a recuperator directly attached to the waveguide and having a gas passageway that is in fluid communication with the gas outlet in the waveguide, the recuperator being configured to recover heat energy from the exhaust gas and to heat an input gas using the heat energy; a gas inlet mounted on the waveguide and configured to receive the input gas from the recuperator and introduce the input gas into the plasma cavity; and a pipe having one end coupled to the recuperator and an other end coupled to the gas inlet, wherein the input gas flows from the recuperator to the gas inlet through the pipe. 16. A plasma generating system as recited in claim 15, wherein the recuperator has an enclosed space thereinside and one or more baffles disposed inside the enclosed space and wherein heat energy is transferred from the one or more baffles to the inlet gas. 17. A plasma generating system as recited in claim 15, wherein the recuperator has one or more baffles that are disposed in the gas passageway and wherein the one or more baffles recover heat energy from the exhaust gas. 18. A plasma generating system as recited in claim 15, wherein each of the one or more baffles is arranged in parallel to a flow direction of the exhaust gas exiting the gas outlet. 19. A plasma generating system as recited in claim 15, wherein each of the one or more baffles is rifled relative to a flow direction of the exhaust gas exiting the gas outlet. 20. A plasma generating system as recited in claim 15, wherein the gas inlet is configured to introduce the input gas into the plasma cavity as a vortex flow. 21. A plasma generating system as recited in claim 15, further comprising:
a plasma stabilizer having a shape of a circular hollow cylinder and protruding into the plasma cavity, wherein as portion of the gas inlet is disposed inside the plasma stabilizer. | 3,700 |
347,177 | 16,805,610 | 3,735 | Described herein are methods and systems of distributed acoustic sensing, such as in an urban or metropolitan area involving a dedicated and established fibre optic communications network including a data centre. In general, the disclosed method and system includes the steps of (a) selecting an optical fibre cable installation having a path extending across a selected geographical area, the optical fibre cable installation including a bundle of optical fibres and forming part of a fibre-optic communications network, (b) determining characteristics associated with the optical fibre and/or the selected optical fibre installation, (c) transmitting outgoing light in the optical fibre, (d) receiving reflected light back scattered along the optical fibre, and (e) based on the reflected light and the determined characteristics, generating an alert signal representative of an acoustic event. The disclosed method and system may be useful in the detection of acoustic events near or within the selected geographical area. | 1. A system for distributed acoustic sensing, the system including:
a distributed sensing unit for:
transmitting outgoing light in an optical fibre;
receiving reflected light back scattered along the optical fibre, the reflected light including fluctuations over time; and
based on the fluctuations, generating an alert signal representative of an acoustic event, and
an optical switch for coupling the distributed sensing unit to a selected one of multiple optical fibre cable installations, each installation having a path extending across a respective selected geographical area and including a bundle of optical fibres and forming part of a dedicated fibre-optic telecommunications network, the bundle of optical fibres including an unused channel or unlit optical fibre for communication. 2. The system of claim 1, wherein the optical switch and the distributed sensing unit are located in a data center connecting to an enterprise network. 3. The system of claim 1, wherein the multiple fibre cable installations are connected to or terminated at the data center. | Described herein are methods and systems of distributed acoustic sensing, such as in an urban or metropolitan area involving a dedicated and established fibre optic communications network including a data centre. In general, the disclosed method and system includes the steps of (a) selecting an optical fibre cable installation having a path extending across a selected geographical area, the optical fibre cable installation including a bundle of optical fibres and forming part of a fibre-optic communications network, (b) determining characteristics associated with the optical fibre and/or the selected optical fibre installation, (c) transmitting outgoing light in the optical fibre, (d) receiving reflected light back scattered along the optical fibre, and (e) based on the reflected light and the determined characteristics, generating an alert signal representative of an acoustic event. The disclosed method and system may be useful in the detection of acoustic events near or within the selected geographical area.1. A system for distributed acoustic sensing, the system including:
a distributed sensing unit for:
transmitting outgoing light in an optical fibre;
receiving reflected light back scattered along the optical fibre, the reflected light including fluctuations over time; and
based on the fluctuations, generating an alert signal representative of an acoustic event, and
an optical switch for coupling the distributed sensing unit to a selected one of multiple optical fibre cable installations, each installation having a path extending across a respective selected geographical area and including a bundle of optical fibres and forming part of a dedicated fibre-optic telecommunications network, the bundle of optical fibres including an unused channel or unlit optical fibre for communication. 2. The system of claim 1, wherein the optical switch and the distributed sensing unit are located in a data center connecting to an enterprise network. 3. The system of claim 1, wherein the multiple fibre cable installations are connected to or terminated at the data center. | 3,700 |
347,178 | 16,805,680 | 3,772 | An apparatus for styling hair includes a hinged frame two arms and a hinge. A platen for engaging hair and having a plurality of through holes arranged in a pattern has a mounted surface against a first one of the arms and a free surface facing a second one of the two arms. A pin carrier is interposed between the first one of the arms and the flat plate, having a plurality of pins arranged in the pattern for inserting into the through holes. A mechanism is coupled to the pin carrier, movable between an extended state wherein the plurality of pins protrudes above the free surface and a retracted state wherein the plurality of pins are retracted below the free surface. The perforated platen and a mating platen can be heated for styling hair and a user can easily move the pins between the engaged and retracted states. | 1. An apparatus for styling hair, comprising:
a hinged frame comprising two opposing arms and a hinge; a perforated platen for engaging hair comprising a plurality of through holes arranged in a pattern, having a mounted surface against a first one of the arms and a free surface facing a second one of the two arms; a pin carrier interposed between the first one of the arms and the perforated plate, comprising a plurality of pins coupled to a substrate and arranged in the pattern for inserting into the through holes; and a mechanism coupled to the pin carrier, movable between an extended state wherein the plurality of pins protrude above the free surface and a retracted state wherein the plurality of pins are retracted below the free surface. 2. The apparatus of claim 1, further comprising a sliding actuator coupled to the mechanism for moving the mechanism between the extended state and the retracted state. 3. The apparatus of claim 2, further comprising a resilient spring biasing the pin carrier towards one of the extended state and the retracted state. 4. The apparatus of claim 2, further comprising a ramp disposed against the pin carrier, positioned for transforming motion of the pin carrier parallel to the perforated platen into motion perpendicular to the perforated platen. 5. The apparatus of claim 4, wherein the ramp is formed in a frame of the mechanism fixed to the first one of the two arms. 6. The apparatus of claim 2, wherein the sliding actuator comprises a manual actuator mounted in a receiver of the hinged frame. 7. The apparatus of claim 1, wherein the mechanism comprises an assembly of components. 8. The apparatus of claim 1, wherein each of the plurality of pins comprises a stainless steel material. 9. The apparatus of claim 8, wherein each of the plurality of pins has a diameter in a range of 0.5 to 1.5 mm. 10. The apparatus of claim 8, wherein each of the plurality of pins has length in a range of 1 to 4 mm. 11. The apparatus of claim 8, wherein the stainless steel material is coated with one of a ceramic or fluoropolymer. 12. The apparatus of claim 1, wherein the pin carrier comprises two separate pieces, each holding two rows of the plurality of pins. 13. The apparatus of claim 12, wherein pins in a first of the two rows are spaced apart a uniform amount that is less than spacing between pins in a second of the two rows. 14. The apparatus of claim 13, wherein each of the two separate pieces is positioned relative to the perforated platen so the first of the two rows is along and closer to an edge of the perforated platen than the second of the two rows. 15. The apparatus of claim 1, wherein the perforated platen is flat and smooth on its free surface. 16. The apparatus of claim 1, wherein the perforated platen is in conductive communication with a resistive heating element. 17. The apparatus of claim 1, further comprising a water reservoir for producing steam. 18. The apparatus of claim 1, further comprising a second platen mounted to the second arm opposite to the perforated platen. 19. The apparatus of claim 1, wherein the through holes have cylindrical walls. 20. The apparatus of claim 1, wherein the pattern of through holes include a row of more closely-spaced holes along each long edge of the smooth plate, and two or more rows of more widely-spaced holes there between. | An apparatus for styling hair includes a hinged frame two arms and a hinge. A platen for engaging hair and having a plurality of through holes arranged in a pattern has a mounted surface against a first one of the arms and a free surface facing a second one of the two arms. A pin carrier is interposed between the first one of the arms and the flat plate, having a plurality of pins arranged in the pattern for inserting into the through holes. A mechanism is coupled to the pin carrier, movable between an extended state wherein the plurality of pins protrudes above the free surface and a retracted state wherein the plurality of pins are retracted below the free surface. The perforated platen and a mating platen can be heated for styling hair and a user can easily move the pins between the engaged and retracted states.1. An apparatus for styling hair, comprising:
a hinged frame comprising two opposing arms and a hinge; a perforated platen for engaging hair comprising a plurality of through holes arranged in a pattern, having a mounted surface against a first one of the arms and a free surface facing a second one of the two arms; a pin carrier interposed between the first one of the arms and the perforated plate, comprising a plurality of pins coupled to a substrate and arranged in the pattern for inserting into the through holes; and a mechanism coupled to the pin carrier, movable between an extended state wherein the plurality of pins protrude above the free surface and a retracted state wherein the plurality of pins are retracted below the free surface. 2. The apparatus of claim 1, further comprising a sliding actuator coupled to the mechanism for moving the mechanism between the extended state and the retracted state. 3. The apparatus of claim 2, further comprising a resilient spring biasing the pin carrier towards one of the extended state and the retracted state. 4. The apparatus of claim 2, further comprising a ramp disposed against the pin carrier, positioned for transforming motion of the pin carrier parallel to the perforated platen into motion perpendicular to the perforated platen. 5. The apparatus of claim 4, wherein the ramp is formed in a frame of the mechanism fixed to the first one of the two arms. 6. The apparatus of claim 2, wherein the sliding actuator comprises a manual actuator mounted in a receiver of the hinged frame. 7. The apparatus of claim 1, wherein the mechanism comprises an assembly of components. 8. The apparatus of claim 1, wherein each of the plurality of pins comprises a stainless steel material. 9. The apparatus of claim 8, wherein each of the plurality of pins has a diameter in a range of 0.5 to 1.5 mm. 10. The apparatus of claim 8, wherein each of the plurality of pins has length in a range of 1 to 4 mm. 11. The apparatus of claim 8, wherein the stainless steel material is coated with one of a ceramic or fluoropolymer. 12. The apparatus of claim 1, wherein the pin carrier comprises two separate pieces, each holding two rows of the plurality of pins. 13. The apparatus of claim 12, wherein pins in a first of the two rows are spaced apart a uniform amount that is less than spacing between pins in a second of the two rows. 14. The apparatus of claim 13, wherein each of the two separate pieces is positioned relative to the perforated platen so the first of the two rows is along and closer to an edge of the perforated platen than the second of the two rows. 15. The apparatus of claim 1, wherein the perforated platen is flat and smooth on its free surface. 16. The apparatus of claim 1, wherein the perforated platen is in conductive communication with a resistive heating element. 17. The apparatus of claim 1, further comprising a water reservoir for producing steam. 18. The apparatus of claim 1, further comprising a second platen mounted to the second arm opposite to the perforated platen. 19. The apparatus of claim 1, wherein the through holes have cylindrical walls. 20. The apparatus of claim 1, wherein the pattern of through holes include a row of more closely-spaced holes along each long edge of the smooth plate, and two or more rows of more widely-spaced holes there between. | 3,700 |
347,179 | 16,805,679 | 3,772 | An improved one-piece cage and an improved insert and their assembly create a zero-restriction fluid flow ball check valve. The improved insert for ball and seat valve comprises external screw threads on the base of the insert and have circumferentially spaced ribs extending upwards and converging towards the longitudinal axis of the insert, forming a hemi-spherical ball stop and arched side openings. The inside diameter of the insert bore is substantially equal to the ball valve diameter preventing the ball from rattling when positioned in the improved insert's passageway during the fluid flow. The outside diameter of the ribs is less than the inside diameter of the improved one-piece cage cavity producing a zero-restriction fluid flow ball check valve in comparison to the volumetric fluid flow through the annular seat. The improved cage that receives the improved insert is a one piece in construction and has internal threads that correspond to the external threads on the improved insert. The insert is assembled inside the cage using a screw thread connection and simultaneously forming a fluid seal between the insert and the cage. | 1. A ball check valve insert and a one-piece cage used in downhole pumps of artificial lift systems, the ball check valve insert comprising:
circumferentially spaced apart ribs corresponding to the top of the base extending upwards from the base and converging towards the longitudinal axis of the insert to form arched side openings spanning from the top of the base of the insert to the point of convergence;
one or more external screw threads below the ribs on an outside diameter of the base of the ball check valve insert configured to be screwed in a cavity, of the one-piece cage, having an internal screw threads, wherein an inside diameter of the cavity is bigger than the outside diameter of the ribs of the ball check valve insert;
the ribs converging towards the longitudinal axis of the ball check valve insert to form a hemispherical ball stop;
an upwardly directed conical protrusion extending from the point of convergence of the ribs forming the ball stop; wherein the check valve insert having a passageway to receive a ball is movable therein between two positions, one of which closes an insert bore against movement of fluids therethrough and the other allowing fluid to move through. 2. The ball check valve insert of claim 1, wherein the inside diameter of the insert bore is 0.381 mm [0.015 in] or less plus the diameter of the ball that fits into the insert bore. 3. The ball check valve insert of claim 1, having a base ring having circumferentially spaced clutches on a bottom surface. 4. The ball check valve insert of claim 1, wherein the ribs are inclined at an angle and helically extended upwards from the base to form helically arched fluid flow side openings spanning from the top of the base to the point of convergence of the ribs forming the ball stop towards the longitudinal axis of the ball check valve insert. 5. The ball check valve insert of claim 1, wherein the ball check valve insert is a one-piece in construction and formed from a hard, tough, wear resistant and corrosion resistant material. 6. The ball check valve insert of claim 1, wherein the one-piece cage having an insert receiving cavity having an internal screw threads wherein the insert is screwed in; wherein the internal screw threads below the cage cavity corresponds to one or more threads on the base of the ball check valve insert of claim 1. 7. A method of manufacturing a ball check valve using an insert and a one-piece cage, assembly comprising:
providing a one-piece unitary cage having an insert receiving cavity and having a screw thread corresponding to a screw thread on a base of the insert wherein the insert is configured to be screwed in the screw threads of the insert receiving cavity, wherein an inside diameter of the cavity is bigger than outside diameter of ribs of the insert; wherein diametrical clearance between valve ball and inside diameter of an insert bore is less than 0.381 mm [0.015 in] and having arched side openings spaced circumferentially and a passageway extending axially therethrough; providing the ball having an outside diameter substantially equal to the inside diameter of the passageway extending through the insert; and positioning the ball in the passageway of the insert for axial movement therein between two positions, one of which secures the insert against passage of fluids therethrough. 8. The method of manufacturing a ball check valve assembly according to claim 7, wherein the step of securing an unitary insert inside a cage is carried out by screw thread connection; wherein one or more clutches on the insert are engaged with a torqueing tool to screw and torque the insert into one-piece cage; 9. The method of manufacturing a ball check valve assembly according to claim 8, wherein the clutches on bottom of the insert are removed by machining to form a smooth seal face on the bottom of the insert; wherein the process of machining out the clutches is carried out after the insert is screwed and torqued into the one-piece cage creating a fluid seal threaded connection between the insert and the one-piece cage. 10. The method of manufacturing a ball check valve assembly according to claim 7, wherein the insert forms an annular flow region between the outside diameter of the insert ribs and the inside diameter of the cage cavity. | An improved one-piece cage and an improved insert and their assembly create a zero-restriction fluid flow ball check valve. The improved insert for ball and seat valve comprises external screw threads on the base of the insert and have circumferentially spaced ribs extending upwards and converging towards the longitudinal axis of the insert, forming a hemi-spherical ball stop and arched side openings. The inside diameter of the insert bore is substantially equal to the ball valve diameter preventing the ball from rattling when positioned in the improved insert's passageway during the fluid flow. The outside diameter of the ribs is less than the inside diameter of the improved one-piece cage cavity producing a zero-restriction fluid flow ball check valve in comparison to the volumetric fluid flow through the annular seat. The improved cage that receives the improved insert is a one piece in construction and has internal threads that correspond to the external threads on the improved insert. The insert is assembled inside the cage using a screw thread connection and simultaneously forming a fluid seal between the insert and the cage.1. A ball check valve insert and a one-piece cage used in downhole pumps of artificial lift systems, the ball check valve insert comprising:
circumferentially spaced apart ribs corresponding to the top of the base extending upwards from the base and converging towards the longitudinal axis of the insert to form arched side openings spanning from the top of the base of the insert to the point of convergence;
one or more external screw threads below the ribs on an outside diameter of the base of the ball check valve insert configured to be screwed in a cavity, of the one-piece cage, having an internal screw threads, wherein an inside diameter of the cavity is bigger than the outside diameter of the ribs of the ball check valve insert;
the ribs converging towards the longitudinal axis of the ball check valve insert to form a hemispherical ball stop;
an upwardly directed conical protrusion extending from the point of convergence of the ribs forming the ball stop; wherein the check valve insert having a passageway to receive a ball is movable therein between two positions, one of which closes an insert bore against movement of fluids therethrough and the other allowing fluid to move through. 2. The ball check valve insert of claim 1, wherein the inside diameter of the insert bore is 0.381 mm [0.015 in] or less plus the diameter of the ball that fits into the insert bore. 3. The ball check valve insert of claim 1, having a base ring having circumferentially spaced clutches on a bottom surface. 4. The ball check valve insert of claim 1, wherein the ribs are inclined at an angle and helically extended upwards from the base to form helically arched fluid flow side openings spanning from the top of the base to the point of convergence of the ribs forming the ball stop towards the longitudinal axis of the ball check valve insert. 5. The ball check valve insert of claim 1, wherein the ball check valve insert is a one-piece in construction and formed from a hard, tough, wear resistant and corrosion resistant material. 6. The ball check valve insert of claim 1, wherein the one-piece cage having an insert receiving cavity having an internal screw threads wherein the insert is screwed in; wherein the internal screw threads below the cage cavity corresponds to one or more threads on the base of the ball check valve insert of claim 1. 7. A method of manufacturing a ball check valve using an insert and a one-piece cage, assembly comprising:
providing a one-piece unitary cage having an insert receiving cavity and having a screw thread corresponding to a screw thread on a base of the insert wherein the insert is configured to be screwed in the screw threads of the insert receiving cavity, wherein an inside diameter of the cavity is bigger than outside diameter of ribs of the insert; wherein diametrical clearance between valve ball and inside diameter of an insert bore is less than 0.381 mm [0.015 in] and having arched side openings spaced circumferentially and a passageway extending axially therethrough; providing the ball having an outside diameter substantially equal to the inside diameter of the passageway extending through the insert; and positioning the ball in the passageway of the insert for axial movement therein between two positions, one of which secures the insert against passage of fluids therethrough. 8. The method of manufacturing a ball check valve assembly according to claim 7, wherein the step of securing an unitary insert inside a cage is carried out by screw thread connection; wherein one or more clutches on the insert are engaged with a torqueing tool to screw and torque the insert into one-piece cage; 9. The method of manufacturing a ball check valve assembly according to claim 8, wherein the clutches on bottom of the insert are removed by machining to form a smooth seal face on the bottom of the insert; wherein the process of machining out the clutches is carried out after the insert is screwed and torqued into the one-piece cage creating a fluid seal threaded connection between the insert and the one-piece cage. 10. The method of manufacturing a ball check valve assembly according to claim 7, wherein the insert forms an annular flow region between the outside diameter of the insert ribs and the inside diameter of the cage cavity. | 3,700 |
347,180 | 16,805,681 | 3,772 | One variation of a method for deriving and storing emotional conditions of humans includes: writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display. | 1. A method for deriving and storing emotional conditions of humans includes:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display. 2. The method of claim 1:
further comprising interpreting a change in emotional state of the user proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein retrieving the set of biosignal data from the rolling buffer in response to detecting the trigger event comprises, in response to detecting the change in emotional state of the user:
retrieving the set of biosignal data, representing the change in emotional state, from the rolling buffer;
writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
further comprising:
in response to detecting the change in emotional state of the user, writing a second set of biosignal data, output by the set of biosensors in the local device over a second period of time succeeding the first time, to the raw data file; and
transforming the second set of biosignal data in the raw data file into a second timeseries of emotions exhibited by the user during the second period of time;
wherein generating the visualization comprises generating the visualization of the timeseries of emotions and the second timeseries of emotions; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display in communication with the local device. 3. The method of claim 2, further comprising:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user; labeling the raw data file with the external stimulus identified by the user; storing the raw data file in a database; at a second time, receiving a search term from the user; and in response to the search term matching the external stimulus:
retrieving the raw data file;
regenerating the visualization of the timeseries of emotions and the second timeseries of emotions; and
rendering the visualization for the user. 4. The method of claim 1:
further comprising interpreting a change in emotional state of the user, from a first emotion type to an emotion type of interest preselected by the user, proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein retrieving the set of biosignal data from the rolling buffer in response to detecting the trigger event comprises, in response to detecting the change in emotional state of the user to the emotion type of interest:
retrieving the set of biosignal data, representing the change in emotional state, from the rolling buffer;
writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
further comprising:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user;
labeling the raw data file with the external stimulus identified by the user; and
storing the raw data file in a database. 5. The method of claim 4, further comprising:
at a second time, receiving a set of search terms from the user; and in response to the set of search terms matching the emotion type of interest and the external stimulus:
retrieving the raw data file;
regenerating the visualization of the timeseries of emotions; and
rendering the visualization for the user. 6. The method of claim 1:
wherein retrieving the set of biosignal data from the rolling buffer comprises, at the local device, in response to receipt of a manual trigger from the user:
writing the set of biosignal data from the rolling buffer to a raw data file; and
offloading the raw data file to a second computing device;
wherein transforming the set of biosignal data in the raw data file into the timeseries of emotions comprises, at the second computing device, deriving the timeseries of emotions, exhibited by the user during the first period of time, from the set of biosignal data in the raw data file; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display of the second computing device. 7. The method of claim 1, wherein generating the visualization of the timeseries of emotions and rendering the visualization of the timeseries of emotions on the display comprises, at a computing device coupled to the display:
rendering an emotion graph depicting a set of emotion axes; at a first playback time, rendering an avatar at a first position on the emotion graph, the first position corresponding to a first type and a first magnitude of a first emotion in the timeseries of emotions exhibited by the user during the first period of time; at a second playback time succeeding the first playback time, transitioning the avatar to a second position on the emotion graph, the second position corresponding to a second type and a second magnitude of a second emotion in the timeseries of emotions exhibited by the user during the first period of time; and at a third time playback time succeeding the second playback time, transitioning the avatar to a third position on the emotion graph, the third position corresponding to the second type and a third magnitude of the second emotion in the timeseries of emotions exhibited by the user during the first period of time. 8. The method of claim 1:
wherein writing timeseries biosignal data to the rolling buffer comprises writing timeseries biosignal data, output by a heart rate sensor, a skin temperature sensor, and a galvanic skin response sensor integrated into the local device worn by the user, to the rolling buffer defining a look-back duration of approximately five minutes; wherein retrieving the set of biosignal data from the rolling buffer comprises, at a mobile computing device affiliated with the local device:
querying the local device for contents of the rolling buffer in response to manual selection of a capture trigger at the local device; and
downloading the set of biosignal data from the rolling buffer; and
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display of the mobile computing device. 9. The method of claim 1:
further comprising:
in response to detecting the trigger event, writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
storing the raw data file in a database;
wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions based on a first model for interpreting emotions from raw biosignal data available at the first time; and further comprising, at a second time succeeding the first time:
retrieving the raw data file from the database;
transforming the set of biosignal data, stored in the raw data file, into a revised timeseries of emotions based on a second model for interpreting emotions from raw biosignal data available at the second time;
generating a second visualization of the revised timeseries of emotions; and
rendering the second visualization of the revised timeseries of emotions. 10. The method of claim 1:
wherein generating the visualization of the timeseries of emotions comprises:
receiving selection of a first model for visualizing emotions from the user;
generating the visualization of the timeseries of emotions according to the first model;
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions for the user on the display in communication with the local device; further comprising:
writing the timeseries of emotions, representing emotions exhibited by the user during the first period of time, to an emotion file; and
storing the emotion file in a database;
authorizing access to the emotion file by a second user in response to receiving selection of the second user from the user; and
at a second time succeeding the first time:
at a second computing device affiliated with the second user, accessing the emotion file from the database;
receiving selection of a second model for visualizing emotions from the second user;
generating a second visualization of the timeseries of emotions, stored in the emotion file, according to the second model; and
rendering the second visualization of the timeseries of emotions for the second user on a second display in the second computing device. 11. The method of claim 1:
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receipt of a manual trigger from the user at the first time following receipt of a media from a sender; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user between presentation of the media to the user and the first time; wherein generating the visualization of the timeseries of emotions comprises generating the visualization depicting a change in emotional state of the user during consumption of the media; and further comprising, in response to confirmation from the user, transmitting the visualization to a second computing device associated with the sender. 12. The method of claim 1:
further comprising:
receiving selection of a recipient from an electronic contact list;
recording a message entered by the user over the first period of time; and
prompting the user to pair the message with personal emotion status data;
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving confirmation from the user to pair the message with personal emotion status data; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user during entry of the message; further comprising, in response to receiving confirmation from the user to pair the message with personal emotion status data, transmitting the message and the visualization to a second computing device affiliated with the recipient; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization with the message on the display of the second computing device. 13. The method of claim 1:
further comprising:
presenting a media to the user during the first period of time;
receiving selection of a recipient, for the media, from an electronic contact list; and
prompting the user to pair the media with personal emotion status data;
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving confirmation from the user to pair the media with personal emotion status data; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user while consuming the media; further comprising, in response to receiving confirmation from the user to pair the media with personal emotion status data, transmitting the media and the visualization to a second computing device affiliated with the recipient; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization with the media on the display of the second computing device. 14. The method of claim 13:
wherein presenting the media to the user comprises playing back a song title, via a first computing device in communication with the local device, during the first period of time; wherein transmitting the media to the second computing device comprises transmitting, to the second computing device, a link to the song title; and wherein rendering the visualization with the media on the display of the second computing device comprises, at the second computing device:
accessing the song title via the link;
playing back the song title; and
on the display of the second computing device, rendering visual representations of emotions, exhibited by the user while consuming the song title during the first period of time, synchronized to playback of the song title at the second computing device. 15. The method of claim 1:
further comprising receiving a manual trigger from the user following conclusion of a performance; wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving the manual trigger from the user; further comprising:
writing the timeseries of emotions to an emotion file;
linking the emotion file to a recording of the performance;
storing the emotion file in a database; and
in response to selection of the media by a second user at a second computing device at a second time succeeding the first time, serving the emotion file to the second computing device;
wherein generating the visualization of the timeseries of emotions comprises generating the visualization of the timeseries of emotions at the second computing device; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions, synchronized to playback of the recording of the performance, on the display of the second computing device. 16. A method for deriving and storing emotional conditions of humans includes:
at a local device coupled to a user:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration;
in response to a trigger event at a first time:
writing timeseries biosignal data, contained in the rolling buffer and spanning a first period of time preceding the first time, to a raw data file; and
writing timeseries biosignal data, spanning a second period of time succeeding the first time, to the raw data file;
transforming timeseries biosignal data in the raw data file into a timeseries of emotions exhibited by the user; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display. 17. The method of claim 16:
further comprising interpreting a change in emotional state of the user proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein writing timeseries biosignal data to the raw data file comprises, in response to detecting the change in emotional state of the user:
writing timeseries biosignal data, contained in the rolling buffer and spanning a first period of time preceding the first time, to the raw data file;
writing biosignal data, output by the set of biosensors, directly to the raw data file;
further comprising:
in response to detecting the change in emotional state of the user, prompting the user to confirm an emotion event at the first time;
in response to the user confirming the emotion event:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user;
labeling the raw data file with the external stimulus identified by the user; and
storing the raw data file in a database. 18. The method of claim 16, wherein generating the visualization of the timeseries of emotions and rendering the visualization of the timeseries of emotions on the display comprises, at a computing device coupled to the display:
rendering an emotion graph depicting a set of emotion axes; at a first playback time, rendering an avatar at a first position on the emotion graph, the first position corresponding to a first type and a first magnitude of a first emotion in the timeseries of emotions exhibited by the user during the first period of time; at a second playback time succeeding the first playback time, transitioning the avatar to a second position on the emotion graph, the second position corresponding to a second type and a second magnitude of a second emotion in the timeseries of emotions exhibited by the user during the first period of time; and at a third playback time succeeding the second playback time, transitioning the avatar to a third position on the emotion graph, the third position corresponding to the second type and a third magnitude of the second emotion in the timeseries of emotions exhibited by the user during the first period of time. 19. The method of claim 1:
wherein generating the visualization of the timeseries of emotions comprises:
receiving selection of a first model for visualizing emotions from the user;
generating the visualization of the timeseries of emotions according to the first model;
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions for the user on the display in communication with the local device; and further comprising:
writing the timeseries of emotions, representing emotions exhibited by the user during the first period of time, to an emotion file;
storing the emotion file in a database;
authorizing access to the emotion file by a second user in response to receiving selection of the second user from the user; and
at a second time succeeding the first time:
at a second computing device affiliated with the second user, accessing the emotion file;
receiving selection of a second model for visualizing emotions from the second user;
generating a second visualization of the timeseries of emotions, stored in the emotion file, according to the second model; and
rendering the second visualization of the timeseries of emotions for the second user on a second display in the second computing device. 20. A method for deriving and storing emotional conditions of humans includes:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; prompting the user to indicate an external stimulus that initiated the change in emotional state of the user; storing the timeseries of emotions, labeled with the external stimulus identified by the user, in an emotion file associated with the user; storing the emotion file in a database; and at a second time succeeding the first time:
receiving selection of the emotion file;
generating a visualization of the external stimulus and the timeseries of emotions stored in the emotion file; and
rendering the visualization of the timeseries of emotions on a display. | One variation of a method for deriving and storing emotional conditions of humans includes: writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display.1. A method for deriving and storing emotional conditions of humans includes:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display. 2. The method of claim 1:
further comprising interpreting a change in emotional state of the user proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein retrieving the set of biosignal data from the rolling buffer in response to detecting the trigger event comprises, in response to detecting the change in emotional state of the user:
retrieving the set of biosignal data, representing the change in emotional state, from the rolling buffer;
writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
further comprising:
in response to detecting the change in emotional state of the user, writing a second set of biosignal data, output by the set of biosensors in the local device over a second period of time succeeding the first time, to the raw data file; and
transforming the second set of biosignal data in the raw data file into a second timeseries of emotions exhibited by the user during the second period of time;
wherein generating the visualization comprises generating the visualization of the timeseries of emotions and the second timeseries of emotions; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display in communication with the local device. 3. The method of claim 2, further comprising:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user; labeling the raw data file with the external stimulus identified by the user; storing the raw data file in a database; at a second time, receiving a search term from the user; and in response to the search term matching the external stimulus:
retrieving the raw data file;
regenerating the visualization of the timeseries of emotions and the second timeseries of emotions; and
rendering the visualization for the user. 4. The method of claim 1:
further comprising interpreting a change in emotional state of the user, from a first emotion type to an emotion type of interest preselected by the user, proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein retrieving the set of biosignal data from the rolling buffer in response to detecting the trigger event comprises, in response to detecting the change in emotional state of the user to the emotion type of interest:
retrieving the set of biosignal data, representing the change in emotional state, from the rolling buffer;
writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
further comprising:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user;
labeling the raw data file with the external stimulus identified by the user; and
storing the raw data file in a database. 5. The method of claim 4, further comprising:
at a second time, receiving a set of search terms from the user; and in response to the set of search terms matching the emotion type of interest and the external stimulus:
retrieving the raw data file;
regenerating the visualization of the timeseries of emotions; and
rendering the visualization for the user. 6. The method of claim 1:
wherein retrieving the set of biosignal data from the rolling buffer comprises, at the local device, in response to receipt of a manual trigger from the user:
writing the set of biosignal data from the rolling buffer to a raw data file; and
offloading the raw data file to a second computing device;
wherein transforming the set of biosignal data in the raw data file into the timeseries of emotions comprises, at the second computing device, deriving the timeseries of emotions, exhibited by the user during the first period of time, from the set of biosignal data in the raw data file; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display of the second computing device. 7. The method of claim 1, wherein generating the visualization of the timeseries of emotions and rendering the visualization of the timeseries of emotions on the display comprises, at a computing device coupled to the display:
rendering an emotion graph depicting a set of emotion axes; at a first playback time, rendering an avatar at a first position on the emotion graph, the first position corresponding to a first type and a first magnitude of a first emotion in the timeseries of emotions exhibited by the user during the first period of time; at a second playback time succeeding the first playback time, transitioning the avatar to a second position on the emotion graph, the second position corresponding to a second type and a second magnitude of a second emotion in the timeseries of emotions exhibited by the user during the first period of time; and at a third time playback time succeeding the second playback time, transitioning the avatar to a third position on the emotion graph, the third position corresponding to the second type and a third magnitude of the second emotion in the timeseries of emotions exhibited by the user during the first period of time. 8. The method of claim 1:
wherein writing timeseries biosignal data to the rolling buffer comprises writing timeseries biosignal data, output by a heart rate sensor, a skin temperature sensor, and a galvanic skin response sensor integrated into the local device worn by the user, to the rolling buffer defining a look-back duration of approximately five minutes; wherein retrieving the set of biosignal data from the rolling buffer comprises, at a mobile computing device affiliated with the local device:
querying the local device for contents of the rolling buffer in response to manual selection of a capture trigger at the local device; and
downloading the set of biosignal data from the rolling buffer; and
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions on the display of the mobile computing device. 9. The method of claim 1:
further comprising:
in response to detecting the trigger event, writing the set of biosignal data, spanning the first period of time preceding the first time, to a raw data file; and
storing the raw data file in a database;
wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions based on a first model for interpreting emotions from raw biosignal data available at the first time; and further comprising, at a second time succeeding the first time:
retrieving the raw data file from the database;
transforming the set of biosignal data, stored in the raw data file, into a revised timeseries of emotions based on a second model for interpreting emotions from raw biosignal data available at the second time;
generating a second visualization of the revised timeseries of emotions; and
rendering the second visualization of the revised timeseries of emotions. 10. The method of claim 1:
wherein generating the visualization of the timeseries of emotions comprises:
receiving selection of a first model for visualizing emotions from the user;
generating the visualization of the timeseries of emotions according to the first model;
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions for the user on the display in communication with the local device; further comprising:
writing the timeseries of emotions, representing emotions exhibited by the user during the first period of time, to an emotion file; and
storing the emotion file in a database;
authorizing access to the emotion file by a second user in response to receiving selection of the second user from the user; and
at a second time succeeding the first time:
at a second computing device affiliated with the second user, accessing the emotion file from the database;
receiving selection of a second model for visualizing emotions from the second user;
generating a second visualization of the timeseries of emotions, stored in the emotion file, according to the second model; and
rendering the second visualization of the timeseries of emotions for the second user on a second display in the second computing device. 11. The method of claim 1:
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receipt of a manual trigger from the user at the first time following receipt of a media from a sender; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user between presentation of the media to the user and the first time; wherein generating the visualization of the timeseries of emotions comprises generating the visualization depicting a change in emotional state of the user during consumption of the media; and further comprising, in response to confirmation from the user, transmitting the visualization to a second computing device associated with the sender. 12. The method of claim 1:
further comprising:
receiving selection of a recipient from an electronic contact list;
recording a message entered by the user over the first period of time; and
prompting the user to pair the message with personal emotion status data;
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving confirmation from the user to pair the message with personal emotion status data; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user during entry of the message; further comprising, in response to receiving confirmation from the user to pair the message with personal emotion status data, transmitting the message and the visualization to a second computing device affiliated with the recipient; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization with the message on the display of the second computing device. 13. The method of claim 1:
further comprising:
presenting a media to the user during the first period of time;
receiving selection of a recipient, for the media, from an electronic contact list; and
prompting the user to pair the media with personal emotion status data;
wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving confirmation from the user to pair the media with personal emotion status data; wherein transforming the set of biosignal data into the timeseries of emotions comprises transforming the set of biosignal data into the timeseries of emotions exhibited by the user while consuming the media; further comprising, in response to receiving confirmation from the user to pair the media with personal emotion status data, transmitting the media and the visualization to a second computing device affiliated with the recipient; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization with the media on the display of the second computing device. 14. The method of claim 13:
wherein presenting the media to the user comprises playing back a song title, via a first computing device in communication with the local device, during the first period of time; wherein transmitting the media to the second computing device comprises transmitting, to the second computing device, a link to the song title; and wherein rendering the visualization with the media on the display of the second computing device comprises, at the second computing device:
accessing the song title via the link;
playing back the song title; and
on the display of the second computing device, rendering visual representations of emotions, exhibited by the user while consuming the song title during the first period of time, synchronized to playback of the song title at the second computing device. 15. The method of claim 1:
further comprising receiving a manual trigger from the user following conclusion of a performance; wherein retrieving the set of biosignal data from the rolling buffer comprises retrieving the set of biosignal data from the rolling buffer in response to receiving the manual trigger from the user; further comprising:
writing the timeseries of emotions to an emotion file;
linking the emotion file to a recording of the performance;
storing the emotion file in a database; and
in response to selection of the media by a second user at a second computing device at a second time succeeding the first time, serving the emotion file to the second computing device;
wherein generating the visualization of the timeseries of emotions comprises generating the visualization of the timeseries of emotions at the second computing device; and wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions, synchronized to playback of the recording of the performance, on the display of the second computing device. 16. A method for deriving and storing emotional conditions of humans includes:
at a local device coupled to a user:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration;
in response to a trigger event at a first time:
writing timeseries biosignal data, contained in the rolling buffer and spanning a first period of time preceding the first time, to a raw data file; and
writing timeseries biosignal data, spanning a second period of time succeeding the first time, to the raw data file;
transforming timeseries biosignal data in the raw data file into a timeseries of emotions exhibited by the user; generating a visualization of the timeseries of emotions; and rendering the visualization of the timeseries of emotions on a display. 17. The method of claim 16:
further comprising interpreting a change in emotional state of the user proximal the first time based on timeseries biosignal data output by the set of biosensors in the local device; wherein writing timeseries biosignal data to the raw data file comprises, in response to detecting the change in emotional state of the user:
writing timeseries biosignal data, contained in the rolling buffer and spanning a first period of time preceding the first time, to the raw data file;
writing biosignal data, output by the set of biosensors, directly to the raw data file;
further comprising:
in response to detecting the change in emotional state of the user, prompting the user to confirm an emotion event at the first time;
in response to the user confirming the emotion event:
prompting the user to indicate an external stimulus that initiated the change in emotional state of the user;
labeling the raw data file with the external stimulus identified by the user; and
storing the raw data file in a database. 18. The method of claim 16, wherein generating the visualization of the timeseries of emotions and rendering the visualization of the timeseries of emotions on the display comprises, at a computing device coupled to the display:
rendering an emotion graph depicting a set of emotion axes; at a first playback time, rendering an avatar at a first position on the emotion graph, the first position corresponding to a first type and a first magnitude of a first emotion in the timeseries of emotions exhibited by the user during the first period of time; at a second playback time succeeding the first playback time, transitioning the avatar to a second position on the emotion graph, the second position corresponding to a second type and a second magnitude of a second emotion in the timeseries of emotions exhibited by the user during the first period of time; and at a third playback time succeeding the second playback time, transitioning the avatar to a third position on the emotion graph, the third position corresponding to the second type and a third magnitude of the second emotion in the timeseries of emotions exhibited by the user during the first period of time. 19. The method of claim 1:
wherein generating the visualization of the timeseries of emotions comprises:
receiving selection of a first model for visualizing emotions from the user;
generating the visualization of the timeseries of emotions according to the first model;
wherein rendering the visualization of the timeseries of emotions on the display comprises rendering the visualization of the timeseries of emotions for the user on the display in communication with the local device; and further comprising:
writing the timeseries of emotions, representing emotions exhibited by the user during the first period of time, to an emotion file;
storing the emotion file in a database;
authorizing access to the emotion file by a second user in response to receiving selection of the second user from the user; and
at a second time succeeding the first time:
at a second computing device affiliated with the second user, accessing the emotion file;
receiving selection of a second model for visualizing emotions from the second user;
generating a second visualization of the timeseries of emotions, stored in the emotion file, according to the second model; and
rendering the second visualization of the timeseries of emotions for the second user on a second display in the second computing device. 20. A method for deriving and storing emotional conditions of humans includes:
writing timeseries biosignal data, output by a set of biosensors in a local device coupled to a user, to a rolling buffer spanning a look-back duration; in response to a trigger event at a first time, retrieving a set of biosignal data, spanning a first period of time preceding the first time, from the rolling buffer; transforming the set of biosignal data into a timeseries of emotions exhibited by the user during the first period of time; prompting the user to indicate an external stimulus that initiated the change in emotional state of the user; storing the timeseries of emotions, labeled with the external stimulus identified by the user, in an emotion file associated with the user; storing the emotion file in a database; and at a second time succeeding the first time:
receiving selection of the emotion file;
generating a visualization of the external stimulus and the timeseries of emotions stored in the emotion file; and
rendering the visualization of the timeseries of emotions on a display. | 3,700 |
347,181 | 16,805,658 | 3,772 | A composite panel includes a mold surface, a layer of gel coat applied to the mold surface, a wet laminate containing a resin applied to the layer of gel coat, a substrate of lauan or another moisture-carrying or moisture-absorbing material placed on the wet laminate, and a layer of a bonding promoter provided at the interface of the substrate with the wet laminate, additional to any amount of promoter(s) present in the resin of the wet laminate. Without previously curing or drying the layer consisting essentially of the bonding promoter in the solvent, each of the wet laminate, the bonding promoter, and the gel coat are simultaneously cured. | 1. A composite panel, comprising:
a mold surface; a layer of gel coat applied to the mold surface; a wet laminate applied to the layer of the gel coat, the wet laminate comprising a resin; a substrate of lauan or other moisture-carrying or moisture-absorbing material placed on the wet laminate; a layer consisting essentially of a bonding promoter in a solvent provided at an interface of the substrate with the wet laminate, additional to any amount of promoter(s) present in the resin of the wet laminate, wherein, without previously curing or drying the layer consisting essentially of the bonding promoter in the solvent, each of the wet laminate, the bonding promoter, and the gel coat are simultaneously cured. 2. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to an exposed surface of the wet laminate. 3. The composite panel of claim 2, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to the exposed surface of the wet laminate before the substrate is placed on the wet laminate. 4. The composite panel of claim 2, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the wet laminate. 5. The composite panel of claim 4, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the wet laminate before the substrate is placed on the wet laminate. 6. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to an exposed surface of the substrate. 7. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to the exposed surface of the substrate before the substrate is placed on the wet laminate. 8. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the substrate. 9. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is rolled onto the exposed surface of the substrate. 10. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of the promoter in the solvent in a concentration of the solvent to the promoter in a range of 10:1 to 1000:1, inclusive. 11. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of a promoter selected from the group consisting of copper salts, iron salts, and cobalt salts. 12. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of a promoter selected from the group consisting of amine accelerators, dimethyl aniline, dimethyl-p-toluidine, vanadium accelerators, vanadium monobutyl dihydrophosphite, 2,4-pentanedione, and N,N-diethylacetoacetamide. 13. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution containing a material selected from the group consisting of mineral spirits, methyl ethyl ketone, styrene, acetone, methyl methacrylate and xylene as a solvent. 14. The composite panel of claim 1, wherein the resin further includes glass fibers. 15. The composite panel of claim 1, wherein the substrate is plywood. 16. The composite panel of claim 1, wherein the substrate is a wood other than lauan or plywood. 17. The composite panel of claim 1, wherein the substrate has a moisture content of up to 19 weight %. 18. The composite panel of claim 1, wherein the substrate has a moisture content of 13-18 weight %. 19. The composite panel of claim 1, wherein the substrate has a moisture content of 14-17 weight %. | A composite panel includes a mold surface, a layer of gel coat applied to the mold surface, a wet laminate containing a resin applied to the layer of gel coat, a substrate of lauan or another moisture-carrying or moisture-absorbing material placed on the wet laminate, and a layer of a bonding promoter provided at the interface of the substrate with the wet laminate, additional to any amount of promoter(s) present in the resin of the wet laminate. Without previously curing or drying the layer consisting essentially of the bonding promoter in the solvent, each of the wet laminate, the bonding promoter, and the gel coat are simultaneously cured.1. A composite panel, comprising:
a mold surface; a layer of gel coat applied to the mold surface; a wet laminate applied to the layer of the gel coat, the wet laminate comprising a resin; a substrate of lauan or other moisture-carrying or moisture-absorbing material placed on the wet laminate; a layer consisting essentially of a bonding promoter in a solvent provided at an interface of the substrate with the wet laminate, additional to any amount of promoter(s) present in the resin of the wet laminate, wherein, without previously curing or drying the layer consisting essentially of the bonding promoter in the solvent, each of the wet laminate, the bonding promoter, and the gel coat are simultaneously cured. 2. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to an exposed surface of the wet laminate. 3. The composite panel of claim 2, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to the exposed surface of the wet laminate before the substrate is placed on the wet laminate. 4. The composite panel of claim 2, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the wet laminate. 5. The composite panel of claim 4, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the wet laminate before the substrate is placed on the wet laminate. 6. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to an exposed surface of the substrate. 7. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is applied to the exposed surface of the substrate before the substrate is placed on the wet laminate. 8. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is sprayed onto the exposed surface of the substrate. 9. The composite panel of claim 6, wherein the layer consisting essentially of the bonding promoter in the solvent is rolled onto the exposed surface of the substrate. 10. The composite panel of claim 1, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of the promoter in the solvent in a concentration of the solvent to the promoter in a range of 10:1 to 1000:1, inclusive. 11. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of a promoter selected from the group consisting of copper salts, iron salts, and cobalt salts. 12. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution of a promoter selected from the group consisting of amine accelerators, dimethyl aniline, dimethyl-p-toluidine, vanadium accelerators, vanadium monobutyl dihydrophosphite, 2,4-pentanedione, and N,N-diethylacetoacetamide. 13. The composite panel of claim 10, wherein the layer consisting essentially of the bonding promoter in the solvent is provided by applying a solution containing a material selected from the group consisting of mineral spirits, methyl ethyl ketone, styrene, acetone, methyl methacrylate and xylene as a solvent. 14. The composite panel of claim 1, wherein the resin further includes glass fibers. 15. The composite panel of claim 1, wherein the substrate is plywood. 16. The composite panel of claim 1, wherein the substrate is a wood other than lauan or plywood. 17. The composite panel of claim 1, wherein the substrate has a moisture content of up to 19 weight %. 18. The composite panel of claim 1, wherein the substrate has a moisture content of 13-18 weight %. 19. The composite panel of claim 1, wherein the substrate has a moisture content of 14-17 weight %. | 3,700 |
347,182 | 16,805,675 | 2,828 | A light source has a resonant laser cavity with an optical grating and a waveguide that has a longitudinal axis. A portion of the longitudinal axis extends through the optical grating and serves as a grating axis. The laser cavity is configured to generate a laser signal that exits the laser cavity through the optical grating. The optical grating includes multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide. The perturbation structures are staggered on the waveguide such that the perturbation structures that are adjacent to one another in a longitudinal direction are spaced apart in a transverse direction. The longitudinal direction is a direction parallel to the grating axis and the transverse direction is a direction transverse to the longitudinal direction. | 1. A LIDAR system, comprising:
a resonant laser cavity that includes an optical grating and a waveguide having a longitudinal axis, a portion of the longitudinal axis that extends through the optical grating serving as a grating axis,
the laser cavity being configured to generate a laser signal that exits the laser cavity through the optical grating,
the optical grating including multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide, and
the perturbation structures being staggered on the waveguide such that perturbation structures that are adjacent to one another in a longitudinal direction are spaced apart in a transverse direction, the longitudinal direction being parallel to the grating axis and the transverse direction being transverse to the longitudinal direction. 2. The system of claim 1, wherein the perturbation structures are arranged in sub-gratings such that perturbation structures in the same sub-grating overlap one another in the transverse direction and the perturbation structures from different sub-gratings are spaced apart in the transverse direction. 3. The system of claim 2, wherein the perturbation structures are arranged in sub-gratings such that perturbation structures that are adjacent to one another in the longitudinal direction are members of different sub-gratings. 4. The system of claim 3, wherein the perturbation structures from different sub-gratings are spaced apart in the transverse direction by a gap of more than 90 nm. 5. The system of claim 4, wherein the optical grating outputs a laser signal with a wavelength less than 1450 nm. 6. The system of claim 5, wherein the optical grating is a first order grating. 7. The system of claim 6, wherein the perturbation structures that are members of the same sub-grating are arranged periodically in the longitudinal direction. 8. The system of claim 7, wherein the perturbation structures from the different sub-gratings combine such that the perturbation structures from different sub-gratings are periodically spaced in the longitudinal direction at a composite period (Pc). 9. The system of claim 8, wherein the periodic arrangement of the perturbation structures in each sub-grating is spaced at a sub-grating period, and
the perturbation structures are arranged such that the composite period is 1/N times the sub-grating period where N is the number of sub-grating included in the optical grating. 10. The system of claim 3, wherein the perturbation structures each has a transverse direction width measured in the transverse direction and the transverse direction width of the perturbation structures in the same sub-grating is the same. 11. The system of claim 1, wherein the perturbation structures are arranged in sub-gratings such that no line that is parallel to the grating axis extends through the perturbation structures in more than one sub-grating. 12. The system of claim 11, wherein the perturbation structures are arranged such that a line that is parallel to the grating axis can extend through each perturbation structure in the same sub-grating. 13. The system of claim 1, wherein the perturbation structures are arranged such that the shortest possible line that can be drawn between perturbation structures that are adjacent to each other in the longitudinal direction is diagonal relative to the grating axis. 14. The system of claim 13, wherein the perturbation structures are arranged such a length of each line is less than 110 nm. 15. The system of claim 14, wherein the optical grating outputs a laser signal with a wavelength less than 1450 nm. 16. The system of claim 1, wherein the waveguide is a ridge waveguide and the perturbation structures each include a recess in a ridge of the ridge waveguide. 17. The system of claim 1, wherein the light source is included in a Photonic Integrated Circuit (PIC) on a LIDAR chip. 18. The system of claim 1, wherein the LIDAR chip is constructed on a silicon-on-insulator platform. 19. A LIDAR system, comprising:
a resonant laser cavity that includes a waveguide and an optical grating,
the laser cavity is configured to generate a laser signal that exits the laser cavity through the optical grating,
the optical grating including multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide,
the perturbation structures being arranged in sub-gratings such that each sub-grating includes more than one of the perturbation structures, and
perturbation structures in the same subgroup have the same orientation relative to a longitudinal axis of the waveguide but the perturbation structures in different subgroup have different orientations relative to the longitudinal axis of the waveguide. 20. The LIDAR system of claim 1, wherein each of the perturbation structures has a corresponding feature that corresponds to the common location on each of the other perturbation structures,
a first axis that is parallel to the longitudinal axis of the waveguide can extend through the corresponding locations on each perturbation structure included in a first one of the sub-gratings, a second axis that is parallel to the longitudinal axis of the waveguide can extend through the corresponding locations on each perturbation structure included in a second one of the sub-gratings, and the first axis is spaced apart from the second axis. | A light source has a resonant laser cavity with an optical grating and a waveguide that has a longitudinal axis. A portion of the longitudinal axis extends through the optical grating and serves as a grating axis. The laser cavity is configured to generate a laser signal that exits the laser cavity through the optical grating. The optical grating includes multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide. The perturbation structures are staggered on the waveguide such that the perturbation structures that are adjacent to one another in a longitudinal direction are spaced apart in a transverse direction. The longitudinal direction is a direction parallel to the grating axis and the transverse direction is a direction transverse to the longitudinal direction.1. A LIDAR system, comprising:
a resonant laser cavity that includes an optical grating and a waveguide having a longitudinal axis, a portion of the longitudinal axis that extends through the optical grating serving as a grating axis,
the laser cavity being configured to generate a laser signal that exits the laser cavity through the optical grating,
the optical grating including multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide, and
the perturbation structures being staggered on the waveguide such that perturbation structures that are adjacent to one another in a longitudinal direction are spaced apart in a transverse direction, the longitudinal direction being parallel to the grating axis and the transverse direction being transverse to the longitudinal direction. 2. The system of claim 1, wherein the perturbation structures are arranged in sub-gratings such that perturbation structures in the same sub-grating overlap one another in the transverse direction and the perturbation structures from different sub-gratings are spaced apart in the transverse direction. 3. The system of claim 2, wherein the perturbation structures are arranged in sub-gratings such that perturbation structures that are adjacent to one another in the longitudinal direction are members of different sub-gratings. 4. The system of claim 3, wherein the perturbation structures from different sub-gratings are spaced apart in the transverse direction by a gap of more than 90 nm. 5. The system of claim 4, wherein the optical grating outputs a laser signal with a wavelength less than 1450 nm. 6. The system of claim 5, wherein the optical grating is a first order grating. 7. The system of claim 6, wherein the perturbation structures that are members of the same sub-grating are arranged periodically in the longitudinal direction. 8. The system of claim 7, wherein the perturbation structures from the different sub-gratings combine such that the perturbation structures from different sub-gratings are periodically spaced in the longitudinal direction at a composite period (Pc). 9. The system of claim 8, wherein the periodic arrangement of the perturbation structures in each sub-grating is spaced at a sub-grating period, and
the perturbation structures are arranged such that the composite period is 1/N times the sub-grating period where N is the number of sub-grating included in the optical grating. 10. The system of claim 3, wherein the perturbation structures each has a transverse direction width measured in the transverse direction and the transverse direction width of the perturbation structures in the same sub-grating is the same. 11. The system of claim 1, wherein the perturbation structures are arranged in sub-gratings such that no line that is parallel to the grating axis extends through the perturbation structures in more than one sub-grating. 12. The system of claim 11, wherein the perturbation structures are arranged such that a line that is parallel to the grating axis can extend through each perturbation structure in the same sub-grating. 13. The system of claim 1, wherein the perturbation structures are arranged such that the shortest possible line that can be drawn between perturbation structures that are adjacent to each other in the longitudinal direction is diagonal relative to the grating axis. 14. The system of claim 13, wherein the perturbation structures are arranged such a length of each line is less than 110 nm. 15. The system of claim 14, wherein the optical grating outputs a laser signal with a wavelength less than 1450 nm. 16. The system of claim 1, wherein the waveguide is a ridge waveguide and the perturbation structures each include a recess in a ridge of the ridge waveguide. 17. The system of claim 1, wherein the light source is included in a Photonic Integrated Circuit (PIC) on a LIDAR chip. 18. The system of claim 1, wherein the LIDAR chip is constructed on a silicon-on-insulator platform. 19. A LIDAR system, comprising:
a resonant laser cavity that includes a waveguide and an optical grating,
the laser cavity is configured to generate a laser signal that exits the laser cavity through the optical grating,
the optical grating including multiple perturbation structures that each causes a perturbation in an effective refractive index of the waveguide,
the perturbation structures being arranged in sub-gratings such that each sub-grating includes more than one of the perturbation structures, and
perturbation structures in the same subgroup have the same orientation relative to a longitudinal axis of the waveguide but the perturbation structures in different subgroup have different orientations relative to the longitudinal axis of the waveguide. 20. The LIDAR system of claim 1, wherein each of the perturbation structures has a corresponding feature that corresponds to the common location on each of the other perturbation structures,
a first axis that is parallel to the longitudinal axis of the waveguide can extend through the corresponding locations on each perturbation structure included in a first one of the sub-gratings, a second axis that is parallel to the longitudinal axis of the waveguide can extend through the corresponding locations on each perturbation structure included in a second one of the sub-gratings, and the first axis is spaced apart from the second axis. | 2,800 |
347,183 | 16,805,618 | 2,828 | The present invention relates to the field of oligonucleotide conjugates and to methods of synthesis thereof. In the present method a low-water content solvent environment allows a more efficient conjugation, reducing the amount of conjugate moiety needed and increasing the conjugation reaction speed. | 1.-22. (canceled) 23. A process of synthesizing an amide linked oligonucleotide conjugate comprising the step of reacting a conjugate group to a reactive amino group of an oligonucleotide, wherein said reaction step is performed in a solvent composition comprising at least about 85% (v/v) polar aprotic solvent, wherein the molar ratio of the conjugate group/oligonucleotide used in the solvent composition is between about 0.5 and about 2, and wherein the solvent composition comprises a lipophilic cation. | The present invention relates to the field of oligonucleotide conjugates and to methods of synthesis thereof. In the present method a low-water content solvent environment allows a more efficient conjugation, reducing the amount of conjugate moiety needed and increasing the conjugation reaction speed.1.-22. (canceled) 23. A process of synthesizing an amide linked oligonucleotide conjugate comprising the step of reacting a conjugate group to a reactive amino group of an oligonucleotide, wherein said reaction step is performed in a solvent composition comprising at least about 85% (v/v) polar aprotic solvent, wherein the molar ratio of the conjugate group/oligonucleotide used in the solvent composition is between about 0.5 and about 2, and wherein the solvent composition comprises a lipophilic cation. | 2,800 |
347,184 | 29,725,946 | 2,828 | The present invention relates to the field of oligonucleotide conjugates and to methods of synthesis thereof. In the present method a low-water content solvent environment allows a more efficient conjugation, reducing the amount of conjugate moiety needed and increasing the conjugation reaction speed. | 1.-22. (canceled) 23. A process of synthesizing an amide linked oligonucleotide conjugate comprising the step of reacting a conjugate group to a reactive amino group of an oligonucleotide, wherein said reaction step is performed in a solvent composition comprising at least about 85% (v/v) polar aprotic solvent, wherein the molar ratio of the conjugate group/oligonucleotide used in the solvent composition is between about 0.5 and about 2, and wherein the solvent composition comprises a lipophilic cation. | The present invention relates to the field of oligonucleotide conjugates and to methods of synthesis thereof. In the present method a low-water content solvent environment allows a more efficient conjugation, reducing the amount of conjugate moiety needed and increasing the conjugation reaction speed.1.-22. (canceled) 23. A process of synthesizing an amide linked oligonucleotide conjugate comprising the step of reacting a conjugate group to a reactive amino group of an oligonucleotide, wherein said reaction step is performed in a solvent composition comprising at least about 85% (v/v) polar aprotic solvent, wherein the molar ratio of the conjugate group/oligonucleotide used in the solvent composition is between about 0.5 and about 2, and wherein the solvent composition comprises a lipophilic cation. | 2,800 |
347,185 | 16,805,661 | 2,828 | The present invention provides a plasma generating system that includes: a plasma cavity for generating a plasma therewithin by use of microwave energy; an adaptor electrically grounded and having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and an ignition device mounted on the adaptor. The ignition device includes: a first electrode electrically grounded; and a second electrode electrically floating and configured to convert a portion of the microwave energy into an electrostatic discharge to thereby develop a voltage difference between the first and second electrodes, where the voltage difference generates a spark discharge between the first electrode and the second electrode to create the plasma. | 1. A plasma generating system, comprising:
a plasma cavity for generating a plasma therewithin by use of microwaves in the plasma cavity; an adaptor electrically grounded and having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and an ignition device mounted on the adaptor, including:
a first electrode electrically grounded; and
a second electrode electrically floating and configured to convert a portion of the microwaves into an electrostatic discharge to thereby develop a voltage between the first and second electrodes, the voltage generating a spark discharge between the first electrode and the second electrode to create the plasma. 2. A plasma generating system as recited in claim 1, wherein the first electrode has a first pointed tip and the second electrode has a second pointed tip and wherein a gap between the first and second pointed tips ranges from 0.1 to 10.0 mm. 3. A plasma generating system as recited in claim 1, wherein the first and second electrodes are located downstream of the plasma in a direction of a flow of the microwaves. 4. A plasma generating system as recited in claim 1, wherein the first electrode is in direct contact with the adaptor. 5. A plasma generating system as recited in claim 1, wherein the ignition device further includes:
an insulator mounted on and in direct contact with the adaptor, wherein the second electrode is mounted on the insulator to thereby be electrically insulated from the adaptor. 6. A plasma generating system as recited in claim 1, wherein the ignition device further includes:
an electrode support mounted on the adaptor, formed of an electrically insulating material and being of a shape of a hollow cylinder that has a hole, wherein the hole of the electrode support being in fluid communication with the hole of the adaptor, wherein the first and second electrodes are mounted on and in direct contact with the electrode support. 7. A plasma generating system as recited in claim 6, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having one end in direct contact with the adaptor. 8. A plasma generating system as recited in claim 6, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having an electrically conducting wire for connecting to a ground. 9. A plasma generating system as recited in claim 6, wherein the second electrode includes a shank being disposed on a side surface of the electrode support and is electrically insulated from the adaptor. 10. A plasma generating system as recited in claim 6, wherein the second electrode includes an antenna that is configured to convert a portion of the microwaves into an electrostatic charge to develop an additional voltage between the first and second electrodes. 11. A plasma generating system as recited in claim 1, further comprising:
a waveguide for transmitting the microwaves therethrough; and an inner wall disposed within the waveguide to define the plasma cavity and formed of material that is transparent to the microwaves. 12. An ignition device for generating a plasma by use of microwaves in a plasma chamber, comprising:
a first electrode electrically grounded; and a second electrode electrically floating and configured to convert a portion of the microwaves into an electrostatic discharge to thereby develop a voltage between the first and second electrodes, the voltage generating a spark discharge between the first electrode and the second electrode to create a plasma. 13. An ignition device as recited in claim 12, wherein the first electrode has a first pointed tip and the second electrode has a second pointed tip and wherein a gap between the first and second pointed tips ranges from 0.1 to 10.0 mm. 14. An ignition device as recited in claim 12, further comprising:
an adaptor electrically grounded and disposed in the plasma chamber and configured to introduce gas into the plasma chamber and having a hole through which an exhaust gas processed by the plasma exits the plasma cavity, wherein the first electrode is mounted on and in direct contact with the adaptor. 15. An ignition device as recited in claim 14, further comprising:
an insulator mounted on and in direct contact with the adaptor, wherein the second electrode is mounted on the insulator to thereby be electrically insulated from the adaptor. 16. An ignition device as recited in claim 12, further comprising:
an adaptor electrically grounded and disposed in the plasma chamber and configured to introduce gas into the plasma chamber and having a hole through which an exhaust gas processed by the plasma exits the plasma cavity; and an electrode support mounted on the adaptor that is formed of an electrically insulating material and having a shape of a hollow cylinder, wherein the first and second electrodes are mounted on the electrode support. 17. An ignition device as recited in claim 16, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having one end in direct contact with the adaptor. 18. An ignition device as recited in claim 16, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having an electrically conducting wire for connecting to a ground. 19. An ignition device as recited in claim 16, wherein the second electrode includes a shank being disposed on a side surface of the electrode support and is electrically insulated from the adaptor. 20. An ignition device as recited in claim 16, wherein the second electrode includes an antenna that is configured to convert a portion of the microwaves into an electrostatic charge to develop an additional voltage between the first and second electrodes. | The present invention provides a plasma generating system that includes: a plasma cavity for generating a plasma therewithin by use of microwave energy; an adaptor electrically grounded and having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and an ignition device mounted on the adaptor. The ignition device includes: a first electrode electrically grounded; and a second electrode electrically floating and configured to convert a portion of the microwave energy into an electrostatic discharge to thereby develop a voltage difference between the first and second electrodes, where the voltage difference generates a spark discharge between the first electrode and the second electrode to create the plasma.1. A plasma generating system, comprising:
a plasma cavity for generating a plasma therewithin by use of microwaves in the plasma cavity; an adaptor electrically grounded and having a gas outlet through which an exhaust gas processed by the plasma exits the plasma cavity; and an ignition device mounted on the adaptor, including:
a first electrode electrically grounded; and
a second electrode electrically floating and configured to convert a portion of the microwaves into an electrostatic discharge to thereby develop a voltage between the first and second electrodes, the voltage generating a spark discharge between the first electrode and the second electrode to create the plasma. 2. A plasma generating system as recited in claim 1, wherein the first electrode has a first pointed tip and the second electrode has a second pointed tip and wherein a gap between the first and second pointed tips ranges from 0.1 to 10.0 mm. 3. A plasma generating system as recited in claim 1, wherein the first and second electrodes are located downstream of the plasma in a direction of a flow of the microwaves. 4. A plasma generating system as recited in claim 1, wherein the first electrode is in direct contact with the adaptor. 5. A plasma generating system as recited in claim 1, wherein the ignition device further includes:
an insulator mounted on and in direct contact with the adaptor, wherein the second electrode is mounted on the insulator to thereby be electrically insulated from the adaptor. 6. A plasma generating system as recited in claim 1, wherein the ignition device further includes:
an electrode support mounted on the adaptor, formed of an electrically insulating material and being of a shape of a hollow cylinder that has a hole, wherein the hole of the electrode support being in fluid communication with the hole of the adaptor, wherein the first and second electrodes are mounted on and in direct contact with the electrode support. 7. A plasma generating system as recited in claim 6, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having one end in direct contact with the adaptor. 8. A plasma generating system as recited in claim 6, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having an electrically conducting wire for connecting to a ground. 9. A plasma generating system as recited in claim 6, wherein the second electrode includes a shank being disposed on a side surface of the electrode support and is electrically insulated from the adaptor. 10. A plasma generating system as recited in claim 6, wherein the second electrode includes an antenna that is configured to convert a portion of the microwaves into an electrostatic charge to develop an additional voltage between the first and second electrodes. 11. A plasma generating system as recited in claim 1, further comprising:
a waveguide for transmitting the microwaves therethrough; and an inner wall disposed within the waveguide to define the plasma cavity and formed of material that is transparent to the microwaves. 12. An ignition device for generating a plasma by use of microwaves in a plasma chamber, comprising:
a first electrode electrically grounded; and a second electrode electrically floating and configured to convert a portion of the microwaves into an electrostatic discharge to thereby develop a voltage between the first and second electrodes, the voltage generating a spark discharge between the first electrode and the second electrode to create a plasma. 13. An ignition device as recited in claim 12, wherein the first electrode has a first pointed tip and the second electrode has a second pointed tip and wherein a gap between the first and second pointed tips ranges from 0.1 to 10.0 mm. 14. An ignition device as recited in claim 12, further comprising:
an adaptor electrically grounded and disposed in the plasma chamber and configured to introduce gas into the plasma chamber and having a hole through which an exhaust gas processed by the plasma exits the plasma cavity, wherein the first electrode is mounted on and in direct contact with the adaptor. 15. An ignition device as recited in claim 14, further comprising:
an insulator mounted on and in direct contact with the adaptor, wherein the second electrode is mounted on the insulator to thereby be electrically insulated from the adaptor. 16. An ignition device as recited in claim 12, further comprising:
an adaptor electrically grounded and disposed in the plasma chamber and configured to introduce gas into the plasma chamber and having a hole through which an exhaust gas processed by the plasma exits the plasma cavity; and an electrode support mounted on the adaptor that is formed of an electrically insulating material and having a shape of a hollow cylinder, wherein the first and second electrodes are mounted on the electrode support. 17. An ignition device as recited in claim 16, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having one end in direct contact with the adaptor. 18. An ignition device as recited in claim 16, wherein the first electrode includes a shank being disposed on a side surface of the electrode support and having an electrically conducting wire for connecting to a ground. 19. An ignition device as recited in claim 16, wherein the second electrode includes a shank being disposed on a side surface of the electrode support and is electrically insulated from the adaptor. 20. An ignition device as recited in claim 16, wherein the second electrode includes an antenna that is configured to convert a portion of the microwaves into an electrostatic charge to develop an additional voltage between the first and second electrodes. | 2,800 |
347,186 | 16,805,671 | 2,435 | Various implementations described herein relate to systems and methods for protecting data stored on a Solid State Drive (SSD) against malware, including determining, by a controller of the SSD, a typical traffic profile, receiving, by the controller, commands from a host, and determining, by the controller, that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile. In response to determining the commands are likely caused by the malware, the controller performs a malware response action. | 1. A method for protecting data stored on a Solid State Drive (SSD) against malware, comprising:
determining, by a controller of the SSD, a typical traffic profile; receiving, by the controller, commands from a host; determining, by the controller, that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and in response to determining the commands are likely caused by the malware, perform, by the controller, a malware response action. 2. The method of claim 1, wherein the malware response action comprises one or more of delaying execution of the commands, stopping the execution of the commands, ignoring the commands, or reporting to the host that the commands are likely caused by the malware. 3. The method of claim 1, wherein the typical traffic profile is determined based on one or more of input/output (I/O) command pattern, logical block address range sizes, data transfer types, rates or sizes of data received from the host, or data content types of the data received from the host. 4. The method of claim 1, wherein the typical traffic profile is determined based on input/output (I/O) operations per second (IOPS) for one or more of sequential write operations, random write operations, sequential read operations, random read operations, trim operations, unmap operations, or deallocate operations. 5. The method of claim 4, wherein
the commands received from the host comprises sequential read commands, sequential write commands, trim operations, unmap operations or deallocate operations; and the sequential read commands, the sequential write commands, the trim operations, the unmap operations or the deallocate operations are determined to deviate from the typical traffic profile based on the TOPS for the one or more of the sequential write operations, the random write operations, the sequential read operations, the random read operations, the trim operations, the unmap operations or the deallocate operations. 6. The method of claim 1, wherein the typical traffic profile is determined based on input/output (I/O) operations per second (IOPS) for one or more of small write operations, large write operations, small read operations, large read operations, trim operations, unmap operations, or deallocate operations. 7. The method of claim 6, wherein
the commands received from the host comprises read commands corresponding to large data sizes or write commands corresponding to large data sizes; and the read commands corresponding to large data sizes or the write commands corresponding to large data sizes are determined to deviate from the typical traffic profile based on the IOPS for the one or more of the small write operations, the large write operations, the small read operations, or the large read operations. 8. The method of claim 1, wherein
the commands are write commands; and determining that the commands are likely caused by the malware comprises determining, by the controller, that data associated with the write commands is encrypted data. 9. The method of claim 8, wherein determining that the data associated with the write commands is the encrypted data comprises:
compressing, by a compressor of the controller, the data associated with the write commands; and determining, by the compressor, that the data is incompressible. 10. The method of claim 9, wherein
compressing the data comprises determining an entropy value for the data; and the data associated with the write commands is determined to be encrypted data based on the entropy value and an encrypted data threshold. 11. The method of claim 8, wherein malware response action comprises one or more of:
stopping processing trim, unmap, deallocate commands received from the host; stopping processing write commands received from the host; causing the SSD to not respond to any commands from the host; stopping all write operations; or stopping any garbage collection operations. 12. The method of claim 8, further comprising simultaneously providing the data to a memory controller and a compressor. 13. A Solid State Drive (SSD), comprising:
a controller; and a non-volatile memory, wherein the controller is configured to:
determine a typical traffic profile;
receive commands from a host;
determine that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and
in response to determining the commands are likely caused by the malware, performing a malware response action. 14. The SSD of claim 13, wherein
the commands are write commands; and the controller determines that the commands are likely caused by the malware by determining that data associated with the write commands is encrypted data. 15. The SSD of claim 14, wherein
the controller comprises a compressor; and the controller determines that the data associated with the write commands is the encrypted data by:
compressing, by the compressor, the data associated with the write commands; and
determining, by the compressor, that the data is incompressible. 16. The SSD of claim 15, wherein
compressing the data comprises determining an entropy value for the data; and the data associated with the write commands is determined to be encrypted data based on the entropy value and an encrypted data threshold. 17. The SSD of claim 14, wherein malware response action comprises one or more of:
stopping processing trim, unmap, deallocate commands received from the host; stopping processing write commands received from the host; causing the SSD to not respond to any commands from the host; stopping all write operations; or stopping any garbage collection operations. 18. The SSD of claim 14, wherein
the controller comprises a compressor and a memory controller; and the data is simultaneously provided to the compressor and the memory controller. 19. The SSD of claim 13, wherein the typical traffic profile is determined based on one or more of input/output (I/O) command pattern, data sizes of data received from the host, or data content types of the data received from the host. 20. A non-transitory computer-readable medium storing computer-readable instructions, such that when executed, causes a controller of a Solid State Drive (SSD) to:
determine a typical traffic profile; receive commands from a host; determine that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and in response to determining the commands are likely caused by the malware, performing a malware response action. | Various implementations described herein relate to systems and methods for protecting data stored on a Solid State Drive (SSD) against malware, including determining, by a controller of the SSD, a typical traffic profile, receiving, by the controller, commands from a host, and determining, by the controller, that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile. In response to determining the commands are likely caused by the malware, the controller performs a malware response action.1. A method for protecting data stored on a Solid State Drive (SSD) against malware, comprising:
determining, by a controller of the SSD, a typical traffic profile; receiving, by the controller, commands from a host; determining, by the controller, that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and in response to determining the commands are likely caused by the malware, perform, by the controller, a malware response action. 2. The method of claim 1, wherein the malware response action comprises one or more of delaying execution of the commands, stopping the execution of the commands, ignoring the commands, or reporting to the host that the commands are likely caused by the malware. 3. The method of claim 1, wherein the typical traffic profile is determined based on one or more of input/output (I/O) command pattern, logical block address range sizes, data transfer types, rates or sizes of data received from the host, or data content types of the data received from the host. 4. The method of claim 1, wherein the typical traffic profile is determined based on input/output (I/O) operations per second (IOPS) for one or more of sequential write operations, random write operations, sequential read operations, random read operations, trim operations, unmap operations, or deallocate operations. 5. The method of claim 4, wherein
the commands received from the host comprises sequential read commands, sequential write commands, trim operations, unmap operations or deallocate operations; and the sequential read commands, the sequential write commands, the trim operations, the unmap operations or the deallocate operations are determined to deviate from the typical traffic profile based on the TOPS for the one or more of the sequential write operations, the random write operations, the sequential read operations, the random read operations, the trim operations, the unmap operations or the deallocate operations. 6. The method of claim 1, wherein the typical traffic profile is determined based on input/output (I/O) operations per second (IOPS) for one or more of small write operations, large write operations, small read operations, large read operations, trim operations, unmap operations, or deallocate operations. 7. The method of claim 6, wherein
the commands received from the host comprises read commands corresponding to large data sizes or write commands corresponding to large data sizes; and the read commands corresponding to large data sizes or the write commands corresponding to large data sizes are determined to deviate from the typical traffic profile based on the IOPS for the one or more of the small write operations, the large write operations, the small read operations, or the large read operations. 8. The method of claim 1, wherein
the commands are write commands; and determining that the commands are likely caused by the malware comprises determining, by the controller, that data associated with the write commands is encrypted data. 9. The method of claim 8, wherein determining that the data associated with the write commands is the encrypted data comprises:
compressing, by a compressor of the controller, the data associated with the write commands; and determining, by the compressor, that the data is incompressible. 10. The method of claim 9, wherein
compressing the data comprises determining an entropy value for the data; and the data associated with the write commands is determined to be encrypted data based on the entropy value and an encrypted data threshold. 11. The method of claim 8, wherein malware response action comprises one or more of:
stopping processing trim, unmap, deallocate commands received from the host; stopping processing write commands received from the host; causing the SSD to not respond to any commands from the host; stopping all write operations; or stopping any garbage collection operations. 12. The method of claim 8, further comprising simultaneously providing the data to a memory controller and a compressor. 13. A Solid State Drive (SSD), comprising:
a controller; and a non-volatile memory, wherein the controller is configured to:
determine a typical traffic profile;
receive commands from a host;
determine that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and
in response to determining the commands are likely caused by the malware, performing a malware response action. 14. The SSD of claim 13, wherein
the commands are write commands; and the controller determines that the commands are likely caused by the malware by determining that data associated with the write commands is encrypted data. 15. The SSD of claim 14, wherein
the controller comprises a compressor; and the controller determines that the data associated with the write commands is the encrypted data by:
compressing, by the compressor, the data associated with the write commands; and
determining, by the compressor, that the data is incompressible. 16. The SSD of claim 15, wherein
compressing the data comprises determining an entropy value for the data; and the data associated with the write commands is determined to be encrypted data based on the entropy value and an encrypted data threshold. 17. The SSD of claim 14, wherein malware response action comprises one or more of:
stopping processing trim, unmap, deallocate commands received from the host; stopping processing write commands received from the host; causing the SSD to not respond to any commands from the host; stopping all write operations; or stopping any garbage collection operations. 18. The SSD of claim 14, wherein
the controller comprises a compressor and a memory controller; and the data is simultaneously provided to the compressor and the memory controller. 19. The SSD of claim 13, wherein the typical traffic profile is determined based on one or more of input/output (I/O) command pattern, data sizes of data received from the host, or data content types of the data received from the host. 20. A non-transitory computer-readable medium storing computer-readable instructions, such that when executed, causes a controller of a Solid State Drive (SSD) to:
determine a typical traffic profile; receive commands from a host; determine that the commands are likely caused by malware by determining that the commands deviate from the typical traffic profile; and in response to determining the commands are likely caused by the malware, performing a malware response action. | 2,400 |
347,187 | 16,805,690 | 2,435 | A non-destructive testing device includes a tubular housing including a proximal end and a distal end. A conduit section is arranged at the proximal end, and a bendable articulation section secured to the conduit section and arranged at the distal end. A plurality of actuation systems each includes a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section, and an actuator disposed at the proximal end of the tubular housing and secured to the control cable. | 1. A non-destructive testing device, comprising:
a tubular housing including a proximal end and a distal end, including:
a conduit section arranged at the proximal end; and
a bendable articulation section secured to the conduit section and arranged at the distal end; and
a plurality of actuation systems, each actuation system including:
a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable. 2. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 3. The non-destructive testing device of claim 2, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 4. The non-destructive testing device of claim 3, wherein each control cable of the plurality of actuation systems is configured to be independently controlled. 5. The non-destructive testing device of claim 1, wherein the plurality of actuation systems includes a first actuation system, a second actuation system, and a third actuation system. 6. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the first actuation system is actuated. 7. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the second actuation system and the third actuation system are actuated in the same direction. 8. The non-destructive testing device of claim 1, wherein each control cable of the plurality of actuation systems extends within channels formed between an outer wall and an inner wall of the bendable articulation section. 9. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is unequally spaced apart circumferentially around the bendable articulation section. 10. The non-destructive testing device of claim 9, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. 11. The non-destructive testing device of claim 1, further comprising:
a head section coupled to the distal end of the tubular housing; and a control unit housing coupled to the proximal end of the tubular housing. 12. The non-destructive testing device of claim 11, wherein each actuator of the plurality of actuation systems is arranged within the control unit housing. 13. A method of articulating a non-destructive testing device, comprising:
receiving, by a control unit communicatively coupled to a plurality of actuation systems, an actuation command, each of the plurality of actuation systems including:
a control cable extending along a tubular housing and arranged at a respective circumferential position within the tubular housing; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable;
actuating the plurality of actuation systems based on the actuation command in order to bend a bendable articulation section of the tubular housing, wherein each actuation system is configured to be independently operable. 14. The method of claim 13, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 15. The method of claim 14, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 16. The method of claim 15, wherein each actuator of the plurality of actuation systems includes a force sensor configured to measure the tension of each control cable. 17. The method of claim 16, wherein each control cable is extended or retracted based on the tension of each control cable of the plurality of actuation systems. 18. The method of claim 13, comprising a first actuation system, a second actuation system, and a third actuation system. 19. The method of claim 18, further comprising:
actuating the first actuation system to apply tension to a first control cable bends the bendable articulation section in a first direction; and actuating the second actuation system and the third actuation system to apply tension to a second control cable and a third control cable bends the bendable articulation section in a second direction, opposite the first direction. 20. The method of claim 19, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. | A non-destructive testing device includes a tubular housing including a proximal end and a distal end. A conduit section is arranged at the proximal end, and a bendable articulation section secured to the conduit section and arranged at the distal end. A plurality of actuation systems each includes a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section, and an actuator disposed at the proximal end of the tubular housing and secured to the control cable.1. A non-destructive testing device, comprising:
a tubular housing including a proximal end and a distal end, including:
a conduit section arranged at the proximal end; and
a bendable articulation section secured to the conduit section and arranged at the distal end; and
a plurality of actuation systems, each actuation system including:
a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable. 2. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 3. The non-destructive testing device of claim 2, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 4. The non-destructive testing device of claim 3, wherein each control cable of the plurality of actuation systems is configured to be independently controlled. 5. The non-destructive testing device of claim 1, wherein the plurality of actuation systems includes a first actuation system, a second actuation system, and a third actuation system. 6. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the first actuation system is actuated. 7. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the second actuation system and the third actuation system are actuated in the same direction. 8. The non-destructive testing device of claim 1, wherein each control cable of the plurality of actuation systems extends within channels formed between an outer wall and an inner wall of the bendable articulation section. 9. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is unequally spaced apart circumferentially around the bendable articulation section. 10. The non-destructive testing device of claim 9, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. 11. The non-destructive testing device of claim 1, further comprising:
a head section coupled to the distal end of the tubular housing; and a control unit housing coupled to the proximal end of the tubular housing. 12. The non-destructive testing device of claim 11, wherein each actuator of the plurality of actuation systems is arranged within the control unit housing. 13. A method of articulating a non-destructive testing device, comprising:
receiving, by a control unit communicatively coupled to a plurality of actuation systems, an actuation command, each of the plurality of actuation systems including:
a control cable extending along a tubular housing and arranged at a respective circumferential position within the tubular housing; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable;
actuating the plurality of actuation systems based on the actuation command in order to bend a bendable articulation section of the tubular housing, wherein each actuation system is configured to be independently operable. 14. The method of claim 13, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 15. The method of claim 14, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 16. The method of claim 15, wherein each actuator of the plurality of actuation systems includes a force sensor configured to measure the tension of each control cable. 17. The method of claim 16, wherein each control cable is extended or retracted based on the tension of each control cable of the plurality of actuation systems. 18. The method of claim 13, comprising a first actuation system, a second actuation system, and a third actuation system. 19. The method of claim 18, further comprising:
actuating the first actuation system to apply tension to a first control cable bends the bendable articulation section in a first direction; and actuating the second actuation system and the third actuation system to apply tension to a second control cable and a third control cable bends the bendable articulation section in a second direction, opposite the first direction. 20. The method of claim 19, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. | 2,400 |
347,188 | 16,805,693 | 2,649 | A non-destructive testing device includes a tubular housing including a proximal end and a distal end. A conduit section is arranged at the proximal end, and a bendable articulation section secured to the conduit section and arranged at the distal end. A plurality of actuation systems each includes a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section, and an actuator disposed at the proximal end of the tubular housing and secured to the control cable. | 1. A non-destructive testing device, comprising:
a tubular housing including a proximal end and a distal end, including:
a conduit section arranged at the proximal end; and
a bendable articulation section secured to the conduit section and arranged at the distal end; and
a plurality of actuation systems, each actuation system including:
a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable. 2. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 3. The non-destructive testing device of claim 2, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 4. The non-destructive testing device of claim 3, wherein each control cable of the plurality of actuation systems is configured to be independently controlled. 5. The non-destructive testing device of claim 1, wherein the plurality of actuation systems includes a first actuation system, a second actuation system, and a third actuation system. 6. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the first actuation system is actuated. 7. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the second actuation system and the third actuation system are actuated in the same direction. 8. The non-destructive testing device of claim 1, wherein each control cable of the plurality of actuation systems extends within channels formed between an outer wall and an inner wall of the bendable articulation section. 9. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is unequally spaced apart circumferentially around the bendable articulation section. 10. The non-destructive testing device of claim 9, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. 11. The non-destructive testing device of claim 1, further comprising:
a head section coupled to the distal end of the tubular housing; and a control unit housing coupled to the proximal end of the tubular housing. 12. The non-destructive testing device of claim 11, wherein each actuator of the plurality of actuation systems is arranged within the control unit housing. 13. A method of articulating a non-destructive testing device, comprising:
receiving, by a control unit communicatively coupled to a plurality of actuation systems, an actuation command, each of the plurality of actuation systems including:
a control cable extending along a tubular housing and arranged at a respective circumferential position within the tubular housing; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable;
actuating the plurality of actuation systems based on the actuation command in order to bend a bendable articulation section of the tubular housing, wherein each actuation system is configured to be independently operable. 14. The method of claim 13, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 15. The method of claim 14, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 16. The method of claim 15, wherein each actuator of the plurality of actuation systems includes a force sensor configured to measure the tension of each control cable. 17. The method of claim 16, wherein each control cable is extended or retracted based on the tension of each control cable of the plurality of actuation systems. 18. The method of claim 13, comprising a first actuation system, a second actuation system, and a third actuation system. 19. The method of claim 18, further comprising:
actuating the first actuation system to apply tension to a first control cable bends the bendable articulation section in a first direction; and actuating the second actuation system and the third actuation system to apply tension to a second control cable and a third control cable bends the bendable articulation section in a second direction, opposite the first direction. 20. The method of claim 19, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. | A non-destructive testing device includes a tubular housing including a proximal end and a distal end. A conduit section is arranged at the proximal end, and a bendable articulation section secured to the conduit section and arranged at the distal end. A plurality of actuation systems each includes a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section, and an actuator disposed at the proximal end of the tubular housing and secured to the control cable.1. A non-destructive testing device, comprising:
a tubular housing including a proximal end and a distal end, including:
a conduit section arranged at the proximal end; and
a bendable articulation section secured to the conduit section and arranged at the distal end; and
a plurality of actuation systems, each actuation system including:
a control cable extending along the tubular housing and arranged at a respective circumferential position within the bendable articulation section; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable. 2. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 3. The non-destructive testing device of claim 2, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 4. The non-destructive testing device of claim 3, wherein each control cable of the plurality of actuation systems is configured to be independently controlled. 5. The non-destructive testing device of claim 1, wherein the plurality of actuation systems includes a first actuation system, a second actuation system, and a third actuation system. 6. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the first actuation system is actuated. 7. The non-destructive testing device of claim 5, wherein the bendable articulation section is configured to bend when only the second actuation system and the third actuation system are actuated in the same direction. 8. The non-destructive testing device of claim 1, wherein each control cable of the plurality of actuation systems extends within channels formed between an outer wall and an inner wall of the bendable articulation section. 9. The non-destructive testing device of claim 1, wherein each circumferential position of each control cable of the plurality of actuation systems is unequally spaced apart circumferentially around the bendable articulation section. 10. The non-destructive testing device of claim 9, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. 11. The non-destructive testing device of claim 1, further comprising:
a head section coupled to the distal end of the tubular housing; and a control unit housing coupled to the proximal end of the tubular housing. 12. The non-destructive testing device of claim 11, wherein each actuator of the plurality of actuation systems is arranged within the control unit housing. 13. A method of articulating a non-destructive testing device, comprising:
receiving, by a control unit communicatively coupled to a plurality of actuation systems, an actuation command, each of the plurality of actuation systems including:
a control cable extending along a tubular housing and arranged at a respective circumferential position within the tubular housing; and
an actuator disposed at the proximal end of the tubular housing and secured to the control cable;
actuating the plurality of actuation systems based on the actuation command in order to bend a bendable articulation section of the tubular housing, wherein each actuation system is configured to be independently operable. 14. The method of claim 13, wherein each circumferential position of each control cable of the plurality of actuation systems is substantially equally spaced apart circumferentially around the bendable articulation section. 15. The method of claim 14, wherein each actuator of the plurality of actuation systems is configured to extend or retract the control cable secured to the actuator. 16. The method of claim 15, wherein each actuator of the plurality of actuation systems includes a force sensor configured to measure the tension of each control cable. 17. The method of claim 16, wherein each control cable is extended or retracted based on the tension of each control cable of the plurality of actuation systems. 18. The method of claim 13, comprising a first actuation system, a second actuation system, and a third actuation system. 19. The method of claim 18, further comprising:
actuating the first actuation system to apply tension to a first control cable bends the bendable articulation section in a first direction; and actuating the second actuation system and the third actuation system to apply tension to a second control cable and a third control cable bends the bendable articulation section in a second direction, opposite the first direction. 20. The method of claim 19, wherein the bendable articulation section is configured to articulate a substantially 360° angle about the conduit section. | 2,600 |
347,189 | 16,805,652 | 2,649 | Methods, systems, and devices for wireless communications are described. The described techniques provide for dynamic updates to beam failure detection (BFD) reference signals (RSs) and path loss RS using medium access control-control element (MAC-CE) or downlink control information (DCI). For example, the quasi co-location (QCL) of periodic CSI-RS may be dynamically updated by the MAC-CE or DCI when the periodic CSI-RS is for BFD RS. Also, a semi-persistent CSI-RS or aperiodic CSI-RS may act as a BFD RS. An enhanced update procedure may be used to update the path loss RS dynamically using MAC-CE or DCI. In some cases, the path loss RS parameters updated via MAC-CE or DCI may overwrite the previously RRC configured path loss RS parameters. In another example, if the path loss RS is not configured, then the path loss RS by default may be the spatial relation reference signal of the corresponding uplink beam. | 1. A method for wireless communications, comprising:
receiving a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and receiving, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 2. The method of claim 1, further comprising:
overwriting the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimating a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 3. The method of claim 1, wherein the first message comprises a radio resource control message for uplink power control. 4. The method of claim 3, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 5. The method of claim 4, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 6. The method of claim 4, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 7. The method of claim 1, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 8. A method for wireless communications, comprising:
transmitting a first message that indicates a first set of reference signal resources configured for a path loss reference signal; determining that the first set of reference signal resources has changed to a second set of reference signal resources; and transmitting, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 9. The method of claim 8, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 10. The method of claim 8, wherein the first message comprises a radio resource control message for uplink power control. 11. The method of claim 10, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 12. The method of claim 11, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 13. The method of claim 11, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 14. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and
receive, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 15. The apparatus of claim 14, wherein the instructions are further executable by the processor to cause the apparatus to:
overwrite the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimate a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 16. The apparatus of claim 14, wherein the first message comprises a radio resource control message for uplink power control. 17. The apparatus of claim 16, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 18. The apparatus of claim 14, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 19. The apparatus of claim 18, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 20. The apparatus of claim 18, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 21. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
transmit a first message that indicates a first set of reference signal resources configured for a path loss reference signal;
determine that the first set of reference signal resources has changed to a second set of reference signal resources; and
transmit, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 22. The apparatus of claim 21, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 23. The apparatus of claim 21, wherein the first message comprises a radio resource control message for uplink power control. 24. The apparatus of claim 23, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 25. The apparatus of claim 24, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 26. The apparatus of claim 24, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. | Methods, systems, and devices for wireless communications are described. The described techniques provide for dynamic updates to beam failure detection (BFD) reference signals (RSs) and path loss RS using medium access control-control element (MAC-CE) or downlink control information (DCI). For example, the quasi co-location (QCL) of periodic CSI-RS may be dynamically updated by the MAC-CE or DCI when the periodic CSI-RS is for BFD RS. Also, a semi-persistent CSI-RS or aperiodic CSI-RS may act as a BFD RS. An enhanced update procedure may be used to update the path loss RS dynamically using MAC-CE or DCI. In some cases, the path loss RS parameters updated via MAC-CE or DCI may overwrite the previously RRC configured path loss RS parameters. In another example, if the path loss RS is not configured, then the path loss RS by default may be the spatial relation reference signal of the corresponding uplink beam.1. A method for wireless communications, comprising:
receiving a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and receiving, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 2. The method of claim 1, further comprising:
overwriting the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimating a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 3. The method of claim 1, wherein the first message comprises a radio resource control message for uplink power control. 4. The method of claim 3, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 5. The method of claim 4, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 6. The method of claim 4, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 7. The method of claim 1, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 8. A method for wireless communications, comprising:
transmitting a first message that indicates a first set of reference signal resources configured for a path loss reference signal; determining that the first set of reference signal resources has changed to a second set of reference signal resources; and transmitting, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 9. The method of claim 8, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 10. The method of claim 8, wherein the first message comprises a radio resource control message for uplink power control. 11. The method of claim 10, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 12. The method of claim 11, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 13. The method of claim 11, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 14. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and
receive, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 15. The apparatus of claim 14, wherein the instructions are further executable by the processor to cause the apparatus to:
overwrite the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimate a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 16. The apparatus of claim 14, wherein the first message comprises a radio resource control message for uplink power control. 17. The apparatus of claim 16, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 18. The apparatus of claim 14, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 19. The apparatus of claim 18, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 20. The apparatus of claim 18, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 21. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
transmit a first message that indicates a first set of reference signal resources configured for a path loss reference signal;
determine that the first set of reference signal resources has changed to a second set of reference signal resources; and
transmit, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 22. The apparatus of claim 21, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 23. The apparatus of claim 21, wherein the first message comprises a radio resource control message for uplink power control. 24. The apparatus of claim 23, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 25. The apparatus of claim 24, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 26. The apparatus of claim 24, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. | 2,600 |
347,190 | 29,725,938 | 2,649 | Methods, systems, and devices for wireless communications are described. The described techniques provide for dynamic updates to beam failure detection (BFD) reference signals (RSs) and path loss RS using medium access control-control element (MAC-CE) or downlink control information (DCI). For example, the quasi co-location (QCL) of periodic CSI-RS may be dynamically updated by the MAC-CE or DCI when the periodic CSI-RS is for BFD RS. Also, a semi-persistent CSI-RS or aperiodic CSI-RS may act as a BFD RS. An enhanced update procedure may be used to update the path loss RS dynamically using MAC-CE or DCI. In some cases, the path loss RS parameters updated via MAC-CE or DCI may overwrite the previously RRC configured path loss RS parameters. In another example, if the path loss RS is not configured, then the path loss RS by default may be the spatial relation reference signal of the corresponding uplink beam. | 1. A method for wireless communications, comprising:
receiving a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and receiving, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 2. The method of claim 1, further comprising:
overwriting the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimating a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 3. The method of claim 1, wherein the first message comprises a radio resource control message for uplink power control. 4. The method of claim 3, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 5. The method of claim 4, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 6. The method of claim 4, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 7. The method of claim 1, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 8. A method for wireless communications, comprising:
transmitting a first message that indicates a first set of reference signal resources configured for a path loss reference signal; determining that the first set of reference signal resources has changed to a second set of reference signal resources; and transmitting, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 9. The method of claim 8, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 10. The method of claim 8, wherein the first message comprises a radio resource control message for uplink power control. 11. The method of claim 10, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 12. The method of claim 11, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 13. The method of claim 11, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 14. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and
receive, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 15. The apparatus of claim 14, wherein the instructions are further executable by the processor to cause the apparatus to:
overwrite the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimate a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 16. The apparatus of claim 14, wherein the first message comprises a radio resource control message for uplink power control. 17. The apparatus of claim 16, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 18. The apparatus of claim 14, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 19. The apparatus of claim 18, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 20. The apparatus of claim 18, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 21. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
transmit a first message that indicates a first set of reference signal resources configured for a path loss reference signal;
determine that the first set of reference signal resources has changed to a second set of reference signal resources; and
transmit, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 22. The apparatus of claim 21, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 23. The apparatus of claim 21, wherein the first message comprises a radio resource control message for uplink power control. 24. The apparatus of claim 23, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 25. The apparatus of claim 24, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 26. The apparatus of claim 24, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. | Methods, systems, and devices for wireless communications are described. The described techniques provide for dynamic updates to beam failure detection (BFD) reference signals (RSs) and path loss RS using medium access control-control element (MAC-CE) or downlink control information (DCI). For example, the quasi co-location (QCL) of periodic CSI-RS may be dynamically updated by the MAC-CE or DCI when the periodic CSI-RS is for BFD RS. Also, a semi-persistent CSI-RS or aperiodic CSI-RS may act as a BFD RS. An enhanced update procedure may be used to update the path loss RS dynamically using MAC-CE or DCI. In some cases, the path loss RS parameters updated via MAC-CE or DCI may overwrite the previously RRC configured path loss RS parameters. In another example, if the path loss RS is not configured, then the path loss RS by default may be the spatial relation reference signal of the corresponding uplink beam.1. A method for wireless communications, comprising:
receiving a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and receiving, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 2. The method of claim 1, further comprising:
overwriting the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimating a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 3. The method of claim 1, wherein the first message comprises a radio resource control message for uplink power control. 4. The method of claim 3, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 5. The method of claim 4, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 6. The method of claim 4, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 7. The method of claim 1, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 8. A method for wireless communications, comprising:
transmitting a first message that indicates a first set of reference signal resources configured for a path loss reference signal; determining that the first set of reference signal resources has changed to a second set of reference signal resources; and transmitting, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 9. The method of claim 8, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 10. The method of claim 8, wherein the first message comprises a radio resource control message for uplink power control. 11. The method of claim 10, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 12. The method of claim 11, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 13. The method of claim 11, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 14. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
receive a first message that indicates a first set of reference signal resources configured for a path loss reference signal; and
receive, based at least in part on the first set of reference signal resources changing, a second message that indicates a second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 15. The apparatus of claim 14, wherein the instructions are further executable by the processor to cause the apparatus to:
overwrite the first set of reference signal resources with the second set of reference signal resources based at least in part on receiving the second message; and estimate a path loss for an uplink bandwidth part based at least in part on the second set of reference signal resources associated with the path loss reference signal. 16. The apparatus of claim 14, wherein the first message comprises a radio resource control message for uplink power control. 17. The apparatus of claim 16, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 18. The apparatus of claim 14, wherein the path loss reference signal comprises one or more of a channel state information reference signal or a synchronization signal block. 19. The apparatus of claim 18, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 20. The apparatus of claim 18, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. 21. An apparatus for wireless communications, comprising:
a processor, memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
transmit a first message that indicates a first set of reference signal resources configured for a path loss reference signal;
determine that the first set of reference signal resources has changed to a second set of reference signal resources; and
transmit, based at least in part on the first set of reference signal resources changing, a second message that indicates the second set of reference signal resources configured for the path loss reference signal, wherein the second message comprises one or more of a medium access control (MAC) control element or downlink control information. 22. The apparatus of claim 21, wherein the second set of reference signal resources overwrites the first set of reference signal resources. 23. The apparatus of claim 21, wherein the first message comprises a radio resource control message for uplink power control. 24. The apparatus of claim 23, wherein the uplink power control comprises one of more of physical uplink control channel power control, physical uplink shared channel power control, or sounding reference signal power control. 25. The apparatus of claim 24, wherein the sounding reference signal power control comprises an aperiodic sounding reference signal. 26. The apparatus of claim 24, wherein the sounding reference signal power control comprises a semi-persistent sounding reference signal. | 2,600 |
347,191 | 16,805,611 | 2,649 | Embodiments of the present disclosure provides systems and methods for processing video content. The methods include: receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor. | 1. A computer-implemented method for processing video content, comprising:
receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor. 2. The method according to claim 1, wherein determining the chroma scaling factor based on the luma scaling information further comprises:
determining a luma scaling factor of the luma block based on the luma scaling information; determining the chroma scaling factor based on a value of the luma scaling factor. 3. The method according to claim 2, wherein determining the chroma scaling factor based on a value of the luma scaling factor further comprises:
setting the chroma scaling factor equal to the value of the luma scaling factor. 4. The method according to claim 1, wherein processing the chroma block using the chroma scaling factor further comprises:
determining if a first condition is satisfied; and performing one of
in response to the determination that the first condition is satisfied, processing the chroma block using the chroma scaling factor; or
in response to the determination that the first condition is not satisfied, bypassing the processing of the chroma block using the chroma scaling factor. 5. The method according claim 4, wherein the first condition comprises:
a target coding unit associated with the picture having no non-zero residuals; or a target transform unit associated with the picture having no non-zero chroma residuals. 6. The method according claim 5, wherein
the target coding unit having no non-zero residuals is determined based on a value of a first coded block flag of the target coding unit, and the target transform unit having no non-zero chroma residuals is determined based on values of a second coded block flag for a first chroma component and a third coded block flag for a second luma chroma component of the target transform unit. 7. The method of claim 6, wherein
the value of the first coded block flag is 0; and the values of the second coded block flag and the third coded block flag are 0. 8. The method according to claim 1, wherein processing the chroma block using the chroma scaling factor comprises:
processing residuals of the chroma block using the chroma scaling factor. 9. An apparatus for processing video content, comprising:
a memory storing a set of instructions; and a processor coupled to the memory and configured to execute the set of instructions to cause the apparatus to perform:
receiving a chrome block and a luma block associated with a picture;
determining luma scaling information associated with the luma block;
determining a chroma scaling factor based on the luma scaling information; and
processing the chroma block using the chroma scaling factor. 10. The apparatus according to claim 9, wherein in determining the chroma scaling factor based on the luma scaling information, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
determining a luma scaling factor of the luma block based on the luma scaling information; determining the chroma scaling factor based on a value of the luma scaling factor. 11. The apparatus according to claim 10, wherein in determining the chroma scaling factor based on a value of the luma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
setting the chroma scaling factor equal to the value of the luma scaling factor. 12. The apparatus according to claim 9, wherein in processing the chroma block using the chroma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
determining if a first condition is satisfied; and performing one of
in response to the determination that the second condition is satisfied, processing the chroma block using the chroma scaling factor; or
in response to the determination that the second condition is not satisfied, bypassing the processing of the chroma block using the chroma scaling factor. 13. The apparatus according claim 12, wherein the first condition comprises:
a target coding unit associated with the picture having no non-zero residuals; or a target transform unit associated with the picture having no non-zero chroma residuals. 14. The apparatus according claim 13, wherein
the target coding unit having no non-zero residuals is determined based on a value of a first coded block flag of the target coding unit, and the target transform unit having no non-zero chroma residuals is determined based on values of a second coded block flag for a first chroma component and a third coded block flag for a second chroma component of the target transform unit. 15. The apparatus of claim 14, wherein
the value of the first coded block flag is 0; and the values of the second coded block flag and the third coded block flag are 0. 16. The apparatus according to claim 9, wherein in processing the chroma block using the chroma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
processing residuals of the chroma block using the chroma scaling factor. 17. A non-transitory computer-readable storage medium storing a set of instructions that are executable by one or more processors of a device to cause the device to perform a method for processing video content, the method comprising:
receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor. | Embodiments of the present disclosure provides systems and methods for processing video content. The methods include: receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor.1. A computer-implemented method for processing video content, comprising:
receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor. 2. The method according to claim 1, wherein determining the chroma scaling factor based on the luma scaling information further comprises:
determining a luma scaling factor of the luma block based on the luma scaling information; determining the chroma scaling factor based on a value of the luma scaling factor. 3. The method according to claim 2, wherein determining the chroma scaling factor based on a value of the luma scaling factor further comprises:
setting the chroma scaling factor equal to the value of the luma scaling factor. 4. The method according to claim 1, wherein processing the chroma block using the chroma scaling factor further comprises:
determining if a first condition is satisfied; and performing one of
in response to the determination that the first condition is satisfied, processing the chroma block using the chroma scaling factor; or
in response to the determination that the first condition is not satisfied, bypassing the processing of the chroma block using the chroma scaling factor. 5. The method according claim 4, wherein the first condition comprises:
a target coding unit associated with the picture having no non-zero residuals; or a target transform unit associated with the picture having no non-zero chroma residuals. 6. The method according claim 5, wherein
the target coding unit having no non-zero residuals is determined based on a value of a first coded block flag of the target coding unit, and the target transform unit having no non-zero chroma residuals is determined based on values of a second coded block flag for a first chroma component and a third coded block flag for a second luma chroma component of the target transform unit. 7. The method of claim 6, wherein
the value of the first coded block flag is 0; and the values of the second coded block flag and the third coded block flag are 0. 8. The method according to claim 1, wherein processing the chroma block using the chroma scaling factor comprises:
processing residuals of the chroma block using the chroma scaling factor. 9. An apparatus for processing video content, comprising:
a memory storing a set of instructions; and a processor coupled to the memory and configured to execute the set of instructions to cause the apparatus to perform:
receiving a chrome block and a luma block associated with a picture;
determining luma scaling information associated with the luma block;
determining a chroma scaling factor based on the luma scaling information; and
processing the chroma block using the chroma scaling factor. 10. The apparatus according to claim 9, wherein in determining the chroma scaling factor based on the luma scaling information, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
determining a luma scaling factor of the luma block based on the luma scaling information; determining the chroma scaling factor based on a value of the luma scaling factor. 11. The apparatus according to claim 10, wherein in determining the chroma scaling factor based on a value of the luma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
setting the chroma scaling factor equal to the value of the luma scaling factor. 12. The apparatus according to claim 9, wherein in processing the chroma block using the chroma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
determining if a first condition is satisfied; and performing one of
in response to the determination that the second condition is satisfied, processing the chroma block using the chroma scaling factor; or
in response to the determination that the second condition is not satisfied, bypassing the processing of the chroma block using the chroma scaling factor. 13. The apparatus according claim 12, wherein the first condition comprises:
a target coding unit associated with the picture having no non-zero residuals; or a target transform unit associated with the picture having no non-zero chroma residuals. 14. The apparatus according claim 13, wherein
the target coding unit having no non-zero residuals is determined based on a value of a first coded block flag of the target coding unit, and the target transform unit having no non-zero chroma residuals is determined based on values of a second coded block flag for a first chroma component and a third coded block flag for a second chroma component of the target transform unit. 15. The apparatus of claim 14, wherein
the value of the first coded block flag is 0; and the values of the second coded block flag and the third coded block flag are 0. 16. The apparatus according to claim 9, wherein in processing the chroma block using the chroma scaling factor, the processor is configured to execute the set of instructions to cause the apparatus to further perform:
processing residuals of the chroma block using the chroma scaling factor. 17. A non-transitory computer-readable storage medium storing a set of instructions that are executable by one or more processors of a device to cause the device to perform a method for processing video content, the method comprising:
receiving a chrome block and a luma block associated with a picture; determining luma scaling information associated with the luma block; determining a chroma scaling factor based on the luma scaling information; and processing the chroma block using the chroma scaling factor. | 2,600 |
347,192 | 29,725,942 | 2,917 | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium. | 1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium.1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | 2,900 |
347,193 | 29,725,939 | 2,916 | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium. | 1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium.1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | 2,900 |
347,194 | 16,805,682 | 2,167 | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium. | 1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | A method including receiving, in a machine learning model (MLM), a corpus including words. The MLM includes layers configured to extract keywords from the corpus, plus a retrospective layer. A first keyword and a second keyword from the corpus are identified in the layers. The first and second keywords are assigned first and second probabilities. Each probability is a likelihood that a keyword is to be included in a key phrase. A determination is made, in the retrospective layer, of a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword. The first probability is modified using the first probability modifier. The first modified probability is used to determine whether the first keyword and the second keyword together form the key phrase. The key phrase is stored in a non-transitory computer readable storage medium.1. A method comprising:
receiving, in a machine learning model, a corpus comprising a plurality of words comprising natural language terms, wherein the machine learning model comprises a plurality of layers configured to extract a plurality of keywords out of the corpus and further comprises a retrospective layer; identifying, in the plurality of layers, a first keyword from the corpus and a second keyword from the corpus; assigning the first keyword a first probability and the second word a second probability, wherein each probability is a corresponding likelihood that a corresponding keyword is to be included in a key phrase; determining, in the retrospective layer, a first probability modifier that modifies the first probability based on a first dependence relationship between the second keyword being placed after the first keyword; modifying the first probability using the first probability modifier to form a first modified probability; using the first modified probability to determine whether the first keyword and the second keyword together form the key phrase; and storing the key phrase in a non-transitory computer readable storage medium. 2. The method of claim 1, further comprising:
categorizing the corpus based on the key phrase. 3. The method of claim 1, wherein determining, in the retrospective layer, the first probability modifier further comprises:
embedding, using the retrospective layer, the second keyword as a scalar; determining, using the retrospective layer, the first probability modifier for the second keyword using the scalar. 4. The method of claim 3, wherein determining the first probability modifier using the scalar comprises using the scalar in a leaky rectifier function. 5. The method of claim 1, further comprising:
determining, in the retrospective layer, a second probability modifier that modifies the second probability based on a second dependence relationship between the first keyword being placed before the second keyword; modifying the second probability using the second probability modifier to form a second modified probability; using both the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase. 6. The method of claim 5, further comprising:
recursively iterating:
identifying the first keyword and the second keyword, assigning the first keyword the first probability and the second keyword the second probability, determining the first probability modifier and the second probability modifier, modifying the first probability and the second probability, and using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase,
until convergence of the machine learning model. 7. The method of claim 5, further comprising:
identifying, in the plurality of layers, a third word from the corpus, wherein the third word is between the first word and the second word in a sequence of words defined in the corpus; assigning the third keyword a third probability comprising a corresponding likelihood that the third keyword is to be included in a key phrase; determining, in the retrospective layer, a third probability modifier that modifies the third probability based on both of i) a third dependence relationship between the third keyword being placed after the first keyword, and ii) a fourth dependence relationship between the third keyword being placed before the second keyword; modifying the third probability using the third probability modifier to form a third modified probability; and wherein using the first modified probability and the second modified probability to determine whether the first keyword and the second keyword together form the key phrase further comprises additionally using the third modified probability in determining whether the first keyword, the second keyword, and the third keyword together form the key phrase. 8. The method of claim 1, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 9. A method of training a machine learning model, comprising:
receiving a corpus comprising a plurality of natural language words, wherein the plurality of natural language words are organized into a plurality of known key phrases; inputting at least part of the corpus as a vector into the machine learning model, wherein the machine learning model comprises a plurality of layers and a retrospective layer, determining, using the plurality of layers, a probability that a first word in the corpus is a first keyword in at least one of a plurality of predicted key phrases, determining, using the retrospective layer, a first modified probability that the first word is the first keyword based on a first position of the first word relative to a second position of a second word in the corpus; determining, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word; calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases; and modifying the machine learning model using the loss function. 10. The method of claim 9, wherein determining the first modified probability further comprises:
embedding, using the retrospective layer, the second word as a scalar; determining, using the retrospective layer, the first modified probability using the scalar. 11. The method of claim 10, wherein determining the first modified probability using the scalar further comprises using the scalar in a leaky rectifier function. 12. The method of claim 9, further comprising:
wherein the retrospective layer is further configured to determine the first modified probability also based on the first position of the first word relative to a third position of a third word in the corpus. 13. The method of claim 9, further comprising:
determining, using the plurality of layers, a second probability that the second word in the corpus is a second keyword in at least one of the plurality of predicted key phrases; and determining, using the retrospective layer, a second modified probability that the second word is the second keyword based on a second position of the second word relative to the first position of the first word in the corpus, wherein predicting the plurality of predicted key phrases comprises predicting whether the first keyword and the second keyword are in the predicted key phrase; 14. The method of claim 9, further comprising:
recursively iterating:
inputting at least part of the corpus, determining the probability that the first word in the corpus is the first keyword, determining the first modified probability, predicting the plurality of predicted key phrases, calculating the loss function, and modifying the machine learning model,
until convergence of the machine learning model. 15. The method of claim 9, further comprising:
using a gradient descent process by mathematically maximizing cross entropy on the corpus. 16. A classification system comprising:
a data repository storing:
a corpus comprising a plurality of words including a first word;
a machine learning model comprising a plurality of layers and a retrospective layer,
a key phrase comprising a subset of words within the plurality of words,
a first probability that the first word is a keyword in the key phrase, and
a modified probability that the first word is the keyword, wherein the modified probability is based on a position of the first word relative to at least one neighbor word in the corpus; and
a server comprising a server application, wherein:
the server application is configured to execute the machine learning model to calculate the first probability using the plurality of layers and to calculate the modified probability using the retrospective layer, and
the server application is further application is further configured to predict that the first word is part of the key phrase when the modified probability exceeds a threshold value. 17. The classification system of claim 16, further comprising:
a categorization application configured to categorize the corpus using the key phrase. 18. The classification system of claim 15, further comprising:
a training application configured to train the machine learning model,
wherein the corpus further comprises a plurality of known key phrases comprising a plurality of known keywords, and
wherein the training application is further configured to train the machine learning model prior to use of the machine learning model by:
inputting at least part of the corpus as a vector into the machine learning model,
determining, using the plurality of layers, the first probability that the first word in the corpus is the first keyword in at least one of a plurality of predicted key phrases,
determining, using the retrospective layer, the modified probability that the first word is the first keyword based on the first position of the first word relative to the second position of the at least one neighbor word in the corpus,
predicting, using the machine learning model, the plurality of predicted key phrases, wherein at least one of the plurality of predicted key phrases comprises at least the first word,
calculating a loss function by comparing and evaluating a difference between the plurality of predicted key phrases and the plurality of known key phrases, and
modifying the machine learning model using the loss function. 19. The classification system of claim 15, further comprising:
a user device in communication with the server application and configured to search, using the key phrase, for the corpus from among a plurality of documents. 20. The classification system of claim 15, wherein the server application is further configured to execute the machine learning model to calculate the first probability by:
embedding, using the retrospective layer, the at least one neighboring word as a scalar, and determining, using the retrospective layer, the first probability modifier for the at least one neighboring word using the scalar in a leaky rectifier function. | 2,100 |
347,195 | 29,725,937 | 2,918 | An approach is provided for configuring printing devices using a mobile device. The mobile device acquires, from a configuration manager, data that identifies a plurality of configurations available for a printing device. The mobile device displays the data and a user selects a configuration for the printing device. The mobile device causes the selected configuration to be applied to the printing device. | 1. A mobile device comprising:
a display; one or more processors; one or more memories; and a configuration application executing on the mobile device and configured to:
receive, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
cause the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquire the particular configuration from the configuration manager via the one or more computer networks, and
cause the particular configuration to be implemented on the printing device. 2. The mobile device as recited in claim 1, wherein the plurality of configurations for a printing device include a recommended configuration and at least one other configuration that is compatible with the printing device. 3. The mobile device as recited in claim 1, wherein the configuration application executing on the mobile device and configured to:
transmit to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 4. The mobile device as recited in claim 3, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and the configuration application executing on the mobile device is configured to generate and transmit to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 5. The mobile device as recited in claim 4, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 6. The mobile device as recited in claim 1, wherein the configuration application executing on the mobile device is configured to generate and transmit to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. 7. The mobile device as recited in claim 1, wherein the printing device identification data is one or more of: retrieved by the configuration application communicating with the printing device, acquiring an image of encoded data for the printing device and decoding the encoded data, or acquiring an image of the printing device identification data and using optical character recognition to obtain the printing device identification data. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
a configuration application executing on a mobile device to:
receive, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
cause the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquire the particular configuration from the configuration manager via the one or more computer networks, and
cause the particular configuration to be implemented on the printing device. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein the plurality of configurations for a printing device include a recommended configuration, and at least one other configuration that is compatible with the printing device. 10. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to:
transmit to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 11. The one or more non-transitory computer-readable media as recited in claim 10, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to generate and transmit to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 12. The one or more non-transitory computer-readable media as recited in claim 11, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 13. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to generate and transmit to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein the printing device identification data is one or more of: retrieved by the configuration application communicating with the printing device, acquiring an image of encoded data for the printing device and decoding the encoded data, or acquiring an image of the printing device identification data and using optical character recognition to obtain the printing device identification data. 15. A computer-implemented method comprising:
a configuration application executing on a mobile device:
receiving, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
causing the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquiring the particular configuration from the configuration manager via the one or more computer networks, and
causing the particular configuration to be implemented on the printing device. 16. The computer-implemented method as recited in claim 15, wherein the plurality of configurations for a printing device include a recommended configuration and at least one other configuration that is compatible with the printing device. 17. The computer-implemented method as recited in claim 15, further comprising the configuration application executing on the mobile device:
transmitting to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 18. The computer-implemented method as recited in claim 17, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and the computer-implemented method further comprises the configuration application executing on the mobile device generating and transmitting to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 19. The computer-implemented method as recited in claim 18, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 20. The computer-implemented method as recited in claim 15, further comprising the configuration application executing on the mobile device generating and transmitting to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. | An approach is provided for configuring printing devices using a mobile device. The mobile device acquires, from a configuration manager, data that identifies a plurality of configurations available for a printing device. The mobile device displays the data and a user selects a configuration for the printing device. The mobile device causes the selected configuration to be applied to the printing device.1. A mobile device comprising:
a display; one or more processors; one or more memories; and a configuration application executing on the mobile device and configured to:
receive, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
cause the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquire the particular configuration from the configuration manager via the one or more computer networks, and
cause the particular configuration to be implemented on the printing device. 2. The mobile device as recited in claim 1, wherein the plurality of configurations for a printing device include a recommended configuration and at least one other configuration that is compatible with the printing device. 3. The mobile device as recited in claim 1, wherein the configuration application executing on the mobile device and configured to:
transmit to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 4. The mobile device as recited in claim 3, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and the configuration application executing on the mobile device is configured to generate and transmit to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 5. The mobile device as recited in claim 4, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 6. The mobile device as recited in claim 1, wherein the configuration application executing on the mobile device is configured to generate and transmit to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. 7. The mobile device as recited in claim 1, wherein the printing device identification data is one or more of: retrieved by the configuration application communicating with the printing device, acquiring an image of encoded data for the printing device and decoding the encoded data, or acquiring an image of the printing device identification data and using optical character recognition to obtain the printing device identification data. 8. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
a configuration application executing on a mobile device to:
receive, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
cause the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquire the particular configuration from the configuration manager via the one or more computer networks, and
cause the particular configuration to be implemented on the printing device. 9. The one or more non-transitory computer-readable media as recited in claim 8, wherein the plurality of configurations for a printing device include a recommended configuration, and at least one other configuration that is compatible with the printing device. 10. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to:
transmit to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 11. The one or more non-transitory computer-readable media as recited in claim 10, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to generate and transmit to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 12. The one or more non-transitory computer-readable media as recited in claim 11, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 13. The one or more non-transitory computer-readable media as recited in claim 8, wherein processing of the instructions by the one or more processors further causes the configuration application executing on the mobile device to generate and transmit to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. 14. The one or more non-transitory computer-readable media as recited in claim 8, wherein the printing device identification data is one or more of: retrieved by the configuration application communicating with the printing device, acquiring an image of encoded data for the printing device and decoding the encoded data, or acquiring an image of the printing device identification data and using optical character recognition to obtain the printing device identification data. 15. A computer-implemented method comprising:
a configuration application executing on a mobile device:
receiving, from a configuration manager via one or more computer networks, data that identifies a plurality of configurations for a printing device, wherein each configuration, from the plurality of configurations, specifies a plurality of settings for the printing device, wherein the plurality of configurations for the printing device includes at least a current configuration currently being used by the printing device,
causing the data that identifies the plurality of configurations for the printing device to be displayed on the user interface of the mobile device,
in response to a user selection of a particular configuration, from the plurality of configurations:
acquiring the particular configuration from the configuration manager via the one or more computer networks, and
causing the particular configuration to be implemented on the printing device. 16. The computer-implemented method as recited in claim 15, wherein the plurality of configurations for a printing device include a recommended configuration and at least one other configuration that is compatible with the printing device. 17. The computer-implemented method as recited in claim 15, further comprising the configuration application executing on the mobile device:
transmitting to the configuration manager current configuration identification data that uniquely identifies the current configuration currently being used by the printing device, and in response to receiving a notification from the configuration manager that the current configuration has changed, causing a visual indication to be displayed on the user interface to notify a user of the mobile device that the current configuration of the printing device has changed. 18. The computer-implemented method as recited in claim 17, wherein:
the current configuration identification data uniquely corresponds to a plurality of settings currently being used by the printing device, and the computer-implemented method further comprises the configuration application executing on the mobile device generating and transmitting to the configuration manager a request for configuration data that includes data that identifies the printing device and the current configuration identification data uniquely corresponds to the plurality of settings currently being used by the printing device. 19. The computer-implemented method as recited in claim 18, wherein the current configuration identification data that uniquely corresponds to the current plurality of settings being used by the printing device is one or more of signature data, one or more or hash results data, or a checksum value generated based upon the current plurality of settings being used by the printing device. 20. The computer-implemented method as recited in claim 15, further comprising the configuration application executing on the mobile device generating and transmitting to the configuration manager a request for configuration data that includes printing device identification data that uniquely identifies the printing device and a model or type of the printing device, wherein the configuration manager uses the printing device identification data and the model or type of the printing device to determine the plurality of configurations for the printing device. | 2,900 |
347,196 | 16,873,233 | 2,844 | A LED lighting system with an adaptive current LED driver circuit is disclosed. The adaptive current LED driver circuit includes a LED driver for powering a LED light fixture and an adaptative circuit. The adaptive circuit includes a measuring circuit and a CPU or micro-processor for running adaptive software that computes operating currents and/or operating voltages of the LED driver and adjusting operating line current values of the LED driver meet optimal power requirements of the LED light fixture. | 1. A LED lighting system comprising:
a) a LED light fixture; and b) an adaptive current LED driver circuit for controlling the LED light fixture, the adaptive current LED driver circuit comprising:
I) an LED driver; and
ii) an adaptive LED driver circuit that monitors forward line voltage values of LED driver and sets the forward line current at an optimum current value for powering the light fixture. | A LED lighting system with an adaptive current LED driver circuit is disclosed. The adaptive current LED driver circuit includes a LED driver for powering a LED light fixture and an adaptative circuit. The adaptive circuit includes a measuring circuit and a CPU or micro-processor for running adaptive software that computes operating currents and/or operating voltages of the LED driver and adjusting operating line current values of the LED driver meet optimal power requirements of the LED light fixture.1. A LED lighting system comprising:
a) a LED light fixture; and b) an adaptive current LED driver circuit for controlling the LED light fixture, the adaptive current LED driver circuit comprising:
I) an LED driver; and
ii) an adaptive LED driver circuit that monitors forward line voltage values of LED driver and sets the forward line current at an optimum current value for powering the light fixture. | 2,800 |
347,197 | 16,805,687 | 2,844 | Example embodiments provide a device that includes a housing with a surface with a cable pass-through hole, and a plate mounted against a surface of the housing, such that the plate includes a base which is affixed to the housing surface, and a protruding portion which extends vertically from the base, and the protruding portion has a support element which protrudes in a horizontal direction with respect to the base so a cable may rest against the protruding portion while being passed through the cable pass-through hole. | 1. An apparatus comprising:
a housing comprising a surface with a cable pass-through hole; a plate mounted against a surface of the housing, wherein the plate comprises
a base which is affixed to the housing surface; and
a protruding portion which extends vertically from the base, and wherein the protruding portion comprises a support element which protrudes in a horizontal direction with respect to the base so a cable may rest against the protruding portion while being passed through the cable pass-through hole. 2. The apparatus of claim 1, wherein the plate is mounted contiguous to the cable pass-through hole. 3. The apparatus of claim 1, wherein the plate and the housing are different materials. 4. The apparatus of claim 1, comprising one or more network cable interfaces flush mounted on the surface of the housing. 5. The apparatus of claim 1, wherein the housing is plastic and the base is metal. | Example embodiments provide a device that includes a housing with a surface with a cable pass-through hole, and a plate mounted against a surface of the housing, such that the plate includes a base which is affixed to the housing surface, and a protruding portion which extends vertically from the base, and the protruding portion has a support element which protrudes in a horizontal direction with respect to the base so a cable may rest against the protruding portion while being passed through the cable pass-through hole.1. An apparatus comprising:
a housing comprising a surface with a cable pass-through hole; a plate mounted against a surface of the housing, wherein the plate comprises
a base which is affixed to the housing surface; and
a protruding portion which extends vertically from the base, and wherein the protruding portion comprises a support element which protrudes in a horizontal direction with respect to the base so a cable may rest against the protruding portion while being passed through the cable pass-through hole. 2. The apparatus of claim 1, wherein the plate is mounted contiguous to the cable pass-through hole. 3. The apparatus of claim 1, wherein the plate and the housing are different materials. 4. The apparatus of claim 1, comprising one or more network cable interfaces flush mounted on the surface of the housing. 5. The apparatus of claim 1, wherein the housing is plastic and the base is metal. | 2,800 |
347,198 | 16,805,678 | 2,844 | A maintenance interval adjuster and methods for improving accuracy of maintenance scheduling and changing a maintenance interval are presented. Scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task are retrieved for a plurality of platforms. A distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data are analyzed for high variance or multiple modes. A number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task is identified, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes. The lifetimes are divided into a plurality of groups based on the number of conditions. A respective recommended maintenance interval is determined for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. | 1. A computer-implemented method comprising:
determining if sensor data of a platform indicates a condition affecting a frequency of a maintenance task; changing a maintenance interval for performing the maintenance task for the platform to an updated value if a condition affecting the frequency of the maintenance task is indicated in the sensor data; and performing the maintenance task at or before the maintenance interval having the updated value. 2. The method of claim 1, wherein changing the maintenance interval to the updated value decreases the maintenance interval. 3. The method of claim 1, wherein changing the maintenance interval to the updated value increases the maintenance interval. 4. The method of claim 1 further comprising:
resetting a time point counter and the maintenance interval for performing the maintenance task to default values after performing the maintenance task. 5. The method of claim 1 further comprising:
determining if the sensor data meets a time point, wherein determining if sensor data of the platform indicates a condition affecting a frequency of the maintenance task is performed in response to determining the sensor data does meet the time point. 6. The method of claim 5, wherein the time point is one of a quantity of usage cycles, an amount of usage time, or a quantity of calendar days. 7. The method of claim 1 further comprising:
determining if second sensor data of the platform indicates a second condition affecting a frequency of a second maintenance task;
changing a second maintenance interval for performing the second maintenance task for the platform to a second updated value if a second condition affecting the frequency of the second maintenance task is indicated in the second sensor data; and
performing the second maintenance task at or before the second maintenance interval having the second updated value. 8. The method of claim 7 further comprising:
determining if the second sensor data meets a second time point, wherein determining if the second sensor data of the platform indicates the second condition affecting a frequency of the second maintenance task is performed in response to determining the second sensor data does meet the second time point. 9. The method of claim 1, wherein the platform is an aircraft and the sensor data is flight sensor data. 10. A computer-implemented method of improving accuracy of maintenance scheduling, the method comprising:
retrieving scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyzing a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identifying, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; dividing the lifetimes into a plurality of groups based on the number of conditions; and determining a respective recommended maintenance interval for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. 11. The method of claim 10 further comprising:
retrieving the sensor data of the plurality of platforms. 12. The method of claim 10 further comprising:
calculating a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 13. The method of claim 12, wherein the time point is a minimum quantity of cycles. 14. The method of claim 10, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected during preventive scheduled maintenance. 15. An apparatus comprising:
a bus system; a communications system coupled to the bus system; and a processor unit coupled to the bus system, wherein the processor unit executes computer-usable program code to retrieve scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyze a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identify, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; divide the lifetimes into a plurality of groups based on the number of conditions; and determine a respective recommended maintenance interval for each group of the plurality of groups by performing an customized maintenance program analysis on each of the plurality of groups. 16. The apparatus of claim 15, wherein the processor unit also sends analysis results of performing the customized maintenance program analysis on the plurality of groups to regulatory authorities for approval. 17. The apparatus of claim 15, wherein the communications system receives the sensor data of the plurality of platforms. 18. The apparatus of claim 15, wherein the processor unit also calculates a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 19. The apparatus of claim 18, wherein the time point is a minimum quantity of cycles. 20. The apparatus of claim 15, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected on a respective platform during preventive scheduled maintenance. | A maintenance interval adjuster and methods for improving accuracy of maintenance scheduling and changing a maintenance interval are presented. Scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task are retrieved for a plurality of platforms. A distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data are analyzed for high variance or multiple modes. A number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task is identified, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes. The lifetimes are divided into a plurality of groups based on the number of conditions. A respective recommended maintenance interval is determined for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group.1. A computer-implemented method comprising:
determining if sensor data of a platform indicates a condition affecting a frequency of a maintenance task; changing a maintenance interval for performing the maintenance task for the platform to an updated value if a condition affecting the frequency of the maintenance task is indicated in the sensor data; and performing the maintenance task at or before the maintenance interval having the updated value. 2. The method of claim 1, wherein changing the maintenance interval to the updated value decreases the maintenance interval. 3. The method of claim 1, wherein changing the maintenance interval to the updated value increases the maintenance interval. 4. The method of claim 1 further comprising:
resetting a time point counter and the maintenance interval for performing the maintenance task to default values after performing the maintenance task. 5. The method of claim 1 further comprising:
determining if the sensor data meets a time point, wherein determining if sensor data of the platform indicates a condition affecting a frequency of the maintenance task is performed in response to determining the sensor data does meet the time point. 6. The method of claim 5, wherein the time point is one of a quantity of usage cycles, an amount of usage time, or a quantity of calendar days. 7. The method of claim 1 further comprising:
determining if second sensor data of the platform indicates a second condition affecting a frequency of a second maintenance task;
changing a second maintenance interval for performing the second maintenance task for the platform to a second updated value if a second condition affecting the frequency of the second maintenance task is indicated in the second sensor data; and
performing the second maintenance task at or before the second maintenance interval having the second updated value. 8. The method of claim 7 further comprising:
determining if the second sensor data meets a second time point, wherein determining if the second sensor data of the platform indicates the second condition affecting a frequency of the second maintenance task is performed in response to determining the second sensor data does meet the second time point. 9. The method of claim 1, wherein the platform is an aircraft and the sensor data is flight sensor data. 10. A computer-implemented method of improving accuracy of maintenance scheduling, the method comprising:
retrieving scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyzing a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identifying, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; dividing the lifetimes into a plurality of groups based on the number of conditions; and determining a respective recommended maintenance interval for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. 11. The method of claim 10 further comprising:
retrieving the sensor data of the plurality of platforms. 12. The method of claim 10 further comprising:
calculating a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 13. The method of claim 12, wherein the time point is a minimum quantity of cycles. 14. The method of claim 10, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected during preventive scheduled maintenance. 15. An apparatus comprising:
a bus system; a communications system coupled to the bus system; and a processor unit coupled to the bus system, wherein the processor unit executes computer-usable program code to retrieve scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyze a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identify, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; divide the lifetimes into a plurality of groups based on the number of conditions; and determine a respective recommended maintenance interval for each group of the plurality of groups by performing an customized maintenance program analysis on each of the plurality of groups. 16. The apparatus of claim 15, wherein the processor unit also sends analysis results of performing the customized maintenance program analysis on the plurality of groups to regulatory authorities for approval. 17. The apparatus of claim 15, wherein the communications system receives the sensor data of the plurality of platforms. 18. The apparatus of claim 15, wherein the processor unit also calculates a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 19. The apparatus of claim 18, wherein the time point is a minimum quantity of cycles. 20. The apparatus of claim 15, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected on a respective platform during preventive scheduled maintenance. | 2,800 |
347,199 | 29,725,952 | 2,844 | A maintenance interval adjuster and methods for improving accuracy of maintenance scheduling and changing a maintenance interval are presented. Scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task are retrieved for a plurality of platforms. A distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data are analyzed for high variance or multiple modes. A number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task is identified, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes. The lifetimes are divided into a plurality of groups based on the number of conditions. A respective recommended maintenance interval is determined for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. | 1. A computer-implemented method comprising:
determining if sensor data of a platform indicates a condition affecting a frequency of a maintenance task; changing a maintenance interval for performing the maintenance task for the platform to an updated value if a condition affecting the frequency of the maintenance task is indicated in the sensor data; and performing the maintenance task at or before the maintenance interval having the updated value. 2. The method of claim 1, wherein changing the maintenance interval to the updated value decreases the maintenance interval. 3. The method of claim 1, wherein changing the maintenance interval to the updated value increases the maintenance interval. 4. The method of claim 1 further comprising:
resetting a time point counter and the maintenance interval for performing the maintenance task to default values after performing the maintenance task. 5. The method of claim 1 further comprising:
determining if the sensor data meets a time point, wherein determining if sensor data of the platform indicates a condition affecting a frequency of the maintenance task is performed in response to determining the sensor data does meet the time point. 6. The method of claim 5, wherein the time point is one of a quantity of usage cycles, an amount of usage time, or a quantity of calendar days. 7. The method of claim 1 further comprising:
determining if second sensor data of the platform indicates a second condition affecting a frequency of a second maintenance task;
changing a second maintenance interval for performing the second maintenance task for the platform to a second updated value if a second condition affecting the frequency of the second maintenance task is indicated in the second sensor data; and
performing the second maintenance task at or before the second maintenance interval having the second updated value. 8. The method of claim 7 further comprising:
determining if the second sensor data meets a second time point, wherein determining if the second sensor data of the platform indicates the second condition affecting a frequency of the second maintenance task is performed in response to determining the second sensor data does meet the second time point. 9. The method of claim 1, wherein the platform is an aircraft and the sensor data is flight sensor data. 10. A computer-implemented method of improving accuracy of maintenance scheduling, the method comprising:
retrieving scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyzing a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identifying, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; dividing the lifetimes into a plurality of groups based on the number of conditions; and determining a respective recommended maintenance interval for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. 11. The method of claim 10 further comprising:
retrieving the sensor data of the plurality of platforms. 12. The method of claim 10 further comprising:
calculating a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 13. The method of claim 12, wherein the time point is a minimum quantity of cycles. 14. The method of claim 10, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected during preventive scheduled maintenance. 15. An apparatus comprising:
a bus system; a communications system coupled to the bus system; and a processor unit coupled to the bus system, wherein the processor unit executes computer-usable program code to retrieve scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyze a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identify, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; divide the lifetimes into a plurality of groups based on the number of conditions; and determine a respective recommended maintenance interval for each group of the plurality of groups by performing an customized maintenance program analysis on each of the plurality of groups. 16. The apparatus of claim 15, wherein the processor unit also sends analysis results of performing the customized maintenance program analysis on the plurality of groups to regulatory authorities for approval. 17. The apparatus of claim 15, wherein the communications system receives the sensor data of the plurality of platforms. 18. The apparatus of claim 15, wherein the processor unit also calculates a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 19. The apparatus of claim 18, wherein the time point is a minimum quantity of cycles. 20. The apparatus of claim 15, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected on a respective platform during preventive scheduled maintenance. | A maintenance interval adjuster and methods for improving accuracy of maintenance scheduling and changing a maintenance interval are presented. Scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task are retrieved for a plurality of platforms. A distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data are analyzed for high variance or multiple modes. A number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task is identified, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes. The lifetimes are divided into a plurality of groups based on the number of conditions. A respective recommended maintenance interval is determined for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group.1. A computer-implemented method comprising:
determining if sensor data of a platform indicates a condition affecting a frequency of a maintenance task; changing a maintenance interval for performing the maintenance task for the platform to an updated value if a condition affecting the frequency of the maintenance task is indicated in the sensor data; and performing the maintenance task at or before the maintenance interval having the updated value. 2. The method of claim 1, wherein changing the maintenance interval to the updated value decreases the maintenance interval. 3. The method of claim 1, wherein changing the maintenance interval to the updated value increases the maintenance interval. 4. The method of claim 1 further comprising:
resetting a time point counter and the maintenance interval for performing the maintenance task to default values after performing the maintenance task. 5. The method of claim 1 further comprising:
determining if the sensor data meets a time point, wherein determining if sensor data of the platform indicates a condition affecting a frequency of the maintenance task is performed in response to determining the sensor data does meet the time point. 6. The method of claim 5, wherein the time point is one of a quantity of usage cycles, an amount of usage time, or a quantity of calendar days. 7. The method of claim 1 further comprising:
determining if second sensor data of the platform indicates a second condition affecting a frequency of a second maintenance task;
changing a second maintenance interval for performing the second maintenance task for the platform to a second updated value if a second condition affecting the frequency of the second maintenance task is indicated in the second sensor data; and
performing the second maintenance task at or before the second maintenance interval having the second updated value. 8. The method of claim 7 further comprising:
determining if the second sensor data meets a second time point, wherein determining if the second sensor data of the platform indicates the second condition affecting a frequency of the second maintenance task is performed in response to determining the second sensor data does meet the second time point. 9. The method of claim 1, wherein the platform is an aircraft and the sensor data is flight sensor data. 10. A computer-implemented method of improving accuracy of maintenance scheduling, the method comprising:
retrieving scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyzing a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identifying, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; dividing the lifetimes into a plurality of groups based on the number of conditions; and determining a respective recommended maintenance interval for each group of the plurality of groups based on respective lifetimes for the maintenance task of a respective group. 11. The method of claim 10 further comprising:
retrieving the sensor data of the plurality of platforms. 12. The method of claim 10 further comprising:
calculating a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 13. The method of claim 12, wherein the time point is a minimum quantity of cycles. 14. The method of claim 10, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected during preventive scheduled maintenance. 15. An apparatus comprising:
a bus system; a communications system coupled to the bus system; and a processor unit coupled to the bus system, wherein the processor unit executes computer-usable program code to retrieve scheduled maintenance data and unscheduled in-service maintenance data for a maintenance task for a plurality of platforms; analyze a distribution of lifetimes for the maintenance task in the scheduled maintenance data and unscheduled in-service maintenance data for high variance or multiple modes; identify, in response to identifying at least one of high variance or multiple modes in the distribution of lifetimes, a number of conditions in sensor data of the plurality of platforms correlated to a length of the lifetimes for the maintenance task; divide the lifetimes into a plurality of groups based on the number of conditions; and determine a respective recommended maintenance interval for each group of the plurality of groups by performing an customized maintenance program analysis on each of the plurality of groups. 16. The apparatus of claim 15, wherein the processor unit also sends analysis results of performing the customized maintenance program analysis on the plurality of groups to regulatory authorities for approval. 17. The apparatus of claim 15, wherein the communications system receives the sensor data of the plurality of platforms. 18. The apparatus of claim 15, wherein the processor unit also calculates a time point after which an acceptable amount of sensor data is available for a platform such that an analysis can be performed to determine if the number of conditions is present for the platform. 19. The apparatus of claim 18, wherein the time point is a minimum quantity of cycles. 20. The apparatus of claim 15, wherein each of the respective recommended maintenance intervals is an interval of time between performances of the maintenance task that maximizes a probability that anomalies associated with a set of components are detected on a respective platform during preventive scheduled maintenance. | 2,800 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.