An application processor receives first and safety state information from first and second microcontrollers, and respective first and second sets of bytes forming a first identifier of the first microcontroller and a second identifier of the second microcontroller. The processor concatenates a safety message including the first and second safety state information, the safety message including the first set of bytes and the second set of bytes. The processor transmits the safety message to a second application processor of a safety controller, which separates, the first set of bytes and the second set of bytes, compares at least one of the first set of bytes and the second set of bytes to a data structure of known microcontroller identifiers, and verifies the safety state information based on identifying a match.

In a malware detection device, first characters in a network traffic flow are compared with a plurality of entries within a ternary content addressable memory (TCAM), the plurality of entries including a first entry that constitutes a first segment of a malware signature. In response to an output from the first TCAM indicating that the first characters match the first entry, a variable-character expression engine determines whether second characters in the network traffic flow match a first variable-length regular expression, the variable-length regular expression corresponding to a second segment of the malware signature. A comparand value is generated that includes third characters in the network traffic flow and an expression-match value that indicates whether the second characters match the first variable-length regular expression. The TCAM compares the first comparand value with the plurality of entries therein as part of a determination whether the network traffic flow contains the malware signature.

In a malware detection device, first characters in a network traffic flow are compared with a plurality of entries within a ternary content addressable memory (TCAM), the plurality of entries including a first entry that constitutes a first segment of a malware signature. In response to an output from the first TCAM indicating that the first characters match the first entry, a variable-character expression engine determines whether second characters in the network traffic flow match a first variable-length regular expression, the variable-length regular expression corresponding to a second segment of the malware signature. A comparand value is generated that includes third characters in the network traffic flow and an expression-match value that indicates whether the second characters match the first variable-length regular expression. The TCAM compares the first comparand value with the plurality of entries therein as part of a determination whether the network traffic flow contains the malware signature.

A computer system for dynamic adaptation of a user interface according to data store mining includes a data store configured to index event data of a plurality of events. A data analyst device is configured to render the user interface to a data analyst and transmit a message that identifies a selected identifier of the plurality of identifiers. A data processing circuit is configured to train a machine learning model based on event data stored by the data store for a first set of identifiers from within a predetermined epoch. An interface circuit determines an interface metric for the selected identifier based on the determined output of the selected identifier and transmits the interface metric to the data analyst device. The data analyst device is configured to, in response to the interface metric from the interface circuit, selectively perform a modification or removal of a second user interface element.

Disclosed are various embodiments for identifying and sourcing relevant and recently added or otherwise cold-sourced supplemental content (e.g., advertisements, sponsored item listings, etc.) for consideration to be presented to a user interacting with an electronic commerce system. Supplemental content that is identified as being recently added or cold-sourced is mapped to or otherwise associated with one or more search queries that are determined to correspond to a given item category. When a user interacting with a user interface enters a search query that matches a previously received search query, the supplemental content that has been mapped to the previously received search query is selected and/or otherwise sourced for consideration to be presented in a user interface including the search results.

A data normalization system receives a first string and a second string that are ordered according to an initial string ordering. The data normalization system analyzes, the first string and the second string based on a list of known character sets included in surnames, yielding an analysis, and determines, based on the analysis, that a set of characters in the second string matches a known character set included in the list of known character sets included in surnames. In response to determining that the set of characters in the second string matches a known character set included in the list of known character sets included in surname, the data normalization system orders the first string and the second string according to an updated string ordering.

Transformation rule generation and validation functionality is provided herein. Transformation rules can be generated for one or more mappings in an alignment between a source database and a target database. The transformation rules can transform instance data from the source data model to a form matching the target data model. One or more transformation rules can be generated for a mapping between fields in a source database and a field in a target database. The transformation rules can be generated based on one or more source fields and a target field of a mapping, and one or more identified functions. Evaluating the transformation rules can include generating test data based on the transformation rules applied to instance data from the source database. The test data can be evaluated against instance data from the target database. The transformation rules and the evaluation results can be provided in a user interface.

Various embodiments relate to a method for masked decoding of a polynomial a using an arithmetic sharing a to perform a cryptographic operation in a data processing system using a modulus q, the method for use in a processor of the data processing system, including: subtracting an offset δ from each coefficient of the polynomial a; applying an arithmetic to Boolean (A2B) function on the arithmetic shares of each coefficient a.sub.i of the polynomial a to produce Boolean shares â.sub.i that encode the same secret value a.sub.i; and performing in parallel for all coefficients a shared binary search to determine which of coefficients a.sub.i are greater than a threshold t to produce a Boolean sharing value {circumflex over (b)} of the bitstring b where each bit of b decodes a coefficient of the polynomial a.

Various embodiments relate to a method for masked decoding of a polynomial a using an arithmetic sharing a to perform a cryptographic operation in a data processing system using a modulus q, the method for use in a processor of the data processing system, including: subtracting an offset δ from each coefficient of the polynomial a; applying an arithmetic to Boolean (A2B) function on the arithmetic shares of each coefficient a.sub.i of the polynomial a to produce Boolean shares â.sub.i that encode the same secret value a.sub.i; and performing in parallel for all coefficients a shared binary search to determine which of coefficients a.sub.i are greater than a threshold t to produce a Boolean sharing value {circumflex over (b)} of the bitstring b where each bit of b decodes a coefficient of the polynomial a.

The present disclosure advantageously provides a modulo operation unit that includes a first input configured to receive operand data, a second input configured to receive modulus data, an initial modulo stage, a sequence of intermediate modulo stages, and a final modulo stage.