Abstract: The present disclosure provides a method and system for determining an optimal flight height of an unmanned aerial vehicle (UAV), an electronic device, and a medium. The method includes: obtaining a multi-band crop spectral image of an experimental area in a preset scenario; performing data processing on the multi-band crop spectral image, to obtain multi-spectral orthographies of a plurality of sample plots; calculating a ground resolution of the multi-spectral orthography of each sample plot, simulating and determining a multi-band crop spectral image of each sample plot at a different flight height by a nearest neighbor interpolation method based on the ground resolution of the multi-spectral orthography of each sample plot; and for the multi-band crop spectral image of each sample plot at the different flight height, determining an optimal flight height corresponding to each sample plot by a hypothetical test method.

Abstract: Disclosed is a service quality prediction method in a service network environment. The method includes the steps of (1) constructing a service uncertainty quality model of a user through service quality log information generated when the user invokes the same or different services multiple times; (2) tapping a set of similar users of a target user based on the service uncertainty quality model of the user; and (3) improving a matrix factorization algorithm based on similarity information of the set of similar users of the target user to achieve accurate prediction of service quality. The service quality prediction method of the present invention can provide a basis for decision-making, perform targeted service optimization based on the service quality information, and provide more accurate service recommendation.

Abstract: The present invention discloses a network burst load evacuation method for edge servers, which takes a time and average penalty function of all tasks performed by the edge system as a minimum optimization goal. This method not only takes into account the fairness of all users in the system, but also ensures that the unloading tasks of all users in the system can be completed in a relatively shortest time, and a new quantitative measure is proposed for improving user QoS response. In the implementation process of the algorithm in the present invention, a particle swarm algorithm is used to solve an optimal target of the system, This algorithm has a fast execution speed and high efficiency, and is especially suitable for a scene of an edge computing network system, so that when a sudden load occurs, an edge computing network system can respond in a very short time and complete the evacuation of the load, which greatly improves the fault tolerance and stability of the edge network environment.

Abstract: The present invention discloses a service caching method for a cross-border service network, wherein the method includes: a cache space of a service switch node is divided into a resident area, a change area, a pre-reclaimed area and a maintenance index area; among them, a cache hit frequency is: a resident area>a change area>a pre-reclaimed area, and the maintenance index area is used for separate storage services call path. when a service call is generated, a cache content in the cache space is replaced according to a cache value of a missed cache or a hit cache; a service router and service switch nodes in the corresponding area jointly form a hierarchical cache mode. When the cache space of any node in the service switch node is insufficient, the service switch nodes in the same area perform collaborative cache and store them in other cache space of the service switch node through indexing.

Abstract: The present disclosure discloses an unsupervised domain adaptation method, a device, a system and a storage medium of semantic segmentation based on uniform clustering; first, a prototype-based source domain uniform clustering loss and an empirical prototype-based target domain uniform clustering loss are established, to reduce intra-class differences of pixels responding to the same category; meanwhile, the pixels with similar structures but different classes are driven away from each other, wherein they tend to be evenly distributed, increasing the inter-class distance and overcoming the problem that the category boundaries are unclear during the domain adaptation process; next, the prototype-based source domain uniform clustering loss and the empirical prototype-based target domain uniform clustering loss are integrated into an adversarial training framework, which reduces the domain difference between the source domain and the target domain, thus improving the accuracy of semantic segmentation.

Abstract: The present invention discloses a network burst load evacuation method for edge servers, which takes a time and average penalty function of all tasks performed by the edge system as a minimum optimization goal. This method not only takes into account the fairness of all users in the system, but also ensures that the unloading tasks of all users in the system can be completed in a relatively shortest time, and a new quantitative measure is proposed for improving user QoS response. In the implementation process of the algorithm in the present invention, a particle swarm algorithm is used to solve an optimal target of the system, This algorithm has a fast execution speed and high efficiency, and is especially suitable for a scene of an edge computing network system, so that when a sudden load occurs, an edge computing network system can respond in a very short time and complete the evacuation of the load, which greatly improves the fault tolerance and stability of the edge network environment.

Abstract: The present invention discloses a service caching method for a cross-border service network, wherein the method includes: a cache space of a service switch node is divided into a resident area, a change area, a pre-reclaimed area and a maintenance index area; among them, a cache hit frequency is: a resident area>a change area>a pre-reclaimed area, and the maintenance index area is used for separate storage services call path. when a service call is generated, a cache content in the cache space is replaced according to a cache value of a missed cache or a hit cache; a service router and service switch nodes in the corresponding area jointly form a hierarchical cache mode. When the cache space of any node in the service switch node is insufficient, the service switch nodes in the same area perform collaborative cache and store them in other cache space of the service switch node through indexing.

Abstract: A method and system of graph feature extraction and graph classification based on adjacency matrix is provided. The invention first concentrates the connection information elements in the adjacency matrix into a specific diagonal region of the adjacency matrix which reduces the non-connection information elements in advance. Then the subgraph structure of the graph is further extracted along the diagonal direction using the filter matrix. Further, it uses a stacked convolutional neural network to extract a larger subgraph structure. On one hand, it greatly reduces the amount of computation and complexity, getting rid of the limitations caused by computational complexity and window size. On the other hand, it can capture large subgraph structure through a small window, as well as deep features from the implicit correlation structures at both vertex and edge level, which improves speed and accuracy of graph classification.

Abstract: The present disclosure discloses an unsupervised domain adaptation method, a device, a system and a storage medium of semantic segmentation based on uniform clustering; first, a prototype-based source domain uniform clustering loss and an empirical prototype-based target domain uniform clustering loss are established, to reduce intra-class differences of pixels responding to the same category; meanwhile, the pixels with similar structures but different classes are driven away from each other, wherein they tend to be evenly distributed, increasing the inter-class distance and overcoming the problem that the category boundaries are unclear during the domain adaptation process; next, the prototype-based source domain uniform clustering loss and the empirical prototype-based target domain uniform clustering loss are integrated into an adversarial training framework, which reduces the domain difference between the source domain and the target domain, thus improving the accuracy of semantic segmentation.

Abstract: The present invention discloses a service pattern quantitative evaluation method for crossover services: defining top elements of the service pattern, including defining participants, workflow, data flow, resource flow and cash flow; describing participants in the service pattern; describing the workflow among the participants based on existing participants; on the basis of the workflow among the participants, describing the data flow among the participants; on the basis of the workflow among the participants, describing the resource flow among the participants; on the basis of the workflow among the participants, describing the cash flow among the participants; based on the described workflow, data flow, resource flow and cash flow, calculating the evaluation indicators of the service pattern, including running time, consumption cost, transfer efficiency, value, and reliability; and calculating pattern entropy based on the evaluation indicators to conduct overall evaluation of the service pattern.

Abstract: Disclosed is system and method of connection information regularization, graph feature extraction and graph classification based on adjacency matrix. By concentrating the connection information elements in the adjacency matrix into a specific diagonal region of the adjacency matrix in order to reduce the non-connection information elements in advance. The subgraph structure of the graph is further extracted along the diagonal direction using the filter matrix. Then a stacked convolutional neural network is used to extract a larger subgraph structure. On the one hand, it greatly reduces the amount of computation and complexity, solving the limitations of the computational complexity and the limitations of window size. And on the other hand, it can capture large subgraph structure through a small window, as well as deep features from the implicit correlation structures at both vertex and edge level, which improves the accuracy and speed of the graph classification.

Abstract: Disclosed in the present invention is a spontaneous edge application deployment and pricing method based on an incentive mechanism. The method comprises the following steps: building an edge end application oriented spontaneous deployment system architecture; then proposing an incentive mechanism aiming at spontaneous edge application deployment and prizing; solving the spontaneous edge application deployment and prizing problem based on a backward induction method, thereby obtaining an optimal deployment solution of an edge server and an optimal prizing strategy of an application provider.

Abstract: Disclosed is system and method of connection information regularization, graph feature extraction and graph classification based on adjacency matrix. By concentrating the connection information elements in the adjacency matrix into a specific diagonal region of the adjacency matrix in order to reduce the non-connection information elements in advance. The subgraph structure of the graph is further extracted along the diagonal direction using the filter matrix. Then a stacked convolutional neural network is used to extract a larger subgraph structure. On the one hand, it greatly reduces the amount of computation and complexity, solving the limitations of the computational complexity and the limitations of window size. And on the other hand, it can capture large subgraph structure through a small window, as well as deep features from the implicit correlation structures at both vertex and edge level, which improves the accuracy and speed of the graph classification.

Abstract: A method and system of graph feature extraction and graph classification based on adjacency matrix is provided. The invention first concentrates the connection information elements in the adjacency matrix into a specific diagonal region of the adjacency matrix which reduces the non-connection information elements in advance. Then the subgraph structure of the graph is further extracted along the diagonal direction using the filter matrix. Further, it uses a stacked convolutional neural network to extract a larger subgraph structure. On one hand, it greatly reduces the amount of computation and complexity, getting rid of the limitations caused by computational complexity and window size. On the other hand, it can capture large subgraph structure through a small window, as well as deep features from the implicit correlation structures at both vertex and edge level, which improves speed and accuracy of graph classification.

Abstract: Provided is a computer-based latent ability model construction method, a parameter calculation method for characteristic parameters of work ability, and a labor force assessment apparatus based on the latent ability model. The method constructs a latent ability model, and introduces characteristic parameters of work ability into the latent ability model to reveal the internal relations among the employee, the activity, and the service time. The characteristic parameters of work ability is calculated to obtain a final value, and labor force assessment can be carried out according to the final value. The labor force assessment comprises performance prediction, work ability comparison, and employee-activity matching evaluation.

Abstract: A method for semantic service registration and query based on WordNet is disclosed. The method includes the following steps: (1) semantic service registration: a service provider registers a service and uploads the Web Service Description Language (WSDL) document corresponding to the service, and a system parses the WSDL document to form a service description tree, then constructs a WordNet ontology tree according to the input of the service, performs a semantic annotation on the input/output of the service to form a Web Service Semantic Description Document (WSDL-S), and finally stores it in a register library; (2) semantic service discovery: a service requester inputs the information of service type, semantic information of the service input/output and other user-defined information to the register library to retrieve the services meeting the requirements; and (3) similarity sorting: the services meeting a certain threshold are sorted in descending order.

Abstract: The present invention provides a workflow management system and a method for implementing a workflow definition tool. The workflow management system comprises a computer, and a workflow definition tool and a workflow engine in the computer, wherein: the workflow definition tool directly represents a process as process definition codes which are computer executable, and the workflow engine directly calls the process definition codes. When the workflow changes, the system of the present invention will only need to correspondingly modify the workflow definition tool instead of modifying the codes of the workflow engine, thus the development, maintenance and use of the workflow management system are facilitated.

Abstract: A method for semantic service registration and query based on WordNet is disclosed. The method includes the following steps: (1) semantic service registration: a service provider registers a service and uploads the Web Service Description Language (WSDL) document corresponding to the service, and a system parses the WSDL document to form a service description tree, then constructs a WordNet ontology tree according to the input of the service, performs a semantic annotation on the input/output of the service to form a Web Service Semantic Description Document (WSDL-S), and finally stores it in a register library; (2) semantic service discovery: a service requester inputs the information of service type, semantic information of the service input/output and other user-defined information to the register library to retrieve the services meeting the requirements; and (3) similarity sorting: the services meeting a certain threshold are sorted in descending order.