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
|
|---|---|---|---|---|---|---|
344,500 | 16,803,999 | 2,419 | A method for generating a user interface for analyzing a patient-specific electronic medical or health record that includes a problem list includes the steps of grouping related potential problems into problem list categories, grouping a subset of the problems into clusters within the categories, mapping, using a computer, entries in the problem list with a respective description in an interface terminology, associating one or more of other medical data, e.g., medication, lab results, procedures, imaging results, past medical history or surgeries, notes, vital signs, or allergy data in the record with at least one problem, receiving a request corresponding to a problem or problem list category or to other medical data, identifying non-problem data in the record grouped in a cluster with the requested data, and modifying a user interface to display the identified data separate from other similar medical data included in the electronic medical or health record. | 1. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to a problem or a problem list category; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data included in the electronic medical record or electronic health record. 2. The method of claim 1, wherein the user request corresponds to a problem not present in the patient-specific electronic medical record or electronic health record. 3. The method of claim 1, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 4. The method of claim 1, wherein the receiving step comprises receiving a textual input. 5. The method of claim 1, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 6. The method of claim 1, wherein the user request corresponds to a plurality of problems. 7. The method of claim 6, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 8. The method of claim 6, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 9. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to of medication, lab result, procedure, imaging, or allergy data; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data other than the requested data, the identified data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging, or allergy data included in the electronic medical record or electronic health record. 10. The method of claim 9, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 11. The method of claim 9, wherein the receiving step comprises receiving a textual input. 12. The method of claim 9, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 13. The method of claim 9, wherein the user request corresponds to a plurality of problems. 14. The method of claim 13, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 15. The method of claim 13, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 16. A method for identifying patient-specific care plans through a patient-specific problem list in an electronic medical record or an electronic health record, comprising:
mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; analyzing, by a computer, interface terminology concepts mapped to each mapped entry to determine related problem list entries; grouping related entries into one or more problem list categories; 17. The method of claim 16, wherein the patient-specific problem list triggering the one or more care plans includes both previous and current medical conditions. 18. The method of claim 17, wherein the one or more care plans triggered by the previous and current medial conditions include previous and current care plans. 19. The method of claim 16, wherein the types of care plans include one or more of medications, laboratory tests, or procedures. | A method for generating a user interface for analyzing a patient-specific electronic medical or health record that includes a problem list includes the steps of grouping related potential problems into problem list categories, grouping a subset of the problems into clusters within the categories, mapping, using a computer, entries in the problem list with a respective description in an interface terminology, associating one or more of other medical data, e.g., medication, lab results, procedures, imaging results, past medical history or surgeries, notes, vital signs, or allergy data in the record with at least one problem, receiving a request corresponding to a problem or problem list category or to other medical data, identifying non-problem data in the record grouped in a cluster with the requested data, and modifying a user interface to display the identified data separate from other similar medical data included in the electronic medical or health record.1. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to a problem or a problem list category; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data included in the electronic medical record or electronic health record. 2. The method of claim 1, wherein the user request corresponds to a problem not present in the patient-specific electronic medical record or electronic health record. 3. The method of claim 1, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 4. The method of claim 1, wherein the receiving step comprises receiving a textual input. 5. The method of claim 1, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 6. The method of claim 1, wherein the user request corresponds to a plurality of problems. 7. The method of claim 6, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 8. The method of claim 6, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 9. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to of medication, lab result, procedure, imaging, or allergy data; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data other than the requested data, the identified data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging, or allergy data included in the electronic medical record or electronic health record. 10. The method of claim 9, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 11. The method of claim 9, wherein the receiving step comprises receiving a textual input. 12. The method of claim 9, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 13. The method of claim 9, wherein the user request corresponds to a plurality of problems. 14. The method of claim 13, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 15. The method of claim 13, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 16. A method for identifying patient-specific care plans through a patient-specific problem list in an electronic medical record or an electronic health record, comprising:
mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; analyzing, by a computer, interface terminology concepts mapped to each mapped entry to determine related problem list entries; grouping related entries into one or more problem list categories; 17. The method of claim 16, wherein the patient-specific problem list triggering the one or more care plans includes both previous and current medical conditions. 18. The method of claim 17, wherein the one or more care plans triggered by the previous and current medial conditions include previous and current care plans. 19. The method of claim 16, wherein the types of care plans include one or more of medications, laboratory tests, or procedures. | 2,400 |
344,501 | 29,725,771 | 2,419 | A method for generating a user interface for analyzing a patient-specific electronic medical or health record that includes a problem list includes the steps of grouping related potential problems into problem list categories, grouping a subset of the problems into clusters within the categories, mapping, using a computer, entries in the problem list with a respective description in an interface terminology, associating one or more of other medical data, e.g., medication, lab results, procedures, imaging results, past medical history or surgeries, notes, vital signs, or allergy data in the record with at least one problem, receiving a request corresponding to a problem or problem list category or to other medical data, identifying non-problem data in the record grouped in a cluster with the requested data, and modifying a user interface to display the identified data separate from other similar medical data included in the electronic medical or health record. | 1. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to a problem or a problem list category; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data included in the electronic medical record or electronic health record. 2. The method of claim 1, wherein the user request corresponds to a problem not present in the patient-specific electronic medical record or electronic health record. 3. The method of claim 1, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 4. The method of claim 1, wherein the receiving step comprises receiving a textual input. 5. The method of claim 1, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 6. The method of claim 1, wherein the user request corresponds to a plurality of problems. 7. The method of claim 6, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 8. The method of claim 6, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 9. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to of medication, lab result, procedure, imaging, or allergy data; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data other than the requested data, the identified data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging, or allergy data included in the electronic medical record or electronic health record. 10. The method of claim 9, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 11. The method of claim 9, wherein the receiving step comprises receiving a textual input. 12. The method of claim 9, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 13. The method of claim 9, wherein the user request corresponds to a plurality of problems. 14. The method of claim 13, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 15. The method of claim 13, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 16. A method for identifying patient-specific care plans through a patient-specific problem list in an electronic medical record or an electronic health record, comprising:
mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; analyzing, by a computer, interface terminology concepts mapped to each mapped entry to determine related problem list entries; grouping related entries into one or more problem list categories; 17. The method of claim 16, wherein the patient-specific problem list triggering the one or more care plans includes both previous and current medical conditions. 18. The method of claim 17, wherein the one or more care plans triggered by the previous and current medial conditions include previous and current care plans. 19. The method of claim 16, wherein the types of care plans include one or more of medications, laboratory tests, or procedures. | A method for generating a user interface for analyzing a patient-specific electronic medical or health record that includes a problem list includes the steps of grouping related potential problems into problem list categories, grouping a subset of the problems into clusters within the categories, mapping, using a computer, entries in the problem list with a respective description in an interface terminology, associating one or more of other medical data, e.g., medication, lab results, procedures, imaging results, past medical history or surgeries, notes, vital signs, or allergy data in the record with at least one problem, receiving a request corresponding to a problem or problem list category or to other medical data, identifying non-problem data in the record grouped in a cluster with the requested data, and modifying a user interface to display the identified data separate from other similar medical data included in the electronic medical or health record.1. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to a problem or a problem list category; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data included in the electronic medical record or electronic health record. 2. The method of claim 1, wherein the user request corresponds to a problem not present in the patient-specific electronic medical record or electronic health record. 3. The method of claim 1, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 4. The method of claim 1, wherein the receiving step comprises receiving a textual input. 5. The method of claim 1, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 6. The method of claim 1, wherein the user request corresponds to a plurality of problems. 7. The method of claim 6, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 8. The method of claim 6, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 9. A method for generating a user interface for analyzing a patient-specific electronic medical record or an electronic health record that includes a problem list with one or more problems selected from among a plurality of potential problems, the method comprising:
grouping related potential problems into one or more problem list categories; grouping a subset of the related potential problems into one or more clusters within the one or more problem list categories; mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; associating one or more of medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data in the electronic medical record or electronic health record with at least one problem; receiving a user request corresponding to of medication, lab result, procedure, imaging, or allergy data; identifying medication, lab result, procedure, imaging result, past medical history or surgery, note, vital sign, or allergy data other than the requested data, the identified data contained in the electronic medical record or electronic health record and associated with the requested data by virtue of being grouped in a cluster with the requested data; and modifying a user interface to display the identified data separate from other medication, lab result, procedure, imaging, or allergy data included in the electronic medical record or electronic health record. 10. The method of claim 9, wherein the modifying step includes generating separate regions in the user interface for each of the identified medication, lab result, procedure, imaging, and allergy data. 11. The method of claim 9, wherein the receiving step comprises receiving a textual input. 12. The method of claim 9, wherein the receiving step comprises receiving a user selection of a region of the user interface corresponding to the problem or problem list category. 13. The method of claim 9, wherein the user request corresponds to a plurality of problems. 14. The method of claim 13, wherein one of the plurality of problems is grouped in a first problem list category and a second one of the plurality of problems is grouped in a second, separate problem list category. 15. The method of claim 13, wherein a first and second one of the plurality of problems are grouped in a common problem list category, but wherein the first one of the plurality of problems is grouped in a first cluster within the common problem list category and the second one of the plurality of problems is grouped in a second, separate cluster within the common problem list category. 16. A method for identifying patient-specific care plans through a patient-specific problem list in an electronic medical record or an electronic health record, comprising:
mapping, using a computer, entries in a problem list with a respective description in an interface terminology, wherein the interface terminology comprises a plurality of domains, a plurality of concepts, and a plurality of descriptions, wherein each concept is unique within a given domain, and wherein each description maps to a respective concept in the interface terminology and is an alternative way to express the respective concept; analyzing, by a computer, interface terminology concepts mapped to each mapped entry to determine related problem list entries; grouping related entries into one or more problem list categories; 17. The method of claim 16, wherein the patient-specific problem list triggering the one or more care plans includes both previous and current medical conditions. 18. The method of claim 17, wherein the one or more care plans triggered by the previous and current medial conditions include previous and current care plans. 19. The method of claim 16, wherein the types of care plans include one or more of medications, laboratory tests, or procedures. | 2,400 |
344,502 | 16,803,971 | 2,419 | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens. | 1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens.1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | 2,400 |
344,503 | 29,725,769 | 2,419 | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens. | 1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens.1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | 2,400 |
344,504 | 29,725,759 | 2,419 | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens. | 1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens.1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | 2,400 |
344,505 | 29,725,762 | 2,921 | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens. | 1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens.1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | 2,900 |
344,506 | 16,873,230 | 1,661 | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens. | 1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | An ultrasound catheter with fluid delivery lumens, fluid evacuation lumens and a light source is used for the treatment of intracerebral hemorrhages. After the catheter is inserted into a blood clot in the brain, a lytic drug can be delivered to the blood clot via the fluid delivery lumens while applying ultrasonic energy to the treatment site. As the blood clot is dissolved, the liquefied blood clot can be removed by evacuation through the fluid evacuation lumens.1. A method for treating a blood clot resulting from an intracranial hemorrhage in a brain of a patient, the method comprising:
advancing a tubular body through a patient's skull and into the blood clot in the brain, the tubular body including a central lumen and a fluid delivery lumen and including a distal portion configured for advancement into a patient's brain; advancing an inner core comprising an ultrasound radiating element into the central lumen of the tubular body; delivering a therapeutic compound through the fluid delivery lumen of the tubular body and to the blood clot positioned outside the tubular body; transmitting ultrasound energy with the inner core to the blood clot; and evacuating clot material from the brain through the tubular body. 2. The method of claim 1, further including monitoring intracranial pressure using a pressure sensor. 3. The method of claim 1, wherein evacuating of clot material occurs through the central lumen. 4. The method of claim 1, wherein the tubular body further includes an evacuation lumen separate from the central lumen, and evacuating clot material occurs through the evacuation lumen. 5. The method of claim 1, wherein advancing the tubular body through the patient's skull includes inserting a device configured to provide additional stiffness to the tubular body within the central lumen, and then removing the device from the central lumen after the tubular member is advanced into the patient's skull. 6. The method of claim 1, comprising transmitting ultrasound energy at a frequency between about 20 kHz and about 20 MHz. 7. The method of claim 2, wherein the pressure sensor is disposed on the tubular member. 8. The method of claim 7, wherein the pressure sensor is exposed to fluid surrounding the tubular member, and can directly measure intracranial pressure. 9. The method of claim 7, wherein the pressure sensor is disposed in the fluid delivery lumen. 10. The method of claim 7, wherein the tubular body further includes an evacuation lumen, and the pressure sensors is disposed in the fluid evacuation lumen. 11. The method of claim 2, wherein the tubular body further includes an evacuation lumen, and the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the fluid evacuation lumen. 12. The method of claim 11, further including measuring intracranial pressure by calculating the pressure drop across the first and second pressure sensors. 13. The method of claim 2, wherein the pressure sensor includes a first pressure sensor in the fluid delivery lumen, and a second pressure sensor in the central lumen. 14. The method of claim 1, further including maintaining an intracranial pressure below a threshold pressure while delivering the therapeutic compound. 15. The method of claim 2, wherein if the monitored intracranial pressure rises above a predetermined threshold, reducing the intracranial pressure below the threshold by increasing the evacuating, reducing the delivering, or both. 16. The method of claim 1, wherein the therapeutic compound includes a thrombolytic compound. 17. The method of claim 16, wherein the therapeutic compound includes one or more of a neuroprotective agent, an anti-apoptotic agent, and a neurotoxin scavenging agent. 18. The method of claim 1, wherein the ultrasound catheter has multiple ultrasound elements configured for use in the brain. 19. The method of claim 1, further including activating a light source located on the tubular body or inner core. 20. The method of claim 1, wherein the light source is configured to emit a wavelength and amplitude of light selected for its ability to penetrate clot and brain tissue. | 1,600 |
344,507 | 16,803,982 | 1,612 | Some embodiments of the invention include a synthetic biocidal surface comprising an array of disordered nanospikes. The biocidal surface may be lethal to cells on said surface due to piercing of cell membranes by said nanospikes. Some embodiments may include a method of producing a synthetic biocidal surface comprising an array of disordered nanospikes that may include exposing a silicon comprising substrate surface to reactive-ion etching. | 1. A synthetic biocidal surface comprising an array of disordered nanospikes that are lethal to cells on said surface, wherein at least some of said nanospikes are branched. 2. The surface of claim 1, wherein said surface is hydrophilic. 3. The surface of claim 1, wherein diameter of said nanospikes is greater at a base thereof than at a free end thereof. 4. The surface of claim 1, wherein said nanospikes are from about 20 nm to about 300 nm in diameter at half maximum height. 5. The surface of claim 1, wherein the nanospikes are spaced from about 200 nm to about 700 nm apart from centre to centre. 6. The surface of claim 1, wherein said nanospikes are capable of flexing to an extent that tips of adjacent nanospikes within said array can come together. 7. The surface of claim 1, wherein Young's modulus of elasticity of the nanospikes is from about 10 GPa to about 300 GPa. 8. The surface claim 1, wherein said nanospikes are from about 100 nm to about 600 nm in height and/or wherein tips of said nanospikes are from about 4 nm to about 50 nm in diameter. 9. The surface of claim 8 wherein branching is at or towards a free end of said nanospikes. 10. The surface of claim 1, wherein a substrate from which said surface is formed comprises silicon, preferably boron-doped silicon or black silicon (b-Si). 11. The surface of claim 1, wherein a substrate from which said surface is formed comprises metal. 12. The surface of claim 11, wherein the metal comprises titanium, gold, platinum, silver, cobalt, chromium, vanadium, tantalum, nickel, magnesium, manganese, molybdenum or tungsten; preferably cobalt chrome, nickel titanium, titanium vanadium aluminium or stainless steel. 13. A device, tool, fitting or apparatus comprising a surface of claim 1. 14. The device, tool, fitting or apparatus of claim 13 which is selected from medical, surgical, veterinary and dental tools, instruments and equipment and medical, dental and veterinary implants. 15. (canceled) | Some embodiments of the invention include a synthetic biocidal surface comprising an array of disordered nanospikes. The biocidal surface may be lethal to cells on said surface due to piercing of cell membranes by said nanospikes. Some embodiments may include a method of producing a synthetic biocidal surface comprising an array of disordered nanospikes that may include exposing a silicon comprising substrate surface to reactive-ion etching.1. A synthetic biocidal surface comprising an array of disordered nanospikes that are lethal to cells on said surface, wherein at least some of said nanospikes are branched. 2. The surface of claim 1, wherein said surface is hydrophilic. 3. The surface of claim 1, wherein diameter of said nanospikes is greater at a base thereof than at a free end thereof. 4. The surface of claim 1, wherein said nanospikes are from about 20 nm to about 300 nm in diameter at half maximum height. 5. The surface of claim 1, wherein the nanospikes are spaced from about 200 nm to about 700 nm apart from centre to centre. 6. The surface of claim 1, wherein said nanospikes are capable of flexing to an extent that tips of adjacent nanospikes within said array can come together. 7. The surface of claim 1, wherein Young's modulus of elasticity of the nanospikes is from about 10 GPa to about 300 GPa. 8. The surface claim 1, wherein said nanospikes are from about 100 nm to about 600 nm in height and/or wherein tips of said nanospikes are from about 4 nm to about 50 nm in diameter. 9. The surface of claim 8 wherein branching is at or towards a free end of said nanospikes. 10. The surface of claim 1, wherein a substrate from which said surface is formed comprises silicon, preferably boron-doped silicon or black silicon (b-Si). 11. The surface of claim 1, wherein a substrate from which said surface is formed comprises metal. 12. The surface of claim 11, wherein the metal comprises titanium, gold, platinum, silver, cobalt, chromium, vanadium, tantalum, nickel, magnesium, manganese, molybdenum or tungsten; preferably cobalt chrome, nickel titanium, titanium vanadium aluminium or stainless steel. 13. A device, tool, fitting or apparatus comprising a surface of claim 1. 14. The device, tool, fitting or apparatus of claim 13 which is selected from medical, surgical, veterinary and dental tools, instruments and equipment and medical, dental and veterinary implants. 15. (canceled) | 1,600 |
344,508 | 16,803,984 | 1,612 | Sample preparation can include obtaining a sample in the form of a liquid mixture and forcing the liquid mixture through a cavitation chamber at an optimal pressure for separating pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. Apparatuses used for sample preparation methods can include a fluid circuit, a cavitation chamber incorporated into the fluid circuit and having a channel with first, second, and third cross-sectional areas, the second cross-sectional area being downstream of and smaller than the first cross-sectional with respect to fluid flow through the fluid circuit and the third cross-sectional area being larger than and downstream of the second cross-sectional area with respect to fluid flow through the fluid circuit. The apparatus can include a pump in fluid communication with the cavitation chamber and a pressure sensor positioned upstream of the cavitation chamber. | 1. A method for sample preparation, comprising:
obtaining a sample in the form of a liquid mixture; forcing the liquid mixture through a cavitation chamber at an optimal pressure for separating pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. 2. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 50% of the pathogens. 3. The method of claim 2, wherein the optimal pressure is between 5-20 PSI. 4. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 75% of the pathogens. 5. The method of claim 4, wherein the optimal pressure is between 8-14 PSI. 6. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 90% of the pathogens. 7. The method of claim 6, wherein the optimal pressure is between 8-14 PSI. 8. The method of claim 7, wherein the optimal pressure is about 11 PSI. 9. The method of claim 7, further comprising breaking down solids in the liquid mixture with an enzyme prior to forcing the liquid mixture through the cavitation chamber. 10. The method of claim 9, further comprising filtering particles from the liquid mixture prior to forcing the liquid mixture through the cavitation chamber. 11. An apparatus for sample preparation, comprising:
a fluid circuit; a cavitation chamber incorporated into the fluid circuit, the cavitation chamber including:
a channel;
a first cross-sectional area of the channel;
a second cross-sectional area of the channel, wherein the second cross-sectional area of the channel is smaller than the first cross-sectional area and oriented downstream from the first cross-sectional area with respect to fluid flow through the fluid circuit;
a third cross-sectional area of the channel, wherein the third cross-sectional area of the channel is larger than the second cross-sectional area and oriented downstream from the second cross-sectional area with respect to fluid flow through the fluid circuit;
a pump in fluid communication with the cavitation chamber; and a pressure sensor associated with the fluid circuit and positioned upstream of the cavitation chamber, wherein the apparatus is configured to force a liquid mixture through the cavitation chamber at a pressure that separates pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. 12. The apparatus of claim 11, wherein the second cross-sectional area is formed by at least a first orifice defined in a cavitation plate disposed within the cavitation chamber. 13. The apparatus of claim 12, wherein the first orifice has a cross-sectional width that is between 0.5 mm and 1.5 mm. 14. The apparatus of claim 12, wherein the first orifice has a cross-sectional width of about 0.8 mm and the first cross-sectional area of the channel has a cross-sectional width of about 1.2 mm. 15. The apparatus of claim 11, wherein the second cross-sectional area is formed by at least a first orifice and a second orifice defined in the cavitation plate,
wherein the first orifice is spaced apart away from the second orifice at a distance, and wherein the first orifice and the second orifice allow a liquid to flow through the cavitation plate in parallel. 15. The apparatus of claim 12, wherein the third cross-sectional area is formed by an aperture defined by an expansion plate disposed downstream of the cavitation plate within the cavitation chamber. 16. The apparatus of claim 15, wherein the first orifice has a cross-sectional width less than 1.0 mm and the aperture has a cross-sectional width greater than 1.0 mm. 17. The apparatus of claim 16, wherein the cross-sectional width of the first orifice is about 0.8 mm and the cross-sectional width of the aperture is at least 1.2 mm. 18. The apparatus of claim 11, further comprising a filter loop incorporated into the fluid circuit and a filter incorporated into the filter loop. 19. The apparatus of claim 18, further comprising a cavitation loop incorporated into the cavitation chamber and a directional control valve configured to selectively direct fluid into the cavitation loop and into the filter loop. 20. A method for detecting a pathogen in a food substance, comprising:
breaking down solids in the food substance to create a liquid mixture; fluidically coupling the liquid mixture to the apparatus of claim 19; filtering the liquid mixture via the filter; and separating the pathogen from the filtered, liquid mixture without fragmenting at least 30% of the pathogens by forcing the liquid mixture through the cavitation chamber. | Sample preparation can include obtaining a sample in the form of a liquid mixture and forcing the liquid mixture through a cavitation chamber at an optimal pressure for separating pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. Apparatuses used for sample preparation methods can include a fluid circuit, a cavitation chamber incorporated into the fluid circuit and having a channel with first, second, and third cross-sectional areas, the second cross-sectional area being downstream of and smaller than the first cross-sectional with respect to fluid flow through the fluid circuit and the third cross-sectional area being larger than and downstream of the second cross-sectional area with respect to fluid flow through the fluid circuit. The apparatus can include a pump in fluid communication with the cavitation chamber and a pressure sensor positioned upstream of the cavitation chamber.1. A method for sample preparation, comprising:
obtaining a sample in the form of a liquid mixture; forcing the liquid mixture through a cavitation chamber at an optimal pressure for separating pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. 2. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 50% of the pathogens. 3. The method of claim 2, wherein the optimal pressure is between 5-20 PSI. 4. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 75% of the pathogens. 5. The method of claim 4, wherein the optimal pressure is between 8-14 PSI. 6. The method of claim 1, wherein forcing the liquid mixture through the cavitation chamber at an optimal pressure separates pathogens from particles in the mixture without fragmenting at least 90% of the pathogens. 7. The method of claim 6, wherein the optimal pressure is between 8-14 PSI. 8. The method of claim 7, wherein the optimal pressure is about 11 PSI. 9. The method of claim 7, further comprising breaking down solids in the liquid mixture with an enzyme prior to forcing the liquid mixture through the cavitation chamber. 10. The method of claim 9, further comprising filtering particles from the liquid mixture prior to forcing the liquid mixture through the cavitation chamber. 11. An apparatus for sample preparation, comprising:
a fluid circuit; a cavitation chamber incorporated into the fluid circuit, the cavitation chamber including:
a channel;
a first cross-sectional area of the channel;
a second cross-sectional area of the channel, wherein the second cross-sectional area of the channel is smaller than the first cross-sectional area and oriented downstream from the first cross-sectional area with respect to fluid flow through the fluid circuit;
a third cross-sectional area of the channel, wherein the third cross-sectional area of the channel is larger than the second cross-sectional area and oriented downstream from the second cross-sectional area with respect to fluid flow through the fluid circuit;
a pump in fluid communication with the cavitation chamber; and a pressure sensor associated with the fluid circuit and positioned upstream of the cavitation chamber, wherein the apparatus is configured to force a liquid mixture through the cavitation chamber at a pressure that separates pathogens from particles in the mixture without fragmenting at least 30% of the pathogens. 12. The apparatus of claim 11, wherein the second cross-sectional area is formed by at least a first orifice defined in a cavitation plate disposed within the cavitation chamber. 13. The apparatus of claim 12, wherein the first orifice has a cross-sectional width that is between 0.5 mm and 1.5 mm. 14. The apparatus of claim 12, wherein the first orifice has a cross-sectional width of about 0.8 mm and the first cross-sectional area of the channel has a cross-sectional width of about 1.2 mm. 15. The apparatus of claim 11, wherein the second cross-sectional area is formed by at least a first orifice and a second orifice defined in the cavitation plate,
wherein the first orifice is spaced apart away from the second orifice at a distance, and wherein the first orifice and the second orifice allow a liquid to flow through the cavitation plate in parallel. 15. The apparatus of claim 12, wherein the third cross-sectional area is formed by an aperture defined by an expansion plate disposed downstream of the cavitation plate within the cavitation chamber. 16. The apparatus of claim 15, wherein the first orifice has a cross-sectional width less than 1.0 mm and the aperture has a cross-sectional width greater than 1.0 mm. 17. The apparatus of claim 16, wherein the cross-sectional width of the first orifice is about 0.8 mm and the cross-sectional width of the aperture is at least 1.2 mm. 18. The apparatus of claim 11, further comprising a filter loop incorporated into the fluid circuit and a filter incorporated into the filter loop. 19. The apparatus of claim 18, further comprising a cavitation loop incorporated into the cavitation chamber and a directional control valve configured to selectively direct fluid into the cavitation loop and into the filter loop. 20. A method for detecting a pathogen in a food substance, comprising:
breaking down solids in the food substance to create a liquid mixture; fluidically coupling the liquid mixture to the apparatus of claim 19; filtering the liquid mixture via the filter; and separating the pathogen from the filtered, liquid mixture without fragmenting at least 30% of the pathogens by forcing the liquid mixture through the cavitation chamber. | 1,600 |
344,509 | 16,803,937 | 1,612 | The present application provides peripheral blood mononuclear cells comprising an antigen, methods of manufacturing such PBMCs, and methods of using such PBMCs, such as for modulating an immune response in an individual. In some embodiments, the PBMCs are conditioned by incubating the PBMC in the presence of an adjuvant. | 1-3. (canceled) 4. A conditioned plurality of modified PBMCs comprising an antigen, wherein the antigen is exogenous to the modified PBMCs. 5. (canceled) 6. The conditioned plurality of modified PBMCs of claim 4, wherein the modified PBMCs further comprise an adjuvant. 7-8. (canceled) 9. The conditioned plurality of PBMCs of claim 4, prepared by incubating the plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition before or after introducing the antigen to the PBMCs, thereby generating the conditioned plurality of PBMCs comprising the antigen. 10. A plurality of modified PBMCs comprising an antigen, or an antigen and an adjuvant, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the antigen or the antigen and the adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the antigen, or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 11. A plurality of modified PBMCs comprising an antigen, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for a nucleic acid encoding the antigen to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the nucleic acid encoding the antigen for a sufficient time to allow the nucleic acid encoding the antigen to enter the perturbed input PBMCs, wherein the nucleic acid is expressed in the PBMCs to produce the antigen thereby generating a plurality of modified PBMCs comprising the antigen. 12. (canceled) 13. The plurality of modified PBMCs of claim 11, the process further comprises the step of:
a) incubating the plurality of input PBMCs with an adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the nucleic acid encoding the antigen with an adjuvant for a sufficient time for the modified PBMCs comprising the nucleic acid encoding the antigen to condition, wherein the nucleic acid is expressed in the PBMCs to produce the antigen thereby generating the conditioned plurality of modified PBMCs comprising the antigen. 14-16. (canceled) 17. The plurality of modified PBMCs of claim 10, wherein the input PBMCs comprise an adjuvant. 18. A plurality of modified PBMCs comprising an antigen and an adjuvant, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs comprising the antigen through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the adjuvant to pass through to form a plurality of perturbed input PBMCs; and b) incubating the plurality of perturbed input PBMCs with the adjuvant for a sufficient time to allow the adjuvant to enter the perturbed input PBMCs, thereby generating the plurality of modified PBMCs comprising the antigen and the adjuvant. 19. The plurality of modified PBMCs according to claim 10, wherein the process further comprises:
a) incubating the plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or (b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating a conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 20. The plurality of modified PBMCs of claim 10, wherein the process further comprises a step of incubating the input PBMCs and/or the modified PBMCs with an agent that enhances the viability and/or function of the modified PBMCs as compared to corresponding modified PBMCs prepared without the further incubation step. 21. The plurality of modified PBMCs of claim 10, wherein the diameter of the constriction is about 10% to about 99% of the mean diameter of the plurality of input PBMCs. 22. The plurality of modified PBMCs of claim 10, wherein the diameter of the constriction is: (a) about 4.2 μm to about 6 μm; (b) about 4.2 μm to about 4.8 μm; or (c) about 4.5 μm. 23. (canceled) 24. The plurality of modified PBMCs of claim 10, wherein the cell suspension comprising the plurality of input PBMCs are is passed through multiple constrictions wherein the multiple constrictions are arranged in series and/or in parallel. 25. (canceled) 26. The conditioned plurality of modified PBMCs of claim 10, wherein the plurality of modified PBMCs is incubated with the adjuvant for about 2 hours to about 10 hours; or for about 3 hours to about 6 hours; or for about 4 hours for the modified PBMCs to condition. 27. The plurality of modified PBMCs of claim 10, wherein the antigen and/or the adjuvant are present in at least about 70% of the cells in the plurality of PBMCs. 28. The plurality of modified PBMCs of claim 10, wherein the adjuvant is a CpG oligodeoxynucleotide (ODN), LPS, IFN-α, STING agonists, RIG-I agonists, poly I:C, R837, R848, a TLR3 agonist, a TLR4 agonist or a TLR 9 agonist. 29. The plurality of modified PBMCs of claim 10, wherein the adjuvant is a CpG oligodeoxynucleotide (ODN). 30. The plurality of modified PBMCs of claim 10, wherein the antigen is a disease-associated antigen. 31. The plurality of modified PBMCs of claim 10, wherein the antigen is a human papillomavirus (HPV) antigen. 32. The plurality of modified PBMCs of claim 10, wherein the cells are further modified to increase expression of:
(a) one or more of co-stimulatory molecules; and/or (b) one or more cytokines. 33. The plurality of modified PBMCs of claim 32, wherein:
(a) the cells are further modified to increase expression of one or more of co-stimulatory molecules, wherein the co-stimulatory molecule is B7-H2 (ICOSL), B7-1 (CD80), B7-2 (CD86), CD70, LIGHT, HVEM, CD40, 4-1BBL, OX40L, TL1A, GITRL, CD30L, TIM4, SLAM, CD48, CD58, CD155, or CD112; and/or (b) the cells are further modified to increase expression of one or more cytokines, wherein the cytokine is IL-15, IL-12, IL-2, IFN-α, or IL-21. 34-35. (canceled) 36. The plurality of modified PBMCs of claim 10, wherein:
(a) one or more co-stimulatory molecules is upregulated in the B cells of the conditioned plurality of modified PBMCs compared to the B cells in the plurality of unmodified PBMCs, wherein the co-stimulatory molecule is CD80 and/or CD86; and/or (b) the modified PBMCs have increased expression of one or more of IFN-γ, IL-6, MCP-1, MIP-1β, IP-10, or TNF-α compared to a plurality of unconditioned PBMCs. 37. The plurality of modified PBMCs of claim 36, wherein:
(a) the CD80 and/or CD86 is upregulated in the B cells of the conditioned plurality of modified PBMCs by more than about 1.2-fold, 1.5-fold, 1.8-fold, 2-fold, 3-fold, 4-fold, 5-fold, 8-fold, or more than 10-fold compared to the B cells in a plurality of unconditioned PBMCs; and/or (b) the expression of one or more of IFN-γ, IL-6, MCP-1, MIP-113, IP-10, or TNF-α is increased by more than about 1.2-fold, 1.5-fold, 1.8-fold, 2-fold, 3-fold, 4-fold, 5-fold, 8-fold, or more than 10-fold compared to the plurality of unconditioned PBMCs. 38-39. (canceled) 40. A composition comprising the plurality of modified PBMCs of claim 10. 41-47. (canceled) 48. A method for stimulating an immune response in an individual, comprising:
a) incubating a plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition, wherein the plurality of PBMCs comprises an antigen before the conditioning or wherein an antigen is introduced to the plurality of PBMCs after the conditioning, thereby generating a conditioned plurality of PBMCs comprising the antigen; b) administering the conditioned plurality of PBMCs comprising the antigen to the individual. 49. (canceled) 50. A method for stimulating an immune response in an individual, comprising:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for an antigen or an antigen and an adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the antigen or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant; c) administering the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant to the individual. 51-52. (canceled) 53. The method of claim 50, wherein the PBMCs are conditioned by a process comprising the step of:
a) incubating a plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating a conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 54. The method of claim 50, wherein the input PBMCs comprise an adjuvant. 55. A method for stimulating an immune response in an individual, comprising:
a) passing a cell suspension comprising an input PBMCs comprising an antigen through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for an adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the adjuvant for a sufficient time to allow the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen and the adjuvant; and c) administering the plurality of modified PBMCs to the individual. 56. The method of claim 50, further comprising the step of administering an adjuvant to the individual. 57. The method of claim 55, further comprising the step of administering an adjuvant to the individual. 58. (canceled) 59. A method for stimulating an immune response in an individual, comprising: administering to the individual a plurality of modified PBMCs associated with an antigen, wherein the plurality of modified PBMCs is prepared by a process comprising the steps of:
a) incubating a plurality of input PBMCs with an antigen for a sufficient time to allow the antigen to associate with the cell surface of the input PBMCs, thereby generating the plurality of modified PBMCs associated with the antigen; and b) administering the plurality of modified PBMCs to the individual. 60. The method of claim 50, wherein the stimulation of the immune response is for use in treating cancer, an infectious disease, or a viral associated disease in an individual. 61. The method of claim 50, wherein the plurality of modified PBMCs is administered prior to, concurrently with, or following administration of:
(a) a cytokine; (b) an immune checkpoint inhibitor; and/or (c) a therapeutic agent. 62. The method of claim 61, wherein the plurality of modified PBMCs is administered prior to, concurrently with, or following administration of:
(a) a cytokine, wherein the cytokine is IL-2; (b) an immune checkpoint inhibitor; wherein the immune checkpoint inhibitor is targeted to any one of PD-1, PD-L1, CTLA-4, LAG3, VISTA, and TIM-3; and/or (c) a therapeutic agent, wherein the therapeutic agent is a chemotherapeutic agent. 63-66. (canceled) 67. A method for generating a conditioned plurality of PBMCs comprising an antigen, comprising incubating a plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition before or after introducing the antigen to the plurality of PBMCs, thereby generating the conditioned plurality of PBMCs comprising the antigen. 68-69. (canceled) 70. A method for generating a plurality of modified PBMCs comprising an antigen, or an antigen and an adjuvant, comprising:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the antigen or the antigen and the adjuvant to pass through to form a plurality of perturbed input PBMCs; and b) incubating the plurality of perturbed input PBMCs with the antigen or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 71. (canceled) 72. The method of claim 70, wherein the method further comprises:
a) incubating the plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating the conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 73-93. (canceled) | The present application provides peripheral blood mononuclear cells comprising an antigen, methods of manufacturing such PBMCs, and methods of using such PBMCs, such as for modulating an immune response in an individual. In some embodiments, the PBMCs are conditioned by incubating the PBMC in the presence of an adjuvant.1-3. (canceled) 4. A conditioned plurality of modified PBMCs comprising an antigen, wherein the antigen is exogenous to the modified PBMCs. 5. (canceled) 6. The conditioned plurality of modified PBMCs of claim 4, wherein the modified PBMCs further comprise an adjuvant. 7-8. (canceled) 9. The conditioned plurality of PBMCs of claim 4, prepared by incubating the plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition before or after introducing the antigen to the PBMCs, thereby generating the conditioned plurality of PBMCs comprising the antigen. 10. A plurality of modified PBMCs comprising an antigen, or an antigen and an adjuvant, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the antigen or the antigen and the adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the antigen, or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 11. A plurality of modified PBMCs comprising an antigen, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for a nucleic acid encoding the antigen to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the nucleic acid encoding the antigen for a sufficient time to allow the nucleic acid encoding the antigen to enter the perturbed input PBMCs, wherein the nucleic acid is expressed in the PBMCs to produce the antigen thereby generating a plurality of modified PBMCs comprising the antigen. 12. (canceled) 13. The plurality of modified PBMCs of claim 11, the process further comprises the step of:
a) incubating the plurality of input PBMCs with an adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the nucleic acid encoding the antigen with an adjuvant for a sufficient time for the modified PBMCs comprising the nucleic acid encoding the antigen to condition, wherein the nucleic acid is expressed in the PBMCs to produce the antigen thereby generating the conditioned plurality of modified PBMCs comprising the antigen. 14-16. (canceled) 17. The plurality of modified PBMCs of claim 10, wherein the input PBMCs comprise an adjuvant. 18. A plurality of modified PBMCs comprising an antigen and an adjuvant, prepared by a process comprising the steps of:
a) passing a cell suspension comprising a plurality of input PBMCs comprising the antigen through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the adjuvant to pass through to form a plurality of perturbed input PBMCs; and b) incubating the plurality of perturbed input PBMCs with the adjuvant for a sufficient time to allow the adjuvant to enter the perturbed input PBMCs, thereby generating the plurality of modified PBMCs comprising the antigen and the adjuvant. 19. The plurality of modified PBMCs according to claim 10, wherein the process further comprises:
a) incubating the plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or (b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating a conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 20. The plurality of modified PBMCs of claim 10, wherein the process further comprises a step of incubating the input PBMCs and/or the modified PBMCs with an agent that enhances the viability and/or function of the modified PBMCs as compared to corresponding modified PBMCs prepared without the further incubation step. 21. The plurality of modified PBMCs of claim 10, wherein the diameter of the constriction is about 10% to about 99% of the mean diameter of the plurality of input PBMCs. 22. The plurality of modified PBMCs of claim 10, wherein the diameter of the constriction is: (a) about 4.2 μm to about 6 μm; (b) about 4.2 μm to about 4.8 μm; or (c) about 4.5 μm. 23. (canceled) 24. The plurality of modified PBMCs of claim 10, wherein the cell suspension comprising the plurality of input PBMCs are is passed through multiple constrictions wherein the multiple constrictions are arranged in series and/or in parallel. 25. (canceled) 26. The conditioned plurality of modified PBMCs of claim 10, wherein the plurality of modified PBMCs is incubated with the adjuvant for about 2 hours to about 10 hours; or for about 3 hours to about 6 hours; or for about 4 hours for the modified PBMCs to condition. 27. The plurality of modified PBMCs of claim 10, wherein the antigen and/or the adjuvant are present in at least about 70% of the cells in the plurality of PBMCs. 28. The plurality of modified PBMCs of claim 10, wherein the adjuvant is a CpG oligodeoxynucleotide (ODN), LPS, IFN-α, STING agonists, RIG-I agonists, poly I:C, R837, R848, a TLR3 agonist, a TLR4 agonist or a TLR 9 agonist. 29. The plurality of modified PBMCs of claim 10, wherein the adjuvant is a CpG oligodeoxynucleotide (ODN). 30. The plurality of modified PBMCs of claim 10, wherein the antigen is a disease-associated antigen. 31. The plurality of modified PBMCs of claim 10, wherein the antigen is a human papillomavirus (HPV) antigen. 32. The plurality of modified PBMCs of claim 10, wherein the cells are further modified to increase expression of:
(a) one or more of co-stimulatory molecules; and/or (b) one or more cytokines. 33. The plurality of modified PBMCs of claim 32, wherein:
(a) the cells are further modified to increase expression of one or more of co-stimulatory molecules, wherein the co-stimulatory molecule is B7-H2 (ICOSL), B7-1 (CD80), B7-2 (CD86), CD70, LIGHT, HVEM, CD40, 4-1BBL, OX40L, TL1A, GITRL, CD30L, TIM4, SLAM, CD48, CD58, CD155, or CD112; and/or (b) the cells are further modified to increase expression of one or more cytokines, wherein the cytokine is IL-15, IL-12, IL-2, IFN-α, or IL-21. 34-35. (canceled) 36. The plurality of modified PBMCs of claim 10, wherein:
(a) one or more co-stimulatory molecules is upregulated in the B cells of the conditioned plurality of modified PBMCs compared to the B cells in the plurality of unmodified PBMCs, wherein the co-stimulatory molecule is CD80 and/or CD86; and/or (b) the modified PBMCs have increased expression of one or more of IFN-γ, IL-6, MCP-1, MIP-1β, IP-10, or TNF-α compared to a plurality of unconditioned PBMCs. 37. The plurality of modified PBMCs of claim 36, wherein:
(a) the CD80 and/or CD86 is upregulated in the B cells of the conditioned plurality of modified PBMCs by more than about 1.2-fold, 1.5-fold, 1.8-fold, 2-fold, 3-fold, 4-fold, 5-fold, 8-fold, or more than 10-fold compared to the B cells in a plurality of unconditioned PBMCs; and/or (b) the expression of one or more of IFN-γ, IL-6, MCP-1, MIP-113, IP-10, or TNF-α is increased by more than about 1.2-fold, 1.5-fold, 1.8-fold, 2-fold, 3-fold, 4-fold, 5-fold, 8-fold, or more than 10-fold compared to the plurality of unconditioned PBMCs. 38-39. (canceled) 40. A composition comprising the plurality of modified PBMCs of claim 10. 41-47. (canceled) 48. A method for stimulating an immune response in an individual, comprising:
a) incubating a plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition, wherein the plurality of PBMCs comprises an antigen before the conditioning or wherein an antigen is introduced to the plurality of PBMCs after the conditioning, thereby generating a conditioned plurality of PBMCs comprising the antigen; b) administering the conditioned plurality of PBMCs comprising the antigen to the individual. 49. (canceled) 50. A method for stimulating an immune response in an individual, comprising:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for an antigen or an antigen and an adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the antigen or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant; c) administering the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant to the individual. 51-52. (canceled) 53. The method of claim 50, wherein the PBMCs are conditioned by a process comprising the step of:
a) incubating a plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating a conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 54. The method of claim 50, wherein the input PBMCs comprise an adjuvant. 55. A method for stimulating an immune response in an individual, comprising:
a) passing a cell suspension comprising an input PBMCs comprising an antigen through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for an adjuvant to pass through to form a plurality of perturbed input PBMCs; b) incubating the plurality of perturbed input PBMCs with the adjuvant for a sufficient time to allow the adjuvant to enter the perturbed input PBMCs, thereby generating a plurality of modified PBMCs comprising the antigen and the adjuvant; and c) administering the plurality of modified PBMCs to the individual. 56. The method of claim 50, further comprising the step of administering an adjuvant to the individual. 57. The method of claim 55, further comprising the step of administering an adjuvant to the individual. 58. (canceled) 59. A method for stimulating an immune response in an individual, comprising: administering to the individual a plurality of modified PBMCs associated with an antigen, wherein the plurality of modified PBMCs is prepared by a process comprising the steps of:
a) incubating a plurality of input PBMCs with an antigen for a sufficient time to allow the antigen to associate with the cell surface of the input PBMCs, thereby generating the plurality of modified PBMCs associated with the antigen; and b) administering the plurality of modified PBMCs to the individual. 60. The method of claim 50, wherein the stimulation of the immune response is for use in treating cancer, an infectious disease, or a viral associated disease in an individual. 61. The method of claim 50, wherein the plurality of modified PBMCs is administered prior to, concurrently with, or following administration of:
(a) a cytokine; (b) an immune checkpoint inhibitor; and/or (c) a therapeutic agent. 62. The method of claim 61, wherein the plurality of modified PBMCs is administered prior to, concurrently with, or following administration of:
(a) a cytokine, wherein the cytokine is IL-2; (b) an immune checkpoint inhibitor; wherein the immune checkpoint inhibitor is targeted to any one of PD-1, PD-L1, CTLA-4, LAG3, VISTA, and TIM-3; and/or (c) a therapeutic agent, wherein the therapeutic agent is a chemotherapeutic agent. 63-66. (canceled) 67. A method for generating a conditioned plurality of PBMCs comprising an antigen, comprising incubating a plurality of PBMCs with an adjuvant for a sufficient time for the PBMCs to condition before or after introducing the antigen to the plurality of PBMCs, thereby generating the conditioned plurality of PBMCs comprising the antigen. 68-69. (canceled) 70. A method for generating a plurality of modified PBMCs comprising an antigen, or an antigen and an adjuvant, comprising:
a) passing a cell suspension comprising a plurality of input PBMCs through a cell-deforming constriction, wherein a diameter of the constriction is a function of a diameter of the input PBMCs in the suspension, thereby causing perturbations of the input PBMCs large enough for the antigen or the antigen and the adjuvant to pass through to form a plurality of perturbed input PBMCs; and b) incubating the plurality of perturbed input PBMCs with the antigen or the antigen and the adjuvant for a sufficient time to allow the antigen or the antigen and the adjuvant to enter the perturbed input PBMCs, thereby generating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 71. (canceled) 72. The method of claim 70, wherein the method further comprises:
a) incubating the plurality of input PBMCs with a second adjuvant for a sufficient time for the input PBMCs to condition, thereby generating a conditioned plurality of input PBMCs; and/or b) incubating the plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant with a second adjuvant for a sufficient time for the modified PBMCs comprising the antigen or the antigen and the adjuvant to condition, thereby generating the conditioned plurality of modified PBMCs comprising the antigen or the antigen and the adjuvant. 73-93. (canceled) | 1,600 |
344,510 | 16,803,996 | 3,672 | A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting. The rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes. The bore shell wraps around the guide bore. The bore shell comprises an outside surface and an inside surface. The plurality of flutes are arranged around the bore shell extending outward from a central axis. The plurality of flutes are configured to prevent the sucker rod from rubbing within a tubing, as the sucker rod is inserted and withdrawn from said tubing the rod guide and the guide bore comprises the central axis. | 1. A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting, wherein:
said rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes; said bore shell wraps around said guide bore; said bore shell comprises an outside surface and an inside surface; said plurality of flutes are arranged around said bore shell extending outward from a central axis; said plurality of flutes are configured to prevent said sucker rod from rubbing within a tubing, as said sucker rod is inserted and withdrawn from said tubing Said rod guide and said guide bore comprises said central axis; said plurality of flutes comprises a flute diameter as measured outward from said central axis; said bore shell comprises a shell diameter; said guide bore comprises an inner bore diameter and an outer bore diameter; said inner bore diameter is substantially the same or minimally larger than an outer rod diameter of said sucker rod; said one or more glue ports each comprise an aperture in said bore shell creating a fluid channel into said guide bore; said plurality of glue dams are arranged about said inside surface of said bore shell; said one or more glue ports are arranged between said plurality of glue dams in said bore shell to allow an adhesive to enter an adhesive channel; said adhesive channel can comprise a channel between said sucker rod, said bore shell, and said plurality of glue dams; said one or more glue ports each comprise one or more port diameters; said one or more port diameters can taper down as between said outside surface and said inside surface of said bore shell; said plurality of flutes comprise at least a first flute, a second flute and a third flute; and said bore shell comprise a cylindrical shape with open ends at said first end and said second end. 2. A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting, wherein:
said rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes; said bore shell wraps around said guide bore; said bore shell comprises an outside surface and an inside surface; said plurality of flutes are arranged around said bore shell extending outward from a central axis; said plurality of flutes are configured to prevent said sucker rod from rubbing within a tubing, as said sucker rod is inserted and withdrawn from said tubing Said rod guide and said guide bore comprises said central axis; said plurality of flutes comprises a flute diameter as measured outward from said central axis; said bore shell comprises a shell diameter; said guide bore comprises an inner bore diameter and an outer bore diameter; said inner bore diameter is substantially the same or larger than an outer rod diameter of said sucker rod; said one or more glue ports each comprise an aperture in said bore shell creating a fluid channel into said guide bore; said plurality of glue dams are arranged about said inside surface of said bore shell; said one or more glue ports are arranged between said plurality of glue dams in said bore shell to allow an adhesive to enter an adhesive channel; and said adhesive channel can comprise a channel between said sucker rod, said bore shell, and said plurality of glue dams. 3. The rod guide of claim 1, wherein:
said one or more glue ports each comprise said one or more port diameters; and said one or more port diameters taper down as between said outside surface and said inside surface of said bore shell. 4. The rod guide of claim 3, wherein:
said one or more port diameters comprise a first port diameter, a second port diameter, and a third port diameter; said first port diameter is smaller than said second port diameter; and said second port diameter is smaller than said third port diameter. 5. The rod guide of claim 1, wherein:
said plurality of flutes comprise at least said first flute, said second flute and said third flute. 6. The rod guide of claim 1, wherein:
said plurality of flutes comprise at least said first flute, said second flute, said third flute and a fourth flute. 7. The rod guide of claim 1, wherein:
said bore shell comprise a cylindrical shape with open ends at said first end and said second end. 8. The rod guide of claim 1, wherein:
said rod guide is aligned along said central axis, corresponding to a longitudinal center of said rod guide and said sucker rod. 9. The rod guide of claim 1, wherein:
said plurality of glue dams comprise a plurality of horizontal dams and a plurality of vertical dams; said plurality of horizontal dams comprise a first thickness, and said plurality of vertical dams comprises a second thickness; a portion of said plurality of glue dams comprises a different thickness from one another, for example said first thickness are thicker than said second thickness; said plurality of horizontal dams comprises a first radial width and said plurality of vertical dams comprises a second radial width; a diagonal section cut are arranged on a top portion and a bottom portion of said inside surface, and said plurality of vertical dams are arranged on a first side and a second side portion of said inside surface; said plurality of horizontal dams comprises a first width and said plurality of vertical dams comprises a second width; said first width are equal to said second width; each of said plurality of horizontal dams and said plurality of vertical dams repeat in an alternating pattern along said inside surface separated by said adhesive channel; each among said plurality of horizontal dams and said plurality of vertical dams are arranged between a two ends with a gap distance between said plurality of horizontal dams and said plurality of vertical dams; and said plurality of horizontal dams and said plurality of vertical dams alternate along said rod guide. 10. The rod guide of claim 1, wherein:
said plurality of glue dams comprise said plurality of horizontal dams and said plurality of vertical dams; said plurality of horizontal dams comprise said first thickness, and said plurality of vertical dams comprises said second thickness; said plurality of horizontal dams comprises said first radial width and said plurality of vertical dams comprises said second radial width; said diagonal section cut are arranged on said top portion and said bottom portion of said inside surface, and said plurality of vertical dams are arranged on said first side and said second side portion of said inside surface; each of said plurality of horizontal dams and said plurality of vertical dams repeat in an alternating pattern along said inside surface separated by said adhesive channel; and said plurality of horizontal dams and said plurality of vertical dams alternate along said rod guide. 11. The rod guide of claim 10, wherein:
each among said plurality of horizontal dams and said plurality of vertical dams are arranged between said two ends with said gap distance between said plurality of horizontal dams and said plurality of vertical dams. 12. The rod guide of claim 10, wherein:
said plurality of horizontal dams comprises said first width and said plurality of vertical dams comprises said second width; and said first width are equal to said second width. 13. The rod guide of claim 10, wherein:
a portion of said plurality of glue dams comprises a different thickness from one another, for example said first thickness are thicker than said second thickness. | A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting. The rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes. The bore shell wraps around the guide bore. The bore shell comprises an outside surface and an inside surface. The plurality of flutes are arranged around the bore shell extending outward from a central axis. The plurality of flutes are configured to prevent the sucker rod from rubbing within a tubing, as the sucker rod is inserted and withdrawn from said tubing the rod guide and the guide bore comprises the central axis.1. A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting, wherein:
said rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes; said bore shell wraps around said guide bore; said bore shell comprises an outside surface and an inside surface; said plurality of flutes are arranged around said bore shell extending outward from a central axis; said plurality of flutes are configured to prevent said sucker rod from rubbing within a tubing, as said sucker rod is inserted and withdrawn from said tubing Said rod guide and said guide bore comprises said central axis; said plurality of flutes comprises a flute diameter as measured outward from said central axis; said bore shell comprises a shell diameter; said guide bore comprises an inner bore diameter and an outer bore diameter; said inner bore diameter is substantially the same or minimally larger than an outer rod diameter of said sucker rod; said one or more glue ports each comprise an aperture in said bore shell creating a fluid channel into said guide bore; said plurality of glue dams are arranged about said inside surface of said bore shell; said one or more glue ports are arranged between said plurality of glue dams in said bore shell to allow an adhesive to enter an adhesive channel; said adhesive channel can comprise a channel between said sucker rod, said bore shell, and said plurality of glue dams; said one or more glue ports each comprise one or more port diameters; said one or more port diameters can taper down as between said outside surface and said inside surface of said bore shell; said plurality of flutes comprise at least a first flute, a second flute and a third flute; and said bore shell comprise a cylindrical shape with open ends at said first end and said second end. 2. A rod guide for guiding and protecting a sucker rod in a fluid mineral extraction setting, wherein:
said rod guide comprising a bore shell, and a guide bore, a first end, a second end, one or more glue ports, a plurality of glue dams and a plurality of flutes; said bore shell wraps around said guide bore; said bore shell comprises an outside surface and an inside surface; said plurality of flutes are arranged around said bore shell extending outward from a central axis; said plurality of flutes are configured to prevent said sucker rod from rubbing within a tubing, as said sucker rod is inserted and withdrawn from said tubing Said rod guide and said guide bore comprises said central axis; said plurality of flutes comprises a flute diameter as measured outward from said central axis; said bore shell comprises a shell diameter; said guide bore comprises an inner bore diameter and an outer bore diameter; said inner bore diameter is substantially the same or larger than an outer rod diameter of said sucker rod; said one or more glue ports each comprise an aperture in said bore shell creating a fluid channel into said guide bore; said plurality of glue dams are arranged about said inside surface of said bore shell; said one or more glue ports are arranged between said plurality of glue dams in said bore shell to allow an adhesive to enter an adhesive channel; and said adhesive channel can comprise a channel between said sucker rod, said bore shell, and said plurality of glue dams. 3. The rod guide of claim 1, wherein:
said one or more glue ports each comprise said one or more port diameters; and said one or more port diameters taper down as between said outside surface and said inside surface of said bore shell. 4. The rod guide of claim 3, wherein:
said one or more port diameters comprise a first port diameter, a second port diameter, and a third port diameter; said first port diameter is smaller than said second port diameter; and said second port diameter is smaller than said third port diameter. 5. The rod guide of claim 1, wherein:
said plurality of flutes comprise at least said first flute, said second flute and said third flute. 6. The rod guide of claim 1, wherein:
said plurality of flutes comprise at least said first flute, said second flute, said third flute and a fourth flute. 7. The rod guide of claim 1, wherein:
said bore shell comprise a cylindrical shape with open ends at said first end and said second end. 8. The rod guide of claim 1, wherein:
said rod guide is aligned along said central axis, corresponding to a longitudinal center of said rod guide and said sucker rod. 9. The rod guide of claim 1, wherein:
said plurality of glue dams comprise a plurality of horizontal dams and a plurality of vertical dams; said plurality of horizontal dams comprise a first thickness, and said plurality of vertical dams comprises a second thickness; a portion of said plurality of glue dams comprises a different thickness from one another, for example said first thickness are thicker than said second thickness; said plurality of horizontal dams comprises a first radial width and said plurality of vertical dams comprises a second radial width; a diagonal section cut are arranged on a top portion and a bottom portion of said inside surface, and said plurality of vertical dams are arranged on a first side and a second side portion of said inside surface; said plurality of horizontal dams comprises a first width and said plurality of vertical dams comprises a second width; said first width are equal to said second width; each of said plurality of horizontal dams and said plurality of vertical dams repeat in an alternating pattern along said inside surface separated by said adhesive channel; each among said plurality of horizontal dams and said plurality of vertical dams are arranged between a two ends with a gap distance between said plurality of horizontal dams and said plurality of vertical dams; and said plurality of horizontal dams and said plurality of vertical dams alternate along said rod guide. 10. The rod guide of claim 1, wherein:
said plurality of glue dams comprise said plurality of horizontal dams and said plurality of vertical dams; said plurality of horizontal dams comprise said first thickness, and said plurality of vertical dams comprises said second thickness; said plurality of horizontal dams comprises said first radial width and said plurality of vertical dams comprises said second radial width; said diagonal section cut are arranged on said top portion and said bottom portion of said inside surface, and said plurality of vertical dams are arranged on said first side and said second side portion of said inside surface; each of said plurality of horizontal dams and said plurality of vertical dams repeat in an alternating pattern along said inside surface separated by said adhesive channel; and said plurality of horizontal dams and said plurality of vertical dams alternate along said rod guide. 11. The rod guide of claim 10, wherein:
each among said plurality of horizontal dams and said plurality of vertical dams are arranged between said two ends with said gap distance between said plurality of horizontal dams and said plurality of vertical dams. 12. The rod guide of claim 10, wherein:
said plurality of horizontal dams comprises said first width and said plurality of vertical dams comprises said second width; and said first width are equal to said second width. 13. The rod guide of claim 10, wherein:
a portion of said plurality of glue dams comprises a different thickness from one another, for example said first thickness are thicker than said second thickness. | 3,600 |
344,511 | 16,803,972 | 3,672 | This invention relates to compositions of chimeric and humanized antibodies that bind to the human CTLA4 molecule and their use in cancer immunotherapy and for reduction of autoimmune side effects compared to other immunotherapeutic agents. | 1.-14. (canceled) 15. A method of treating lung cancer in a subject in need thereof, comprising administering a composition comprising an anti-CTLA4 antibody or an antigen binding fragment thereof to the subject, wherein the anti-CTLA4 antibody or the antigen binding fragment is capable of binding to a human CTLA4 protein and comprises:
(a) a light chain variable region comprising: (i) a complementarity determining region (CDR) 1 comprising the amino acid sequence set forth in SEQ ID NO: 21; (ii) a CDR2 comprising the amino acid sequence set forth in SEQ ID NO: 36, 37 or 38; and, (iii) a CDR3 comprising the amino acid sequence set forth in SEQ ID NO: 23; and, (b) a heavy chain variable region comprising: (i) a CDR1 comprising the amino acid sequence set forth in SEQ ID NO: 24; (ii) a CDR2 comprising the amino acid sequence set forth in SEQ ID NO: 33, 34 or 35; and, (iii) a CDR3 comprising the amino acid sequence set forth in SEQ ID NO: 26. 16. The method of claim 15, wherein: (a) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 37 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 33; (b) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 37 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 35; or, (c) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 38 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 35. 17. The method of claim 15, wherein: (a) the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 62, 63 or 64; and, (b) the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 70, 71 or 72. 18. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 62 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 71. 19. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 64 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 71. 20. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 64 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 72. 21. The method of claim 15, wherein the anti-CTLA4 antibody or the antigen binding fragment is characterized by reduced binding to soluble CTLA4. 22. The method of claim 15, wherein the composition comprises the antigen binding fragment. 23. The method of claim 15, wherein the composition is a pharmaceutical composition comprising a therapeutically effective amount of the anti-CTLA4 antibody or the antigen binding fragment, and a physiologically acceptable carrier or excipient. 24. The method of claim 15, further comprising administering an additional agent selected from the group consisting of an anti-PD-1 antibody and an anti-4-1BB antibody. 25. The method of claim 24, wherein the anti-PD-1 antibody or anti-4-1BB antibody, and the anti-CTLA4 antibody are combined in a single molecule as a bi-specific antibody. 26. The method of claim 15, wherein the composition induces strong deletion of Treg and local T cell activation in tumor microenvironment but minimal systemic T cell activation. | This invention relates to compositions of chimeric and humanized antibodies that bind to the human CTLA4 molecule and their use in cancer immunotherapy and for reduction of autoimmune side effects compared to other immunotherapeutic agents.1.-14. (canceled) 15. A method of treating lung cancer in a subject in need thereof, comprising administering a composition comprising an anti-CTLA4 antibody or an antigen binding fragment thereof to the subject, wherein the anti-CTLA4 antibody or the antigen binding fragment is capable of binding to a human CTLA4 protein and comprises:
(a) a light chain variable region comprising: (i) a complementarity determining region (CDR) 1 comprising the amino acid sequence set forth in SEQ ID NO: 21; (ii) a CDR2 comprising the amino acid sequence set forth in SEQ ID NO: 36, 37 or 38; and, (iii) a CDR3 comprising the amino acid sequence set forth in SEQ ID NO: 23; and, (b) a heavy chain variable region comprising: (i) a CDR1 comprising the amino acid sequence set forth in SEQ ID NO: 24; (ii) a CDR2 comprising the amino acid sequence set forth in SEQ ID NO: 33, 34 or 35; and, (iii) a CDR3 comprising the amino acid sequence set forth in SEQ ID NO: 26. 16. The method of claim 15, wherein: (a) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 37 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 33; (b) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 37 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 35; or, (c) the light chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 38 and the heavy chain CDR2 comprises the amino acid sequence set forth in SEQ ID NO: 35. 17. The method of claim 15, wherein: (a) the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 62, 63 or 64; and, (b) the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 70, 71 or 72. 18. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 62 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 71. 19. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 64 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 71. 20. The method of claim 17, wherein the heavy chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 64 and the light chain variable region comprises the amino acid sequence set forth in SEQ ID NO: 72. 21. The method of claim 15, wherein the anti-CTLA4 antibody or the antigen binding fragment is characterized by reduced binding to soluble CTLA4. 22. The method of claim 15, wherein the composition comprises the antigen binding fragment. 23. The method of claim 15, wherein the composition is a pharmaceutical composition comprising a therapeutically effective amount of the anti-CTLA4 antibody or the antigen binding fragment, and a physiologically acceptable carrier or excipient. 24. The method of claim 15, further comprising administering an additional agent selected from the group consisting of an anti-PD-1 antibody and an anti-4-1BB antibody. 25. The method of claim 24, wherein the anti-PD-1 antibody or anti-4-1BB antibody, and the anti-CTLA4 antibody are combined in a single molecule as a bi-specific antibody. 26. The method of claim 15, wherein the composition induces strong deletion of Treg and local T cell activation in tumor microenvironment but minimal systemic T cell activation. | 3,600 |
344,512 | 16,803,977 | 3,672 | Methods and apparatuses for improve data clock to reduce power consumption are presented. The apparatus includes a memory configured to receive a data clock from a host via a link and to synchronize the data clock with the host. The memory includes a clock tree buffer configured to toggle based on the data clock to capture write data or to output read data and a command decoder configured to detect a data clock suspend command while the data clock is synchronized between the host and the memory. The clock tree buffer is configured to disable toggling based on the data clock in response to the command decoder detecting the data clock suspend command. the host includes a memory controller configured to provide a data clock suspend command to the memory via the link while the data clock is synchronized between the host and the memory. | 1. An apparatus, comprising:
a memory configured to receive a data clock from a host via a link and to synchronize the data clock with the host, further comprising:
a clock tree buffer configured to toggle based on the data clock to capture write data or to output read data; and
a command decoder configured to detect a data clock suspend command while the data clock is synchronized between the host and the memory, wherein the clock tree buffer is configured to disable toggling based on the data clock in response to the command decoder detecting the data clock suspend command. 2. The apparatus of claim 1, wherein the command decoder is further configured to detect a read or write command subsequent to detecting the data clock suspend command without performing synchronization of the data clock between detecting the data clock suspend command and detecting the read or write command, and the clock tree buffer is further configured to start toggling based on the data clock in response to the command decoder detecting the read or write command. 3. The apparatus of claim 2, wherein the memory is configured to perform a read or write operation in response to the read or write command. 4. The apparatus of claim 1, wherein the memory further comprises a memory mode register configured store information of the data clock suspend command. 5. The apparatus of claim 4, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 6. The apparatus of claim 3, wherein the memory is configured to operate according to a low power double data rate dynamic random-access memory specification. 7. The apparatus of claim 6, wherein the data clock suspend command comprises operands of WS_WR, WS_RD, and WS_FS at logic one. 8. The apparatus of claim 6, further comprising one of a computing system, a mobile computing system, an Internet of Things device, a virtual reality system, or an augmented reality system incorporating the host, the memory, and the link, wherein the host further comprises at least on processor coupled to the memory to perform a computing function of the one of the computing system, the mobile computing system, the Internet of Things device, the virtual reality system, or the augmented reality system. 9. The apparatus of claim 8, wherein the memory comprises an LPDDR5 memory. 10. The apparatus of claim 8, the clock tree buffer is configured to receive an output directly or indirectly from a data clock buffer configured to receive the data clock. 11. An apparatus, comprising:
a host coupled to a memory via a link, wherein the host is configured to synchronize a data clock with the memory and to output write data or capture read data based on the data clock, wherein the host comprises a memory controller configured
to provide a data clock suspend command to the memory via the link while the data clock is synchronized between the host and the memory, wherein the data clock suspend command notifies the memory to disable toggling a clock tree buffer, the clock tree buffer being configured to toggle based on the data clock, and
to toggle the data clock after providing the data clock suspend command. 12. The apparatus of claim 11, wherein the memory controller is further configured to provide a read or write command to the memory via the link, subsequent to providing the data clock suspend command, wherein the read or write command notifies the memory to start toggling a data clock buffer. 13. The apparatus of claim 12, wherein the memory controller is configured to provide the read or write command to access the memory, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 14. The apparatus of claim 13, wherein the memory controller is configured to provide a mode register read command to the memory via the link, for information of the data clock suspend command, and configured to provide the data clock suspend command based on the information of the data clock suspend command. 15. The apparatus of claim 14, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 16. The apparatus of claim 14, wherein the memory controller is configured to operate in accordance with a low power double data rate dynamic random-access memory specification. 17. The apparatus of claim 16, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 18. The apparatus of claim 16, further comprising one of a computing system, a mobile computing system, an Internet of Things device, a virtual reality system, or an augmented reality system incorporating the host, the memory, and the link, wherein the host further comprises at least on processor coupled to the memory to perform a computing function of the one of the computing system, the mobile computing system, the Internet of Things device, the virtual reality system, or the augmented reality system. 19. The apparatus of claim 18, wherein the memory comprises an LPDDR5 memory. 20. The apparatus of claim 18, wherein the read or write command is between a first time period and a second time period after the data clock suspend command. 21. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising:
receiving a data clock, by the memory, from a host via a link; synchronizing, by the memory, the data clock with the host; toggling, by a clock tree buffer of the memory, based on the data clock to capture write data or to output read data; detecting, by the memory, a data clock suspend command while the data clock is synchronized between the memory and the host; and disabling toggling the clock tree buffer based on the data clock, in response to detecting the data clock suspend command. 22. The method of claim 21, further comprising
detecting, by the memory, a read or write command subsequent to detecting the data clock suspend command; and starting toggling based on the data clock, by the clock tree buffer, in response to detecting the read or write command. 23. The method of claim 22, further comprising
performing a read or write operation, by the memory, in response to the read or write command, without performing synchronization of the data clock between detecting the data clock suspend command and detecting the read or write command. 24. The method of claim 21, further comprising
storing, by a memory mode register, information of the data clock suspend command. 25. The method of claim 24, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 26. The method of claim 23, wherein the memory operates according to a low power double data rate dynamic random-access memory specification. 27. The method of claim 26, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 28. The method of claim 27, wherein the link operates according to an LPDDR5 specification. 29. The method of claim 28, wherein the memory comprises an LPDDR5 memory. 30. The method of claim 29, wherein the host operates according to the LPDDR5 specification. 31. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising
synchronizing a data clock between the host and the memory via a link; toggling, by a clock tree buffer of the memory, based on the data clock to capture write data or to output read data; providing, by the host to the memory via the link, a data clock suspend command, while the data clock is synchronized between the host and the memory; disabling toggling based on the data clock, by the clock tree buffer, in response to the data clock suspend command; and toggling, by the host, the data clock after providing the data clock suspend command. 32. The method of claim 31, providing, by the host to the memory via the link, a read or write command after the data clock suspend command, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 33. The method of claim 32, further comprising starting toggling, by the memory, the clock tree buffer in response to the read or write command. 34. The method of claim 33, performing, by the memory, the read or write operation in response to the read or write command. 35. The method of claim 31, further comprising
providing, by the host to the memory via the link, a mode register read command; and providing, by the memory to the host via the link, information of the data clock suspend command in response to the mode register read command. 36. The method of claim 35, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 37. The method of claim 36, providing the data clock suspend command being in response to the information of the data clock suspend command. 38. The method of claim 37, wherein host, the memory, and the link operate in accordance with a low power double data rate dynamic random-access memory specification. 39. The method of claim 38, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 40. The method of claim 39, wherein the host operates according to an LPDDR5 specification. 41. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising:
providing, by a host to a memory via a link, a data clock synchronization command; providing, by the host to the memory via the link, a data clock suspend command, after synchronizing a data clock, wherein the data clock suspend command notifies the memory to disable a data clock buffer which toggles based on the data clock; and toggling, by the host, the data clock after providing the data clock suspend command. 42. The method of claim 41, further comprising
providing, by the host to the memory via the link, a read or write command after the data clock suspend command, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 43. The method of claim 42, further wherein the memory starts toggling the data clock buffer in response to the read or write command. 44. The method of claim 43, wherein the memory performs a read or write operation in response to the read or write command. 45. The method of claim 42, further comprising
providing, by the host to the memory via the link, a mode register read command for information of the data clock suspend command. 46. The method of claim 45, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 47. The method of claim 46, providing the data clock suspend command being in response to the information of the data clock suspend command. 48. The method of claim 41, wherein host, the memory, and the link operate in accordance with a low power double data rate dynamic random-access memory specification. 49. The method of claim 41, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. | Methods and apparatuses for improve data clock to reduce power consumption are presented. The apparatus includes a memory configured to receive a data clock from a host via a link and to synchronize the data clock with the host. The memory includes a clock tree buffer configured to toggle based on the data clock to capture write data or to output read data and a command decoder configured to detect a data clock suspend command while the data clock is synchronized between the host and the memory. The clock tree buffer is configured to disable toggling based on the data clock in response to the command decoder detecting the data clock suspend command. the host includes a memory controller configured to provide a data clock suspend command to the memory via the link while the data clock is synchronized between the host and the memory.1. An apparatus, comprising:
a memory configured to receive a data clock from a host via a link and to synchronize the data clock with the host, further comprising:
a clock tree buffer configured to toggle based on the data clock to capture write data or to output read data; and
a command decoder configured to detect a data clock suspend command while the data clock is synchronized between the host and the memory, wherein the clock tree buffer is configured to disable toggling based on the data clock in response to the command decoder detecting the data clock suspend command. 2. The apparatus of claim 1, wherein the command decoder is further configured to detect a read or write command subsequent to detecting the data clock suspend command without performing synchronization of the data clock between detecting the data clock suspend command and detecting the read or write command, and the clock tree buffer is further configured to start toggling based on the data clock in response to the command decoder detecting the read or write command. 3. The apparatus of claim 2, wherein the memory is configured to perform a read or write operation in response to the read or write command. 4. The apparatus of claim 1, wherein the memory further comprises a memory mode register configured store information of the data clock suspend command. 5. The apparatus of claim 4, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 6. The apparatus of claim 3, wherein the memory is configured to operate according to a low power double data rate dynamic random-access memory specification. 7. The apparatus of claim 6, wherein the data clock suspend command comprises operands of WS_WR, WS_RD, and WS_FS at logic one. 8. The apparatus of claim 6, further comprising one of a computing system, a mobile computing system, an Internet of Things device, a virtual reality system, or an augmented reality system incorporating the host, the memory, and the link, wherein the host further comprises at least on processor coupled to the memory to perform a computing function of the one of the computing system, the mobile computing system, the Internet of Things device, the virtual reality system, or the augmented reality system. 9. The apparatus of claim 8, wherein the memory comprises an LPDDR5 memory. 10. The apparatus of claim 8, the clock tree buffer is configured to receive an output directly or indirectly from a data clock buffer configured to receive the data clock. 11. An apparatus, comprising:
a host coupled to a memory via a link, wherein the host is configured to synchronize a data clock with the memory and to output write data or capture read data based on the data clock, wherein the host comprises a memory controller configured
to provide a data clock suspend command to the memory via the link while the data clock is synchronized between the host and the memory, wherein the data clock suspend command notifies the memory to disable toggling a clock tree buffer, the clock tree buffer being configured to toggle based on the data clock, and
to toggle the data clock after providing the data clock suspend command. 12. The apparatus of claim 11, wherein the memory controller is further configured to provide a read or write command to the memory via the link, subsequent to providing the data clock suspend command, wherein the read or write command notifies the memory to start toggling a data clock buffer. 13. The apparatus of claim 12, wherein the memory controller is configured to provide the read or write command to access the memory, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 14. The apparatus of claim 13, wherein the memory controller is configured to provide a mode register read command to the memory via the link, for information of the data clock suspend command, and configured to provide the data clock suspend command based on the information of the data clock suspend command. 15. The apparatus of claim 14, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 16. The apparatus of claim 14, wherein the memory controller is configured to operate in accordance with a low power double data rate dynamic random-access memory specification. 17. The apparatus of claim 16, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 18. The apparatus of claim 16, further comprising one of a computing system, a mobile computing system, an Internet of Things device, a virtual reality system, or an augmented reality system incorporating the host, the memory, and the link, wherein the host further comprises at least on processor coupled to the memory to perform a computing function of the one of the computing system, the mobile computing system, the Internet of Things device, the virtual reality system, or the augmented reality system. 19. The apparatus of claim 18, wherein the memory comprises an LPDDR5 memory. 20. The apparatus of claim 18, wherein the read or write command is between a first time period and a second time period after the data clock suspend command. 21. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising:
receiving a data clock, by the memory, from a host via a link; synchronizing, by the memory, the data clock with the host; toggling, by a clock tree buffer of the memory, based on the data clock to capture write data or to output read data; detecting, by the memory, a data clock suspend command while the data clock is synchronized between the memory and the host; and disabling toggling the clock tree buffer based on the data clock, in response to detecting the data clock suspend command. 22. The method of claim 21, further comprising
detecting, by the memory, a read or write command subsequent to detecting the data clock suspend command; and starting toggling based on the data clock, by the clock tree buffer, in response to detecting the read or write command. 23. The method of claim 22, further comprising
performing a read or write operation, by the memory, in response to the read or write command, without performing synchronization of the data clock between detecting the data clock suspend command and detecting the read or write command. 24. The method of claim 21, further comprising
storing, by a memory mode register, information of the data clock suspend command. 25. The method of claim 24, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 26. The method of claim 23, wherein the memory operates according to a low power double data rate dynamic random-access memory specification. 27. The method of claim 26, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 28. The method of claim 27, wherein the link operates according to an LPDDR5 specification. 29. The method of claim 28, wherein the memory comprises an LPDDR5 memory. 30. The method of claim 29, wherein the host operates according to the LPDDR5 specification. 31. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising
synchronizing a data clock between the host and the memory via a link; toggling, by a clock tree buffer of the memory, based on the data clock to capture write data or to output read data; providing, by the host to the memory via the link, a data clock suspend command, while the data clock is synchronized between the host and the memory; disabling toggling based on the data clock, by the clock tree buffer, in response to the data clock suspend command; and toggling, by the host, the data clock after providing the data clock suspend command. 32. The method of claim 31, providing, by the host to the memory via the link, a read or write command after the data clock suspend command, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 33. The method of claim 32, further comprising starting toggling, by the memory, the clock tree buffer in response to the read or write command. 34. The method of claim 33, performing, by the memory, the read or write operation in response to the read or write command. 35. The method of claim 31, further comprising
providing, by the host to the memory via the link, a mode register read command; and providing, by the memory to the host via the link, information of the data clock suspend command in response to the mode register read command. 36. The method of claim 35, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 37. The method of claim 36, providing the data clock suspend command being in response to the information of the data clock suspend command. 38. The method of claim 37, wherein host, the memory, and the link operate in accordance with a low power double data rate dynamic random-access memory specification. 39. The method of claim 38, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. 40. The method of claim 39, wherein the host operates according to an LPDDR5 specification. 41. A method to reduce power of a data clock for a memory coupled to a host via a link, comprising:
providing, by a host to a memory via a link, a data clock synchronization command; providing, by the host to the memory via the link, a data clock suspend command, after synchronizing a data clock, wherein the data clock suspend command notifies the memory to disable a data clock buffer which toggles based on the data clock; and toggling, by the host, the data clock after providing the data clock suspend command. 42. The method of claim 41, further comprising
providing, by the host to the memory via the link, a read or write command after the data clock suspend command, without performing synchronization of the data clock between providing the data clock suspend command and providing the read or write command. 43. The method of claim 42, further wherein the memory starts toggling the data clock buffer in response to the read or write command. 44. The method of claim 43, wherein the memory performs a read or write operation in response to the read or write command. 45. The method of claim 42, further comprising
providing, by the host to the memory via the link, a mode register read command for information of the data clock suspend command. 46. The method of claim 45, wherein the information of the data clock suspend command indicates whether the memory supports the data clock suspend command. 47. The method of claim 46, providing the data clock suspend command being in response to the information of the data clock suspend command. 48. The method of claim 41, wherein host, the memory, and the link operate in accordance with a low power double data rate dynamic random-access memory specification. 49. The method of claim 41, wherein the data clock suspend command comprises operands of WS_WR and WS_FS at logic one and WS_RD at logic zero. | 3,600 |
344,513 | 16,803,990 | 3,741 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 3,700 |
344,514 | 29,725,780 | 3,741 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 3,700 |
344,515 | 16,803,981 | 3,741 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 3,700 |
344,516 | 29,725,776 | 2,923 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,517 | 29,725,792 | 2,923 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,518 | 29,725,790 | 2,923 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,519 | 29,725,786 | 2,923 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,520 | 29,725,796 | 2,923 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,521 | 29,725,807 | 2,924 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,522 | 29,725,795 | 2,914 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,523 | 29,725,798 | 2,916 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,524 | 29,725,803 | 2,926 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,525 | 29,725,774 | 2,926 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,526 | 29,725,787 | 2,924 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,900 |
344,527 | 16,803,980 | 2,454 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,400 |
344,528 | 29,725,770 | 2,454 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,400 |
344,529 | 29,725,765 | 2,454 | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. | 1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | A combustor and a gas turbine having the same which can improve a degree of mixing of fuel and air and achieve a reduction in combustion vibration are provided. The combustor may include a fuel nozzle disposed on a nozzle tube, a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base, a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle, and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor.1. A combustor comprising:
a fuel nozzle disposed on a nozzle tube; a center body disposed at a center of the fuel nozzle and connected to a fuel nozzle base; a plurality of swirlers circumferentially spaced apart from each other between the center body and the fuel nozzle; and a plurality of fuel pegs spaced apart from each other around the center body to inject fuel into air flowing in the fuel nozzle, wherein the plurality of fuel pegs are disposed behind the swirlers on the center body based on a combustion chamber of the combustor. 2. The combustor according to claim 1, wherein individual reference lines extending from the fuel pegs toward the fuel nozzle base are offset from an extension reference line extending from an end of each of the swirlers toward the fuel nozzle base. 3. The combustor according to claim 2, wherein the fuel pegs are arranged in a plurality of stages between the swirlers and the fuel nozzle base on the center body. 4. The combustor according to claim 3, wherein if the fuel pegs are arranged in the plurality of stages, a first stage peg which is a fuel peg disposed closest to each of the swirlers includes a first injection hole formed at an angle corresponding to an angle of arrangement (α1) of the swirler, and a first stage peg reference line which is a reference line extending from an end of the first stage peg toward the fuel nozzle base is offset from the extension reference line of the swirler on the center body. 5. The combustor according to claim 4, wherein a second stage peg reference line which is a reference line extending from an end of a second stage peg which is a fuel peg disposed behind the first stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first stage peg reference line on the center body. 6. The combustor according to claim 5, wherein the second stage peg comprises:
a second front injection hole formed in a direction of air flow; and a plurality of second rear injection holes disposed behind the second front injection hole, each of the second rear injection holes being formed at a predetermined angle of injection with the direction of air flow. 7. The combustor according to claim 6, wherein a third stage peg reference line which is a reference line extending from an end of a third stage peg which is a fuel peg disposed behind the second stage peg based on the combustion chamber toward the fuel nozzle base is offset from the extension reference line of the swirler and the first and second stage peg reference lines on the center body. 8. The combustor according to claim 7, wherein the third stage peg comprises:
a third front injection hole formed in the direction of air flow; and a plurality of third rear injection holes disposed behind the third front injection hole, each of the third rear injection holes being formed at a predetermined angle of injection with the direction of air flow and having an angle of injection greater than the second rear injection hole. 9. The combustor according to claim 1, wherein each of the fuel pegs has an elliptical shape such that air flows smoothly thereon. 10. The combustor according to claim 9, wherein
the fuel peg comprises a first curved part curved toward the fuel nozzle base and a second curved part curved toward the combustion chamber, and the first curved part has a relatively gentler curvature than the second curved part. 11. The combustor according to claim 10, wherein the fuel peg further comprises a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second curved part. 12. The combustor according to claim 11, wherein the fuel peg further comprises a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first curved part. 13. The combustor according to claim 12, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 14. The combustor according to claim 12, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 15. The combustor according to claim 1, wherein each of the fuel pegs has a diamond shape such that air flows smoothly thereon. 16. The combustor according to claim 15, wherein
the fuel peg comprises a first inclined part inclined toward the fuel nozzle base and a second inclined part inclined toward the combustion chamber, and the first inclined part has a relatively gentler inclination than the second inclined part. 17. The combustor according to claim 16, wherein the fuel peg further comprises:
a front injection hole formed at a predetermined angle of injection with a direction of air flow, the front injection hole being disposed on the second inclined part; and a rear injection hole formed perpendicular to the direction of air flow, the rear injection hole being disposed on the first inclined part. 18. The combustor according to claim 17, wherein a bather block is disposed, in a form of protruding toward the fuel nozzle base, at a circumference of the front or rear injection hole. 19. The combustor according to claim 17, wherein
a cyclone helix is formed in the front or rear injection hole so that fuel is injected while forming turbulence to increase a degree of mixing of fuel and air, and the cyclone helix comprises a spiral groove formed spirally in the front or rear injection hole and a tapered part tapered from inside to outside in the front or rear injection hole. 20. A gas turbine comprising:
a casing; a compressor section disposed in the casing and configured to compress air; the combustor according to claim 1, the combustor being connected to the compressor section in the casing and configured to combust a mixture of fuel with the compressed air; a turbine section connected to the combustor in the casing and configured to generate power using combustion gas generated by the combustor; and a diffuser connected to the turbine section in the casing and configured to discharge the gas to an outside. | 2,400 |
344,530 | 16,804,000 | 2,454 | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells. | 1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells.1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | 2,400 |
344,531 | 29,725,781 | 2,454 | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells. | 1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells.1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | 2,400 |
344,532 | 29,725,779 | 2,924 | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells. | 1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells.1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | 2,900 |
344,533 | 29,725,761 | 2,924 | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells. | 1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | Presented are Ergodic Spectrum Management (ESM) systems and methods that take advantage of the presence of statistical consistencies (“ergodicity”) and correlations, such as a wireless network's average dimensional consistencies of probability distributions (in time, space, and frequency) of channel gains, to adaptively learn qualitative and quantitative network/user behavior; estimate or predict network performance; and guide locally implemented radio resource management (RRM) decisions of wireless multi-user transmissions in a manner such as to reduce interference and improve latency; connection stability; efficiency; and overall wireless performance. ESM also enhances end-users' Quality of Experience (QoE) by allowing movement across bands and regions as users/devices roam. A remote-cloud-based resource management implementation of ESM's Learn-ed Resource Managers (LRMs) removes the need for heavy edge-computing close to radio cells.1. A system for improving quality of experience (QoE) with a wireless communication system, the system comprising:
a first access node within a plurality of access nodes, the first access node collects data comprising a probability distribution of channel gains that have been obtained for one or more channels in the wireless communication system; and a processor coupled to the first access node, the processor identifies user or network behavior by performing steps comprising:
receiving the collected data at a management interface;
performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and
providing the policy to at least one access node within the plurality of access nodes to cause the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 2. The system according to claim 1 wherein the processor is a learn-ed resource manager (LRM). 3. The system according to claim 1 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 4. The system according to claim 3 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 5. The system according to claim 1 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 6. The system according to claim 1 wherein determining the policy comprises using the collected data to predict a set of transmission parameters. 7. The system according to claim 6 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 8. The system according to claim 1 wherein the processor determines the policy by using at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 9. The system according to claim 1 wherein the processor uses at least one of a Quality of Service (QoS) data and the collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 10. The system according to claim 1 wherein the processor discretizes the probability distribution of channel gains into observation intervals that correspond to different MCS parameters. 11. A method for improving quality of experience (QoE) with a wireless communication system, the method comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in the wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. 12. The method according to claim 11 wherein the step of performing an ergodic analysis is performed by a learn-ed resource manager. 13. The method according to claim 11 wherein the ergodic analysis is performed based on extracted consistent patterns within a channel along with collected feedback data. 14. The method according to claim 13 wherein the collected feedback data is provided from at least one of a user, a network operator, a consumer device, and network equipment or system. 15. The method according to claim 11 wherein the collected data comprises at least one of a geometric average channel gain, reference signal received power, reference signal received quality, interference data, and noise data. 16. The method according to claim 11 wherein the step of determining the policy comprises using the collected data to predict a set of transmission parameters. 17. The method of claim 16 wherein the set of transmission parameters comprises at least one of a modulation and coding-system (MCS) parameter, an energy parameter, a beamform parameter, a precoder parameter, a transmission's duration in symbol periods, a channel-frequency index, and a code-rate parameter. 18. The method according to claim 11 wherein the step of determining the policy uses at least one of an ergodic water filling method, an ergodic iterative water filling method, an ergodic spectrum management (ESM) Stage 1 iterative water filling, an ESM Stage 2 optimum spectrum balancing, an ESM Stage 2 orthogonal dimension division (ODD) method, an ESM Stage 3 method, a gradient descent method, and any other form of an iterative optimization method. 19. The method according to claim 11 wherein the step of determining the policy uses at least one of a Quality of Service (QoS) data and collected feedback data to estimate QoE parameters, the QoS data being related to line conditions. 20. A non-transitory computer-readable medium or media comprising one or more sequences of instructions which, when executed by at least one processor, causes steps to be performed comprising:
receiving collected data comprising a probability distribution of channel gains that have been obtained by one or more channels in a wireless communication system; performing an ergodic analysis such that consistent use patterns within the collected data are exploited to determine a policy that satisfies one or more constraints; and providing the policy to at least one access node within a plurality of access nodes within the wireless communication system, the policy causes the at least one access node to adapt one or more parameters to improve quality of experience (QoE) with the wireless communication system. | 2,900 |
344,534 | 16,803,919 | 2,924 | Systems and methods for enabling adjustments to an operating room schedule are disclosed. A system may include at least one processor configured to receive from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure. The processor may access a data structure containing information based on historical surgical data and analyze the visual data to determine an estimated completion time of the ongoing surgical procedure. The processor may access a schedule for the surgical operating room, including a scheduled time associated with completion of the ongoing surgical procedure and may calculate, based on the estimated completion time, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion. The processor may output a notification to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. | 1-100. (canceled) 101. A non-transitory computer readable medium containing instructions that, when executed by at least one processor, cause the at least one processor to execute a method for enabling adjustments of an operating room schedule, the method comprising:
receiving, from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; accessing a data structure containing information based on historical surgical data; analyzing the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; accessing a schedule for the surgical operating room including a scheduled time associated with completion of the ongoing surgical procedure; calculating, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and outputting a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 102. The non-transitory computer readable medium of claim 101, wherein the notification includes an updated operating room schedule. 103. The non-transitory computer readable medium of claim 101, wherein the updated operating room schedule enables a queued healthcare professional to prepare for a subsequent surgical procedure. 104. The non-transitory computer readable medium of claim 101, wherein the method further comprises electronically transmitting the notification to a device associated with a subsequent scheduled user of the surgical operating room. 105. The non-transitory computer readable medium of claim 101, wherein the method further comprises:
determining an extent of the variance from the scheduled time associated with the completion; in response to a first determined extent, outputting the notification; and in response to a second determined extent, forgoing outputting the notification. 106. The non-transitory computer readable medium of claim 101, wherein the method further comprises:
determining whether the expected time of completion is likely to result in a delay of at least a selected threshold amount of time from the scheduled time associated with the completion; in response to a determination that the expected time of completion is likely to result in a delay of at least the selected threshold amount of time, outputting the notification; and in response to a determination that the expected time of completion is not likely to result in a delay of at least the selected threshold amount of time, forgoing outputting the notification. 107. The non-transitory computer readable medium of claim 101, wherein the determining the estimated completion time is based on one or more stored characteristics associated with a healthcare professional conducting the ongoing surgical procedure. 108. The non-transitory computer readable medium of claim 101, further comprising updating a historical average time to completion based on determined actual time to complete the ongoing surgical procedure. 109. The non-transitory computer readable medium of claim 101, wherein the image sensor is positioned above a patient. 110. The non-transitory computer readable medium of claim 101, wherein the image sensor is positioned on a surgical tool. 111. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting a characteristic event in the received visual data, assessing the information based on historical surgical data to determine an expected time to complete the surgical procedure following an occurrence of the characteristic event in the historical surgical data, and determining the estimated completion time based on the determined expected time to complete. 112. The non-transitory computer readable medium of claim 111, wherein the method further comprises using historical visual data to train a machine learning model to detect the characteristic event. 113. The non-transitory computer readable medium of claim 101, wherein the method further comprises using historical visual data to train a machine learning model to estimate completion times, and wherein calculating the estimated completion time includes implementing the trained machine learning model trained. 114. The non-transitory computer readable medium of claim 101, wherein the method further comprises using average historical completion times to determine the estimated completion time. 115. The non-transitory computer readable medium of claim 101, wherein the method further comprises detecting a medical tool in the visual data, and wherein calculating the estimated completion time is based on the detected medical tool. 116. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting an anatomical structure in the visual data, and wherein calculating the estimated completion time is based on the detected anatomical structure. 117. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting an interaction between an anatomical structure and a medical tool in the visual data, and wherein calculating the estimated completion time is based on the detected interaction. 118. The non-transitory computer readable medium of claim 101, wherein analyzing further includes determining a skill level of a surgeon in the visual data, and wherein calculating the estimated completion time is based on the determined skill level. 119. A system for enabling adjustments to an operating room schedule, the system comprising:
at least one processor configured to: receive from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; access a data structure containing information based on historical surgical data; analyze the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; access a schedule for the surgical operating room, including a scheduled time associated with completion of the ongoing surgical procedure; calculate, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and output a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 120. A computer-implemented method for enabling adjustments to an operating room schedule, the method comprising:
receiving from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; accessing a data structure containing information based on historical surgical data; analyzing the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; accessing a schedule for the surgical operating room including a scheduled time associated with completion of the ongoing surgical procedure; calculating, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and outputting a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 121-282. (canceled) | Systems and methods for enabling adjustments to an operating room schedule are disclosed. A system may include at least one processor configured to receive from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure. The processor may access a data structure containing information based on historical surgical data and analyze the visual data to determine an estimated completion time of the ongoing surgical procedure. The processor may access a schedule for the surgical operating room, including a scheduled time associated with completion of the ongoing surgical procedure and may calculate, based on the estimated completion time, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion. The processor may output a notification to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly.1-100. (canceled) 101. A non-transitory computer readable medium containing instructions that, when executed by at least one processor, cause the at least one processor to execute a method for enabling adjustments of an operating room schedule, the method comprising:
receiving, from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; accessing a data structure containing information based on historical surgical data; analyzing the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; accessing a schedule for the surgical operating room including a scheduled time associated with completion of the ongoing surgical procedure; calculating, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and outputting a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 102. The non-transitory computer readable medium of claim 101, wherein the notification includes an updated operating room schedule. 103. The non-transitory computer readable medium of claim 101, wherein the updated operating room schedule enables a queued healthcare professional to prepare for a subsequent surgical procedure. 104. The non-transitory computer readable medium of claim 101, wherein the method further comprises electronically transmitting the notification to a device associated with a subsequent scheduled user of the surgical operating room. 105. The non-transitory computer readable medium of claim 101, wherein the method further comprises:
determining an extent of the variance from the scheduled time associated with the completion; in response to a first determined extent, outputting the notification; and in response to a second determined extent, forgoing outputting the notification. 106. The non-transitory computer readable medium of claim 101, wherein the method further comprises:
determining whether the expected time of completion is likely to result in a delay of at least a selected threshold amount of time from the scheduled time associated with the completion; in response to a determination that the expected time of completion is likely to result in a delay of at least the selected threshold amount of time, outputting the notification; and in response to a determination that the expected time of completion is not likely to result in a delay of at least the selected threshold amount of time, forgoing outputting the notification. 107. The non-transitory computer readable medium of claim 101, wherein the determining the estimated completion time is based on one or more stored characteristics associated with a healthcare professional conducting the ongoing surgical procedure. 108. The non-transitory computer readable medium of claim 101, further comprising updating a historical average time to completion based on determined actual time to complete the ongoing surgical procedure. 109. The non-transitory computer readable medium of claim 101, wherein the image sensor is positioned above a patient. 110. The non-transitory computer readable medium of claim 101, wherein the image sensor is positioned on a surgical tool. 111. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting a characteristic event in the received visual data, assessing the information based on historical surgical data to determine an expected time to complete the surgical procedure following an occurrence of the characteristic event in the historical surgical data, and determining the estimated completion time based on the determined expected time to complete. 112. The non-transitory computer readable medium of claim 111, wherein the method further comprises using historical visual data to train a machine learning model to detect the characteristic event. 113. The non-transitory computer readable medium of claim 101, wherein the method further comprises using historical visual data to train a machine learning model to estimate completion times, and wherein calculating the estimated completion time includes implementing the trained machine learning model trained. 114. The non-transitory computer readable medium of claim 101, wherein the method further comprises using average historical completion times to determine the estimated completion time. 115. The non-transitory computer readable medium of claim 101, wherein the method further comprises detecting a medical tool in the visual data, and wherein calculating the estimated completion time is based on the detected medical tool. 116. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting an anatomical structure in the visual data, and wherein calculating the estimated completion time is based on the detected anatomical structure. 117. The non-transitory computer readable medium of claim 101, wherein analyzing further includes detecting an interaction between an anatomical structure and a medical tool in the visual data, and wherein calculating the estimated completion time is based on the detected interaction. 118. The non-transitory computer readable medium of claim 101, wherein analyzing further includes determining a skill level of a surgeon in the visual data, and wherein calculating the estimated completion time is based on the determined skill level. 119. A system for enabling adjustments to an operating room schedule, the system comprising:
at least one processor configured to: receive from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; access a data structure containing information based on historical surgical data; analyze the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; access a schedule for the surgical operating room, including a scheduled time associated with completion of the ongoing surgical procedure; calculate, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and output a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 120. A computer-implemented method for enabling adjustments to an operating room schedule, the method comprising:
receiving from an image sensor positioned in a surgical operating room, visual data tracking an ongoing surgical procedure; accessing a data structure containing information based on historical surgical data; analyzing the visual data of the ongoing surgical procedure using the data structure to determine an estimated completion time of the ongoing surgical procedure; accessing a schedule for the surgical operating room including a scheduled time associated with completion of the ongoing surgical procedure; calculating, based on the estimated completion time of the ongoing surgical procedure, whether an expected time of completion is likely to result in variance from the scheduled time associated with the completion; and outputting a notification upon calculation of the variance, to thereby enable subsequent users of the surgical operating room to adjust their schedules accordingly. 121-282. (canceled) | 2,900 |
344,535 | 16,803,994 | 2,641 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,600 |
344,536 | 29,725,773 | 2,641 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,600 |
344,537 | 29,725,824 | 2,914 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,538 | 29,725,808 | 2,914 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,539 | 29,725,819 | 2,914 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,540 | 29,725,832 | 2,911 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,541 | 29,725,827 | 2,911 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,542 | 29,725,810 | 2,911 | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor. | 1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | A method comprises receiving an area of interest (AOI) selection. The method further comprises accessing an AOI device location data for the AOI, the AOI device location data indicating locations of devices over time received within the AOI. The AOI device location data is filtered to only include the device location data that match one or more characteristics. A proximity zone is determined for the for the AOI that includes the area of the AOI. A zone device location data for the proximity zone is determined, which indicates locations of devices over time reported within the proximity zone. The method further comprises normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate, and transmitting the AOI user estimate to a client device of a requestor.1. A method, comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area; accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI; filtering the AOI device location data to only include device location data that match one or more first characteristics; determining a proximity zone for the AOI, the proximity zone being a superset of the AOI; accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone; filtering the proximity zone device location data to only include device location data that matches one or more second characteristics; normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 2. The method of claim 1, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 3. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 4. The method of claim 1, wherein filtering the AOI device location data further comprises:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 5. The method of claim 1, wherein the determining the proximity zone comprises:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 6. The method of claim 1, wherein the determining the proximity zone comprises:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 7. The method of claim 1, wherein the normalizing the filtered AOI device location data comprises:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 8. The method of claim 1, further comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 9. The method of claim 1, further comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 10. The method of claim 1, further comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. 11. A system, comprising:
a processor; a non-transitory computer readable storage medium, storing instructions, that when executed by the processor, cause the processor to perform operations comprising:
receiving an area of interest (AOI) selection, the selection indicating a geographic area;
accessing an AOI device location data for the AOI, the AOI device location data indicating locations of one or more devices over time received within the AOI;
filtering the AOI device location data to only include device location data that match one or more first characteristics;
determining a proximity zone for the AOI, the proximity zone being a superset of the AOI;
accessing a zone device location data for the proximity zone, the zone device location data indicating locations of one or more devices over time reported within the proximity zone;
filtering the proximity zone device location data to only include device location data that matches one or more second characteristics;
normalizing the filtered AOI device location data by computing a ratio of the filtered AOI device location data and the zone device location data to generate an AOI user estimate; and
transmitting the AOI user estimate to a client device of a requestor to cause the AOI user estimate for display in a graphical user interface (GUI) on a screen associated with the client device of the requestor. 12. The system of claim 11, wherein the selection of the AOI is indicated using a closed polygonal boundary, the closed polygonal boundary specified using geographic coordinates; 13. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI during a specific time period. 14. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
filtering the AOI device location data to only include device location data of devices that are at the AOI for a range of dwell times. 15. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
selecting a region having a center matching that of the AOI, the region having each dimension exceeding 100 kilometers. 16. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a home location of devices of the AOI device location data; and determining the proximity zone to include regions having the home locations of the devices of the AOI device location data which are within a predetermined threshold distance from the AOI. 17. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
computing the ratio of a number of device reported in the filtered AOI device location data and the zone device location data; and determining as the AOI user estimate a number of users in the proximity zone as indicated by demographic data modified by the computed ratio. 18. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining, using historical AOI user estimates, a prediction interval for the AOI user estimates in the historical AOI user estimates for a plurality of repeating time periods; determining a selected repeating time period in which the current time period belongs; determining whether a current AOI user estimate exceeds the prediction interval to a specified degree for the historical AOI user estimate for the selected repeating time period; transmitting, in response to the current AOI user estimate exceeding the percentile range for the historical AOI user estimate for the selected repeating time period, a message to the client device of the requestor to cause an alert to be displayed at the GUI of the client device of the requestor. 19. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a relative difference between the AOI user estimate and a AOI user estimate of one or more alternate AOIs that share a same category type as the AOI; and transmitting a message to the requester's client device to cause the relative difference displayed within the GUI of the requestor's client device. 20. The system of claim 11, wherein the non-transitory computer readable storage medium stores further instructions, that when executed by the processor, cause the processor to perform operations comprising:
determining a number of re-visits of devices based on the filtered AOI device location data, a re-visit being a device in the filtered AOI device location data with a device location history that has a location that is within the AOI during more than one non-consecutive time period; and transmitting a message to the requester's client device to cause the number of re-visits to be displayed within the GUI of the requestor's client device. | 2,900 |
344,543 | 16,873,231 | 2,911 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,544 | 29,725,831 | 2,912 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,545 | 29,725,834 | 2,912 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,546 | 29,725,846 | 2,913 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,547 | 29,725,851 | 2,924 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,548 | 29,725,822 | 2,924 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,549 | 29,725,820 | 2,924 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,550 | 29,725,842 | 2,924 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,551 | 29,725,840 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,552 | 29,725,830 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,553 | 29,725,835 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,554 | 29,725,839 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,555 | 29,725,865 | 2,912 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,556 | 29,725,841 | 2,912 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,557 | 29,725,856 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,558 | 29,725,794 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,559 | 29,725,772 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,560 | 29,725,864 | 2,916 | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin. | 1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | A new and distinct kiwi variety of Actinidia chinensis Planchon named ‘RED GOAL’, particularly characterized by distinctive size of fruit, late time of maturity for harvesting, and long cold storage life. Other desirable characteristics include fruits with red pulp and green/brown, almost hairless skin.1. A new and distinct variety of kiwi (Actinidia chinensis Planchon) named ‘RED GOAL’, as illustrated and described herein. | 2,900 |
344,561 | 16,803,973 | 2,916 | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state. | 1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state.1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | 2,900 |
344,562 | 29,725,821 | 2,916 | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state. | 1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state.1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | 2,900 |
344,563 | 29,725,799 | 2,916 | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state. | 1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state.1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | 2,900 |
344,564 | 29,725,805 | 2,916 | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state. | 1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | Techniques for adjusting user experiences for participants of a multiuser session by deploying vocal-characteristic models to analyze audio streams received in association with the participants. The vocal-characteristic models are used to identify emotional state indicators corresponding to certain vocal properties being exhibited by individual participants. Based on the identified emotional state indicators, probability scores are generated indicating a likelihood that individual participants are experiencing a predefined emotional state. For example, a specific participant's voice may be continuously received and analyzed using a vocal-characteristic model designed to detect vocal properties are consistent with a predefined emotional state. Probability scores may be generated based on how strongly the detected vocal properties correlate with the vocal-characteristic model. Responsive to the probability score that results from the vocal-characteristic model exceeding a threshold score, some remedial action may be performed with respect to the specific participant that is experiencing the predefined emotional state.1. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that is generated in association with a multiuser session, wherein the audio data includes at least a first audio stream that corresponds to a first user and a second audio stream that corresponds to a second user;
analyze, during the multiuser session, the first audio stream to identify emotional state indicators that correspond to one or more vocal properties being exhibited by the first user;
generate, based on the emotional state indicators, a probability score that is associated with the first user being in a predetermined emotional state; and
responsive to the probability score exceeding a threshold score, perform a predetermined remedial action with respect to the second user during the multiuser session. 2. The system of claim 1, wherein the emotional state indicators are first emotional state indicators and the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to identify second emotional state indicators that correspond to one or more other vocal properties being exhibited by the second user, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second emotional state indicators. 3. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to analyze, during the multiuser session, the second audio stream to determine that the second user has used a predetermined word or phrase during the multiuser session, and wherein generating the probability score associated with the first user being in the predetermined emotional state is further based on the second user having used the predetermined word or phrase during the multiuser session. 4. The system of claim 1, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the second user based on historical data associated with the second user, wherein performing the predetermined remedial action with respect to the second user is responsive to the probability score exceeding the threshold score is further based on the reputation score. 5. The system of claim 4, wherein the reputation score for the second user is determined based on at least one of: a number of complaints associated with the second user, a number of other users that have blocked the second user, or a number of previous enforcement events that been performed with respect to the second user. 6. The system of claim 1, wherein the predetermined remedial action, that is performed responsive to the probability score associated with the first user being in the predetermined emotional state exceeding the threshold score, includes preventing the second audio stream from being played at a client device of the first user. 7. The system of claim 1, wherein generating the probability score that is associated with the first user being in the predetermined emotional state includes analyzing the emotional state indicators in relation to a plurality of vocal-characteristic models that correspond to a plurality of emotional states. 8. A system comprising:
one or more processing units; and a computer-readable medium having encoded thereon computer-executable instructions to configure the one or more processing units to:
receive audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session;
obtain a plurality of vocal-characteristic models that correspond to a plurality of predefined emotional states;
analyze, during the multiuser session, an individual audio stream based on individual vocal-characteristic models of the plurality of vocal-characteristic models to determine a plurality of probability scores associated with an individual user being in one or more predefined emotional states; and
perform, during the multiuser session, a remedial action that is determined based on a comparison of at least one probability score to a threshold score. 9. The system of claim 8, wherein the plurality of probability scores include:
a first probability score associated with the individual user being in a first predefined emotional state, and a second probability score associated with the individual user being in a second predefined emotional state. 10. The system of claim 9, wherein performing the remedial action is based on the first probability score combined with the second probability score exceeding the threshold score. 11. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to determine a reputation score for the individual user based on historical data associated with the individual user, wherein analyzing the individual audio stream based on at least some of the individual vocal-characteristic models is based on the reputation score. 12. The system of claim 11, wherein the threshold score is determined based on at least one of: an average age of the plurality of users, a minimum age of the plurality of users, a maximum age difference between an oldest participant a youngest participant, or user profile data associated with one or more of the plurality of users. 13. The system of claim 8, wherein the computer-executable instructions further configure the one or more processing units to:
obtain a neutral speech profile that corresponds to the individual user; and identify deviations from the neutral speech profile within the individual audio stream. 14. The system of claim 8, wherein at least some of the individual vocal-characteristic models are natural-language agnostic. 15. The system of claim 8, wherein the individual vocal-characteristic models, of the plurality of vocal-characteristic models, correspond to individual predefined emotional states of the plurality of predefined emotional states. 16. A computer-implemented method, comprising:
receiving audio data that includes a plurality of audio streams corresponding to a plurality of users that are participating in a multiuser session; obtaining a user profile associated with a particular user of the plurality of users that are participating in a multiuser session; obtaining a rule set that defines one or more conditions for analyzing individual audio streams based on a vocal-characteristic model during the multiuser session; analyzing, during the multiuser session, a particular audio stream associated with the particular user based on a vocal-characteristic model, in response to the user profile associated with the particular user satisfying the one or more conditions; and performing a remedial action in response to a probability score resulting from analyzing the particular audio stream based on a vocal-characteristic model exceeding a threshold score. 17. The computer-implemented method of claim 16, further comprising:
determining that the user profile associated with the particular user satisfies the one or more conditions based on a reputation score that is defined within the user profile. 18. The computer-implemented method of claim 17, wherein the reputation score for the particular user is determined based on at least one of: a number of complaints defined within the user profile, a number of users that have blocked the particular user, or a number of previous enforcement events defined within the user profile. 19. The computer-implemented method of claim 16, wherein the remedial action includes at least one of: muting the audio stream of the particular user with respect to one or more other users of multiuser session, or terminating a user experience of the particular user for the multiuser session. 20. The computer-implemented method of claim 16, further comprising:
obtaining a neutral speech profile that corresponds to the particular user; and generating the probability score based at least in part on deviations from the neutral speech profile within the particular audio stream. | 2,900 |
344,565 | 16,873,661 | 2,916 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,566 | 29,725,775 | 2,916 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,567 | 29,725,800 | 2,916 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,568 | 29,725,793 | 2,916 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,569 | 29,725,813 | 2,912 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,570 | 29,725,768 | 2,912 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,571 | 29,725,783 | 2,923 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,572 | 29,725,806 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,573 | 29,725,870 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,574 | 29,725,869 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,575 | 29,725,867 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,576 | 29,725,791 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,577 | 29,725,789 | 2,913 | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications. | 1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | A new and distinct horseradish (Armoracia rusticana) named K-62 is disclosed, characterized by and distinguished from prior commercial horseradish varieties by increased activity of horseradish peroxidase (HRP). Plants have been clonally propagated by root division and shown to retain the increased HRP activity, which can be used, among other things, in molecular biology applications.1. A new and distinct variety of horseradish plant, substantially as illustrated and describe herein. | 2,900 |
344,578 | 16,803,955 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,579 | 29,725,854 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,580 | 29,725,826 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,581 | 29,725,871 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,582 | 29,725,873 | 2,921 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,583 | 29,725,837 | 2,921 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,584 | 29,725,850 | 2,921 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,585 | 29,725,858 | 2,921 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,586 | 29,725,879 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,587 | 29,725,883 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,588 | 29,725,890 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,589 | 29,725,860 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,590 | 29,725,852 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,591 | 29,725,797 | 2,913 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,592 | 29,725,844 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,593 | 29,725,811 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,594 | 29,725,823 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,595 | 29,725,838 | 2,916 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,596 | 29,725,888 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,597 | 29,725,816 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,598 | 29,725,812 | 2,914 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
344,599 | 29,725,833 | 2,912 | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client. | 1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | Computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems for blockchain-based service source tracing are provided. A blockchain stores service certificates of multiple service dimensions which constitute multiple service certificate linked lists. A service system maintains a mapping relationship between a last node of each service certificate linked list and a service index of a service dimension that each service certificate linked list belongs to. In response to a client-initiated service source tracing request for a target service dimension that includes a service index of the target service dimension, the mapping relationship is queried to determine the last node corresponding to the service index of the target service dimension. A service certificate of the target service dimension stored on the blockchain is queried based on a linked list pointer recorded in the last node. The identified service certificate is returned to the client.1. A computer-implemented method for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 2. The computer-implemented method according to claim 1, further comprising:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 3. The computer-implemented method according to claim 1, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 4. The computer-implemented method according to claim 3, wherein at least one of the linked list pointers is a hash pointer. 5. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 6. The computer-implemented method according to claim 1, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 7. The computer-implemented method according to claim 6, wherein the first-type service certificate linked list is a linked list comprising a billing certificate, a payment certificate, a write-off certificate, and a settlement certificate of a same payment agency collection service in an order of service stages of the same payment agency collection service. 8. The computer-implemented method according to claim 6, wherein the second-type service certificate linked list comprises one of:
a plurality of billing certificates in an order of billing occurrences; a plurality of payment certificates in an order of payment occurrences; a plurality of write-off certificates in an order of write-off occurrences; or a plurality of settlement certificates in an order of settlement occurrences. 9. The computer-implemented method according to claim 1, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 10. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations for blockchain-based service source tracing, comprising:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension; in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension; querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and returning, by the service system, the service certificate of the target service dimension to the client. 11. The non-transitory, computer-readable medium according to claim 10, further comprising one or more instructions for:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 12. The non-transitory, computer-readable medium according to claim 10, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 13. The non-transitory, computer-readable medium according to claim 12, wherein at least one of the linked list pointers is a hash pointer. 14. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists is a one-way linked list. 15. The non-transitory, computer-readable medium according to claim 10, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. 16. The non-transitory, computer-readable medium according to claim 10, wherein:
the blockchain comprises a consortium blockchain comprising a payment institution and a payment platform; a service of the service system comprises a payment agency collection service provided by the payment platform for the payment institution; and the service certificates comprise a payment bill, a payment certificate, a write-off certificate, a settlement certificate, and a refund certificate. 17. A computer-implemented system for blockchain-based service source tracing, 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:
receiving, by a service system, a service source tracing request from a client for a target service dimension of a plurality of service dimensions, wherein service certificates of the plurality of service dimensions are stored on a blockchain, the service certificates of the plurality of service dimensions form a plurality of service certificate linked lists, and the service system maintains a mapping relationship between a last node of each of the plurality of service certificate linked lists and a corresponding service index of a service dimension that each of the plurality of service certificate linked lists belongs to, wherein the service source tracing request comprises a service index of the target service dimension;
in response to the service source tracing request, querying, by the service system, the mapping relationship to determine a last node corresponding to the service index of the target service dimension;
querying, by the service system, a service certificate of the target service dimension stored on the blockchain based on a linked list pointer recorded in the last node; and
returning, by the service system, the service certificate of the target service dimension to the client. 18. The computer-implemented system according to claim 17, wherein the operations further comprise:
monitoring the service certificate of the target service dimension stored on the blockchain; in response to detecting that the blockchain stores a target service certificate of a newly added node in a target service certificate linked list corresponding to the target service dimension, updating the service index of the target service dimension from an unlocked state to a locked state, and updating the last node of the target service certificate linked list into the target service certificate; and after the last node of the target service certificate linked list is updated into the target service certificate, updating the service certificate of the target service dimension from a locked state to an unlocked state. 19. The computer-implemented system according to claim 17, wherein:
the service certificate of the target service dimension comprises a plurality of pointer fields, and the plurality of pointer fields correspond to different service dimensions, respectively; the plurality of pointer fields comprise linked list pointers; and the service certificates of the plurality of service dimensions stored on the blockchain form the plurality of service certificate linked lists based on the linked list pointers in the plurality of pointer fields of the service certificates. 20. The computer-implemented system according to claim 17, wherein at least one of the plurality of the service certificate linked lists comprises:
a first-type service certificate linked list comprising service certificates of a same service at different service stages stored on the blockchain in an order of service stages; or a second-type service certificate linked list comprising service certificates of plurality of services stored on the blockchain in an order of service occurrences. | 2,900 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.