In one embodiment, an apparatus includes a hardware accelerator to execute cryptography operations including a Rivest Shamir Adleman (RSA) operation and an elliptic curve cryptography (ECC) operation. The hardware accelerator may include a multiplier circuit comprising a parallel combinatorial multiplier, and an ECC circuit coupled to the multiplier circuit to execute the ECC operation. The ECC circuit may compute a prime field multiplication using the multiplier circuit and reduce a result of the prime field multiplication in a plurality of addition and subtraction operations for a first type of prime modulus. The hardware accelerator may execute the RSA operation using the multiplier circuit. Other embodiments are described and claimed.

In one embodiment, an apparatus includes a hardware accelerator to execute cryptography operations including a Rivest Shamir Adleman (RSA) operation and an elliptic curve cryptography (ECC) operation. The hardware accelerator may include a multiplier circuit comprising a parallel combinatorial multiplier, and an ECC circuit coupled to the multiplier circuit to execute the ECC operation. The ECC circuit may compute a prime field multiplication using the multiplier circuit and reduce a result of the prime field multiplication in a plurality of addition and subtraction operations for a first type of prime modulus. The hardware accelerator may execute the RSA operation using the multiplier circuit. Other embodiments are described and claimed.

Systems and methods for shard consistency in a clustered database are described. The system identifies an addition of a first shard to a clustered database on a source storage platform. The clustered database includes at least two shards and the first shard includes a first node. The system communicates a first node agent to the first node. The node agent being is configured to execute on the first node to extract a data image and an operation log at the source storage platform and stream the data image and the operation log to the secondary storage platform. The system versions a first version of the clustered database. The versioning includes storing the data image and operation log for the first node at the second storage platform. The timestamp associated with the first shard is different than the timestamp for other shards in the clustered database.

Techniques of measuring vibrations from an object surface using LIDAR includes grouping beams having similar vibration velocity values over a specified time window and replace outlier vibration velocity values with a vibration velocity value based on the similar vibration velocity values over the specified time window. Advantageously, replacing outlier vibration velocity values with a value based on vibration velocity values of similar beams results in a more accurate profile of the vibration velocity field over the surface.

Techniques of measuring vibrations from an object surface using LIDAR includes grouping beams having similar vibration velocity values over a specified time window and replace outlier vibration velocity values with a vibration velocity value based on the similar vibration velocity values over the specified time window. Advantageously, replacing outlier vibration velocity values with a value based on vibration velocity values of similar beams results in a more accurate profile of the vibration velocity field over the surface.

Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.

A computer-implemented method includes receiving genomic data associated with a plurality of genomes and identifying k-mer sets within the genomic data. The method includes constructing a k-mer subset tree according to the following process: performing iterative pairwise comparisons on the k-mer sets, wherein the iterative pairwise comparisons identify fragments with the most shared k-mers, merging the identified fragments into non-leaf nodes of the k-mer subset tree, and placing each remaining k-mer into a leaf node of the k-mer subset tree. The method includes storing the k-mer subset tree. A computer program product for data compression includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a computer to cause the compute to perform the foregoing method. A system includes a processor and logic. The logic is configured to perform the foregoing method.

A computer-implemented method includes: reading a vector of a first table in a database, the vector including counts of a plurality of keywords in the first table, the plurality of keywords including a first keyword and a second keyword; determining a first custom attribute describing the first table, the first custom attribute having a vector including counts of at least a first portion of the plurality of keywords in the first table; determining a multiplier of the first custom attribute, the multiplier being a number of other tables that reference the first custom attribute; and revising the vector of the first table based on the first custom attribute.

In one embodiment, a service divides one or more time series for a network key performance (KPI) into a plurality of time series chunks. The service clusters the plurality of time series chunks into a plurality of clusters. The service identifies a sketch that represents a particular one of the clusters. The service associates a label with the identified sketch. The service applies the label to a new KPI time series by matching the sketch to the new KPI time series.

A method includes maintaining an event logging database including entries corresponding to events processed at local servers. The method includes, in response to receiving a first message from a first local server, where the first message indicates that a first event occurred, identifying a causal parent event preceding the first event. The causal parent event is a most recent event that occurred at the first local server. The method includes identifying a temporal parent event preceding the first event. The temporal parent event is a most recent event that occurred across all of the plurality of local servers. The method includes generating a new entry based on data from the first message, an identifier of a first entry recording the causal parent event, and an identifier of a second entry recording the temporal parent event. The method includes adding the new entry to the event logging database.