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: 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 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: 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: 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: 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: 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: 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: 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: 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: 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 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: 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 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: 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.

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, from a first user device, information identifying a group identifier for a first action object. The techniques then include assigning the identifier to the first action object and to at least one other action object.

Abstract: A distributed event processing system is disclosed that receives continuous data streams, registers a continuous query against the data streams, and continuously executes the query as new data appears in the streams. In certain embodiments, the distributed event processing system deploys and executes applications (e.g., event processing applications) by distributing the execution of the application on a cluster of machines within the system. In certain embodiments, the system provides users with the ability to specify logical rules in an application. The system processes the logical rules by generating a DAG of transformations representing the logical rules and converts the DAG of transformations into a logical rules Resilient Distributed Dataset (RDD) DAG of transformations. The system processes events in an event batch against the RDD DAG of transformations to generate a set of output results for the user.

Abstract: A blockchain architecture allows blocks to store both public and private data. The public data may be accessible to any node in the blockchain network, while the private data may be accessible only to nodes specified in an access list, which may be provided when a record is added to the blockchain. When a new record is received, any private fields in the record may be identified and encrypted by a receiving node. The key may then be encrypted and sent with the protected record to other nodes in the access list. These nodes can access the encryption key, decrypt the private fields, and provide a consensus decision to a receiving node. After consensus, the protected record may be added to the blockchain, where the public fields may be freely accessed by any node, and the private fields remain accessible only to nodes in the access list.

Abstract: According to a method and a system a first action chain with a first explicit computer executable instruction that modifies a global variable is received. A second action chain with a second explicit computer executable instruction that reads the global state without modifying the global state is received. The first action chain and the second action chain implement parts of a client application. A first implicit executable instruction with a first local variable copy of the global state is created using the first explicit computer executable instruction as a first template. The client application is executed including executing the first and second action chains in parallel. The second explicit computer executable instruction using the global state is executed and the first implicit computer executable instruction using the first local variable copy is executed.

Abstract: A method and apparatus for reading data from a memory is disclosed. A particular data storage cell may generate a voltage difference between a true bit line and a complement bit line coupled to the data storage cell. A selection circuit may generate a voltage level on a true data line and a complement data line using the voltage levels of the true and complement bit lines. An amplifier circuit may amplify a voltage difference between the true data line and the complement data line to generate a full-swing voltage difference between the true and complement data lines, and may preset the voltage levels of the true and complement data lines to a ground potential based on a reset timing signal.

Abstract: Systems, methods, and other embodiments associated with transmission of messages over a blockchain network are described. In one embodiment, a method includes extracting message data from a source database. The message data is evaluated to identify a message type of the message. A message template is selected from a set of message templates based upon the message template corresponding to the message type of the message. The message data is decomposed into a set of parameter values that are populated into the message template to create a transaction message in the blockchain message format. The transaction message is routed to a blockchain node for routing over the blockchain network.

Abstract: Systems, methods, and other embodiments associated with history and scenario data tracking are described. In one embodiment, a method includes receiving a request for trending analysis on project data. The request includes a trend range and a time basis. The method also includes selecting a set of records that fall within the trend range from an item table associated with the time basis, and generating a snapshot of the project data for each effective time in each selected record in the item table. The generating includes executing a trend view on (i) a history table storing a version history for every record modified, (ii) a transaction table storing a transaction history for every record modified, and (iii) a base table storing base records corresponding to a current version of the records to create the snapshot. The snapshots of project data are returned in response to the request for trending analysis.

Abstract: Implementations generally relate to a method of adding asynchronous validation and conversion capabilities to web components by adding an attribute to an existing web component accessed through, for example, a GUI interface. Such attribute will specify what type of validation or formatting conversion is expected. The web component may provide feedback on errors or changes in an interactive fashion for the user based on web service data. Feedback may be provided to the user asynchronously, without waiting for all user inputs to be validated or converted before displaying the errors or changes to the user. The web component remains completely interactive to the user even while validation or conversion is in progress on the server. Furthermore, the web component will handle multiple user inputs and only display the validation or conversion results from the last user input.

Abstract: In certain embodiments, a Service Deployment Infrastructure (SDI) instance is disclosed. The SDI instance can intelligently allocate resources of a rack to one or more virtual machines as part of provisioning a requested service. The SDI instance can use machine-learning techniques to evaluate historical data associated with a requested service. The machine-learning techniques can be used to generate one or more models that simulate the possible configurations of sizes for virtual machines for a particular service. The one or more models can be accessed at runtime to fit virtual machines of a requested service into servers of a rack in a manner that minimizes unused resources with multi-dimensional constraints.

Abstract: Techniques are described for offloading remote direct memory operations (RDMOs) to “execution candidates”. The execution candidates may be any hardware capable of performing the offloaded operation. Thus, the execution candidates may be network interface controllers, specialized co-processors, FPGAs, etc. The execution candidates may be on a machine that is remote from the processor that is offloading the operation, or may be on the same machine as the processor that is offloading the operation. Details for certain specific RDMOs, which are particularly useful in online transaction processing (OLTP) and hybrid transactional/analytical (HTAP) workloads, are provided.

Abstract: One or more embodiments analyze log records of applications to determine whether a composite rule pertaining to events associated with the log records occurring within a specified time window are satisfied. Satisfaction of the composite rule may facilitate real-time diagnosis and detection of patterns in logs which indicate problems, threats, systemic issues, or performance issues relating to the applications. The composite rule may specify events associated with log records from multiple different applications that occur within a same specified time window and are associated with a same tenant and entity. Satisfaction of the composite rule may be analyzed by a state machine that tracks satisfaction of the individual rules within the composite rule in a sequence of stages. A notification, alert, or alarm may be generated when the composite rule is satisfied.

Abstract: Techniques for resegmenting a partition in a distributed stream-processing platform are provided. The techniques include receiving a trigger to move a partition of the distributed stream-processing platform from a first broker on a first set of physical resources to a second broker on a second a set of physical resources. In response to the trigger, the partition is allocated on the second broker, and the first broker is configured to redirect, to the second broker, requests for new messages after a last offset in the partition without replicating older messages before the last offset to the second broker. Idempotent produce metadata for the partition from the first broker is then merged into the second broker. Finally, metadata for processing requests for the partition is updated to include the second broker.

Abstract: Techniques are disclosure for a data enrichment system that enables declarative external data source importation and exportation. A user can specify via a user interface input for identifying different data sources from which to obtain input data. The data enrichment system is configured to import and export various types of sources storing resources such as URL-based resources and HDFS-based resources for high-speed bi-directional metadata and data interchange. Connection metadata (e.g., credentials, access paths, etc.) can be managed by the data enrichment system in a declarative format for managing and visualizing the connection metadata.

Abstract: Techniques for restricting plug-in application recipes (“PIARs”) are disclosed. A PIAR management application receives a PIAR restriction via an authenticated user of the PIAR management application. The PIAR restriction is applicable to certain users of the PIAR management application. The PIAR restriction identifies functionality of the PIAR management application that would otherwise be available to a user of the PIAR management application if the user had an active account for a particular plug-in application that, once linked to that user in the PIAR management application and associated with a particular PIAR, would be capable of supplying at least part of the functionality. The PIAR management application stores the PIAR restriction, including information to block the restricted functionality. Based on the PIAR restriction, the PIAR management application blocks the restricted functionality. Many different types of functionality may be restricted, in various ways.

Abstract: An event processing system for distributing a continuous query, and processing events in an event stream, is disclosed. The system can synchronize timestamps across all partitions by adding a heartbeat propagator component propagating a heartbeat signal for silent partitions. The system can further include a timestamp tracker component that tracks the maximum observed timestamp across all partitions for each batch, and sends this to each partition. The system can distribute partitions of the events to the worker nodes, and instruct a heartbeat propagator component to generate a heartbeat for a first worker node corresponding to an event in a different partition. The system receives outputs from the worker nodes and combines these into a single result corresponding to a continuous query. The system can further implement a timestamp tracker to select a highest timestamp value of a previous batch, and send the value to the worker nodes.

Abstract: Techniques are disclosed for improved autonomous agents that can provide a recommendation in a non-intrusive, conversational manner. In an aspect, a method determines a first sentiment score for a first utterance and a second sentiment score for a second utterance, each sentiment score indicating an emotion indicated by the respective utterance. The method further identifies that a difference between the first sentiment score and the second sentiment score is greater than a threshold. The method further extracts a noun phrase from the second utterance. The method identifies a text fragment that includes an entity that corresponds to the noun phrase. The method identifies that the text fragment addresses a claim of the second utterance. The method forms a third utterance that includes the a recommendation related to the second utterance and adds the third utterance to the sequence of utterances after the second utterance.

Abstract: A method, system, and computer program product for managing user identification codes in an internet advertising environment. One aspect implements a system including a database engine to store a plurality of signals comprising characteristics and/or values received from a user device. A user ID generator calculates collision statistics and/or fragmentation statistics to form a first mapping function that is in turn used to generate a plurality of identification codes based at least in part a first set of selected signals. A calibration module produces measurements determined from collision quantities and/or fragmentation quantities using the first mapping function, wherein the measurements are determined by comparing the plurality of identification codes to entries in a known ID database. A sequencing module generates updated sequences of mapping functions.

Abstract: Each object is associated with one root metadata record and one or more version-specific metadata records, each corresponding to a version of object data. A conditional command may be conditioned upon whether an object is stored in a storage system. Whether the condition is satisfied is determined based on whether a root metadata record of the object exists. If the condition is satisfied, then metadata is updated to reflect execution of the conditional command. A conditional command may be conditioned upon whether a data version identifier or a metadata version identifier equals a particular value. A conditional command execution engine retrieves the relevant version identifier from a version-specific metadata record, and performs a check on whether the condition is satisfied. If the condition is satisfied, the engine ensures that the version-specific record has not been modified during the check, and updates metadata to reflect execution of the conditional command.

Abstract: The present disclosure relates to systems and methods for providing cloud-based services securely to on-premises networks or other infrastructure. More particularly, the present disclosure relates to systems and methods for enriching first-party data (e.g., data collected directly by an on-premises server) stored within on-premises networks by enabling the on-premises networks to retrieve and process third-party data stored on cloud-based networks. As a technical benefit, cloud-based services can be performed on the first-party data within the on-premises networks.