Abstract: In accordance with an embodiment, described herein is a system and method for supporting patching in a multi-tenant application server environment. The system can associate one or more partitions with a tenant, for use by that tenant, wherein a partition is a runtime and administrative subdivision or slice of a domain. A patching process can take advantage of high-availability features provided by an application server clustering environment, to apply patches in a controlled, rolling restart, which maintains a domain's ability to operate without interruption, or with zero downtime. The process can be used to automate complex or long running tasks, including preserving an unpatched or prior version of an application server, application, or other software component for possible rollback, or providing automatic reversion in the event of an unrecoverable error.

Abstract: Techniques are disclosed for identifying hypocrisy in text. A computer system creates, from fragments of text, a syntactic tree that represents syntactic relationships between words in the fragments. The system identifies, in the syntactic tree, a first entity and a second entity. The system further determines that the first entity is opposite to the second entity. The system further determines a first sentiment score for a first fragment comprising the first entity and a second sentiment score for a second fragment comprising the second entity. The system, responsive to determining that the first sentiment score and the second sentiment score indicate opposite emotions, identifies the text as comprising hypocrisy and providing the text to an external device.

Abstract: In accordance with an embodiment, described herein is a system and method for behavior injection in a cloud computing platform (cloud platform) or software application, including the use of injection points to modify the operation or behavior of a tenant platform environment. An injection service enables a cloud platform provider to configure software code/behaviors to be injected into cloud platform modules or other components associated with tenants, including mapping, for a tenant-specific globally unique identifier (GUID) associated with a lifecycle activity injection point, a behavior including a platform code or process and metadata that can be used to inject and modify operation of a corresponding module. The described approach enables a cloud platform to expose behavioral aspects of the cloud platform or a software application executing therein, so that they can be controlled or modified in a dynamic manner, from outside of the cloud platform.

Abstract: Techniques are disclosed for creating an attachment between two compute instances. An infrastructure and a generalized method is described for attaching two or more cloud resources (e.g., two compute instances) in spite of the compute resources being provisioned by two different services from different cloud tenancies. An automated process is described that is executed for wiring the compute instances. The automated process can be generally applied to attach any two compute instances providing two different services and provisioned from two different service tenancies.

Abstract: In some aspects, an aggregation system of a cloud system may receive, by an aggregation system of a cloud system and from a data catalog, one or more events from one or more data sources of the cloud system, the one or more data sources having one or more resource types. The aggregation system may store event data to a message queue. The aggregation system of a cloud system may process, by one or more workers of the cloud system, a subset of events from the message queue at a time. The aggregation system may for each event in the subset of events: determine whether an event source has been updated based on information in the event. The aggregation system may in accordance with a determination that the event source has been updated, send an updated status to a dashboard, the dashboard configured to be displayed on a user device.

Abstract: Systems and methods of interface-based ACLs in a virtual Layer-2 network. The method can include sending a packet from source compute instance in a virtual network to a destination compute instance via a destination virtual network interface card (destination VNIC) within a first virtual layer 2 network and evaluating an access control list (ACL) for the packet with a source virtual network interface card (source VNIC). ACL information relevant to the packet can be embedded in the packet. The VSRS can receive the packet and can identify the destination VNIC within the first virtual layer 2 network for delivery of the packet based on information received with the packet and mapping information contained within a mapping table. The VSRS can access ACL information from the packet and can apply the ACL information to the packet.

Abstract: Systems, devices, and methods of the present invention detect deceptive or fake content in text. In an example, a computer system generates, from text a discourse tree that represents rhetorical relationships between fragments of the text. The computer system generates a communicative discourse tree from the discourse tree. The computer system identifies a number of non-trivial rhetorical relations associated with the nonterminal nodes in the communicated discourse tree and, for each terminal edge having a communicative action, a level of nesting of the communicative action. The computer system derives, from the number of non-trivial rhetorical relations and the levels of nesting of the identified communicative actions, a complexity score that is indicative of a level of deception in the text.

Abstract: A ledgered repository of persistent data objects is replicated on a network of persistent storage systems (PSSs) by transactions recorded across multiple blockchains. The blockchains are replicated on each of the PSSs. Using multiple blockchains enables greater parallelism; however, use of the multiple blockchains requires using measures that ensure that transactions distributed across multiple blockchains are applied in way that ensures a level of transactional consistency. Furthermore, the measures are efficient, thereby reducing overhead of maintaining a level of transactional consistency and increasing throughput of applying the transactions using multiple blockchains.

Abstract: Approaches of reassigning a home region from a first data center to a second data center as requested by a customer are described herein. The home region is able to implement write operations to a domain, whereas other data centers cannot implement write operations to the domain. The customer can request the home region being reassigned to another data center such that the customer can utilize the other data center to implement write operations to the domain.

Abstract: A system is provided that processes supply chain events. The system defines a supply chain event type. The system further configures a supply chain event of the supply chain event type as a task generating event, where the task generating event indicates that one or more tasks that are defined for a supply chain financial orchestration flow are to be executed, and where the supply chain financial orchestration flow defines a trade relationship between a first entity and a second entity. The system further receives a supply chain event associated with the supply chain financial orchestration flow. The system further determines whether the supply chain event is a task generating event. The system further executes the one or more tasks that are defined for the supply chain financial orchestration flow where the supply chain event is a task generating event.

Abstract: Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Abstract: Embodiments relate to improving efficiency of data analytics performed on sets of entity data in which different entity properties having very different update frequencies. Time-based analytical queries track the entity states at each moment within a given time window. Analytical queries are executed over a massive number of entity states while using a reasonable memory footprint. The technique partitions the entity properties into partial historical snapshots of data and combines the partial snapshots on demand only as needed to execute analytical queries over business entities. A complete entity state having values for all entity properties is not required to execute most queries. Only partial snapshots including values referenced by the query need to be combined to satisfy the query. Using partial snapshots minimizes data replication, and the snapshots can be efficiently combined into entity states sufficient for query execution.

Abstract: A global state associated with a garbage collection (GC) process is a state assumed by a reference after GC operations for a current GC phase are performed for the reference. A frame state of a frame on a call stack of an application thread tracks a progress of GC operations for references therein. A color watermark is added after a global state change. The frame originally marked by a stack watermark is now marked by the new color watermark. The new color watermark marks a deepest frame on the call stack having the old global state. A color watermark is deleted when the stack watermark meets the color watermark. If the stack watermark is shifted in the call stack to mark the same frame as a color watermark, then the color watermark is deleted. The marked frame is a deepest frame on the call stack having the current global state.

Abstract: Embodiments determine an eligibility of a request for an operation event from a client using a distributed ledger that comprises a plurality of nodes. Embodiments send the request from the client to a primary node of the distributed ledger, the request comprising a first token. Embodiments validate the node at the primary node with a token provider, broadcast the request to all secondary nodes of the distributed ledger and perform a service by the primary node and the secondary nodes in response to the request. Embodiments send a reply to the client from each of the primary node and the secondary nodes when the service is performed successfully by the respective node, the reply comprising a second token. Embodiments then determine an eligibility of the client for the request based on a count of a number of second tokens received by the client.

Abstract: Techniques for reducing overhead in native function calls are disclosed. The system may receive a method invocation instruction for invoking a particular method. The method invocation instruction includes a function descriptor, a method type, and an application binary interface (ABI) descriptor. The function descriptor includes a memory layout corresponding to any data returned by the function and memory layouts corresponding to each argument for the particular method. The system can select an ABI for processing the particular method based on the received ABI descriptor. The system can further associate each argument with a corresponding particular physical register into which the argument is to be loaded. The particular register is selected based on at least the selected ABI and the function descriptor. The system can cause a virtual machine to move each argument into the corresponding associated physical register.

Abstract: The present disclosure provides dynamic routing for data flows to a customer network hosted in the cloud. A plurality of compute instances may share a common virtual IP address. Each of the plurality of compute instances may advertise information to a respective network virtualization device (NVD). The information may include the IP address, cost, and/or active/standby status of the compute instance. The NVD may then provide the information to the control plane of a virtual cloud network (VCN), which may aggregate the information from the plurality of compute instances and generate a forwarding table, which may be sent to the NVDs. These techniques may allow a customer to automatically remove a compute instance whose service host has failed. These techniques may also allow a customer to add compute instances and to route data flows according to an active-standby operation, an equal cost active-active operation, or an unequal cost active-active operation.

Abstract: Techniques are described herein processing asynchronous power transition events while maintaining a persistent memory state. In some embodiments, a system may proxy asynchronous reset events through system logic, which generates an interrupt to invoke a special persistent flush interrupt handler that performs a persistent cache flush prior to invoking a hardware power transition. Additionally or alternatively, the system may include a hardware backup mechanism to ensure all resets and power-transitions requested in hardware reliably complete within a bounded window of time independent of whether the persistent cache flush handler succeeds.

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.

Abstract: A hardware-assisted Distributed Memory System may include software configurable shared memory regions in the local memory of each of multiple processor cores. Accesses to these shared memory regions may be made through a network of on-chip atomic transaction engine (ATE) instances, one per core, over a private interconnect matrix that connects them together. For example, each ATE instance may issue Remote Procedure Calls (RPCs), with or without responses, to an ATE instance associated with a remote processor core in order to perform operations that target memory locations controlled by the remote processor core. Each ATE instance may process RPCs (atomically) that are received from other ATE instances or that are generated locally. For some operation types, an ATE instance may execute the operations identified in the RPCs itself using dedicated hardware. For other operation types, the ATE instance may interrupt its local processor core to perform the operations.

Abstract: The present disclosure generally relates to systems and methods for efficiently and dynamically integrating a chatbot into an application service. More specifically, the present disclosure relates to systems and methods that dynamically build custom components that enable the chatbot to communicate and facilitate the use of the application service directly from the chatbot application. Accordingly, the systems and methods described herein provide the benefit of integrating the chatbot application into an application service without having the application developer write code for the integration, thereby enhancing the computational efficiency of the integration and the reliability of the application service when new services or service functionality are added or modified.

Abstract: Techniques are described herein for prediction of an buffer pool size (BPS). Before performing BPS prediction, gathered data are used to determine whether a target workload is in a steady state. Historical utilization data gathered while the workload is in a steady state are used to predict object-specific BPS components for database objects, accessed by the target workload, that are identified for BPS analysis based on shares of the total disk I/O requests, for the workload, that are attributed to the respective objects. Preference of analysis is given to objects that are associated with larger shares of disk I/O activity. An object-specific BPS component is determined based on a coverage function that returns a percentage of the database object size (on disk) that should be available in the buffer pool for that database object. The percentage is determined using either a heuristic-based or a machine learning-based approach.

Abstract: Described are improved systems, computer program products, and methods for adaptively provisioning an ordered sequence in a clustered database environment. The approach includes identifying a cached list of sequence numbers. A request for one or more sequence numbers in a database environment may be received. A determination may be made to decide whether the request pertains to an ordered sequence. The one or more sequence numbers may be adaptively provisioned to fulfill the request based at least in part upon an independent cache implementation or upon a shared cache implementation.

Abstract: Aspects of the present disclosure include implementing fabric availability and synchronization (FAS) agents within a fabric network. In one example, a first FAS agent executing on a first network device may receive, from a second network device, a command to modify a configuration of a second network device. The first FAS may upgrade the configuration of the first network device based on the command from a current configuration to a new configuration. The first FAS agent increment a state identifier associated with the configuration of the first network device to a new state identifier associated with the new configuration. The first FAS agent may then transmit a control packet that includes the new state identifier. A second FAS agent executing on the second network device may receive the control packet and execute the command to update the configuration of the second network device to the new configuration.

Abstract: Techniques are provided for using context tags in named-entity recognition (NER) models. In one particular aspect, a method is provided that includes receiving an utterance, generating embeddings for words of the utterance, generating a regular expression and gazetteer feature vector for the utterance, generating a context tag distribution feature vector for the utterance, concatenating or interpolating the embeddings with the regular expression and gazetteer feature vector and the context tag distribution feature vector to generate a set of feature vectors, generating an encoded form of the utterance based on the set of feature vectors, generating log-probabilities based on the encoded form of the utterance, and identifying one or more constraints for the utterance.

Abstract: Embodiments are directed to a multi-tenant cloud system. Embodiments receive a request for an authentication action for a user and create an authenticate target action. Embodiments register a cache listener to listen for a target action response that is responsive to the authenticate target action and initiate the authentication action for the user at an on-premise active directory (“AD”) via a bridge. Embodiments wait for a cache callback and, at the cache callback, receive a target action response comprising a result of the authentication action.

Abstract: Methods, systems, and computer readable media for network function (NF) discovery using preferred-locality information are disclosed. One example method for NF discovery using preferred-locality information comprises: at a first NF comprising at least one processor: receiving a message relating to a transaction involving a consumer NF; identifying, from the message, an NF instance identifier (ID) corresponding to the consumer NF; determining, using the NF instance ID and a data store including NF related information and corresponding preferred-locality information, a preferred-locality value; including the preferred-locality value in a preferred-locality information element (IE) of an NF discovery request; and transmitting the NF discovery request toward a second NF.

Abstract: Systems, computer-implemented methods, and computer-readable media for facilitating resource balancing based on resource capacities and resource assignments are disclosed. Electronic communications, received via interfaces, from monitoring devices to identify resource descriptions of resources may be monitored. A resource descriptions data store may be updated to associate each entity of the entities and resource capacities of each resource type of resource types. A first electronic communication, from resource-controlling systems, may be detected. Model data from a model data store may be accessed based on the identified resource descriptions. A first model may be identified based on the model data. A resources assessment corresponding may be generated based on whether a threshold is satisfied based on the first model, a first resource capacity of a first resource type, and the first electronic communication.

Abstract: Herein are techniques that train regressor(s) to predict how effective would a machine learning model (MLM) be if trained with new hyperparameters and/or dataset. In an embodiment, for each training dataset, a computer derives, from the dataset, values for dataset metafeatures. The computer performs, for each hyperparameters configuration (HC) of a MLM, including landmark HCs: configuring the MLM based on the HC, training the MLM based on the dataset, and obtaining an empirical quality score that indicates how effective was said training the MLM when configured with the HC. A performance tuple is generated that contains: the HC, the values for the dataset metafeatures, the empirical quality score and, for each landmark configuration, the empirical quality score of the landmark configuration and/or the landmark configuration itself. Based on the performance tuples, a regressor is trained to predict an estimated quality score based on a given dataset and a given HC.

Abstract: Techniques to create zone maps automatically and efficiently for database query processing are disclosed. The techniques comprise creating a sample dataset to represent an original dataset, building a query workload modeler to characterize a full workload of queries, constructing a clustering quality evaluator to evaluate query performance on a dataset with a certain clustering on the columns, finding a clustering solution by evaluating different applications of the workload to the sample dataset corresponding to different clusterings, and determining which columns of the clustering solution could benefit from zone maps.

Abstract: In accordance with an embodiment, a system and method for dynamic auto-scaling based on roles is provided. Within a system, a node, based upon a load demand, can be duplicated. Additionally, when duplicating a node, the role of the node can be used to determine various characteristics of the duplicated node, taking into account various factors.

Abstract: Techniques are disclosed for deploying a computing resource (e.g., a service) in response to user input. A computer-implemented method can include operations of receiving (e.g., by a gateway computer of a cloud-computing environment) a request comprising an identifier for a computing component of the cloud-computing environment. The computing device receiving the request may determine whether the identifier exists in a routing table that is accessible to the computing device. If so, the request may be forwarded to the computing component. If not, the device may transmit an error code (e.g., to the user device that initiated the request) indicating the computing component is unavailable and a bootstrap request to a deployment orchestrator that is configured to deploy the requested computing component. Once deployed, the computing component may be added to a routing table such that subsequent requests can be properly routed to and processed by the computing component.

Abstract: Methods and systems are disclosed for automated semantic tagging that include detecting a particular thread executed by a processor and identifying a root process of the particular thread. An object-process link may be by linking an object that executed code that called the particular thread to the root process. A thread list of thread definitions of the object may be identified. A particular thread definition that corresponds to the particular thread can be mapped. Resource types to be consumed upon executing an instance of the thread instantiated from the particular thread definition can be identified and the corresponding values of the resource types can be determined. A process specification can be generated that encapsulates the thread definition, resource types and values so as to reproduce a state of the root process at a point in which the particular thread executed.

Abstract: Techniques for expense report submission are disclosed. An expense report submission system receives, via a graphical user interface, a user query that corresponds to requesting whether a particular expense is allowed. The expense report submission system applies the user query to a machine learning model configured to evaluate data associated with expenses against one or more expense policy rules. The expense report submission system generates a response to the user query based at least on a result of applying the user query to the machine learning model. The response to the user query indicates whether the expense is allowed based at least on the expense reporting rule(s). The expense report submission system presents, in the graphical user interface, the response to the user query.

Abstract: Example embodiments employ a selective memory swapping system for selectively placing non-volatile memory devices of a computer system offline, e.g., for background updating, and online, for use by a computer system, whereby the background updating process includes a mechanism for performing forensics analysis and updating of offline memory devices while an alternate memory device is usable by a user of the first computer system.

Abstract: In an embodiment, a computer stores source files and source clone files in a source filesystem. The source clone files are shallow copies of the source files, which initially share the same data blocks as the source files. A source file or a source clone file may eventually be modified, where some of the shared blocks are replaced by modified blocks. In a first phase, all data blocks of all source files that are not clones are replicated to a standby filesystem. A second phase compares each clone file on the source filesystem with its base file to detect a set of differed blocks. The second phase copies the differed blocks into the standby filesystem and, in the standby filesystem, applies the differed blocks to a corresponding clone file. Efficiency of keeping the standby filesystem synchronized with the source filesystem is improved by transferring, from the source filesystem to the standby filesystem, only one copy of only data blocks that are modified.

Abstract: Improved techniques for dialogue management are disclosed. In particular, disclosed systems facilitate improved autonomous agents that can generate a virtual social dialogue from a corpus of text. A virtual social dialogue is a dialogue between autonomous agents and user devices. For example, a virtual social dialogue can include viewpoints, concerns, or questions of various actors on a particular topic. By presenting textual content in this manner, disclosed techniques improve information comprehension and increase the practicality of autonomous agents.

Abstract: A first data accessor acquires a lock associated with a critical section. The first data accessor initiates a help session associated with a first operation of the critical section. In the help session, a second data accessor (which has not acquired the first lock) performs one or more sub-operations of the first operation. The first data accessor releases the lock after at least the first operation has been completed.

Abstract: The present embodiments relate to edge attestation of a host node to access a cloud infrastructure environment. A set of authentication data can be obtained from a console for authorization of the host node. The set of authentication data can include a first endorsement key and an authentication policy identifying characteristics of the host node. The host node can send a request for a network address to connect to the cloud infrastructure environment. The host node can generate a second endorsement key and authentication data that can be verified as corresponding to the set of authentication data received from the console. Responsive to validating the second endorsement key and the received host node authentication data, the network address can be provided to the host node that can be used to connect to the cloud infrastructure environment using the network address.

Abstract: A system is provided for training an inferential model based on selected training vectors. During operation, the system receives training data comprising observations for a set of time-series signals gathered from sensors in a monitored system during normal fault-free operation. Next, the system divides the observations into N subgroups comprising non-overlapping time windows of observations. The system then selects observations with a local minimum value and a local maximum value for all signals from each subgroup to be training vectors for the inferential model. Finally, the system trains the inferential model using the selected training vectors. Note that by selecting observations with local minimum and maximum values to be training vectors, the system maximizes an operational range for the training vectors, which reduces clipping in estimates subsequently produced by the inferential model and thereby reduces false alarms.

Abstract: Resource-to-operation pairs are received at a user interface. The resource-to-operation pairs are stored in a model abstraction as a flat structure. The resource-to-operation pairs in the flat structure are converted into Representational State Transfer (REST) connectors. The REST connectors are encoded in a conventional interface description language. The REST connectors are stored in webpage code. A request is received at the webpage code from the client system for a service of a process step of the process-based software application. A REST connector in the webpage code translates the request to a message that conforms with the service. A response from the service is received at the webpage code. The response from the service is processed at the webpage code. Data retrieved by the processing of the response is accessed via a browser located at the client system.

Abstract: A method for detecting a security vulnerability in code may include obtaining (i) a permitted information flow graph for a permitted query and (ii) a target information flow graph for a target query in the code, determining, by traversing the permitted information flow graph, a permitted information flow including permitted disclosed columns, permitted accessed columns, and a permitted predicate, determining, by traversing the target information flow graph, a target information flow including target disclosed columns, target accessed columns, and a target predicate, comparing the permitted information flow and the target information flow to obtain a comparison result, and determining, based on the comparison result, that the target query includes the security vulnerability.

Abstract: A method for communicating delegated NF discovery results between SCPs and using the delegated NF discovery results for alternate SBI service request routing includes receiving, at a first SCP and from a consumer NF instance, an SBI service request. The method further includes determining that delegated NF discovery is required, and, in response, performing delegated NF discovery on behalf of the consumer NF instance. The method further includes receiving an NF discovery response including delegated NF discovery results. The method further includes sending the SBI service request including the delegated NF discovery results to a second SCP.

Abstract: A system configured to implement Comprehensive Contention-Based Thread Allocation and Placement, may generate a description of a workload from multiple profiling runs and may combine this workload description with a description of the machine's hardware to model the workload's performance over alternative thread placements. For instance, the system may generate a machine description based on executing stress applications and machine performance counters monitoring various performance indicators during execution of a synthetic workload. Such a system may also generate a workload description based on profiling sessions and the performance counters. Additionally, behavior of a workload with a proposed thread placement may be modeled based on the machine description and workload description and a prediction of the workload's resource demands and/or performance may be generated.

Abstract: Techniques are disclosed for tuning external invocations utilizing weight-based parameter resampling. In one example, a computer system determines a plurality of samples, each sample being associated with a parameter value of a plurality of potential parameter values of a particular parameter. The computer system assigns weights to each of the parameter values, and then selects a first sample for processing via a first external invocation based on a weight of the parameter value of the first sample. The computer system then determines feedback data associated with a level of performance of the first external invocation. The computer system adjusts the weights of the parameter values of the particular parameter based on the feedback data. The computer system then selects a second sample of the plurality of samples to be processed via execution of a second external invocation based on the adjustment of weights of the parameter values.

Abstract: A method for automatic domain name system (DNS) configuration for 5G core (5GC) network functions (NFs) includes, at an NF repository function (NRF) including at least one processor, receiving a message concerning a 5GC network function. The method further includes determining a first DNS resource record parameter for the 5GC NF. The method further includes determining a second DNS resource record parameter for the 5GC NF. The method further includes automatically configuring a DNS with a mapping between the first and second DNS resource record parameters for the 5GC NF.

Abstract: The present memory restoration system enables a collection of computing systems to prepare inactive rewritable memory for reserve and future replacement of other memory while the other memory is active and available for access by a user of the computing system. The preparation of the reserved memory part is performed off-line in a manner that is isolated from the current user of the active memory part. Preparation of memory includes erasure of data, reconfiguration, etc. The memory restoration system allows for simple exchange of the reserved memory part, once the active memory part is returned. The previously active memory may be concurrently recycled for future reuse in this same manner to become a reserved memory. This enables the computing collection infrastructure to “swap” to what was previously the inactive memory part when a user vacates a server, speeding up the server wipe process.

Abstract: Techniques for predictive system remediation are disclosed. Based on attributes associated with applications of one or more system-selected remedial actions to one or more problematic system behaviors in a system (e.g., a database system), the system determines a predicted effectiveness of one or more future applications of a remedial action to a particular problematic system behavior, as of one or more future times. The system determines that the predicted effectiveness of the one or more future applications of the remedial action is positive but does not satisfy a performance criterion. Responsive to determining that the predicted effectiveness is positive but does not satisfy the performance criterion, the system generates a notification corresponding to the predicted effectiveness not satisfying the performance criterion.

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: In some aspects, a computing device of the virtual cloud network may select one or more filters from a plurality of filters for a data pipeline, the plurality of filters comprising at least one of: a malware filter; a content filter; a signature filter; a content analyzer; a machine learning filter; or an artificial intelligence filter. A sequential order for the one or more selected filters in the data pipeline can be determined. A message may be received in the data pipeline from a network interface card (NIC), the network interface card being configured as a one-way transfer device. The message in the data pipeline may be filtered by passing the message through the one or more selected filters in the determined sequential order. The computing device of the virtual cloud network may provide logs of events occurring in the data pipeline via a logging network.

Abstract: Columns of a table are stored in either row-major format or column-major format in an in-memory DBMS. For a given table, one set of columns is stored in column-major format; another set of columns for a table are stored in row-major format. This way of storing columns of a table is referred to herein as dual-major format. In addition, a row in a dual-major table is updated “in-place”, that is, updates are made directly to column-major columns without creating an interim row-major form of the column-major columns of the row. Users may submit database definition language (“DDL”) commands that declare the row-major columns and column-major columns of a table.