Abstract: Systems and methods for a virtual network routing gateway that supports address translation for data plane as well as dynamic routing protocols are disclosed herein. The method can include coupling a gateway with a plurality of ports to a network having a plurality of first IP addresses in a private address space, generating a Network Address Translation (“NAT”) function in the gateway, inputting translation information into the NAT function, advertising routes based on the translation information, populating a unified routing table in the gateway based on the plurality of first IP addresses in the private address space and on translated route advertisements, receive an inbound network packet at the gateway, translating an inbound address of the inbound network packet with the NAT function, and delivering the network packet according to the routing table and based on the translated inbound address.

Abstract: A method for processing NF discovery requests using prioritized lists of preferred locations includes maintaining an NF profiles database including NF profiles of producer NFs registered to provide service to other NFs and a preferred locality attribute mappings database including mappings between preferred locality attributes and prioritized lists of preferred locations. The method includes receiving, from an NF, an NF discovery request including query parameters and a preferred locality attribute. The method further includes accessing the preferred locality attribute mappings database using the preferred locality attribute and obtaining a prioritized list of preferred locations corresponding to the preferred locality attribute, accessing the NF profiles database using the query parameters and identifying NF profiles of producer NFs capable of providing a service indicated by the query parameters, and prioritizing the NF profiles according to the prioritized list of preferred locations.

Abstract: Techniques are described to determine whether an input utterance is unrelated to a set of skill bots associated with a master bot. In some embodiments, a system described herein includes a training system and a master bot. The training system trains a classifier of the master bot. The training includes accessing training utterances associated with the skill bots and generating training feature vectors from the training utterances. The training further includes generating multiple set representations of the training feature vectors, where each set representation corresponds to a subset of the training feature vectors, and configuring the classifier with the set representations. The master bot accesses an input utterance and generates an input feature vector. The master bot uses the classifier to compare the input feature vector to the multiple set representations so as to determine whether the input feature falls outside and, thus, cannot be handled by the skill bots.

Abstract: Techniques are disclosed for automatically inferring software-defined network policies from the observed workload in a computing environment. The disclosed techniques include monitoring network traffic flow originating from network interfaces corresponding to containers that execute components of an application, recording details of a new network connection or a change in the existing network connection, obtaining information concerning the components of the application, identifying metadata for a component involved in the new network connection or the change in an existing network connection based on a comparison of the details of the new network connection or a change in the existing network connection and the information concerning the components of the application, generating a network policy for the component using at least the metadata for the component, and integrating the network policy for the component into a deployment package for the application.

Abstract: A computer program product, system, and computer implemented method for application-level redirect trapping and creation of NAT mapping to work with routing infrastructure for private connectivity in cloud and customer networks. The approach disclosed herein generally comprises a method of leveraging a reverse connection endpoint and IP address mapping controller to capture redirection messages from a private cloud or network (e.g., a service consumer network or a service consumer hybrid cloud). This allows at least the IP address mapping controller to manage a cloud networking infrastructure to provide for a service provider network (e.g., a public cloud) to support applications that overcome the isolation requirements of a private cloud or network to perform useful work. For example, without saddling the private cloud or network user with a heavy pre-configuration burden, the approach disclosed herein supports redirection to dynamically determined IP addresses at the private cloud or network.

Abstract: Server-side custom actions are associated with data fields. The data fields are associated with multiple rows of a client-side spread sheet. The server-side custom actions are defined by one or more web services. Input is received into the data fields of the client-side spread sheet. The input from the data fields is transmitted in a single request to the one or more web services. Results of the server-side custom actions are received. The results are displayed in the client-side spread sheet.

Abstract: Techniques discussed herein include providing a cloud computing environment in which applications are deployed using virtual-machine-based virtualization with a static pool of computing nodes (e.g., substrate nodes, overlay nodes) and container-based virtualization with a dynamic pool of computing nodes (e.g., nodes managed by a container orchestration platform). The control plane functionality may be invoked by a deployment orchestrator (e.g., using a client of the container orchestration platform). In some embodiments, the control plane may include a set of applications that are configured to communicate with core services for certificate generation and rotation, namespace and quota management, metric monitoring and alarming, node authentication, and cluster membership management.

Abstract: Techniques for UNDO and REDO operations in a computer-user interface are disclosed. The techniques enables users to configure entities for UNDO and REDO operations. The techniques also enable users to roll back individual entity to an immediate previous state in one UNDO operation and subsequently to the other previous states. Other entities are not affected by the UNDO operations to the entity.

Abstract: Techniques for managing composite tokens for content access requests are disclosed. A system provides a client device with a composite token to allow the client device to make subsequent requests to access content of a content provider without requiring re-authentication of the client device with each request. The composite token includes an access segment associated with permissions to access content. The composite token further includes a regeneration segment associated with permissions to invalidate the composite token and create a new composite token associated with a same user or session. The system invalidates a previous composite token and regenerates a new composite token if the access segment expires. The system requires re-authentication if the regeneration segment expires or if a composite token is received that is not the most recently-generated composite token.

Abstract: Systems and methods for a VLAN switching and routing service (VSRS) are disclosed herein. A method can include generating a table for an instance of a VSRS, which VSRS couples a first virtual layer 2 network (VLAN) with a second network. The table can contain information identifying IP addresses, MAC addresses, and virtual interface identifiers for instances within the virtual layer 2 network. The method can include receiving with the VSRS a packet from a first instance designated for delivery to a second instance within the virtual layer 2 network, identifying with the VSRS the second instance within the virtual layer 2 network for delivery of the packet based on information received with the packet and information contained within the table, and delivering the packet to the identified second instance.

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 model validation system is described that is configured to automatically validate model artifacts corresponding to models. For a model artifact being validated, the model validation system is configured to dynamically determine the validation checks to be performed for the model artifact, where the validation checks include various validation checks to be performed at the model artifact level and also for individual components included in the model artifact. The checks to be performed are dynamically determined based upon the attributes of the model artifact and of the components within the model artifact. The system is configured to generate a validation report that comprises information regarding the checks performed and the results generated from performing the various validation checks. The validation report may also include information suggesting actions for passing checks that result in a failed check, or for improving the scores of certain validation checks.

Abstract: In some aspects, techniques may include monitoring a primary load of a datacenter and a reserve load of the datacenter. The primary load and reserve load can be monitored by a computing device. The primary load of the datacenter can be configured to be powered by one or more primary generator blocks having a primary capacity, and the reserve load of the datacenter can be configured to be powered by one or more reserve generator blocks having a reserve capacity. Also, the techniques may include detecting that the primary load of the datacenter exceeds the primary capacity. In addition, the techniques may include connecting the reserve generator blocks to at least one of the primary generator blocks and the primary load using a computing device switch.

Abstract: Techniques discussed herein include providing a cloud computing environment in which applications are deployed by a deployment orchestrator using virtual-machine-based virtualization with a static pool of computing nodes (e.g., substrate nodes, overlay nodes) and container-based virtualization with a dynamic pool of computing nodes (e.g., nodes managed by a container orchestration platform). Components of a data plane may be used to deploy containers to micro-virtual machines. A container runtime interface (CRI) may receive a deployment request from the deployment orchestrator. A container networking interface of the data plane may configure network connections and allocate an IP address for the container. A container runtime of the data pane may generate and configure the container with the IP address and run the container within a micro-virtual machine that is compatible with the container orchestration platform.

Abstract: A parametric constant resolves to different values in different contexts, but a single value within a particular context. An anchor constant is a parametric constant that allows for a degree of parametricity for an API point. The context for the anchor constant is provided by a caller to the API point. The anchor constant resolves to an anchor value that records specialization decisions for the API point within the provided context. Specialization decisions may include type restrictions, memory layout, and/or memory size. The anchor value together with an unspecialized type of the API point result in a specialized type of the API point. A class object representing the specialized type is created. The class object may be accessible to the caller, but the full value of the anchor value is not accessible to the caller. The API point is executed based on the specialization decisions embodied in the anchor value.

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

Abstract: The disclosed systems, methods and computer readable media relate to managing Non-Volatile Memory Express (NVMe) over Transmission Control Protocol (TCP) (NVMeOTCP) connections between a smart network interface card (smartNIC) and a block storage data plane (BSDP) of a cloud computing environment. A software agent (“agent”) executing at the smartNIC may manage a number of network paths (active and, in some cases, passive network paths). The agent may monitor the network traffic (e.g., input/output operations (IOPS)) through the paths (e.g., using established NVMeOTCP connections corresponding to the paths). If a condition is met relating to a performance threshold associated with the monitored paths, the agent may increase or decrease the number established NVMeOTCP connections to match real time network conditions.

Abstract: In one embodiment of systems and methods described herein, a computing device is configured to generate and display a user interface including one or more selectable generic options; receive a selection of a data analysis function to perform machine learning; translate the selected function into pre-configured commands for each back-end tool that are specific to each back-end tool for performing the selected function, wherein the pre-configured commands identify and access specific schema with a compatible format for reading the specific schema from each back end tool to expose retail-specific data sets in accordance with the specific schema; execute the preconfigured commands based on the specific schema and retrieve corresponding retail-specific data from a plurality of the back-end tools based on the specific schema; and execute the selected data analysis function on the retrieved retail-specific data from the plurality of back-end tools and generate a data analysis result using Artificial Intelligence-Ena

Abstract: Techniques are disclosed for cryptographically secure shuffling processes for generating and utilizing secrets in an infrastructure-as-a-service (IaaS) environment. In an embodiment, a method comprises generating a source list and a destination list, the source list and destination list association with a sequential format and the source list comprising a plurality of elements in the sequential format; generating a first random number and a second random number; determining a first element in the source list, the first element corresponding to a position in the sequential format of the source list based on the first random number; determining a first destination position in the destination list, the first destination position corresponding to a position in the sequential format of the destination list based on the second random number; and updating the destination list to include the first element in the source list at the first destination position.

Abstract: Techniques for storing and processing large volumes of data by increasing the number of partitions that customers can allocate and use for their streams while minimizing the physical footprint of the partitions is disclosed. In certain examples, the stream partitions are created as different logical partitions on a physical partition in a physical storage cluster of a distributed message streaming system. The disclosed system provides an improved process for reading messages stored in different logical partitions of a physical partition by identifying partition chunks in a physical partition that comprise subsets of messages associated with a logical partition and filtering out partition chunks that do not contain messages associated with the logical partition. The disclosed system reduces the amount of the physical partition that needs to be read to retrieve messages stored in different logical partitions thereby improving the overall performance of the distributed message streaming system.

Abstract: Embodiments forecast demand of an item by receiving historical sales data for the item for a plurality of past time periods including a plurality of features that define one or more feature sets. Embodiments use the feature sets as inputs to one or more different algorithms to generate a plurality of different models. Embodiments train each of the different models. Embodiments use each of the trained models to generate a plurality of past demand forecasts for each of some or all of the past time periods. Embodiments determine a root-mean-square error (“RMSE”) for each of the past demand forecasts and, based on the RMSE, determine a weight for each of the trained models and normalize each weight. Embodiments then generate a final demand forecast for the item for each future time period by combining a weighted value for each trained model.

Abstract: A first set and a second set are identified as operands for a set operation of a similarity analysis task iteration. Using respective minimum hash information arrays and contributor count arrays of the two sets, a minimum hash information array and contributor count array of a derived set resulting from the set operation is generated. An entry in the contributor count array of the derived set indicates the number of child sets of the derived set that meet a criterion with respect to a corresponding entry in the minimum hash information array of the derived set. The generated minimum hash information array and the contributor count array are stored as part of input for a subsequent iteration. After a termination criterion of the task is met, output of the task is stored.

Abstract: Techniques for automatically switching between chatbot skills in the same domain. In one particular aspect, a method is provided that includes receiving an utterance from a user within a chatbot session, where a current skill context is a first skill and a current group context is a first group, inputting the utterance into a candidate skills model for the first group, obtaining, using the candidate skills model, a ranking of skills within the first group, determining, based on the ranking of skills, a second skill is a highest ranked skill, changing the current skill context of the chatbot session to the second skill, inputting the utterance into a candidate flows model for the second skill, obtaining, using the candidate flows model, a ranking of intents within the second skill that match the utterance, and determining, based on the ranking of intents, an intent that is a highest ranked intent.

Abstract: Techniques for a database management system to predict when in the future a materialized view will have a quiet period during which the materialized view will not be stale. This is a followed by an approach that uses the quiet period prediction to determine an optimized schedule for refreshing the materialized view. The approach combines the quiet period prediction with a query rewrite pattern prediction for the materialized view and an estimated refresh duration for the materialized view to determine the optimized refresh schedule for the materialized view.

Abstract: In exemplary embodiments, a computer system detects performance anomalies for user computer services. Physical databases convert physical database KPIs into logical database KPI vectors for individual user services and individual time intervals. Physical application servers convert physical application server KPIs into logical application server KPI vectors for the individual user services and time intervals. Physical web servers convert physical web server KPIs into logical web server KPI vectors for the individual user services and time intervals. A KPI server combines the logical database KPI vectors, the logical application server KPI vectors, and the logical web server KPI vectors for individual time intervals into user service KPI vectors for the individual user services during the time intervals. The KPI server detects outlier user service KPI vectors as compared to normal user service KPI vectors and indicates corresponding computer performance anomalies for the user services.

Abstract: In accordance with an embodiment, described herein is a system and method for dependency analysis for a calculation script in a multidimensional database computing environment. A multidimensional database cube aggregation can be represented as a lattice of blocks or cube, arranged according to a database outline (e.g., intra-dimensional or member hierarchy). When the multidimensional database system performs computations in parallel for a given calculation script, portions of the cube that can be computed concurrently are identified.

Abstract: A server system can receive an input identifying a problem to generate a solution using a machine-learning application. The method selects a machine-learning model template from a plurality of templates based at least in part on the input. The method analyzes one or more formats of the customer data to generate a customer data schema based at least in part a data ontology that applies to the identified problem. The method determines whether the customer data schema is misaligned with one or more key features of the selected machine-learning model template. Based on this determination, the method analyzes the metadata for the selected machine-learning model template to determine what additional information is required to re-align the customer data with the data expectations. The method can include gathering the addition information required to re-align the customer data with the data expectations of the selected machine-learning model template.

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.

Abstract: Described herein are systems and methods for a DAG based transaction processing system and method in a distributed ledger. In accordance with an embodiment, a DAG based transaction processing system and method in a distributed ledger can be introduced. The model can help achieve improved throughput performance. With additional weight mechanism, the final performance can be adjusted based on various business requirements. This is different from existing work that uses linear structure and can achieve better performance.

Abstract: The disclosed embodiments relate to a system that characterizes susceptibility of an inferential model to follow signal degradation. During operation, the system receives a set of time-series signals associated with sensors in a monitored system during normal fault-free operation. Next, the system trains the inferential model using the set of time-series signals. The system then characterizes susceptibility of the inferential model to follow signal degradation. During this process, the system adds degradation to a signal in the set of time-series signals to produce a degraded signal. Next, the system uses the inferential model to perform prognostic-surveillance operations on the set of time-series signals with the degraded signal. Finally, the system characterizes susceptibility of the inferential model to follow degradation in the signal based on results of the prognostic-surveillance operations.

Abstract: The present disclosure relates to systems and methods for an intelligent assistant (e.g., a chatbot) that can be used to enable a user to generate a machine learning system. Techniques can be used to automatically generate a machine learning system to assist a user. In some cases, the user may not be a software developer and may have little or no experience in either machine learning techniques or software programming. In some embodiments, a user can interact with an intelligent assistant. The interaction can be aural, textual, or through a graphical user interface. The chatbot can translate natural language inputs into a structural representation of a machine learning solution using an ontology. In this way, a user can work with artificial intelligence without being a data scientist to develop, train, refine, and compile machine learning models as stand-alone executable code.

Abstract: Techniques described herein include frameworks and models for identifying, analyzing, and addressing hangs within distributed and heterogenous computing environments. A hang detection framework may model a distributed computing environment as a complex forest of interrelated requests. The hang detection framework may generate hang graphs based upon requests that are being processed and/or waited upon within the distributed environment. For example, a node within an acyclic graph may represent an execution entity that is currently processing one or more requests. Directed edges that connect one node to another may represent requests upon which an execution entity is waiting for another execution node to fulfill. The model may be used to isolate and address the root cause of hangs within the computing environment.

Abstract: Techniques are disclosed for managing aspects of identifying and/or deploying hardware of a dedicated cloud to be hosted at a customer location (a “DRCC”). A DRCC may comprise cloud infrastructure components provided by a cloud provider but hosted by computing devices located at the customer's (a “cloud owner's”) location. Services of the central cloud-computing environment may be similarly executed at the DRCC. A number of user interfaces may be hosted within the central cloud-computing. These interfaces may be used to track deployment and region data of the DRCC. A deployment state may be transitioned from a first state to a second state based at least in part on the tracking and the deployment state may be presented at one or more user interfaces. Using the disclosed user interfaces, a user may manage the entire lifecycle of a DRCC and its corresponding hardware components.

Abstract: New data structures for analyzing a log are generated. A hierarchical data structure includes a plurality of hierarchical nodes. Each node is associated with data and metadata. Each node may also be associated with analysis data. Information (data, metadata, and/or analysis data) of an ancestor node is imputed to a descendant node; a descendant node inherits the information of an ancestor node. When determining analysis data for a particular hierarchical node, information from any ancestor node to the particular hierarchical node may be used; however, information from non-ancestor nodes is not necessarily used. A timeline data structure includes a reference to a hierarchical node within a hierarchical data structure and a reference to an event type. The timeline data structure is thereby associated with the information of the referenced hierarchical node and information of any ancestor nodes to the referenced hierarchical node.

Abstract: A computer comprising one or more processors and memory may implement multiple threads that perform a lock operation using a data structure comprising an allocation field and a grant field. Upon entry to a lock operation, a thread allocates a ticket by atomically copying a ticket value contained in the allocation field and incrementing the allocation field. The thread compares the allocated ticket to the grant field. If they are unequal, the thread determines a number of waiting threads. If the number is above the threshold, the thread enters a long term wait operation comprising determining a location for long term wait value and waiting on changes to that value. If the number is below the threshold or the long term wait operation is complete, the thread waits for the grant value to equal the ticket to indicate that the lock is allocated.

Abstract: In accordance with an embodiment, described herein is a system and method for aggregating values through risk dimension hierarchies to create risk models in a multidimensional database. The system can include a cube that stores a plurality of standard risk measures organized into different risk dimension hierarchies, and a pluggable calculation engine executing a plurality of scripts to dynamically operate on any value in the cube. The system can aggregate values through the plurality of risk dimensional hierarchies, and either store an aggregated value against a dimension member, or dynamically calculate the aggregated value on demand. By aggregating values through the risk dimension hierarchies, a plurality of risk models can be built to measure a variety of risks.

Abstract: Methods, systems, and computer readable media for processing binding requests in a telecommunications network. A method includes receiving, at a binding support function (BSF), a first request to create a first binding between a protocol data unit (PDU) session and a first policy and control function (PCF). The method includes creating, at the BSF, the first binding between the PDU session and the first PCF and storing, with the first binding, a first PCF session acceptance timestamp from a first header of the first request. The method includes receiving, at the BSF, a second request to create a second binding between the PDU session and a second PCF. The method includes determining, at the BSF, whether to accept or reject the second request based on a difference between the first PCF session acceptance timestamp and a second PCF session acceptance timestamp from a second header of the second request.

Abstract: Techniques discussed herein relate to provisioning one or more virtual cloud-computing edge devices at a physical cloud-computing edge device. A manifest may be generated/utilized to specify various attributes of the virtual cloud-computing edge devices to be executed at a physical cloud-computing edge device. A first set of resources corresponding to a first virtual cloud-computing edge device may be obtained from memory of a centralized cloud-environment and provisioned at the first virtual cloud-computing edge device. Similar operations may be performed with respect to a second virtual cloud-computing edge device. The techniques described herein split the physical edge device into multiple virtual device resources that can be utilized in combination or separately to extend the functionality and versatility of the physical edge device.

Abstract: Disclosed systems relate to generating questions from text. In an example, a method includes forming a first semantic tree from a first reference text and second semantic tree from a second reference text. The method includes identifying a set of semantic nodes that are in the first semantic tree but not in the second semantic tree. The method includes forming a first syntactic tree for the first reference text and a second syntactic tree for the second reference text. The method includes identifying a set of syntactic nodes that are in the first syntactic tree but not in the second syntactic tree. The method includes mapping the set of semantic nodes to the set of syntactic nodes by identifying a correspondence between a semantic node and a syntactic node, forming a question fragment from a normalized word, and providing the question fragment to a user device.

Abstract: Techniques for generating text content arranged in a consistent read order from a source document including text corresponding to different read orders are disclosed. A system parses a binary file representing an electronic document to identify characters and metadata associated with the characters. The system pre-sorts a character order of characters in each line of the electronic document to generate an ordered list of characters arranged according to the right-to-left reading order. The system performs a layout-mirroring operation to change a position of characters within the modified document relative to a right edge of the document and a left edge of the document. Subsequent to performing layout-mirroring, the system identifies native left-to-right reading-order text in-line with the native right-to-left reading-order text.

Abstract: Systems that determine relationships between network components of a cluster using packet filters are disclosed. A system can identify objects that implement services of a cluster and network connections associated with respective pairs of the objects. The system can also filter out network connections from the identified network connections. The filtering can remove connections between source objects and destination objects based on the destination objects lacking any components that implement a service in cluster. The filtering can also retain network connections between source objects and destination objects based on the source objects including components that each implement at least one service, and based on the second destination object including components that each implement at least one service. Additionally, the system can generate relationship maps and network topologies using the determined relationships.

Abstract: Techniques for managing a software build using a machine learning model are disclosed. A system obtains historical data associated with historical software builds. The historical data includes attribute data for a plurality of development stages associated with a historical software build and labels indicating success or failure for the plurality of development stages. The system trains a machine learning model using the historical data associated with the historical software builds to generate predictions of success or failure of the plurality of development stages. The system receives attributes of a target software build and a selection of a first target development stage of the target software build. The system applies the machine learning model to the target software build to generate a first prediction of success or failure of the first target development stage.

Abstract: The present disclosure relates to systems and methods that use an artificial intelligence (AI) model to generate outputs that can be evaluated to predict which logged entry items match entry request record line items of an entry request record. Additionally, the present disclosure relates to systems and methods for intelligently detecting anomalies within data sets.

Abstract: Methods, systems, and computer readable media for enabling forwarding of subsequent network function subscription updates. A method includes forwarding, from a bootstrapped network function repository function (NRF) in a first region, a subscription creation request from a consumer network function to a target NRF in a second region. The method includes creating, at the target NRF, a subscription for the consumer network function. The method includes generating, at the target NRF, a hint comprising data indicating one or more alternate NRFs each sharing subscription state data with the target NRF. The method includes sending, from the target NRF to the consumer network function, a subscription response message including the hint.

Abstract: Techniques discussed herein are directed to identifying health assessment data of a set of computing instances of a distributed computing system. The health assessment data may be collected from the computing instances and stored in a first distributed cache. When a request for health assessment data for one or more computing instances is received, the health assessment data may be retrieved from the first distributed cache, provided to the requesting entity, and stored in a second distributed cache. A subsequent request may cause new health assessment data to be retrieved from the first distributed cache and compared to the stored data of the second distributed cache. Changes in the health assessment data may be identified and data indicating those changes may be provided in response to the subsequent request. One or more remedial actions may be performed in response to the health assessment data obtained.

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

Abstract: Systems, devices, and methods of the present invention involve discourse trees. In an example, a method involves generating a discourse tree. The method includes identifying, from the discourse tree, a central entity that is associated with a rhetorical relation of type elaboration and corresponds to a topic node that identifies a central entity of the text. The method includes determining a subset of elementary discourse units of the discourse tree that are associated with the central entity. The method includes forming generalized phrases from the subset of elementary discourse units. The method includes forming tuples from the generalized phrases, where a tuple is an ordered set of words in normal form. The method involves responsive to successfully converting an elementary discourse unit associated with an identified tuple into a logical representation, updating the ontology with an entity from the identified tuple.

Abstract: A tool may provide a real-time analysis of potential bottlenecks while threads wait on locks held by other threads. For each job currently operating on the server instance, the tool may access a list of threads and retrieve call stacks associated with those threads. The call stacks may then be analyzed to identify threads that are holding a lock, along with any corresponding threads that are waiting on the lock. The locks may be held on memory resources or any other type of computing resource. These bottlenecks may be identified and an adjustment of the configuration of the server instance may be triggered in response that is configured to reduce the likelihood that these types of bottlenecks may occur in the future.

Abstract: The present disclosure relates generally to determining intent based upon speech input using a dialog system. More particularly, techniques are described using matching-based machine learning techniques to identify an intent corresponding to speech input in a dialog system. These procedures do not require training when intents are added or removed from the set of possible intents.

Abstract: Techniques for generating formatting tags for textual content obtained from a source electronic document are disclosed. A system parses a digital file to obtain information about characters in an electronic document. The system applies tags to text generated based on the textual content of the electronic document by creating segments of textually-consecutive characters and applying corresponding text formatting style tags to the segments. The system further identifies segments of text overlapping bounding boxes in the electronic document. The system generates textual content including a segment of text and a corresponding hyperlink associated with the segment of text. The system further generates textual content by selectively applying line breaks from the source electronic document in the textual content.