Abstract: Causing an interface of one application to be embedded into an interface of another application is disclosed, including: receiving a service request from a terminal; determining that the service request is associated with a second application; determining interface data that is used to generate the second interface associated with the second application; and sending the interface data to the terminal. Embedding an interface of one application into an interface of another application is disclosed, including: presenting a first interface associated with a first application; generating a service request for a requested service feature; receiving interface data determined based at least in part on the service request; generating a second interface associated with a second application using the interface data; and embedding and presenting the second interface associated with the second application within the first interface associated with the first application.

Abstract: Methods for providing simultaneous access to a hardware data stream to multiple applications are disclosed. The first application to access a hardware device is responsible for providing and publishing an application programming interface (API) that provides access to the hardware device's data stream, which other applications can then call to gain access to the data stream. In some examples, the first application may be a server process or daemon dedicated to managing the hardware device data stream and publishing the API. In some further examples, the first application may instead may carry out user functionality unrelated to managing the hardware device.

Abstract: An intra-device notational data movement system has a chassis including processing system(s) that are configured to provide a first thread and a second thread. A data mover subsystem in the chassis is coupled to the processing system(s). In a communication transmitted by the first thread, the data mover subsystem identifies a request to transfer data to the second thread that is stored in a first portion of a memory system that is associated with the first thread in a memory fabric management database. The data mover subsystem then modifies notational reference information in the memory fabric management database to disassociate the first portion of the memory system and the first thread and associate the first portion of the memory system with the second thread, which allows the second thread to reference the data using request/respond operations.

Abstract: Toast notifications can be managed via a toast adapter and plugins. A toast adapter can function as an intermediary between a service and an application that interfaces with the Windows toast framework. The service can employ plugins that are configured to send toast requests to the toast adapter. The toast requests can include metadata from which the toast adapter can construct toast content. The toast adapter can then interface with the application to submit the toast content to the Windows toast framework to cause the toast notifications to be displayed. When a user interacts with a toast notification, the arguments that the Windows toast framework provides can be relayed by the application to the toast adapter. The toast adapter may then identify which plugin was the source of the toast notification and provide an indication of the user's interaction with the toast notification to the plugin.

Abstract: Techniques are described for providing an application programming interface (API) that includes a bulk computing task operation. A bulk computing task operation enables users to request performance of any number of computing tasks using a single API request. To submit a bulk task request, a user generates or causes the generation of bulk task data describing a plurality of computing tasks to be executed by an application or service, and causes the bulk task data to be stored at an accessible storage location. A single bulk task API request can be generated that includes an identifier of the storage location at which the corresponding bulk task data is stored. The submission of a bulk task API request results in a synchronous response to the requesting client including an identifier of the request that can be used to request status updates, while processing the request can occur asynchronously using backend resources.

Abstract: Automation windows for robotic process automation (RPA) for attended or unattended robots are disclosed. A child session is created and hosted as a window including the user interfaces (UIs) of applications of a window associated with a parent session. Running multiple sessions allows a robot to operate in this child session while the user interacts with the parent session. The user may thus be able to interact with applications that the robot is not using or the user and the robot may be able to interact with the same application if that application is capable of this functionality. The user and the robot are both interacting with the same application instances and file system. Changes made via the robot and the user in an application will be made as if a single user made them, rather than having the user and the robot each work with separate versions of the applications and file systems.

Abstract: A messaging service may be distributed in a cluster of nodes such that each node includes an instance of the messaging service. To ensure that messages are not lost in the messaging service through a load balancer, addresses for each of the nodes may be accessed, and messages may be retrieved from individual instances of the messaging service by addressing the nodes directly and bypassing the load balancer. To retrieve messages, a client may cycle through the node addresses and retrieve messages until each corresponding message queue is empty. Once a message queue is empty, the client may stop sending requests to the corresponding node until the message queues on the other nodes have been emptied. Various request patterns may be used to cycle through node addresses, including Round Robin patterns and patterns that correspond to traffic patterns seen by the load balancer.

Abstract: Disclosed are some implementations of systems, apparatus, methods and computer program products for facilitating the validation of assessments in an eLearning environment. Validation is facilitated using an assessment definition that includes one or more application programming interfaces (APIs) and identifies, for each of the APIs, a corresponding plugin and handler. Each of the APIs is configurable to obtain at least one user response to a corresponding challenge task via the corresponding plugin and each handler is configurable to validate the user response returned via the corresponding API. The accuracy of the user response to each challenge task is determined via the corresponding handler identified within the assessment definition. APIs can include a third party API, enabling validation of user responses across different systems. The user's knowledge may be assessed based upon the accuracy of the user's responses to all of the challenge tasks.

Abstract: A computer-implemented method comprising receiving and parsing an electrical grid design file to define a plurality of grid objects comprising a power source and a plurality of power lines, generating a grid status data structure comprising a grid coordinate display and the pluralities of grid objects and power lines, assigning electrical properties to and defining location and connection coordinates for the grid objects, defining end coordinates for the power lines, defining electrical connections, associating sensors with the grid objects and power lines, identifying power sources for each grid object, receiving and updating sensor information, and generating and transmitting a display file responsive to the sensor information.

Abstract: Automation windows for RPA for attended or unattended robots are disclosed. A child session is created and hosted as a window including the UIs of applications of a window associated with a parent session. Running multiple sessions allows a robot to operate in this child session while the user interacts with the parent session. The user may thus be able to interact with applications that the robot is not using or the user and the robot may be able to interact with the same application if that application is capable of this functionality. The user and the robot are both interacting with the same application instances and file system. Changes made via the robot and the user in an application will be made as if a single user made them, rather than having the user and the robot each work with separate versions of the applications and file systems.

Abstract: Herein are techniques for automatic tuning of hyperparameters of machine learning algorithms. System throughput is maximized by horizontally scaling and asynchronously dispatching the configuration, training, and testing of an algorithm. In an embodiment, a computer stores a best cost achieved by executing a target model based on best values of the target algorithm's hyperparameters. The best values and their cost are updated by epochs that asynchronously execute. Each epoch has asynchronous costing tasks that explore a distinct hyperparameter. Each costing task has a sample of exploratory values that differs from the best values along the distinct hyperparameter. The asynchronous costing tasks of a same epoch have different values for the distinct hyperparameter, which accomplishes an exploration. In an embodiment, an excessive update of best values or best cost creates a major epoch for exploration in a subspace that is more or less unrelated to other epochs, thereby avoiding local optima.

Abstract: Systems and methods for scheduling an instruction list for parallel processing tasks are provided. An exemplary method includes obtaining an instruction set in the instruction list to be scheduled and determining data dependencies among instructions in the instruction set by performing a data dependency analysis on the instruction set. The method also includes obtaining, based on the data dependencies, selection nodes for performing instruction selections during the scheduling of the instruction list. The method further includes determining, based on a preset rule, an order of instructions in a scheduled instruction list according to a corresponding order of the selection nodes.

Abstract: Computer systems, data processing methods, and computer-readable media are provided to run original networks. An exemplary computer system includes first and second processors and first and second memories. The first memory stores offline models and corresponding input data of a plurality of original networks, and a runtime system configured to run on the first processor. The second memory stores an operating system configured to run on the first processor or the second processor. When the runtime system runs on the first processor, the runtime system obtains an offline model and corresponding input data of an original network from the first memory and controls the second processor to run the offline model of the original network. The offline model of the original network includes model parameters, instructions, and interface data of respective computation nodes of the original network.

Abstract: The present disclosure provides a method for tracking a method-call-chain. The method includes: setting a configuration item for whether to perform a method-call-chain tracking on a current application; intercepting before a method is called, and determining whether call chain information of the method needs to be outputted based on the configuration item; and when it is determined that the call chain information needs to be outputted, recording the call chain information of the method before executing a call request for the method, and outputting the recorded call chain information after the call request for the method is completed. The present disclosure further provides an electronic device and a computer readable storage medium. The method-call-chain tracking method, the electronic device, and the computer readable storage medium provided in the present disclosure allow the tracking of the method-call-chain without rewriting the codes by setting the configuration item and introducing a Spring-AOP.

Abstract: An approach is provided for controlling computer resource usage. A new event in an integration flow in an integration platform is detected. Sender and receiver information is identified and hashed. A portion of data being sent by the sender to the receiver is selected and hashed. It is determined that the hashed sender and receiver information matches a first entry and the hashed selected portion of the data matches a second entry in a pattern repository. A recurring event in the integration flow is identified, where the recurring event uses an amount of computer resources that exceeds a threshold amount. An action is performed which reduces the amount of computer resources used by the integration flow to a new amount that does not exceed the threshold amount.

Abstract: An information processing method that includes acquiring access information related to an access performed via an interface, the access information including an action identifier of an action to be executed via the interface, a response identifier for an execution result of the action, and an interface identifier of the interface. The method further includes determining, based on the action identifier, the response identifier, and the interface identifier, a target access identifier corresponding to the access information. The method further includes determining, based on the access information, time information associated with the access. The method further includes storing the target access identifier and the time information in an associated manner. Through this method, the recorded amount of data information is reduced, and disk space requirements and network transmission loads are lowered.

Abstract: Aspects of the disclosure provide for mechanisms for scheduling execution of quantum algorithm. A method of the disclosure includes: receiving a request to execute a quantum algorithm at a quantum computer system, determining whether the one or more execution environment requirements from the request are satisfied in view of the state of the quantum computer system, responsive to determining that the one or more execution environment requirements are not satisfied in view of the state of the quantum computer system, causing an execution of the quantum algorithm to be delayed until the one or more execution environment requirements are satisfied, and responsive to determining that the one or more execution environment requirements are satisfied in view of the state of the quantum computer system, forwarding the request to execute the quantum algorithm to the quantum computer system to cause the execution of the quantum algorithm.

Abstract: The present disclosure relates to methods, systems and apparatuses for routing API calls to multiple backend systems that share a common API. A system may receive an API call comprising a unique identifier from a client computing device. The system may identify the unique identifier in the API call, and determine a target backend system associated with the unique identifier from the plurality of backend systems. Further, the system may route the API call to the target backend system based on the unique identifier.

Abstract: Systems and methods are provided herein for interfacing between a solver and one or more models. Data comprising at least one solver function is received from a solver interface. Data comprising at least one modeling function corresponding to the solver function is provided to a model interface. The presence of an event occurrence is detected based on interface functions. The interface functions are mapped to the at least one solver function and the at least one modeling function. The interface functions are provided to the solver interface to determine a solution. The solution is initiated for rendering on a graphical user interface.

Abstract: Concepts for controlling interaction with a scalable application are presented. An example includes registering an interface specification to an application, wherein metadata is associated with the interface specification. The method then includes routing a request to instances of the application based on the metadata associated with the interface specification for the application, then combining one or more responses from the instances of the application to form an aggregate response based on the metadata associated with the interface specification for the application.