Abstract: Techniques for natural language processing based on user context include identifying a context of a user and responsive to receiving a request from the user intended for processing by a natural language processing (NLP) model, accounting for the context of the user in relation to the request. A result from the NLP model having accounted for the context of the user is provided.

Abstract: Embodiments include methods, system and computer program products for extracting attributes from embedded table structures in a document. Aspects include identifying a table in the document and identifying one or more headers of the table by locating co-occurring attributes in the table. Aspects also include identifying a plurality of values in the table and creating an annotation for each of the plurality of values value in the table, wherein each annotation includes text extracted from the one or more headers that correspond to the location of the value in the table.

Abstract: Techniques for natural language processing based on user context include identifying a context of a user and responsive to receiving a request from the user intended for processing by a natural language processing (NLP) model, accounting for the context of the user in relation to the request. A result from the NLP model having accounted for the context of the user is provided.

Abstract: Examples described herein provide a computer-implemented method that includes performing a text analysis on unstructured text to identify a restriction associated with a subject. The method further includes identifying an environmental requirement associated with the subject based at least in part on the restriction. The method further includes identifying one or more devices associated with the subject based at least in part on the environmental requirement. The method further includes receiving data from the one or more devices. The method further includes determining device usage information based at least in part on the data. The method further includes determining a compliance of the subject to the restriction based at least in part on the device usage information. The method further includes, responsive to determining non-compliance of the subject, changing a function of the one or more devices.

Abstract: Methods, systems, and computer program products for cognitive model modification are provided. Aspects include receiving a plurality of documents, receiving a cognitive model, identifying a set of cognitive model modification based on an alteration to the cognitive model, and for each cognitive model modification in the set of cognitive model modifications determining an updated concept or surface form based on each cognitive model modification, identifying one or more documents from the plurality of documents based on the updated concept or surface form, adding the one or more documents to a subset of documents, and generating an updated cognitive model based on one or more text analytics performed, by the cognitive model, on the subset of documents.

Abstract: Embodiments include methods, system and computer program products for extracting attributes from embedded table structures in a document. Aspects include identifying a table in the document and identifying one or more headers of the table by locating co-occurring attributes in the table. Aspects also include identifying a plurality of values in the table and creating an annotation for each of the plurality of values value in the table, wherein each annotation includes text extracted from the one or more headers that correspond to the location of the value in the table.

Abstract: Techniques are provided for managing a routing table in a distributed network switch. The distributed network switch is divided into logical switch partitions, or logical networks, that may share a routing table. The shared routing table is configured with counters and thresholds to control utilization of the routing table on a per-logical network basis. When counters exceed certain threshold, the routing table is modified to reduce routing entries within the routing table or pause insertion of new routing entries.

Abstract: Techniques are provided for managing a routing table in a distributed network switch. The distributed network switch is divided into logical switch partitions, or logical networks, that may share a routing table. The shared routing table is configured with counters and thresholds to control utilization of the routing table on a per-logical network basis. When counters exceed certain threshold, the routing table is modified to reduce routing entries within the routing table or pause insertion of new routing entries.

Abstract: Techniques are disclosed for hash-based routing table management in a distributed network switch having multiple switch modules. Upon determining that an attempt to insert a first routing entry into a first hash table of the routing table has failed, a second routing entry, which exists in the first hash table, is attempted to be moved to a second hash table of the routing table. If the move attempt is successful, then the first routing entry is added to the location previously occupied by the second routing entry. If the move attempt is unsuccessful, then a third routing entry, which exists in the first hash table, is attempted to be moved.

Abstract: Apparatuses and methods to manage a global forwarding table in a distributed switch are provided. A particular method may include managing a global forwarding table in a distributed switch. The distributed switch may include a plurality of switch forwarding units. The method may start a timer for an entry in the global forwarding table, and the entry may include a multicast destination address and corresponding multicast membership information. The method may also, in response to expiration of the timer of the entry, check at least one hit status to determine whether at least one switch forwarding unit of the plurality of switch forwarding units has forwarded multicast data to the corresponding multicast membership information of the multicast destination address of the entry. The method may further determine whether the entry is a cast-out candidate based on the hit status.

Abstract: Apparatuses and methods to request multicast membership information in a distributed switch are provided. A particular method may include requesting multicast membership information of a group identified by a multicast destination address in a distributed switch. The distributed switch may include a plurality of distributed switch elements with a plurality of switch forwarding units. The method may generate a miss event indicating that the multicast destination address is unregistered in a switch forwarding unit of a distributed switch element and there is a need for the multicast membership information. The method may also request the multicast membership information of the multicast destination address in response to the miss event. The method may further initiate a query for the multicast membership information of the multicast destination address in response to the request.

Abstract: Techniques are disclosed for hash-based routing table management in a distributed network switch having multiple switch modules. Upon determining that an attempt to insert a first routing entry into a first hash table of the routing table has failed, a second routing entry, which exists in the first hash table, is attempted to be moved to a second hash table of the routing table. If the move attempt is successful, then the first routing entry is added to the location previously occupied by the second routing entry. If the move attempt is unsuccessful, then a third routing entry, which exists in the first hash table, is attempted to be moved.

Abstract: Techniques are provided for managing a routing table in a distributed network switch. The distributed network switch is divided into logical switch partitions, or logical networks, that may share a routing table. The shared routing table is configured with counters and thresholds to control utilization of the routing table on a per-logical network basis. When counters exceed certain threshold, the routing table is modified to reduce routing entries within the routing table or pause insertion of new routing entries.

Abstract: Techniques are disclosed for hash-based routing table management in a distributed network switch having multiple switch modules. Upon determining that an attempt to insert a first routing entry into a first hash table of the routing table has failed, a second routing entry, which exists in the first hash table, is attempted to be moved to a second hash table of the routing table. If the move attempt is successful, then the first routing entry is added to the location previously occupied by the second routing entry. If the move attempt is unsuccessful, then a third routing entry, which exists in the first hash table, is attempted to be moved.

Abstract: Techniques are disclosed for hash-based routing table management in a distributed network switch having multiple switch modules. Upon determining that an attempt to insert a first routing entry into a first hash table of the routing table has failed, a second routing entry, which exists in the first hash table, is attempted to be moved to a second hash table of the routing table. If the move attempt is successful, then the first routing entry is added to the location previously occupied by the second routing entry. If the move attempt is unsuccessful, then a third routing entry, which exists in the first hash table, is attempted to be moved.

Abstract: Apparatuses and methods to manage a global forwarding table in a distributed switch are provided. A particular method may include managing a global forwarding table in a distributed switch. The distributed switch may include a plurality of switch forwarding units. The method may start a timer for an entry in the global forwarding table, and the entry may include a multicast destination address and corresponding multicast membership information. The method may also, in response to expiration of the timer of the entry, check at least one hit status to determine whether at least one switch forwarding unit of the plurality of switch forwarding units has forwarded multicast data to the corresponding multicast membership information of the multicast destination address of the entry. The method may further determine whether the entry is a cast-out candidate based on the hit status.

Abstract: Apparatuses and methods to request multicast membership information in a distributed switch are provided. A particular method may include requesting multicast membership information of a group identified by a multicast destination address in a distributed switch. The distributed switch may include a plurality of distributed switch elements with a plurality of switch forwarding units. The method may generate a miss event indicating that the multicast destination address is unregistered in a switch forwarding unit of a distributed switch element and there is a need for the multicast membership information. The method may also request the multicast membership information of the multicast destination address in response to the miss event. The method may further initiate a query for the multicast membership information of the multicast destination address in response to the request.