Abstract: In some implementations, the techniques described herein relate to a method including: receiving, at an API gateway, an API request from an API client; extracting, by the API gateway, a client identity associated with the API request; checking, by the API gateway, API Level Objectives (ALOs) associated with the client identity, the ALOs defining acceptable usage limits for the client identity; determining, by the API gateway, that the API request falls outside the acceptable usage limits defined by the ALOs; and applying, by the API gateway, an API Level Agreement (ALA) action, the ALA action specifying an action to be taken when an ALO is breached.

Abstract: A system, method, and device for managing dependencies between a hypercube base version and a set of scenario versions for the hypercube are provided. The method includes (i) obtaining a request for a version of a hypercube, and (ii) in response to obtaining the request: (a) obtaining a base version of the hypercube, (b) obtaining an override data structure that indicates a set of scenario values that override corresponding base version values, and (c) providing the version of the hypercube based at least in part on the base version and the override data structure.

Abstract: A system, method, and device for storing a scenario version as a base version for a hypercube are provided. The method includes (i) obtaining a request to store a scenario version of a hypercube as a base version; (ii) obtaining a set of transactions corresponding to hypercube updates for the scenario version, and (iii) writing the set of transactions to the base version.

Abstract: A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a hypercube comprising a plurality of locations, wherein a particular location has an anchor object that stores version information for the particular location, and the particular location comprises a first formula that is evaluated to return a value for the particular location, (ii) in response to receiving the request for the value, determining that the particular location comprises the first formula, (iii) in response to determining that the particular location comprises the first formula, evaluating the first formula to obtain a result, and (iv) storing the result for the particular location in association with the version information for the particular location.

Abstract: A system includes an interface and a processor. The interface is configured to receive a predicted output signal. The processor is configured to: a) determine whether the predicted output signal satisfies a constraint set; and b) in response to the predicted output signal not satisfying the constraint set, determine a transformed output signal that satisfies the constraint set by: 1) determining a set of transformed predicted output signals that satisfy the constraint set, wherein a transformed predicted output signal of the set of transformed predicted output signals that satisfy the constraint set comprises the predicted output signal modified by one or more value modifications; 2) selecting a transformed predicted output signal of the set of transformed predicted output signals that satisfy the constraint set; and 3) providing the transformed predicted output signal of the set of transformed predicted output signals that satisfy the constraint set.

Abstract: A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a hypercube comprising a plurality of locations, wherein a particular location has an associated anchor object that stores version information for the particular location, (ii) receiving a request to store an updated value for the particular location, and (iii) storing the updated value for the particular location of hypercube, the updated value being stored with associated version information stored in the anchor object for the particular location.

Abstract: A system, method, and device for evaluating a query is provided. The method includes (i) receiving the query to be evaluated against a data structure, (ii) determining input data corresponding to a subset of the data structure that is to be used in evaluating the query, (iii) determining a solve order for evaluating the query against the input data, (iv) partitioning the input data into a plurality of sub-grids based at least in part on the solve order, (v) processing the plurality of sub-grids to compute corresponding parts of the query, and (vi) evaluating the query based at least in part on the processing of the plurality of sub-grids to obtain a query result.

Abstract: An incident manager application (IM) for responding to data security incidents in enterprise networks is disclosed. An IM tracks the incidents in an enterprise network by storing incident objects and incident artifact (IA) metadata created for the incidents, where the incident objects and IAs include information concerning the incidents. Incident response team (IRT) personnel of the enterprise networks can define action conditions within the IM that are associated with the incident objects. When the information within the incident objects and/or IAs meets the defined action conditions, the IM includes the objects that cause the action conditions to be satisfied in messages. Devices such as user account databases and configuration servers within the enterprise network can then download the messages and execute actions that reference the objects extracted from the downloaded messages to implement a response to the incidents.

Abstract: A system, method, and device for evaluating a query is provided. The method includes (i) receiving a query that is indicative of one or more properties of result data, (ii) determining, based at least in part on the query, one or more partitions of a hypercube that are expected to comprise information used in generating result data for a response for the query; (iii) generating a data structure comprising a set of data of the one or more partitions, wherein the data structure is indicative of relationships among data in the set of data; (iv) evaluating the query with respect to the plurality of account groups; and (v) using the data structure to determine the result data based at least in part on an evaluation of the query with respect to the plurality of account groups.

Abstract: The present application discloses a method, system, and computer system for enforcing security with respect to a database. The system includes a database configured to receive a query, wherein the query is modified to comprise one or more security predicates; determine data to return in response to the query by examining the one or more security predicates with respect to security for a field; and return the determined data in response to the query.

Abstract: The present application discloses a method, system, and computer system for providing a dataframe as a service. The method includes (a) receiving, from a client system, one or more hints identifying parameters for source data; (b) executing a plan for a source dataframe including determining whether accessing the source data for the source dataframe is permitted based at least in part on one or more security policies, wherein the plan is based at least in part on the one or more hints; (c) receiving from the client system a business logic pertaining to a transformation to be applied to the source dataframe; and (d) providing to the client system information pertaining to an execution result obtained based at least in part on the business logic.

Abstract: A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a tree data structure to represent the data, (ii) receiving a request to rearrange data stored in the N-conjoined tree data structure, (iii) enforcing a first rule that requires each leaf node to have an associated linkage to each tree in the N-conjoined tree data structure while rearranging the N-conjoined tree data structure in accordance with the request, and (iv) providing a rearranged N-conjoined tree data structure. The tree data structure is an N-conjoined tree data structure, and N is a positive integer.

Abstract: Techniques for providing horizontally scaled caching of versioned data are provided. In some aspects, the techniques described herein relate to a method including initializing a first version cache (VC) object based on a version of data stored in a data storage device; replicating the first VC to generate a second VC; receiving a write operation at the first VC; generating a delta for the write operation, the delta representing a change in the version of data; writing the delta to a persistent replication log, the persistent replication log storing an ordered set of deltas including the delta; writing data in the write operation to the data storage device; and applying the ordered set of deltas at the second VC to update data stored by the second VC.

Abstract: A method, system, and device for profiling execution of a set of code is disclosed. The method includes obtaining information associated with a plurality of thread dumps from execution of a set of code; determining, based at least in part on one or more dimensions, one or more relationships between tasks processed during execution of the set of the code; and providing the one or more relationships.

Abstract: A method, system, and device for profiling execution of a set of code is disclosed. The method includes obtaining a plurality of thread dumps, determining a relational model based at least in part on the plurality of thread dumps, and determining, based at least in part on the relational model, latency information pertaining to execution of at least part of the set of code.

Abstract: A system, method, and device for updating a base version of a hypercube are provided. The method includes (i) obtaining a request for a planning session with respect to a hypercube; and (ii) in response to obtaining the request: (a) determining that the planning session uses a base version of the hypercube, (b) receiving a value input to update a particular location in the hypercube, (c) storing the value for the particular location in the base version of the hypercube, and (d) propagating an update to the particular location of the base version of the hypercube to one or more scenario versions having a dependency on the base version.

Abstract: A system for a prediction model includes an interface and a processor. The interface is configured to receive historical data. The processor is configured to determine hyperparameters based at least in part on a best model of N models; determine the prediction model by training using the hyperparameters on the historical data; determine detected anomalies based at least in part on an output of the prediction model; receive user feedback on the detected anomalies and undetected anomalies; and retrain the prediction model using the hyperparameters and based on the user feedback.

Abstract: The techniques described herein relate to a method including: receiving, by a processor, a data record having a plurality of fields; generating, by the processor, a risk score for the data record using a predictive model; determining, by the processor, that the data record is a potential anomaly based on the risk score; identifying, by the processor, an anomalous field from the plurality of fields; generating, by the processor, a plurality of permutations of the data record, the plurality of permutations generated by changing a value of the anomalous field; and outputting, by the processor, a replacement record selected from the plurality of permutations, the replacement record having a field value for the anomalous field that generates a lowest risk score among the plurality of permutations.

Abstract: In some implementations, the techniques described herein relate to a method including: loading, by a processor, a predictive model, the predictive model including a first set of hidden layers; loading, by the processor, a semantic model, the semantic model including a second set of hidden layers; generating, by the processor, a tenant model using the first set of hidden layers and a third set of hidden layers, the third set of hidden layers receiving, as input, an output of the first set of hidden layers; loading, by the processor, a tenanted training data set; training, by the processor, the tenant model by biasing the first set of hidden layers with the second set of hidden layers and training weights of at least the third set of hidden layers using the tenanted training data set; and building, by the processor, an embedding index using the tenant model.

Abstract: A system includes an interface configured to receive a paste-to data cell. The system includes a processor configured to: determine whether there is an exact match key for a copy-from data set; in response to there not being the exact match key for the copy-from data set, determine whether there is a smart formula for the copy-from data set; and in response to there being the smart formula for the copy-from data set, provide the smart formula for the copy-from data set to a formula cell. The system includes a memory coupled to the processor and configured to provide the processor with instructions.