Abstract: A method, an electronic device, and a computer program product for generating a three-dimensional scene are provided in embodiments of the present disclosure. The method may include obtaining source image features from a plurality of two-dimensional source images associated with the three-dimensional scene to be generated. The method may further include obtaining editing features from an editing instruction input by a user for the three-dimensional scene, each of the editing features respectively forming a feature pair with each of the source image features. Furthermore, the method may include updating the source image features by maximizing a correlation coefficient of each of the feature pairs, and generating the three-dimensional scene based at least on the updated source image features. Embodiments of the present disclosure can realize arbitrary editing of a three-dimensional scene, thus enhancing the experience of human-computer interaction.

Abstract: Embodiments of the present disclosure relate to a method, a device, and a computer program product for executing computer programs. The method includes implementing multiple executions of a deep neural network that includes a hooking portion outside a trusted execution environment (TEE), wherein an operator in the hooking portion, when executed outside the TEE, invokes a corresponding execution operator in the TEE. During the period, the method includes determining, on the basis of the invocation of the corresponding execution operator in the TEE by the operator in the hooking portion, a computation graph corresponding to the hooking portion. The method further includes executing, on the basis of the computation graph, the execution operator corresponding to the hooking portion in the TEE during the execution of the deep neural network after the multiple executions.

Abstract: Techniques are disclosed for processing unit virtualization with scalable over-provisioning in an information processing system. For example, the method accesses a data structure that maps a correspondence between a plurality of virtualized processing units and a plurality of abstracted processing units, wherein the plurality of abstracted processing units are configured to decouple an allocation decision from the plurality of virtualized processing units, and further wherein at least one of the virtualized processing units is mapped to multiple ones of the abstracted processing units. The method allocates one or more virtualized processing units to execute a given application by allocating one or more abstracted processing units identified from the data structure. The method also enables migration of one or more virtualized processing units across the system.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for data storage. The method includes determining, based on attribute information of each of a set of nodes in a distributed storage system, a hash value of each of the set of nodes; determining a node identifier of each of the set of nodes based on geographic location information of each of the set of nodes and the hash value, with the node identifier being used to indicate a logical location of a node in the distributed storage system; and determining, in response to a processing request from a first node in the set of nodes for first data, a target node in the set of nodes based on the node identifier of each of the set of nodes. The target node is used to process the processing request for the first data.

Abstract: Embodiments of the present disclosure include a method, an electronic device, and a computer program product for searching for data. The method includes: determining, in response to receiving at a requesting node a search request for target data, a data identifier of the target data; and determining whether the data identifier of the target data is a local data identifier or a global data identifier. The method further includes: searching for the target data using a local distributed hash table in response to determining that the data identifier is the local data identifier; and searching for the target data using a global distributed hash table in response to determining that the data identifier is the global data identifier. By using this method, it is possible to enable quick lookup of various types of data among nodes in a distributed system in a low-latency, flexible, and efficient manner.

Abstract: Techniques are disclosed for processing unit virtualization with scalable over-provisioning in an information processing system. For example, the method accesses a data structure that maps a correspondence between a plurality of virtualized processing units and a plurality of abstracted processing units, wherein the plurality of abstracted processing units are configured to decouple an allocation decision from the plurality of virtualized processing units, and further wherein at least one of the virtualized processing units is mapped to multiple ones of the abstracted processing units. The method allocates one or more virtualized processing units to execute a given application by allocating one or more abstracted processing units identified from the data structure. The method also enables migration of one or more virtualized processing units across the system.

Abstract: A method includes: receiving, by a repository server, requests for pulling images from a plurality of nodes, wherein an image requested to be pulled by a first node is a first image; detecting, by the repository server, that layers of a plurality of images requested to be pulled by the plurality of nodes all include a common layer; generating, by the repository server, a transmission path of data of the common layer, wherein the transmission path includes that the repository server transmits the data of the common layer to a second node, and the second node distributes the data of the common layer to other nodes; sending, by the repository server, setting information to the first node according to the transmission path; sending, by the repository server, the data of the common layer to the second node; and acquiring, by the first node, the data of the common layer from a third node according to the setting information.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for cross-regional data searching. The method includes acquiring a data identifier of target data in response to receiving a searching request for the target data at a first node. The method includes determining, based on the data identifier, a second node storing metadata of the target data, wherein both the first node and the second node are located in a first region, and the metadata includes the data identifier. The method further includes determining, based on the metadata, a third node storing the target data, wherein the third node is located in a second region different from the first region.

Abstract: Embodiments of the present disclosure relate to a task processing method, a task processing device, and a computer program product. The method includes: receiving a task to be processed by a first neural network at a first computing node; determining that the first neural network failed to process the task; and sending the task to a second computing node for processing by a second neural network at the second computing node, wherein compared with the first neural network, the second neural network has at least one of the following: higher processing consumption and higher processing performance. With the technical solution of the present disclosure, a task can be processed quickly and accurately using a neural network with low processing consumption.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for looking up data. This method includes: acquiring, at a first node, a data identifier for data to be looked up, wherein the first node is located in a system having a layered structure, and the data identifier comprises layer information related to a layer in the layered structure. The method further includes: determining a distance between the data identifier and a node identifier for the first node. The method further includes: determining, based on the distance, a second node that can be used to acquire metadata for the data for acquiring the metadata, wherein the distance is related to positions of the first node and the second node in the layered structure. The method further includes: determining, based on the metadata, a third node storing the data for acquiring the data.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for looking up data. This method includes: acquiring, at a first node, a data identifier for data to be looked up, wherein the first node is located in a system having a layered structure, and the data identifier comprises layer information related to a layer in the layered structure. The method further includes: determining a distance between the data identifier and a node identifier for the first node. The method further includes: determining, based on the distance, a second node that can be used to acquire metadata for the data for acquiring the metadata, wherein the distance is related to positions of the first node and the second node in the layered structure. The method further includes: determining, based on the metadata, a third node storing the data for acquiring the data.

Abstract: The present disclosure relates to a method, a device, and a program product for managing a computing system. In a method, a current state and a plurality of historical states of a computing device in a computing system are acquired, the plurality of historical states respectively describing historical states of the computing device in the computing system at a plurality of historical time points. In response to determining that the current state matches a scheduling type for scheduling the computing device, the plurality of historical states are searched for a historical state matching the current state. A historical scheduling policy associated with the historical state is determined. Based on the historical scheduling policy, a computing task to be executed by the computing device is allocated to at least one other computing device in the computing system.

Abstract: An apparatus comprises at least one processing device configured to establish, utilizing a communication network, a remote collaboration session between first and second computing devices associated with first and second users, and to determine data to be exchanged between the first and second computing devices as part of the remote collaboration session. The first and second computing devices each comprise at least one of an augmented reality and a virtual reality computing device. The processing device is also configured to generate different logical network slices of the communication network, each logical network slice having a set of network characteristics associated with at least one type of the data to be exchanged between the first and second computing devices as part of the remote collaboration session. The processing device is further configured to communicate the different types of data between the first and second computing devices utilizing the logical network slices.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for implementing a blockchain system on a switch. The method includes establishing a first blockchain node and a second blockchain node on the switch, where the first blockchain node includes a first ingress port and a first egress port, and the second blockchain node includes a second ingress port and a second egress port. The method further includes receiving a broadcast or multicast request from a user device through a user port of the switch. The method further includes sending the broadcast or multicast request to the first ingress port of the first blockchain node and the second ingress port of the second blockchain node. Through the embodiments of the present disclosure, a blockchain system can be implemented on a switch, so as to reduce the latency of the blockchain system.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for data storage. The method includes determining, based on attribute information of each of a set of nodes in a distributed storage system, a hash value of each of the set of nodes; determining a node identifier of each of the set of nodes based on geographic location information of each of the set of nodes and the hash value, with the node identifier being used to indicate a logical location of a node in the distributed storage system; and determining, in response to a processing request from a first node in the set of nodes for first data, a target node in the set of nodes based on the node identifier of each of the set of nodes. The target node is used to process the processing request for the first data.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for processing a video. The method includes acquiring a video, where the video includes at least a current frame and a previous frame that are adjacent to each other. The method further includes determining, based on a first pixel value of a pixel in the current frame and a second pixel value of a corresponding pixel in the previous frame, whether the current frame has changed relative to the previous frame. The method further includes determining availability of the current frame for a computer vision task if it is determined that the current frame has changed relative to the previous frame. With the method, video data that needs to be processed is reduced, the task load of a computing device is lowered, system power consumption is improved, and data processing efficiency is improved.

Abstract: Techniques are disclosed for generating a virtual representation (e.g., one or more digital twin models) of a multi-access edge computing system environment, and managing the multi-access edge computing system environment via the virtual representation. By way of example only, such techniques enable understanding, prediction and/or optimization of performance of applications and/or systems operating in the multi-access edge computing environment.

Abstract: Illustrative embodiments of the present disclosure relate to a method, a wearable device, an electronic device, and a computer program product for monitoring a user. The method includes verifying an identity of the user by analyzing user data related to the user and obtained by a wearable device, the user data including at least a first image of a part of the user's body. The method further includes monitoring a relative position of the wearable device with respect to the user based on sensor data obtained by the wearable device if the verification on the identity of the user succeeds; monitoring a surrounding environment of the user based on a second image of the surrounding environment obtained by the wearable device; and monitoring behaviors of the user based at least in part on the monitored relative position and the monitored surrounding environment.

Abstract: Techniques are disclosed for generating a virtual representation (e.g., one or more digital twin models) of a multi-access edge computing system environment, and managing the multi-access edge computing system environment via the virtual representation. By way of example only, such techniques enable understanding, prediction and/or optimization of performance of applications and/or systems operating in the multi-access edge computing environment.

Abstract: The present disclosure relates to a method, a device, and a program product for managing a computing system. In a method, a current state and a plurality of historical states of a computing device in a computing system are acquired, the plurality of historical states respectively describing historical states of the computing device in the computing system at a plurality of historical time points. In response to determining that the current state matches a scheduling type for scheduling the computing device, the plurality of historical states are searched for a historical state matching the current state. A historical scheduling policy associated with the historical state is determined. Based on the historical scheduling policy, a computing task to be executed by the computing device is allocated to at least one other computing device in the computing system.