Abstract: Stucco-cement compositions with a shortened drying time, lighter weight, high strength and reduced expansion, the compositions comprising expanded perlite and preferably also calcium aluminate cement and/or calcium sulfoaluminate cement, and methods for making and using these compositions, including pourable and/or pumpable floor underlayment slurries and methods for forming high strength underlayment on different substrates.

Abstract: A dry construction plaster composition made with at least stucco in an amount from about 25 to about 99 wt %; hydrated lime in an amount from about 0.5 to about 75 wt %; a phosphate-based lime bucking inhibitor in an amount from about 0.01 to about 1 wt %; and a setting reaction controlling agent, wherein the setting reaction controlling agent comprises a set accelerator, a set inhibitor, or any combination thereof is provided. Methods for preparing construction plaster slurries and pastes with reduced lime bucking and methods for finishing a substrate are also provided.

Abstract: Layered barrier cans and methods of producing the same are disclosed herein. An example shroud disclosed herein includes an inner shell including a first non-metallic material, an outer shell including the first non-metallic material or a second non-metallic material, and a metal core shell positioned between the inner shell and the outer shell.

Abstract: A test and measurement machine learning model development system includes a user interface, one or more ports to allow the system to connect to one or more data sources, one or more memories, and one or more processors configured to execute code to cause the one or more processors to: display on the user interface one or more application user interfaces, the application user interfaces to allow a user to provide user inputs; use and application programming interface to configure the system based on the user inputs; receive data from the one or more data sources; apply one or more modules from a library of signal processing and feature extraction modules to the data to produce training data; apply one or more machine learning models to the training data; provide monitoring of the one or more machine learning models; and save the one or more machine learning models to at least one of the one or more memories.

Abstract: A high-fidelity, multi-point, full-mission sonic-boom propagation tool that includes functionality to handle aircraft trajectories and maneuvers, as well as, all relevant noise metrics at multiple points along the supersonic mission. This allows efficient computation of sonic-boom loudness across the entire supersonic mission to allow pilots and aircraft operators to plan the aircraft flight path to manage the sonic boom footprint.

Abstract: Operating upon encrypted data with a particular data scope. A base encryption key is established and associated with the particular data scope, and then stored in a base encryption key store. That base encryption key store might be managed by an application or service that stores base encryption keys for multiple data scopes. A proxy encryption key acts as a kind of proxy for the base encryption key. The proxy encryption key may be used for frequent operations on encrypted data within the particular data scope. Thus, the principles described herein act as a frequency amplifier that allows key-based operations upon the particular data scope to be performed at much higher frequencies than otherwise would be possible by operating directly using the base encryption key.

Abstract: A data request that references an external data environment object (foreign object) is identified. A Data Manipulation Language (DML) statement for accessing the object is traversed in a defined order to identify foreign servers having the foreign object. Connections are attempted to foreign servers in the defined order and a selection to one of the foreign servers is made based on server and/or data conditions. The selected server is used for the request to process the portion of the request that includes the foreign object, In an embodiment and during execution of data request, the server and/or the data conditions can be dynamically overridden to change selection criteria for the selected server.

Abstract: Data may be encrypted using a derived block encryption key for each of at least one append blocks of data. A data operation associated with manipulating particular data associated with a user may be received. The particular data may comprise at least one append block of data. In response to the received data operation, for each append block of data of the at least one append block of data, parameters associated with deriving a block encryption key for a given append block of data of the at least one append block of data may be accessed. The parameters may comprise at least a data encryption key associated with the user and a nonce. A block encryption key may be derived for the given append block of data utilizing the parameters. The given append block of data may be encrypted utilizing the block encryption key.

Abstract: A high-fidelity, multi-point, full-mission sonic-boom propagation tool that includes functionality to handle aircraft trajectories and maneuvers, as well as, all relevant noise metrics at multiple points along the supersonic mission. This allows efficient computation of sonic-boom loudness across the entire supersonic mission to allow pilots and aircraft operators to plan the aircraft flight path to manage the sonic boom footprint.

Abstract: Operating upon encrypted data with a particular data scope. A base encryption key is established and associated with the particular data scope, and then stored in a base encryption key store. That base encryption key store might be managed by an application or service that stores base encryption keys for multiple data scopes. A proxy encryption key acts as a kind of proxy for the base encryption key. The proxy encryption key may be used for frequent operations on encrypted data within the particular data scope.

Abstract: Operating upon encrypted data with a particular data scope. A base encryption key is established and associated with the particular data scope, and then stored in a base encryption key store. That base encryption key store might be managed by an application or service that stores base encryption keys for multiple data scopes. A proxy encryption key acts as a kind of proxy for the base encryption key. The proxy encryption key may be used for frequent operations on encrypted data within the particular data scope. Thus, the principles described herein act as a frequency amplifier that allows key-based operations upon the particular data scope to be performed at much higher frequencies than otherwise would be possible by operating directly using the base encryption key.

Abstract: A computer-implemented method includes inserting a bloom filter creation stage after an inner data source identification stage, wherein a join operation is to be performed to join an outer data source with the inner data source. The method inserts a bloom filter search stage after an outer data source identification stage, wherein each row of data from the outer data source is searched against a bloom filter for the inner data source during the bloom filter search stage. The method initializes a read on the inner data source. Subsequent to determining the bloom filter creation stage is complete, the method initializes a read on the outer data source. The method performs the join operation at a join stage.

Abstract: A computer-implemented method includes inserting a bloom filter creation stage after an inner data source identification stage, wherein a join operation is to be performed to join an outer data source with the inner data source. The method inserts a bloom filter search stage after an outer data source identification stage, wherein each row of data from the outer data source is searched against a bloom filter for the inner data source during the bloom filter search stage. The method initializes a read on the inner data source. Subsequent to determining the bloom filter creation stage is complete, the method initializes a read on the outer data source. The method performs the join operation at a join stage.

Abstract: One or more processors receive information regarding a program module that includes a description of a function, license terms, and non-functional properties of the program module. The license terms, the description of function, and the non-functional properties of the program module are identified, based on an analysis of the information. An object of interest of each license term of the license terms is determined, such that the object of interest is directed to a condition influencing license term compliance. Rules corresponding to compliance of the one or more license terms of the program module are determined, and the analyzed information of the program module is stored in a meta-model format organized into categories including the description of function, the one or more license terms, and the non-functional properties of the program module, utilizing standardized syntax and semantics.

Abstract: Entity mappings that produce matching entities for a first data asset having attributes and a second data asset having attributes are generated by: generating entity mappings that produce matching entities for a first data asset having attributes with attribute values and a second data asset having attributes with attribute values by: matching the attribute values of the attributes of the first data asset with the attribute values of the attributes of the second data asset, using the matching attribute values to generate matching attribute pairs, and using the matching attribute pairs to identify entity mappings; computing an entity mapping score for each of the entity mappings based on a combination of factors; ranking the entity mappings based on each entity mapping score; and using some of the ranked entity mappings to determine whether a same real-world entity is described by the first data asset and the second data asset.

Abstract: Operating upon encrypted data with a particular data scope. A base encryption key is established and associated with the particular data scope, and then stored in a base encryption key store. That base encryption key store might be managed by an application or service that stores base encryption keys for multiple data scopes. A proxy encryption key acts as a kind of proxy for the base encryption key. The proxy encryption key may be used for frequent operations on encrypted data within the particular data scope. Thus, the principles described herein act as a frequency amplifier that allows key-based operations upon the particular data scope to be performed at much higher frequencies than otherwise would be possible by operating directly using the base encryption key.

Abstract: Data may be encrypted using a derived block encryption key for each of at least one append blocks of data. A data operation associated with manipulating particular data associated with a user may be received. The particular data may comprise at least one append block of data. In response to the received data operation, for each append block of data of the at least one append block of data, parameters associated with deriving a block encryption key for a given append block of data of the at least one append block of data may be accessed. The parameters may comprise at least a data encryption key associated with the user and a nonce. A block encryption key may be derived for the given append block of data utilizing the parameters. The given append block of data may be encrypted utilizing the block encryption key.

Abstract: Entity mappings that produce matching entities for a first data asset having attributes and a second data asset having attributes are generated by: generating entity mappings that produce matching entities for a first data asset having attributes with attribute values and a second data asset having attributes with attribute values by: matching the attribute values of the attributes of the first data asset with the attribute values of the attributes of the second data asset, using the matching attribute values to generate matching attribute pairs, and using the matching attribute pairs to identify entity mappings; computing an entity mapping score for each of the entity mappings based on a combination of factors; ranking the entity mappings based on each entity mapping score; and using some of the ranked entity mappings to determine whether a same real-world entity is described by the first data asset and the second data asset.

Abstract: Software that utilizes machine logic-based algorithms to combine the Terms of Service (ToS) portions of multiple Application Programming Interfaces (APIs) by performing the following steps: (i) providing a first ToS portion of a first API, with the first ToS portion including a first ToS feature value for a first ToS feature; (ii) providing a second ToS portion of a second API, with the second ToS portion including a second ToS feature value for the first ToS feature; and (iii) merging, at least, the first ToS portion and the second ToS portion, according to a set of ToS merger rule(s) applied by machine logic, to generate a merged ToS. One merger rule combines at least the first ToS feature value and the second ToS feature value according to a set of operator(s) to generate a first merged ToS feature value included as the first ToS feature in the merged ToS.

Abstract: An application programming interface (API) exploration data structure is used in presenting an API composite to a first entity. A query associated with a topic is received from the first entity. A portion of the data structure is accessed. The accessed portion includes nodes that represent entities, nodes that represent APIs, and edges that represent relationships between nodes. A similarity score is calculated for each entity using a comparison to the first entity. Each similarity score is then compared to a threshold. A first network including each entity that has a similarity score above the threshold is generated. An API group including each API that has a relationship with the first network is generated. The API composite is identified based on the topic. As identified, the API composite includes an API of the related API group. The API composite is presented to the first entity.