Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
US-2024419761-A1 · Dec 19, 2024 · US
US9377995B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9377995-B2 |
| Application number | US-201313866383-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 19, 2013 |
| Priority date | Apr 20, 2012 |
| Publication date | Jun 28, 2016 |
| Grant date | Jun 28, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
An apparatus for comparing event data sets. A system and computer program for comparing event data sets comprising: calculating one or more derivatives for each event in a first and second set of events; classifying each event by the calculated derivatives; and evaluating a similarity of the first and second sets of events based on the classifications of the respective events.
Opening claim text (preview).
The invention claimed is: 1. A system for comparing event data sets comprising: a calculating engine for calculating one or more derivatives for each event in a first and second set of events; a classifying engine for classifying each event by respective calculated derivatives; and a correlating engine for correlating first and second sets of events based on the classifications of the respective events, wherein each derivative is classified as a negative, zero or positive value and each event is classified according to a combination of negative, zero and positive values of the derivatives. 2. A system as claimed in claim 1 , wherein a first derivative is approximated as a distance between two consecutive events divided by a difference of their time stamps. 3. A system as claimed in claim 2 , wherein a second derivative is approximated as a distance between two consecutive first derivatives divided by the difference of the time stamps. 4. A system as claimed in claim 3 , wherein a third derivative is approximated as a distance between two consecutive second derivatives divided by the difference of the time stamps. 5. A system as claimed in claim 2 , wherein the difference in timestamps is a unit value. 6. A system as claimed in claim 2 , further comprising a first derivative noise level as a fraction of a maximum derivative value whereby if the first derivative is between the absolute first derivative noise level then the first derivative is taken as neutral. 7. A system as claimed in claim 2 , further comprising a smoothing engine for smoothing the metrics to reduce noise. 8. A computer program product for comparing event data sets comprising, the computer program product comprising a non-transitory computer readable storage device readable by a processing circuit and storing instructions for execution by the processing circuit for performing steps of: calculating one or more derivatives for each event in a first and second set of events; classifying each event by respective calculated derivatives; and correlating first and second sets of events based on the classifications of the respective events, wherein each derivative is classified as a negative, zero or positive value and each event is classified according to a combination of negative, zero and positive values of the derivatives. 9. A computer program product as claimed in claim 8 , wherein a first derivative is approximated as a distance between two consecutive events. 10. A computer program product as claimed in claim 8 , wherein a first derivative is approximated as a distance between two consecutive events divided by a difference of their time stamps. 11. A computer program stored on a non-transitory computer readable device and loadable into the internal memory of a digital computer, comprising software code portions, when said program is run on a computer, for performing the steps of: calculating one or more derivatives for each event in a first and second set of events; classifying each event by respective calculated derivatives; and correlating first and second sets of events based on the classifications of the respective events, wherein each derivative is classified as a negative, zero or positive value and each event is classified according to a combination of negative, zero and positive values of the derivatives. 12. A computer program as claimed in claim 11 , wherein a first derivative is approximated as a distance between two consecutive events. 13. A computer program as claimed in claim 11 , wherein a first derivative is approximated as a distance between two consecutive events divided by a difference of their time stamps.
Feature extraction · CPC title
Apparatus for measuring unknown time intervals by means not provided for in groups G04F5/00 - G04F10/00 · CPC title
for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} · CPC title
Comparing digital values (G06F7/06, {G06F7/22,} G06F7/38 take precedence) · CPC title
Complex mathematical operations {(function generation by table look-up G06F1/03; evaluation of elementary functions by calculation G06F7/544)} · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.