Abstract: Techniques for accessing off-heap memory are disclosed. The system may receive a memory segment layout definition for a memory segment in a physical memory of a machine. The memory segment layout definition defines a number of elements and a number of sub-elements in each element of the plurality of elements. The system may allocate the particular memory segment in the physical memory and may store a reference to a position of a sub-element. The system may receive a request to access a first sub-element of a particular element of the plurality of elements. Based on the request, the system may identify the memory segment corresponding to the plurality of elements, identify the particular element of the plurality of elements, identify the first sub-element of the plurality of elements based the position of the first sub-element, and execute an Input or Output (IO) operation corresponding to the request.

Abstract: Disclosed are techniques for processing user profiles using data structures that are specialized for processing by a GPU. More particularly, the disclosed techniques relate to systems and methods for evaluating characteristics of user profiles to determine whether to offload certain user profiles to the GPU for processing or to process the user profiles locally by one or more central processing units (CPUs). Processing user profiles may include comparing the interest tags included in the user profiles with logic trees, for example, logic trees representing marketing campaigns, to identify user profiles that match the campaigns.

Abstract: Techniques for auto composing using a transformer-based language model having a parameter sharing decoder pair (PSDP) that reduces a number of parameters of the model and maintains the capability of generating understandable and reasonable compositions. In one particular aspect, a method is provided that includes obtaining a full encoder sequence, and inputting the full encoder sequence into a transformer model having a PSDP. The PSDP includes: a first decoder having parameters that are shared across all N layers of the first decoder; and a second decoder having parameters that are shared across all N layers of the first decoder. The parameters of the first decoder are different from the parameters of the second decoder. The method further includes using the transformer model to predict sequence elements based on the full encoder sequence, generate an output sequence comprising the sequence elements, and output an output sequence different from the full encoder sequence.

Abstract: Techniques for transitioning between thread-confined memory segments and shared memory segments are disclosed. The system may instantiate a confined memory segment view. The confined memory segment view confines access to a memory segment to a particular thread. The system may further receive a request to change access permissions for the confined memory segment to allow access by a first set of one or more threads. Responsive to receiving the request to change access permissions for the confined memory segment, the system may instantiate a new memory segment view, wherein the new memory segment view permits access to the memory segment by the first set of one or more threads. The system may also copy metadata from the confined memory segment view to the new memory segment view. The system may de-allocate the memory segment in response to determining that there are no memory segment views associated with the memory segment.

Abstract: Techniques are described handling database transaction in a manner that is efficient and flexible. In some embodiments, a system receives, through a page of a user interface, a first request to change at least a first data object. The system generates, based on the first request, a first atomic transaction to modify the first data object in a database. Before the first atomic database transaction has committed to the database, the system receives, through the page of the user interface, a second request to change at least a second data object. The system generates, based on the second request, a second atomic transaction to modify the second object in the database. The system may execute the second atomic transaction independently of the first atomic transaction.

Abstract: Disclosed are techniques for processing user profiles using data structures that are specialized for processing by a GPU. More particularly, the disclosed techniques relate to systems and methods for evaluating characteristics of user profiles to determine whether to offload certain user profiles to the GPU for processing or to process the user profiles locally by one or more central processing units (CPUs). Processing user profiles may include comparing the interest tags included in the user profiles with logic trees, for example, logic trees representing marketing campaigns, to identify user profiles that match the campaigns.

Abstract: Disclosed are techniques for processing user profiles using data structures that are specialized for processing by a GPU. More particularly, the disclosed techniques relate to systems and methods for evaluating characteristics of user profiles to determine whether to offload certain user profiles to the GPU for processing or to process the user profiles locally by one or more central processing units (CPUs). Processing user profiles may include comparing the interest tags included in the user profiles with logic trees, for example, logic trees representing marketing campaigns, to identify user profiles that match the campaigns.

Abstract: The embodiments disclosed herein relate to predictive rate limiting. A workload for completing a request is predicted based on, for example, characteristics of a ruleset to be applied and characteristics of a target set upon which the ruleset is to be applied. The workload is mapped to a set of tokens or credits. If a requestor has sufficient tokens to cover the workload for the request, the request is processed. The request may be processed in accordance with a set of processing queues. Each processing queue is associated with a maximum per-tenant workload. A request may be added to a processing queue as long as adding the request does not result in exceeding the maximum per-tenant workload. Requests within a processing queue may be processed in a First In First Out (FIFO) order.

Abstract: Some embodiments of the present invention provide systems and methods for live data migration with automatic redirection that overcome some or all of the downfalls of typical approaches. According to some embodiments, any client applications or devices accessing the migrated data may stay live and any new requests may be automatically redirected to the destination server to which the data was migrated. This may be accomplished, for example, using a combination of Server Message Block (SMB), Service Witness Protocol (SWP), and Distributed File System Referral Protocol (DFS).

Abstract: Described is an approach for performing context-aware prognoses in machine learning systems. The approach harnesses streams of detailed data collected from a monitored target to create a context, in parallel to ongoing model operations, for the model outcomes. The context is then probed to identify the particular elements associated with the model findings.

Abstract: Techniques for making preliminary authorization determinations based on partial contextual information are disclosed. In one or more embodiments, an API receives an authorization request and partial contextual information associated with the authorization request. The API submits the partial contextual information to an authorization service, without submitting complete contextual information associated with the authorization request. The API receives, from the authorization service, a preliminary authorization response based on the partial contextual information. The preliminary authorization includes one of (a) denial of the authorization request and (b) non-denial of the authorization request.

Abstract: Embodiments forecasting future demand for an item. Embodiments receive a regression based demand algorithm for the item that includes the set of features as regression variables and split the data points into a training set and a testing set. Embodiments assign each of the features of the set of features into one of a plurality of regularization categories and assign a penalty parameter to each of the features subject to regularization. Embodiments train the demand algorithm using the training set, the penalty parameters and the features to generate a trained demand model. Embodiments evaluate the trained demand model using the testing set to determine an early drop metric and repeat the assigning each of the features, the assigning the penalty parameter, the training the demand algorithm and the evaluating the trained demand model until the early drop metric meets a threshold.

Abstract: Operations include restoring a trusted system firmware state. A system stores a set of self-contained secure code in a secure code store. The system stores a set of operational code in an operational code store. The system executes the secure code or the operational code upon system start up, depending whether the system is configured in a secure mode, or in a normal operational mode. When the system is configured in secure mode, the system executes the secure code. In secure mode, the system also overwrites a current version of the operational code stored in the operational code store with a replacement version of the operational code referenced by the secure code. When the system is configured in normal operational mode, the system executes the operational code. During normal operation, the secure code store is electrically isolated.

Abstract: A method, system, and computer program product for enterprise applications. Embodiments commence by accessing a first database table having columns pertaining to one or more cost items of a first project and accessing a second database table having columns pertaining to cost items of a second project. A user interface aids definition of user-defined inter-project attributes, wherein the user-defined inter-project attributes relate a database table column of the first project to a database table column of the second project. The user-defined inter-project attributes are used in preparing display information pertaining to at least two projects such that in response to a single action being performed under control of a client system, the prepared display information is sent to a display unit. In some cases, the prepared display information comprises a summary of values, and in some cases, an alert icon is displayed based on a summary value exceeding a threshold.

Abstract: Techniques for efficiently generating aggregate distribution approximations are disclosed. In some embodiments, a system receives a plurality of piecewise approximations that represent different distributions of a set of values on at least one computing resource. Based on the plurality of piecewise approximations, a set of clusters are generated, within volatile or non-volatile memory, that approximate an aggregate distribution of the set of metric values on the at least one computing resource. The set of clusters is transformed, within volatile or non-volatile memory, to an aggregate piecewise approximation of a function for the set of metric values on the at least one computing resource.

Abstract: In an exemplary embodiment, a computer system hosts a logical Key Performance Indicator (KPI) network to detect computer performance anomalies. Databases execute database KPI nodes, database edges, and database instance nodes of the logical KPI network to propagate database KPI data to a KPI server system. Application servers execute application server KPI nodes, application server edges, and application server instance nodes of the logical KPI network to propagate application server KPI data to the KPI server system. Web servers execute web server KPI nodes, web server edges, and web server instance nodes of the logical KPI network to propagate web server KPI data to the KPI server system. This KPI data indicates logical data path information for the propagated KPI data (instead of KPI values). The KPI server system processes the logical data path information to indicate the computer performance anomalies.

Abstract: Techniques for analyzing an execution of a query statement based on a random archive are disclosed. A plurality of query statements that are executed during a particular time period are identified. A random sampling function is executed to randomly select a set of query statements from the plurality of query statements. Execution plans and/or performance metrics associated with each execution of the randomly-selected query statements are stored into a random archive. Responsive to determining that a performance metric for a current execution of a particular query statement does not satisfy a performance criteria, information associated with the particular query statement from the random archive is analyzed. A model plan characteristic associated with an execution of the particular query statement stored in the random archive is determined. An execution plan associated with the model plan characteristic is determined for another execution of the particular query statement.

Abstract: On-die functional blocks may use multiple communication networks to send requests and receive responses. For example, a first functional block may send a request via a first network. In response to receiving the request, a second functional block may respond to the first functional block via a second network. The second functional block may also send any requested data to the first functional block via a third network.

Abstract: A method for distributing Sigtran connections among signal transfer point (STP) message processors includes providing a connection load balancer as a front end to plural message processors of an STP. The method further includes publishing, by the connection load balancer, an Internet protocol (IP) address to SS7 peers. The method further includes initializing the message processors of the STP to listen on the IP address published by the connection load balancer. The method further includes receiving, at the connection load balancer, a Sigtran message addressed to the IP address. The method further includes determining, by the connection load balancer, whether the Sigtran message is an initial message for a Sigtran connection or a subsequent message for a Sigtran connection and whether the Sigtran connection has been assigned to one of the message processors.

Abstract: Establishing a conditional branch frame barrier is described. A conditional branch in a function epilogue is used to provide frame-specific control. The conditional branch evaluates a return condition to determine whether to return from a callee function to a calling function, or to execute a slow path instead. The return condition is evaluated based on a thread local value. The thread local value is set such that returns to potentially unsafe frames in a call stack are prohibited. The prohibition to return to a potentially unsafe frame may be referred to as a “frame barrier.” Additionally, the thread local value may be used to establish safepointing and/or thread local handshakes, both after execution of a function body and after execution of a loop body.

Abstract: Techniques are described for triggering conditional automated social posts. According to an embodiment, a set of one or more conditions is received through a user interface by a system executing on one or more computing devices. The system monitors one or more social media channels for target content that has been posted on at least one social media channel of the one or more social media channels. In response to detecting, by the system executing on one or more computing devices, that the target content has been posted on at least one social media channel of the one or more social media channels, the system determines whether the set of one or more conditions are satisfied. In response to determining that the set of one or more conditions are satisfied, the system triggers an action responsive to the target content.

Abstract: Techniques are described herein for handling transactions where only a portion of submitted changes are committed. In some embodiments, a system receives, through a page of a user interface, a request to submit a plurality of changes to a set of data objects. The system identifies, based on the page of the user interface through which the request was submitted, a first subset of one or more changes that require further review and a second subset of one or more changes that do not require further review before being committed to the database. The first subset of one or more changes are cached for further review, and a respective approval transaction may be initiated. A commit transaction may be initiated directly for the second set of one or more changes to commit the changes to the database without further review.

Abstract: A campaign profile specifies products and/or content items associated with a campaign. A target group selection engine applies an affinity attribute model to user information of a user. The affinity attribute model is used to determine the user's affinity towards (a) product attributes of the products associated with the campaign and/or (b) content attributes of the content items associated with the campaign. The affinity attribute model may be generated using machine learning. A user interface accepts target user tuning parameters that specify weights to be applied to the affinity attributes determined by the affinity attribute model. Based at least on applying the weights to the affinity attributes, an inclusion score and/or exclusion score for the user is determined. The user is included in a target group, for engaging with the campaign, based on the inclusion score and/or exclusion score.

Abstract: Provisioning for a cloud service is provided. An instance of a provisioning object is created and initialized, and a graphical user interface (GUI) is generated. The GUI includes a home window, a configure window, an orchestrate window and a deploy window. The provisioning parameters are received from the GUI. The provisioning parameters indicate whether to deploy the software application on a local network or a remote network. A location object and a deployment object are created and initialized based on the provisioning parameters. The location object includes an on-premises object for a local network deployment or a cloud object for a remote network deployment. A command to deploy the software application is received from the GUI, and the software application is deployed to a local network or a remote network using the provisioning object, the location object and the deployment object.

Abstract: Techniques are described herein for asynchronous execution of queries on statically replicated graph data. In an embodiment, a graph is partitioned among a plurality of computers executing the graph querying engine. One or more high-degree vertices of the graph are each replicated in each graph partition. The partitions, including the replicated high-degree vertices, are loaded in memory of the plurality of computers. To execute a query, a query plan is generated based on the query. The query plan specifies a plurality of operators and an order for the plurality of operators. The order is such that if an operator requires data generated by another operator, then the other operator is ordered before the operator in the query plan. Replicated copies of a vertex is visited if matches made by subsequent operator(s) are limited by data unique to the replicated vertices.

Abstract: Systems and methods are disclosed to improve a topic modeling system that tunes a topic model for a set of topics from a corpus of documents, by allowing users to pre-inform the tuning process with bias parameters for desired associations in the topic model. In embodiments, the topic model may be a Latent Dirichlet Allocation (LDA) model. In embodiments, the bias parameter may indicate a fixed association where a particular word in a particular document is associated with a particular topic. In embodiments, the bias parameter may specify a weight value that biases the inference process with regard to a particular association. Advantageously, the disclosed features allow users to specify a small number of parameters to steer the tuning process towards a set of desired topics. As a result, the topic model may be generated more quickly and with more useful topics.

Abstract: Database techniques are provided that use state machines to manage polyglot subroutine bindings for database commands. In an embodiment, a computer receives a database command that contains call sites (CSs). Each CS is associated with a user defined logic (UDL). The computer associates an initial operational state with each of the CSs. During a first invocation of a particular CS, the CS becomes initialized and transitions to an optimized state that is configured for streamlined invocation of the UDL. The UDL is invoked to contribute data to a partial result for the database command. Eventually, command execution stalls and causes the CS to transition to an unready state, which entails releasing shared resources. Later execution resumes and during another invocation of the CS, resources are reacquired, the CS is made ready and transitioned back to the optimized state. The CS may again be repeatedly invoked while revisiting the optimized state.

Abstract: Approaches herein transparently delegate data access from a relational database management system (RDBMS) onto an offload engine (OE). The RDBMS receives a database statement referencing a user defined function (UDF). In an execution plan, the RDBMS replaces the UDF reference with an invocation of a relational operator in the OE. Execution invokes the relational operator in the OE to obtain a result based on data in the OE. Thus, the UDF is bound to the OE, and almost all of the RDBMS avoids specially handling the UDF. The UDF may be a table function that offloads a relational table for processing. User defined objects such as functions and types provide metadata about the table. Multiple tables can be offloaded and processed together, such that some or all offloaded tables are not materialized in the RDBMS. Offloaded tables may participate in standard relational algebra such as in a database statement.

Abstract: A power management controller is disclosed. Broadly speaking, the controller may, in response to receiving a timing signal, monitor a temperature of an integrated circuit including multiple processor clusters. The controller may generate a comparison of the temperature and a threshold value, and in response to a determination that the comparison indicates that the temperature is less than the threshold value, transition a particular processor cluster to a new power state.

Abstract: Systems and methods for using InfiniBand routing algorithms for Ethernet fabrics in a high performance computing environment. The method can provide, at a computer comprising one or more microprocessors, a plurality of switches, a plurality of hosts, a topology provider (TP) module, a routing engine (RE) module, and a switch initializer (SI) module. The method can perform a discovery sweep, by the TP, of the plurality of hosts and the plurality of switches and assigns an address to each of the plurality of hosts and the plurality of switches. The method can calculate, by the routing engine, a routing map, based upon a routing scheme, for the plurality of hosts and the plurality of switches, the routing map comprising a plurality of forwarding tables. The method can configure, each of the plurality of switches with a forwarding table of the plurality of forwarding tables calculated by the routing engine.

Abstract: Systems and methods described herein are directed towards controlling a level of detail for geostreaming data. In some examples, an identifying event data that includes location information. A polygon may be defined that comprises points on a map corresponding to the event data. A first level of detail may be determined and a fidelity of the polygon may be changed based at least in part on the first level of detail. Second event data may be received that identifies a location of an object. It may be identified whether the object is within the location information and a user interface may be prepared that presents whether the object is in an affected area.

Abstract: Systems, methods, and other embodiments associated with anomaly detection using tripoint arbitration are described. In one embodiment, a method includes identifying a set of clusters that correspond to a nominal sample of data points in a sample space. A point z is determined to be an anomaly with respect to the nominal sample when, for each cluster, a tripoint arbitration similarity between data points in the cluster calculated with z as arbiter is greater than a threshold.

Abstract: Techniques for lazy copying of runtime-managed stack frames are disclosed. A runtime environment generates a runtime-managed stack including multiple frames. A topmost subset of frames includes data associated with particular instructions and a return address. A lower subset of frames includes data associated with different instructions. The runtime environment stores a copy of the topmost subset of frames in an OS-managed stack, without copying the lower subset. The particular instructions execute using the copy of the topmost subset of frames in the OS-managed stack. The runtime environment replaces, in the copy, the return address with a return barrier address. When execution of the instructions terminates, control passes to return barrier instructions, which store a copy of the lower subset of frames in the OS-managed stack and pass control to the different instructions. The different instructions execute using the copy of the lower subset of frames in the OS-managed stack.

Abstract: Systems, devices, and methods discussed herein provide improved autonomous agent applications that are configured to provide explanations in response to user-submitted questions. Training data comprising a question, and an explanation pair may be accessed. A discourse tree and an explanation chain can be constructed from the explanation. The explanation chain may identify logical relationships between two entities of elementary discourse units identified from the discourse tree. A query may be submitted for the two entities, and a set of search results can be mined to identify text linking the two entities. An additional discourse tree can be generated from the text of a search result. The additional discourse tree can be combined with the original discourse tree to generate a complete discourse tree. A model may be trained using this augmented data (e.g., the complete discourse tree) to improve the quality of explanations provided by the autonomous agent application.

Abstract: A custom client authenticator is installed on non-server entity. The custom client authenticator authorizes communication between a client application of a client and requested entities of a server. A native authentication technology for the client is different than a native authentication technology for the server. The custom client authenticator is registered in a descriptor file that is accessible by the server. The custom client authenticator generates an authorization token for the client. The authorization token is transmitted as part of a request message for the client application to the server. The custom client authenticator validates the authorization token on behalf of the server. The request message is forwarded to the requested entities executing on the server based on the validating.

Abstract: Techniques, including systems and methods for distributing electronic messages, are disclosed. In an embodiment, information relating to a message thread is maintained. The information includes information identifying one or more members of a distribution list to be excluded from receiving messages in the message thread. When it has been determined to prevent distribution of the electronic message to one or more members of the distribution list, the electronic message is distributed to members of the distribution list excluding the one or more members to whom distribution is to be prevented. The distributed electronic message may identify the distribution list as an intended recipient.

Abstract: Techniques for integrating context-aware software applications are disclosed. A system generates a mapping of a subset of one or more variables, managed by a parent software application, to a data structure. At runtime of the parent software application, based on the mapping, the system populates an instance of the data structure with one or more values corresponding to the subset of one or more variables. The system injects the instance of the data structure into a child software application. The system renders an interface of the child software application as a component of the parent software application. The child software application executes an operation using the one or more values from the instance of the data structure.

Abstract: Embodiments use successive refinement to allow a user to systematically explore the result set of an arbitrary query over RDF, such as a SPARQL query. A user inputs an arbitrary base query and modifies this query by replacing selected variables with values to which each selected variable is bound within the result set of the base query. Embodiments present, via a GUI, variable facets that may be substituted for query variables. Embodiments also present, through a GUI, a query history graph that represents query versions that a user has created. A user may navigate this query history graph to return to previously-created query versions. The GUI also provides information about the facets, including a number of results that would be included in the result set of the query version resulting from substitution of the facet for the associated variable.

Abstract: A method, system, and computer program product for transforming RDF quads to relational views. The method commences by receiving a named graph, the named graph comprising at least one RDF quad, and analyzing the named graph to produce analysis metadata. The method uses the analysis metadata to generate relational views. The method further comprises publishing a relational view in the form of a SPARQL query. The quality of the results can be quantitatively measured and reported by calculating a goodness score based at least in part on aspects of the relational view definitions. Several variants for transformation include generating relational view definitions formed using a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant. The transformations can form outputs responsive to characteristics or properties such as a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

Abstract: A plurality of visualization objects may be provided for representing one or more data sets in a virtual 3D space. The visualization objects may include funnels, containers, name cards, and so forth. The visualization objects can be arranged in a circular carousel that can be rotated around a position of a virtual camera or user in a VR/AR environment. Individual data points in the visualization objects can be rotated, sized, positioned, colored, or otherwise characterized based on attributes of the corresponding data points. Individual data points can also be animated as transitioning between visualization objects in a unified view. Voice commands can be interpreted as part of an interactive environment that can provide views of the visualization objects to multiple devices simultaneously.

Abstract: In accordance with an embodiment, described herein are systems and methods for supporting slowly changing dimensions and metadata versioning in a multidimensional database, comprising. A system can comprise a computer that includes one or more microprocessors, and a multidimensional database server executing on the computer, wherein the multidimensional database server supports at least one hierarchical structure of data dimensions. A data dimension can slowly change over time. When such changes occur, metadata associated with the data dimension can be updated. Advantageously, a current snapshot of the data structure can allow searching of previous changes to the slowly changing dimension based upon the metadata.

Abstract: A method and apparatus for performing memory access operations during a memory relocation in a computing system are disclosed. In response to initiating a relocation operation from a source region of memory to a destination region of memory, copying one or more lines of the source region to the destination region, and activating a mirror operation mode in a communication circuit coupled to one or more devices included in the computing system. In response to receiving an access request from a device, reading previously stored data from the source region, and in response to determining the access request includes a write request, storing new data included in the write request to locations in both the source and destination regions.

Abstract: Some embodiments determine characteristics related to a theme or branding of an existing website. Characteristics from an existing website may, for example, facilitate theming or branding of a new website or software product to coordinate with the existing website. A characteristic extraction system may optimize an existing webpage based on target characteristics to be extracted from the existing webpage. Optimizing an existing webpage includes manipulating the webpage source code and/or the webpage data to facilitate extraction of the target characteristics. Optimization may result in removal of data or formatting from the existing webpage that is unnecessary for extraction of the target characteristics.

Abstract: Techniques are provided for creating, organizing, and maintaining a sharded database. A sharded database can be created using user-defined sharding, system-managed sharding, or composite sharding. The sharded database is implemented with relational database techniques. The techniques described provide improvements to load distribution, organization, query processing, and schema propagation in a sharded database.

Abstract: In accordance with an embodiment, the system provides support for large queries in a multidimensional database computing environment. A kernel-based data structure, referred to herein as an odometer retriever, or odometer, that manages pointers to data blocks, contains control information, or otherwise operates as an array of arrays of pointers to stored members. When used with a dynamic flow, the approach enables the system to be used, for example to handle grid queries, Multidimensional Expressions (MDX) queries, or other types of queries in which the potential size of the query can be up to 264 bits.

Abstract: Techniques are provided for mapping tables and columns of a legacy relational schema into synthetic tables that are dedicated for graph analysis. In an embodiment, a computer receives a mapping of relational tables to node tables and edge tables. The node tables contain columns and rows. The edge tables contain columns and rows. The rows of the node tables and the rows of the edge tables define a graph. Based on the mapping and the relational tables, the computer calculates a value of at least one column of at least one row of the node tables. Based on an execution of a query of the graph, the computer returns the value.

Abstract: An apparatus includes a first device having a clock signal and configured to communicate, via a data bus, with a second device configured to assert a data strobe signal and a plurality of data bit signals on the data bus. The first device may include a control circuit configured, during a training phase, to determine relative timing between the clock signal, the plurality of data bit signals, and the data strobe signal. The first device may determine, using a first set of sampling operations, a first timing relationship of the plurality of data bit signals relative to the data strobe signal, and determine, using a second set of sampling operations, a second timing relationship of the plurality of data bit signals and the data strobe signal relative to the clock signal. During an operational phase, the control circuit may be configured to use delays based on the first and second timing relationships to sample data from the second device on the data bus.

Abstract: The disclosed embodiments provide a system that detects execution of malicious cryptomining software in a target computing system. During operation, the system monitors target electromagnetic interference (EMI) signals generated during operation of the target computing system. Next, the system generates a target EMI fingerprint from the target EMI signals. The system then compares the target EMI fingerprint against a set of malicious EMI fingerprints for different pieces of malicious cryptomining software to determine whether the target computing system is executing malicious cryptomining software.

Abstract: An explicit type for a construct is not necessarily specified by a set of code. Where an explicit type is not specified for a particular construct, a compiler performs type inference for the particular construct. If the compiler infers a denotable type is associated with the construct, the compiler proceeds to perform quality checking for the particular construct by evaluating quality conditions with respect to the inferred denotable type. However, if the compiler determines that a non-denotable type is associated with the construct, then the compiler selects a target type determination process based on an attribute of the inferred non-denotable type associated with the particular construct. The compiler determines one or more target types using the selected target type determination process. The compiler performs quality checking for the particular construct by evaluating quality conditions with respect to the target types.

Abstract: Event processing techniques for updating a database in real time based on events in a continuous event stream are disclosed. The techniques can update the database to incorporate information from thousands of received events per second. The events can include metrics measuring milestones for an organizational process defined by a user. Moreover, multiple streams can include metrics from many tenants concurrently. The techniques include receiving a plurality of events corresponding to a time interval and identifying that two events share a value of a key attribute. The techniques then include causing to be generated an in-memory combined database record comprising a combination of first and second attribute information from the two events and the value of the key attribute. In response to a trigger signal, the techniques include transmitting a single message, based at least in part on the combined database record, to update the database.