Abstract: Techniques are disclosed for live migrating an existing connection between a local gateway in a virtualized computing environment and a remote gateway. The existing IKE and IPSec connection are frozen. MMSA and QMSA data for the IKE and IPSec connection are saved. Data for the existing IKE and IPSec connection is cleared at the local gateway without sending a message to the remote gateway. The saved MMSA and QMSA data are transferred to a new local gateway. Using the saved MMSA and QMSA data, a state for the existing IKE and IPSec connection is reconstructed at the new local gateway. The existing IKE and IPSec connection is enabled.

Abstract: The present disclosure relates to platform configured to recommend Visual and Execution templates to automate exploration across one or more disparate systems. The platform is configured for receiving data from a target system. Further, the platform is configured to identifying a set of best fit templates, from a set of templates. In one embodiment, the set of templates may comprise one or more templates created by the user, one or more templates published by other users associated with the user, and one or more system generated templates. The platform is configured to analyze the set of templates based on the type of data received from the target system and a set of predefined rules to identify a subset of best fit templates (discovered Templates) from the set of templates. Furthermore, the platform is configured to execute the subset of best fit templates for performing one or more data processing operations.

Abstract: One or more implementations allow for systems, methods, and devices for teaching and/or assessment of one or more spoken language skills through analysis of one or more pronunciation characteristics of one or more individual language components of a teaching string audio sample data that corresponds to the user's speaking of the teaching string.

Abstract: The present invention provides a stable pharmaceutical composition to be used with pressurized metered dose inhalers and comprises a ?2 agonist, a propellant, a co-solvent, an organic acid(s) and optionally water. The invention further provides stable pharmaceutical composition comprising ?2 agonist, an inhaled corticosteroid and/or a long acting muscarinic antagonist. The invention also provides pharmaceutical composition for the treatment or prophylaxis of asthma, chronic obstructive pulmonary disease (COPD), rhinitis or as adjunct therapy for cystic fibrosis, non-cystic fibrosis bronchiectasis, lung infections or pulmonary fibrosis.

Abstract: Embodiments herein provide a combustion system comprising a combustion chamber having a catalyst bed, and a vessel for storing a propellant at a predefined pressure. The vessel comprising a first valve for controlling a flow of the propellant over the catalyst bed inside the combustion chamber and an input provided at the first valve, for injecting the propellant inside the combustion chamber at a predefined duration of injection for each cycle of injection. A predefined quantity of the propellant is injected in each cycle of the injection. The combustion system further comprises one or more glow plugs for maintaining a predefined temperature within the catalyst bed and an ignition glow plug for providing a source of ignition for combustion of the propellant inside the combustion chamber.

Abstract: The present disclosure relates to systems for identifying instances of natural language input, determining intent classifications associated with instances of natural language input, and generating responses based on the determined intent classifications. In particular, the disclosed systems intelligently identify and group instances of natural language input based on characteristics of the user input. Additionally, the disclosed systems determine intent classifications for the instances of natural language input based message queuing in order to delay responses to the user input in ways that increase accuracy of the responses, while retaining a conversational aspect of the ongoing chat. Moreover, in one or more embodiments, the disclosed systems generate responses utilizing natural language.

Abstract: A B?-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the B?-tree are therefore characterized by having a maximum allowed size that can vary over time.

Abstract: Embodiments herein are directed towards systems and methods for performing range lookups in B?-trees. One example method involves receiving a request to return key-value pairs within a range of keys from the B?-tree. The B?-tree includes a plurality of nodes, each node being associated with a buffer that stores key-value pairs. The method further involves determining a fractional size of the range of keys. The method further involves, for each level of the B?-tree, obtaining from within one or more buffers of one or more nodes of the level, a set of key-value pairs within the range of keys up to a size equal to the fractional size and transferring the set of key-value pairs to a result data structure. The method further involves sorting and merging all key-value pairs in the result data structure and returning the result data structure in response to the request.

Abstract: A system includes reception of a first query including a first temporary materialized view, where the first temporary materialized view associated with a first view and a first temporary table. The first temporary table is refreshed if it is determined that the first temporary materialized view is stale, and the first query is executed using a result set cached in the first temporary table. The first temporary table caches the result set for the remainder of the current database session.

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.

Abstract: A path suggestion tool in a Software-Defined Networking (SDN) architecture to predict a router's future usage based on an analysis of the router's historical usage over a given period of time in the past and to recommend a routing path within the network in view of the predicted future usages of the routers/switches in the network. The path suggestion tool is an analytical, plug-and-play model usable as part of an SDN controller to provide more insights into different routing paths based on the future usage of each router. A Long Short-Term Memory Recurrent Neural Network (LSTM-RNN) model in the suggestion tool analyzes the historical usage data of a router to predict its future usage. A Deep Boltzmann Machine (DBM) model in the suggestion tool recommends a routing path within the SDN-based network upon analysis of the LSTM-RNN based predicted future usages of routers/switches in the network.

Abstract: Techniques for query intent clustering for automated sourcing are described. In an example embodiment, disclosed is a system comprising a processor, a storage device, and a memory device holding an instruction set executable on the processor to cause the system to perform operations. The system obtains one or more recent hire member profiles used as a basis for a search on member profiles in a social networking service. Additionally, the system extracts one or more attributes from the one or more recent hire member profiles and stores the attributes on the storage device. Moreover, the system identifies skills clusters based on the extracted attributes retrieved from the storage device. Furthermore, the system generates a search query based on the identified skills clusters. Then, a search can be performed on member profiles in the social networking service using the generated search query, returning one or more result member profiles as candidates.

Abstract: Embodiments described herein are related to bulk loading data into a B-tree. Embodiments include generating a first leaf node of a B-tree by allocating a first page for the first leaf node from a leaf page queue comprising a first plurality of sequential pages; and writing one or more tuples to the first page allocated for the first leaf node. Embodiments further include generating an parent node for the first leaf node and a second leaf node of the B-tree by allocating a third page for the parent node from an parent page queue comprising a second plurality of sequential pages, the parent node comprising a first indication of the first leaf node and a second indication of the second leaf node, the first indication and the second indication stored in the third page allocated for the parent.

Abstract: A request to establish a communication session between a first communication endpoint to a second communication endpoint is received. A determination is made that the request to establish the communication session requires an application to be inserted into the communication session between the first communication endpoint and the second communication endpoint. For example, the application may be a call recording application. A first processing resource in a first idle communication endpoint is selected based on an idleness factor of the first processing resource. The application is sent to the first idle communication endpoint. The application in the first idle communication endpoint is then inserted into the communication session between the first communication endpoint and the second communication endpoint.

Abstract: Systems, apparatuses and methods may provide for establishing a hardware-based chain of trust in a computing system and extending the hardware-based chain of trust to a container manager and a containerized application on the computing system. Additionally, the containerized application may be checked for its trust and security while it is launched, via the container manager, on the computing system. In one example, extending the hardware-based chain of trust includes conducting a pre-boot measurement of the container manager, a root of trust measurement agent, and one or more packages associated with the containerized application, and verifying the pre-boot measurement of the platform/host and the application itself prior to the containerized application being launched.

Abstract: Techniques for providing explanations of candidate search queries are described. The queries can be created using query intent clustering in an automated sourcing tool. In an example embodiment, disclosed is a system that obtains one or more current candidate member profiles used as a basis for a search on member profiles in an online system. Additionally, the system extracts one or more attributes from the one or more current candidate member profiles. Moreover, the system identifies query intent clusters based on the extracted one or more attributes. Furthermore, the system generates a search query based on the identified query intent clusters. Next, an explanation of the search query can be displayed on a display device of the system. In some embodiments, the online system hosts a social networking service that includes the member profiles, and the identified query intent clusters include skills clusters.

Abstract: A tribo-electrostatic separation process for beneficiation of bauxite minerals is disclosed. The process may include one or more steps of grinding, drying, de-agglomeration, air classification and electrostatic separation.

Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.

Abstract: The subject matter described herein is generally directed towards tracking and recovering a disk allocation state. An on-disk log of operations is maintained to describe operations performed to an in-memory partial reference count map. Upon a crash of a host computing device during a checkpoint operation to an on-disk complete reference count map, the on-disk log of operations is used to undo and then redo the operations, or just redo the operations. In this manner, a disk allocation state prior to the crash is recreated in the on-disk complete reference count map with atomicity and crash consistency.

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.