Detecting Data Corruption in Medical Binary Decision Diagrams Using Hashing Techniques
First Claim
Patent Images
1. A method comprising:
- receiving, from a first computing device and at a second computing device,a first hash code, wherein the first hash code is determined by applying a hashing scheme to a first instance of a binary decision diagram (BDD) at the first computing device and the BDD represents sensor data from one or more sensors; and
a second instance of the BDD;
determining, by the second computing device, a second hash code by applying the hashing scheme to the second instance of the BDD;
if the second hash code equals the first hash code, then indicating, by the second computing device, that the second instance of the BDD is valid; and
if the second hash code does not equal the first hash code, then indicating, by the second computing device, that the second instance of the BDD is invalid.
1 Assignment
0 Petitions
Accused Products
Abstract
In particular embodiments, a method includes receiving from a remote system a binary decision diagram (BDD) representing data streams from sensors, an input, and a first hash code, transforming the received BDD to a second arithmetic function by performing the arithmetic transformation on the received BDD, calculating a second hash code from the second arithmetic function and the input, and if the first hash code equals the second hash code, then indicating that the received BDD is uncorrupted data, else indicating that the received BDD is corrupted data.
-
Citations
55 Claims
-
1. A method comprising:
-
receiving, from a first computing device and at a second computing device, a first hash code, wherein the first hash code is determined by applying a hashing scheme to a first instance of a binary decision diagram (BDD) at the first computing device and the BDD represents sensor data from one or more sensors; and a second instance of the BDD; determining, by the second computing device, a second hash code by applying the hashing scheme to the second instance of the BDD; if the second hash code equals the first hash code, then indicating, by the second computing device, that the second instance of the BDD is valid; and if the second hash code does not equal the first hash code, then indicating, by the second computing device, that the second instance of the BDD is invalid. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
- one or more processors; and
a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;receive, from a first computing device, a first hash code, wherein the first hash code is determined by applying a hashing scheme to a first instance of a binary decision diagram (BDD) at the first computing device and the BDD represents sensor data from one or more sensors; and a second instance of the BDD; determine a second hash code by applying the hashing scheme to the second instance of the BDD; if the second hash code equals the first hash code, then indicate that the second instance of the BDD is valid; and if the second hash code does not equal the first hash code, then indicate that the second instance of the BDD is invalid. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36)
- one or more processors; and
-
37. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
-
receive, from a first computing device and at a second computing device, a first hash code, wherein the first hash code is determined by applying a hashing scheme to a first instance of a binary decision diagram (BDD) at the first computing device and the BDD represents sensor data from one or more sensors; and a second instance of the BDD; determine, by the second computing device, a second hash code by applying the hashing scheme to the second instance of the BDD; if the second hash code equals the first hash code, then indicate, by the second computing device, that the second instance of the BDD is valid; and if the second hash code does not equal the first hash code, then indicate, by the second computing device, that the second instance of the BDD is invalid. - View Dependent Claims (38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54)
-
-
55. A system comprising:
-
means for receiving, from a first computing device and at a second computing device, a first hash code, wherein the first hash code is determined by applying a hashing scheme to a first instance of a binary decision diagram (BDD) at the first computing device and the BDD represents sensor data from one or more sensors; and a second instance of the BDD; means for determining, by the second computing device, a second hash code by applying the hashing scheme to the second instance of the BDD; means for, if the second hash code equals the first hash code, then indicating, by the second computing device, that the second instance of the BDD is valid; and means for, if the second hash code does not equal the first hash code, then indicating, by the second computing device, that the second instance of the BDD is invalid.
-
Specification