Abstract: A data processing system is configured to perform a computer implemented method for facilitation of efficient processing of electronic messages via a network from message sources. The method includes receiving an electronic message including actionable object data and textual object data from a message source device. The actionable object data includes parameters actionable by at least one data processing transaction device to perform data processing transactions external to the network device and the textual object data including descriptors of the parameters actionable by the at least one data processing transaction device. The textual object data is operable by devices incompatible with the actionable object data. The method includes calculating an execution command for the data processing transaction in response to the actionable object data and based on at least the parameters of the actionable object data.

Abstract: A method of generating content in association with an information search and retrieval system. It begins by receiving a query from a user. The query is semantically-searched to identify a context. A conversation history between the user and the system is identified. An enriched query is then generated by associating to the query both the context and at least a portion of the conversation history. The enriched query is then evaluated/processed by a generative-AI. In response, information associated with the enriched query is received from the generative-AI. A response to the query is then generated using the information, e.g., by passing the information back to the user, by modifying (e.g., editing or supplementing) the information to generate modified information and passing the modified information back to the user, or by dismissing the information. If sensitive information is identified in the utterance, it is masked prior to generating the enriched query.

Abstract: Systems and techniques are disclosed for mobile device network traffic modification and user identity based restrictions on data access. One of the methods includes a user device receiving a request to enter a restricted mode, the restricted mode enforcing compliance of rules associated with electronic personal health information (ePHI). A user interface presented on the user device is updated according to restricted mode. Functionality of the user device is constrained based on the restricted mode, with information generated during the restricted mode being encrypted on the user device.

Abstract: Systems and techniques are disclosed for mobile device network traffic modification and user identity based restrictions on data access. One of the methods includes a user device receiving a request to enter a restricted mode, the restricted mode enforcing compliance of rules associated with electronic personal health information (ePHI). A user interface presented on the user device is updated according to restricted mode. Functionality of the user device is constrained based on the restricted mode, with information generated during the restricted mode being encrypted on the user device.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A method for priority promotion of a service request comprises receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space; determining a number of service requests for the target address space in the set of work requests; and, in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A program (e.g., an operating system) is provided a warning that it has a grace period in which to perform a function, such as cleanup (e.g., complete, stop and/or move a dispatchable unit). The program is being warned, in one example, that it is losing access to its shared resources. For instance, in a virtual environment, a guest program is warned that it is about to lose its central processing unit resources, and therefore, it is to perform a function, such as cleanup.

Abstract: A method and apparatus for use in a computing environment to run a variety of applications in logical partitions. The apparatus includes one or more logical processors (LPs), one or more logical partitions (LPARs) configured to each access a share of processing resources of the LPs in accordance with predefined instructions, and an LPAR manager configured to determine an operational mode of each of the LPARs and any available amount of an excess of the share of the processing resources of the LPs and to dispatch the processing resources of at least a subset of the LPs to the LPARs in accordance with the respective predetermined shares and with respect to the determined operational mode of the respective LPARs and the amount, if any, of the excess share.

Abstract: A method and apparatus of operating a central processing unit (CPU) including a plurality of processors, is provided and includes collecting real-time statistics relating to the processors during dispatching activities, identifying give-help processors from the real-time statistics when the real-time statistics indicate that one or more of the nodes is overworked, and implementing help to be provided by the give-help processor to relieve the overworked node of a portion of the work to be distributed thereto.

Abstract: A method for priority promotion of a service request comprises receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space; determining a number of service requests for the target address space in the set of work requests; and, in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.