Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.

A knowledge management system and method. The knowledge management system and method can have multi-industry applications with special suitability for program-based initiatives, research projects, healthcare sector programs, educational system programs, workforce development initiatives, and social service outcomes.

Techniques and solutions are described for facilitating the use of machine learning techniques. In some cases, filters can be defined for multiple segments of a training data set. Model segments corresponding to respective segments can be trained using an appropriate subset of the training data set. When a request for a machine learning result is made, filter criteria for the request can be determined and an appropriate model segment can be selected and used for processing the request. One or more hyperparameter values can be defined for a machine learning scenario. When a machine learning scenario is selected for execution, the one or more hyperparameter values for the machine learning scenario can be used to configure a machine learning algorithm used by the machine learning scenario.

Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

A database storing data associated with an identifier unique to each sample, the data including first data representative of at least one of composition data, processing data, and property data for the each sample, and second data representative of microstructure data for the each sample. The microstructure data includes a feature determined based on a temperature dependence of magnetization for the each sample.

In some embodiments, a method receives a connection to a data source. The method analyzes metadata of the data source to determine a first type of metadata for a first type of database access and a second type of metadata for a second type of database access. The first type of metadata and the second type of metadata are combined into a data structure. Then, the method stores the data structure where the data structure is used to analyze a query to determine which of the first type of database access and the second type of database access to use for the query.

A method including receiving a request for a report on a data set. The method also includes providing the report. The report includes a macro page having a subset of the data set. The method also includes converting the macro page into a primary tree data structure having levels. The method also includes buffering the primary tree data structure in a buffer to form a buffered tree data structure. The buffered tree data structure is buffered in a level order of the levels. The method also includes selecting a first micro page from the buffered tree data structure. The first micro page is configured for display on a user interface. The method also includes transmitting, to the user interface, the first micro page.

A method for execution by a computing entity includes interpreting a fluid flow response from fluid flow sensors to produce a piston velocity and a piston position of a piston associated with a head unit device. The head unit device includes a chamber filled with a shear thickening fluid (STF) and a variable partition positioned within the chamber between the piston and a closed end of the chamber to dynamically affect volume of the chamber based on activation of the variable partition. The method further includes determining a shear force based on the piston velocity and the piston position. The method further includes determining a desired response for the STF based on the shear force, the piston velocity, and the piston position. The method further includes activating the variable partition using the desired response for the STF to adjust the volume of the chamber.

Various embodiments provide for tag-based application of a masking policy, which can be used in connection with a data platform. In particular, various embodiments enable enforcement of one or more masking policies against an entity (e.g., object) of a data platform, such as a database, a table, a row, or a column, based on one or more tags associated with the entity.

A computer vision processor of a camera generates hyperzooms for persons or vehicles from image frames captured by the camera. The hyperzooms include a first hyperzoom associated with the persons or vehicles. The computer vision processor tracks traffic patterns of the persons or vehicles while obviating network usage by the camera by predicting positions of the persons or vehicles using a Kalman Filter from the first hyperzoom. The persons or vehicles are detected in the second hyperzoom. The positions of the persons or vehicles are updated based on detecting the persons or vehicles in the second hyperzoom. The first hyperzoom is removed from the camera. Tracks of the persons or vehicles are generated based on the updated positions. The second hyperzoom is removed from the camera. Track metadata is generated from the tracks for storing in a key-value database located on a non-transitory computer-readable storage medium of the camera.