53 results about "Vertex number" patented technology

The invention discloses laser-fuze near-field return wave power calculation based on wave beam decomposition and partial irradiation. The laser-fuze near-field return wave power calculation comprises the following steps: firstly, establishing a fuze coordinate system and a laser-fuze launching site model, adopting 3D Max to carry out geometric modeling, then, adopting a triangular grid mode to carry out surface grid division on a complex target surface, and extracting vertex numbers and vertex coordinate information of triangle face-units of a geometric model; carrying out wave beam decomposition on a laser wave beam at a cross section of the laser wave beam, and dividing grids at equal intervals on the cross section of the laser wave beam, approximately considering that strength on each grid is uniform when the grids are small enough, approximating the strength of the whole grid by utilizing strength of the center point of each grid, and adopting a transmission distance to determine longitudinal attenuation in a longitudinal direction; decomposing an original laser wave beam into a plurality of small wave beams, calculating return wave power of each small wave beam, and finally, superposing, thereby obtaining overall return wave power of fuze. The laser-fuze near-field return wave power calculation has the beneficial effects that calculation for a target near-field return wave signal is high in precision, and reaction speed is high.

The invention provides a database search method for obtaining a maximally complete subgraph from an m-part graph. The search method is applied to a face recognition database. The method forms a k-order maximally complete subgraph by establishing an undirected graph model. subgraph, and store the undirected graph G through the adjacency linked list, take the positive sequence edge and the largest vertex as the basic quantity, and use the pruning method to calculate the number of vertices of the undirected graph G and the calculation amount T of the k-order complete subgraph k Perform calculations to obtain the space complexity and time complexity of the maximally complete subgraph, complete the search for the maximally complete subgraph, and use the search results in face recognition data. By looking for frequent itemsets, the Access to the database improves recognition efficiency.

The invention proposes a workload-driven distributed graph data segmentation and replication method. In the present invention, the data in the graph data set are respectively stored in the server cluster through the hash table method; combined with the user's workload information, the active vertex set is constructed in the vertex data set combined with the load determination of the source server, and then each active vertex is combined with the server cluster According to the score function score, construct the target server score list, determine the target migration server through the target server load judgment; combine the active vertex set and the corresponding target migration server, judge whether the active vertex is a high-read vertex through the threshold, if the active vertex is not high The read vertex further dynamically adjusts the copy data of the active vertex through the maximum replication factor. The invention utilizes the characteristics of dynamic change of the workload to dynamically adjust the position of the graph vertex data, thereby improving the query efficiency and ensuring low delay and high throughput of the query.