Abstract: A data aggregation processing method includes data aggregation processing that is performed by a distributed database system, and both data storage and data aggregation processing that are performed by a distributed database, with no need to set up an additional processing system for data aggregation processing. Therefore, data does not need to be replicated and separately sent to the distributed database system and the additionally set up processing system.

Abstract: A data annotation method includes receiving first to-be-annotated data sent by a user, where the first to-be-annotated data is at least one of an image, a point cloud, and a depth map; obtaining, from a multimodal foundation model library, a target vertical-domain multimodal foundation model corresponding to a service scenario to which the first to-be-annotated data belongs; receiving a first downstream task selection message sent by the user, where the first downstream task selection message indicates a first annotation type performed on the to-be-annotated data; obtaining, from a downstream task model library, a target downstream task model that corresponds to the service scenario to which the first to-be-annotated data belongs and that is used for performing the first annotation type; and annotating the first to-be-annotated data based on the target vertical-domain multimodal foundation model and the target downstream task model.

Abstract: This disclosure discloses a fault analysis method and apparatus, a compute device cluster, and a readable storage medium, and relates to the field of computer technologies. The method is applied to a cloud server. The cloud server is configured to run a plurality of services that have a call relationship. The method includes: obtaining a tag of a first service, where the first service is any one of the plurality of services; obtaining link call information of a related service of the first service based on the tag of the first service; and obtaining, based on the link call information, a topology diagram corresponding to the first service, and performing fault analysis on the first service based on the topology diagram corresponding to the first service.

Abstract: A function management method includes: receiving a function call trigger event triggered by a user for an objective function; obtaining functionality classification information of the objective function based on a function identifier of the objective function; determining, based on the functionality classification information of the objective function and a mapping relationship between a function functionality and a container type, a target container type matching the functionality classification information of the objective function; allocating a container of the target container type to the objective function from a container resource pool; and loading a code package of the objective function in the container to perform corresponding system call behavior.

Abstract: This disclosure provides a data processing method, including: obtaining first event data; creating, for the first event data, a first trigger that indicates first window-expiration time; executing data computing based on event data within a first time window, obtaining a first computation result used to update a database, and outputting the first computation result, where the event data within the first time window includes the first event data; and when the first window-expiration time indicated by the first trigger arrives, executing data computing based on event data within a second time window, obtaining a second computation result used to update the database, and outputting the second computation result, where the event data within the second time window does not include the first event data.

Abstract: Embodiments of this application disclose a task processing method and apparatus. The method in embodiments of this application includes: A compute device obtains a mathematical model expression and instance data of a to-be-solved problem, where the mathematical model expression includes an objective function or a constraint condition, and the instance data indicates a value of a coefficient of the mathematical model expression; decomposes the to-be-solved problem into N subproblems based on the mathematical model expression and the instance data of the to-be-solved problem; and allocates, based on a computation amount of each of the N subproblems, the N subproblems to M threads for parallel execution, where N is greater than M, each of the M threads processes one or more subproblems, and a difference between computation amounts required by the M threads for respectively processing the one or more subproblems is less than or equal to a preset threshold.

Abstract: Computer systems, container management methods, and apparatuses are provided. In an implementation, a method comprises receiving a container creation request sent by a container cluster management node, wherein the container cluster management node is connected to the offloading card inserted in and communicably coupled to a computing node, obtaining a container image based on the container creation request, and indicating, through a communication channel established between the offloading card and the computing node, the computing node to create a container on the computing node based on the container image.

Abstract: The disclosure relates to a technique for processing a sequence of transactions to maintain consistency in a distributed system. A node receives a first transaction from a client for a data record associated with a first timestamp. The node identifies a second transaction for the data record that conflicts with the first transaction, where the identified second transaction has a second timestamp that is a most recent transaction stored in the node. A determination is then received by the node of a transmission status of the second transaction, and a result of the first transaction is transmitted to fulfill the first transaction received from a client based on the determined transmission status, fulfillment of the first transaction occurring after a full transmission time period of the first transaction is greater than or equal to a minimum transaction latency (MTL) of the distributed system.

Abstract: A method and a system for double-objective learned indexing in a key-value store is disclosed. The key-value store is a log-structured merge-tree based store. A sorted sting table is divided into data blocks, where a sum of values of the keys in each data block is equal to or less than the maximum block size value. A piecewise linear approximation function is generated for the plurality of data blocks, where the maximum interpolation error of the piecewise linear approximation function is equal to or less than the model error value. The maximum block size value and the model error value are provided by the reinforcement learning agent. Following receipt of the lookup query request to find the target key, the system initiates a discovery operation to discover a data block among the data blocks and generates a search range for the discovered data block.

Abstract: An application page development method includes a static page of a target application being first obtained, and then an application page including an interaction function corresponding to interaction description information being generated based on the interaction description information input by a user and the static page. In other words, the application page has a function of interacting with the user.

Abstract: Methods and systems for selecting a target model for an unlabeled dataset of a dataset provider, the target model for generating labels for the unlabeled dataset. The method comprises acquiring the unlabeled dataset from the dataset provider; acquiring a first candidate model from a first model provider and a second candidate model from a second model provider, generating a first usefulness score for the first candidate model and a second usefulness score for the second candidate model using the unlabeled dataset, the first and second usefulness scores being indicative of likelihood that the first and second candidate models generate accurate labels for the unlabeled dataset respectively; selecting the first candidate model as the target model using the first usefulness score and the second usefulness score; and causing generation of the labels from the unlabeled dataset using the target model.

Abstract: Embodiments of this application disclose an image rendering method and apparatus, and a related device, and belong to the field of computer vision technologies. In embodiments of this application, for any to-be-rendered object, a three-dimensional geometric model and three-dimensional material information of the object are extracted through an implicit object model of the object, an explicit object model of the object is displayed on a frontend interaction interface based on the three-dimensional geometric model and the three-dimensional material information, a display attribute of the explicit object model is edited. In other words, only one implicit object model needs to be obtained, and an image rendering solution in which an implicit object model and an explicit object model are combined can be implemented through the method provided in embodiments of this application, thereby improving editability of an image rendering process and ensuring high realism of a rendering result.

Abstract: This application discloses a three-dimensional data obtaining method and a related apparatus, and relates to the field of internet technologies. The method includes: receiving a data obtaining request sent by a user terminal, where the data obtaining request carries a target uniform resource locator URL and three-dimensional indication information, the target URL is a URL of target virtual space, and the three-dimensional indication information indicates a target three-dimensional model in the target virtual space; obtaining data of the target three-dimensional model based on the target URL and the three-dimensional indication information; and sending the data of the target three-dimensional model to the user terminal. In this application, three-dimensional data is sent to the user terminal via a content delivery network, so that a three-dimensional data delivery speed can be improved.

Abstract: This application discloses a bus network technology-based packet forwarding method and apparatus, and a readable storage medium, and belongs to the field of computer communication technologies. A computer system includes a bus switch, a plurality of processors, and a plurality of NICs. The bus switch is connected to the plurality of processors, and the bus switch is further connected to the plurality of NICs. The bus switch obtains a packet generated by a first processor in the plurality of processors, determines that a destination IP address of the packet is an IP address of a first NIC in the plurality of NICs, and forwards the packet to a second processor according to a routing rule. The second processor is a processor that is in the plurality of processors and that corresponds to the first NIC.

Abstract: A vulnerability fixing code detection meth includes that obtaining commit information of open-source software, where the commit information includes a code snippet in a commit and text information associated with the code snippet; inputting the commit information into a first language model for identification, to obtain function change information and test case information; inputting the function change information into a vulnerability fixing identification model to obtain a vulnerability fixing code snippet for a target vulnerability, and inputting the test case information into a vulnerability test case identification model to obtain a test case code snippet for the target vulnerability; and then inputting the vulnerability fixing code snippet for the target vulnerability and the test case code snippet for the target vulnerability into a second language model for integration and identification, to obtain an identification result.

Abstract: A code recommendation method includes obtaining code generation information, where the code generation information is used to describe a programming task of a code; generating at least one candidate code based on the code generation information; determining a to-be-fixed candidate code from the at least one candidate code, where the to-be-fixed candidate code includes an erroneous parameter, and the erroneous parameter does not meet at least one of a syntax constraint or a semantic constraint of a programming language corresponding to the programming task; fixing the erroneous parameter included in the to-be-fixed candidate code to obtain a fixed candidate code; and recommending the fixed candidate code and an unfixed candidate code in the at least one candidate code, where the unfixed candidate code is different from the to-be-fixed candidate code.

Abstract: Apparatus, systems, and methods for global consistency in distributed shared-data databases may be provided. According to an aspect a method may be provided for ensuring strong consistency in data retrieval. The method includes receiving, by a receiving node of a database, a query for a value of a data item in the database. The method may further include, requesting, by the receiving node, from each node of the plurality of nodes a latest timestamp corresponding to a latest transaction. The method may further include receiving, by the receiving node from said each node of the plurality of nodes, the latest timestamp. The method may further include managing, by the receiving node, a cache of the receiving node based on said each received latest timestamp. The method may further include reading, by the receiving node, the value of the data item.

Abstract: A parameter configuration method includes: receiving a configuration parameter of a service system and a service objective of the service system through a standard interface, performing parameter optimization on the configuration parameter to obtain a recommended parameter value that meets the service objective, and then outputting the recommended parameter value to implement parameter configuration for the service system. The parameter configuration method abstracts parameter configuration problems in different service scenarios into a mathematical problem of inputting and expression through a standard interface. In this way, a universal parameter configuration method is provided without case-by-case parameter configuration. In addition, an expert in the service field can independently complete parameter configuration without artificial intelligence experience.

Abstract: Embodiments of this application disclose a method for solving a system of nonlinear equations. In the method, during an ith iteration of a first system of nonlinear equations, a neural network model can identify, based on input description information of the ith iteration, system of equations feature information of the first system of nonlinear equations during the ith iteration, to efficiently determine a first convergence policy that is appropriate for the first system of nonlinear equations in the current iteration process. In this way, a target convergence policy is determined according to the first convergence policy, and the first system of nonlinear equations is iteratively solved efficiently and accurately according to the target convergence policy, so that performance of iterative solving on a system of nonlinear equations is improved (for example, a solving speed is improved and solving time consumption is reduced).

Abstract: This disclosure provides a graph layout method, applied to a graph layout system including a visualization module, a layout management module, and a layout computation module. The layout management module and the layout computation module perform data exchange by using a shared memory. The method includes: The visualization module receives a layout adjustment request, and provides an adjusted graph layout parameter for the layout management module. The layout management module loads the adjusted graph layout parameter into the shared memory. The layout computation module obtains the adjusted graph layout parameter from the shared memory, performs at least one iterative computation based on the adjusted graph layout parameter, and updates an adjusted graph layout result in the shared memory. The adjusted graph layout result includes at least one of an intermediate result or a final result. The visualization module displays the adjusted graph layout result.