Patent classifications
G06F9/4862
INTER-DEVICE DATA MIGRATION METHOD AND DEVICE
A method includes: interacting, by a first device, with a user through an application in a data collection range; after determining that the user is not located in the data collection range, determining, by the first device, that the user is located in a data collection range of a second device in a network; and sending, by the first device, to-be-migrated data to the second device, so that the second device continues to interact with the user based on the to-be-migrated data. The second device supports the application, the to-be-migrated data includes information about the application and progress information, and the progress information indicates progress of interaction between the first device and the user.
Mobile application state identifier framework
Systems and methods are provided for sharing or recreating a state from a mobile device. For example, a mobile application state identifier can include a protocol identifier, a target task component associated with a mobile application executing when the application state identifier is generated and a sub-task component related to a user-interface active in the mobile application when the application state identifier is generated. The application state identifier can also include a user input component reflecting actions taken by a user during execution of the mobile application. A method can include generating, on a first mobile device, an application state identifier and transmitting the application state identifier to a second mobile device, wherein the second mobile device opens a mobile application associated with the target task to a user-interface corresponding to the sub-task component in response to receiving the application state identifier.
Live migration of containers based on geo-location
Embodiments of the present invention provide methods, systems, and computer program products for container communication. In an embodiment, it is determined whether a message is going to a container on a same machine or to a container on a machine at a geographically different location. If it is determined that the message is going to a container on a machine at a geographically different location, then it is determined whether a predetermined threshold has been reached. If it is determined that the predetermined threshold has been reached, then the container from a first machine is migrated to the container on the container on the machine at the geographically different location. A data tracking structure is used to visually represent the migration of containers to other machines.
Multi-agent plan recognition
Techniques for solving a multi-agent plan recognition problem are provided. In one example, a computer-implemented method comprises transforming, by a device operatively coupled to a processor, a problem model and an at least partially ordered sequence of observations into an artificial intelligence planning problem through a transform algorithm. The problem model can comprises a domain description from a plurality of agents and a durative action. Furthermore, at least one of the observations of the at least partially ordered sequence of observations can be a condition that changes over time. The computer-implemented method further comprises determining, by the device, plan information using an artificial intelligence planner on the artificial intelligence planning problem. The computer-implemented method further comprises translating, by the device, the plan information into information indicative of a solution to the artificial intelligence planning problem.
Executing graph-based program specifications
A graph-based program specification includes components corresponding to tasks and directed links between ports of the components, including: a first type of link configuration defined by respective output and input ports of linked components, and a second type of link configuration defined by respective output and input ports of linked components. A compiler recognizes different types of link configurations and provides in a target program specification occurrences of a target primitive for executing a function for each occurrence of a data element flowing over a link of the second type. A computing node initiates execution of the target program specification, and determines at runtime, for components associated with the occurrences of the target primitive, an order in which instances of tasks corresponding to the components are to be invoked, and/or a computing node on which instances of tasks corresponding to the components are to be executed.
Task delegation and cooperation for automated assistants
The present disclosure provides task delegation and cooperation for automated assistants. In one example, a method includes receiving, at a centralized support center that is in contact with a plurality of automated assistants including a first automated assistant and a second automated assistant, a request to perform a task on behalf of an individual, formulating, at the centralized support center, the task as a plurality of sub-tasks including a first sub-task and a second sub-task, delegating, at the centralized support center, the first sub-task to the first automated assistant, based on a determination at the centralized support center that the first automated assistant is capable of performing the first sub-task, and delegating, at the centralized support center, the second sub-task to the second automated assistant, based on a determination at the centralized support center that the second automated assistant is capable of performing the second sub-task.
Program executing apparatus and program execution method
According to one embodiment, a program executing apparatus includes an event management portion to configure migration timing of the program on the basis of a state of the program being executed at reception of a migration request from the program, and a state transmission portion to migrate state information of the program on the basis of the migration timing configured in the event management portion.
System and method for migrating an agent server to an agent client device
In a network of mobile agents, data integrity can be improved by providing an agent server that can migrate between devices operating in the region of interest (ROI). The agent server distributes agent clients onto devices in the ROI and provides agent server services to the agent clients, including receiving and storing data from the agents. When the agent server device is to leave the ROI, the agent server can migrate to any device executing an agent client and continue to provide the agent server services, including data collection and aggregation, from the device to which the agent server has migrated.
System and method for live migration for software agents
A computer-implemented method, computer program product, and computing system is provided for switching between software agents. A first software agent communicatively coupled to a host device and at least one server may be identified. A configuration file associated with the first software agent may be transformed for operation with a second software agent. The first software agent may be switched to the second software agent in response to transforming the configuration file associated with the first software agent.
HIGHLY AVAILABLE DISTRIBUTED QUEUE USING REPLICATED MESSAGES
Methods and systems for implementing a highly available distributed queue using replicated messages are disclosed. An enqueue request is received from a client at a particular queue host of a plurality of queue hosts. The enqueue request comprises a message and a replica count greater than one. One or more copies of a replication request are sent from the particular queue host to one or more additional queue hosts. The replication request comprises the message. The quantity of copies of the replication request is determined based at least in part on the replica count. An initial replica of the message is enqueued at the particular queue host. One or more additional replicas of the message are enqueued at the one or more additional queue hosts. A quantity of the one or more additional replicas is determined based at least in part on the replica count.