Abstract: A schema matching system processes training event data received from multiple sources to determine correspondence rules associating fields in the schemas of each source. To generate the correspondence rules, the schema matching system can use training event data from multiple sources comprising events associated with multiple schemas. Then, based on one or more similarity metrics between data entries of the training event data, the system matches individual events using a machine learning algorithm and, based on the pairs of matching events, corresponding schema fields across the multiple schemas. Based on the matching events and/or user feedback, the schema matching system can generate one or more correspondence rules based on the normalization rules and the corresponding fields of the schemas for later use by one or more transaction monitoring systems on incoming event data.

Abstract: When a user of an interface system defines a workflow, the interface system transmits a notification to a user that is to perform the first step of the workflow. When the user requests to initiate the step of the workflow, the interface system creates a transaction for the workflow step. The user signs the transaction using a cryptographic key pair. The interface system receives the signed transaction and verifies the signature. Once the signature is verified, the step can be performed. The interface system forwards the transaction to a data storage system for storing. For performing the next step in the workflow, the data storage system identifies the user that is to perform the next workflow step. The data storage system creates a notification that identifies the user and the notification is provided to the user. The process repeats until each step of the workflow is performed.

Abstract: In processing a transaction, a data storage system of a processing system stores and updates a progression created for the transaction that represents a timeline of events that occurred related to the transaction. A progression for a transaction that is processed across multiple processing systems is organized as a chronological chain of segments. Each segment in the progression includes records for events processed by a given processing system prior to the transaction reaching an intermediate state or a terminal state. When the transaction reaches a terminal state, the segmented progression includes records associated with all of the events that occurred in relation to the transaction across multiple processing systems. A segment in the progression is cryptographically linked to a previous segment in the progression using a linking object that includes a transaction signature of the last record stored in the previous segment.

Abstract: A data structure includes data that allows specific users to access data items that are part of the data structure and allows the users to store data items in association with the data structure. The data structure includes a root node which is the genesis of the data structure. The data structure further includes an access node for each user granted access rights to the data structure. An access node granting a user access rights to the data structure is directly connected to the root node. For a user whose access rights to the data structure are revoked, the data structure includes an additional access node directly connected to the access node that gave the user access rights. The data structure also includes a record node for each data item that is part of the data structure. Each record node is connected to the root node directly or indirectly.

Abstract: A data integrity system generates a transaction signature associated with a transaction based on transaction data received from a data producer. The transaction signature is unique to the transaction and is generated by applying a hash function to the transaction data. When the transaction data is to be transmitted to a data consumer, the data integrity system redacts the transaction data based on permission information associated with the data consumer and transmits the redacted transaction data to the data consumer. To enable the data consumer to verify the integrity of the received data, the data integrity system also transmits a cryptographic assurance that includes at least the transaction signature associated with the transaction. The data consumer verifies the integrity of the received data by independently generating a transaction signature based on the redacted transaction data and matching the independently generated signature with the transaction signature in the cryptographic assurance.

Abstract: A data storage system creates a data signature for a data element that is to be stored by hashing the data element. The data storage system also creates a sequence signature for the data element and stores the sequence signature in a signature database. The sequence signature is created using the data signature of the data element and the previous sequence signature stored in the signature database. The data storage system transmits a copy of the sequence signature to an anchor system. The anchor system stores the copy as an export anchor and creates an import anchor based on the export anchor and information associated with the present time. The anchor system stores the import anchor and transmits a copy to the data storage system. An audit system uses the export anchor and import anchor to determine whether data stored by the data storage system has been modified.

Abstract: An electronic apparatus comprises several series-connected loads powered by a high voltage power source. To provide voltage regulation for each load, a ladder circuit is described. To automatically balance the voltage at output, one or more voltage-control-oscillators are included.

Abstract: Technology, implemented in digital hardware, software, or combination thereof, for completing Secure Hash Algorithm (SHA-2) computation with generating one new hash value at each clock cycle is described. The technology includes: using synchronous logic to store the computed values every alternate clock and combinational logic to process multiple rounds of SHA in each clock; completing hash calculation in unrolled modes; using efficient adders for most 32-bit adders to improve performance.