7 results about "Vertex number" patented technology

The application discloses a graph data partitioning method based on a cache mechanism, comprising the following steps: obtaining graph data, obtaining the total number of graph vertices, the neighbor list of each vertex, the initial vertex partition set and the initial partition number according to the graph data; calculating the upper limit of the load; calculating the correlation score of the vertex in each vertex set which does not reach the upper limit of the load according to the vertex and the neighbor list of the vertex; judging whether the vertex meets the cache condition, if yes, partitioning according to the correlation score; if not, the vertex is partitioned into the cache module, when the cache module reaches the maximum capacity limit, the cache module returns the vertex and the neighbor list which are most suitable for the current partitioning, and the process returns; judging whether all vertices have been partitioned, if yes, the final graph data partition set is obtained; if not, the process returns. The application improves the partitioning precision of the Fennel algorithm under the condition that the size of the graph data is too large.

The application discloses a kind of polygon quadrilateral grid automatic subdivision methods based on deep reinforcement learning, it is related to the field of computational geometry and grid generation, the application constructs a kind of automatic subdivision framework of fusion geometry priori knowledge and data-driven strategy.The method predefines 9 kinds of basic topological filling templates covering triangle to hexagon as discrete action space, converts continuous geometry segmentation into sequence decision problem;The mapping relationship between polygon state characteristics and optimal template selection strategy is learned using deep Q network, and exploration and utilization are balanced through dynamic epsilon-greedy mechanism;Combining vertex number priority scheduling strategy and multidimensional quality reward function, guide agent to adaptively generate high-quality quadrilateral grid.The application realizes the full-automatic, high robustness subdivision of complex polygon region, significantly improves the grid orthogonality and aspect ratio quality, avoids manual intervention, and is suitable for finite element analysis and other engineering scenarios.

The present disclosure relates to an induction range calibration method, device, ceiling appliance, equipment and storage medium. The induction range calibration method determines the standing position of the target object as the vertex of the required calibration area, obtains the position of the vertex and determines the coordinates of the horizontal plane projection of the point. When the number of vertices obtained is equal to 2, the rectangle surrounded by the straight line where the horizontal coordinates of the two vertices are located and the straight line where the vertical coordinates are located is taken as the induction working range or the induction non-working range. When the number of vertices obtained is greater than or equal to 3, the polygon surrounded by connecting all the vertices in turn is taken as the induction working range or the induction non-working range. In this way, the range that needs to be calibrated can be determined, and the user can be prevented from accidentally triggering the induction device, thereby causing resource waste. At the same time, this method is simple and does not require manual measurement and calculation, thereby improving the user experience.

The application discloses a graph processing system cache method, a controller and a system for a BFS algorithm, belongs to the technical field of performance optimization of a graph processing system, and comprises the following steps: based on the relationship between the access heat of a cache page and the number of unvisited vertices in the BFS algorithm, more accurate heat grading management is implemented on the cache page, when the cache is full, the page with low access potential is effectively eliminated, and the cache hit rate is improved; fragmented effective edge data is extracted from the cache page and separately stored in a cache managed in a fine granularity; by acquiring the proportion of the edge list of the vertex in the BFS algorithm task queue that has been resident in the cache, and in combination with the vertex out-degree and other attributes, the scheduling order of the vertex in the task queue is adjusted, and the data that has been resident in the cache is maximally utilized. The application can effectively improve the cache hit rate of the graph processing system when processing the BFS algorithm task, and further realizes the improvement of the access performance of the graph processing system.

The present application relates to the technical field of data processing and analysis, and further relates to a topological electrical parameter mixed fault diagnosis method and device for blasting networking, comprising the following steps: step S1: abstracting the blasting networking as a directed graph structure and deploying intelligent acquisition nodes containing Kelvin double-arm bridge arrays and switching matrices at each vertex; step S2: applying multiple rounds of excitation at the root node position and synchronously acquiring the node voltage values of each vertex, and constructing a topological voltage distribution matrix according to the vertex number; step S3: calculating the measured resistance value sequence of each edge according to the topological voltage distribution matrix, inputting the edge abnormal scoring model according to the layer number of hops to generate an abnormal edge candidate set; and step S4: performing switching matrix isolation measurement and insulation detection on the abnormal edge candidate set according to the abnormal scoring order. The present application realizes systematic modeling and fine perception of the electrical state of complex blasting networking, effectively improving the accuracy and localizability of pre-explosion fault diagnosis.

An encryption and decryption method and apparatus based on uncertain graphs, relating to the fields of computer and network communication technologies, the encryption method includes: A1. Obtaining a plaintext string of length n, constructing a sequence graph and a sequence matrix using the ASCII code value corresponding to each character as a vertex and the difference between the ASCII code values ​​corresponding to adjacent characters as edges; A2. Generating a sequence of uncertain implication subgraphs and an adjacency matrix of uncertain implication subgraphs based on the number of vertices in the sequence graph, and making the non-invertible uncertain implication subgraphs in the sequence graph invertible to obtain a list of adjacency matrices of invertible uncertain implication subgraphs; A3. Dividing the value of the first vertex of the sequence graph by 2... n The quotient and remainder are obtained. The quotient is added to the order matrix to obtain the encryption matrix. The invertible matrix with the same index and remainder is queried from the adjacency matrix list of the invertible uncertain implication subgraph. Finally, the encryption matrix is ​​multiplied by the invertible matrix to obtain the ciphertext. This solves the quantum risk and structural incompatibility problem of traditional encryption and improves the security of the string.

The application provides a community searching method and device based on maximum clique search on uncertain graph, and relates to the field of data processing.The method comprises the following steps: obtaining an initial graph corresponding to a social network to be processed; determining reference values of each vertex in the initial graph; deleting vertices with reference values not greater than heuristic solution values in the initial graph to obtain a vertex set corresponding to the heuristic solution values, and determining an intermediate subgraph based on the vertex set; performing multiple search operations on each vertex in the intermediate subgraph, determining a target subgraph with the largest number of vertices based on candidate subgraphs obtained through the search operations, and ensuring that there is an edge between any two different vertices in the target subgraph and the product of the existence probabilities of all edges is greater than a preset probability value; and determining a target social user community in the social network to be processed based on the target subgraph.The application can search for a social user community based on uncertain correlation data between social users.