34 results about "Point graph" patented technology

The embodiment of the invention provides a distribution network project management current situation evaluation method and apparatus, and belongs to the data processing field. The distribution network project management current situation evaluation method includes the steps: acquiring a plurality of project data prestored in a local database; based on material quantity and financing volume, drawing a point graph; based on a first preset rule, acquiring the projects, to be analyzed, displayed on the point graph; performing clustering operation on the projects to be analyzed according to a second preset rule, and obtaining a plurality of clusters; acquiring the standard characteristic graph of each cluster; acquiring the characteristic analysis graph of each project to be analyzed in each cluster; and based on the characteristic analysis graph and the standard characteristic graph, acquiring a problem statistical graph. The distribution network project management current situation evaluation method can obtain the differences between the characteristic analysis graph and the standard characteristic graph by comparing the characteristic analysis graph with the standard characteristic graph one by one, so as to evaluate the project to be analyzed by means of the meaning represented by the differences to infer the total trend of the existed problem in the project to be analyzed and provide basis for the decision of modifying problems for a leader layer, a management layer and an executive layer.

The invention provides a font element determining device and a font element determining method. The invention aims at providing a font element determining device capable of determining radicals and constituent parts except radicals. As a solving way, a quantitative data generating part generates quantitative data relative to a contour graph. The quantitative data comprise a size and a central coordinate of a rectangle surrounding the contour graph. A radical configuration mode analysis part determines a configuration mode of radicals and constituent parts except the radicals according to the quantitative data, and divides the contour graph into a first group as the radicals and a second group as the constituent parts except the radicals according to the configuration mode. A transformation part transforms the contour graphs of the first group and the second group to a first point graph and a second point graph. A radical / constituent part recognition part respectively determines the radicals and the constituent parts except the radicals according to OCR recognition of the first point graph and the second point graph.

The invention discloses a knowledge graph personalized learning path recommendation method based on RankNet-transfer. The method comprises the steps of knowledge model construction and model recommendation. In the knowledge model construction, a blind area knowledge point graph is constructed according to the construction of a course knowledge point graph and the analysis result of the knowledge test by the cognitive model. In the recommendation model, a RankNet algorithm and a Transform algorithm are used to realize reordering of blind area knowledge points, and then a topological ordering method is used to traverse a reordering sequence and a blind area knowledge point graph to generate a final knowledge point recommendation sequence. The accuracy of the recommendation result is improved, and the method adapts to the cognitive sequence of the learner.

The invention discloses an electronic chart position point data simplification method, which comprises the following steps of: 1, dividing chart position points into three types, namely point chart layer discrete position points, line chart layer continuous position points and surface chart layer continuous position points, and respectively processing the three types of chart layer position pointdata; 2, for the discrete position point data of the point graph layer, the discrete position points are continued according to a distance or byte rule, a reference position point of each position point is determined, and then each position point is represented by a relative coordinate relative to the reference position point; and 3, for the line and surface layer data, processing the initial position points of all the line segments according to the step (2), taking the midpoint of two adjacent position points as a reference position point for each group of continuous position points, and representing the line and surface layer position points by using the relative coordinates relative to the reference position point. And 4, storing the relative coordinate data, and generating an electronic chart file. The electronic chart precision is maintained, the chart file is greatly simplified, the storage space is reduced, and the processing efficiency is improved.

The invention relates to a map segmentation method and device, a pose estimation method and an equipment terminal. The map segmentation method comprises the following steps: segmenting a map; acquiring map point data and constructing a corresponding point graph according to the map point data, wherein the point graph comprises nodes formed by map points and corresponding edges; measuring and estimating a to-be-estimated state variable corresponding to each node in the point diagram, and obtaining corresponding measurement and estimation values, wherein the to-be-estimated state variables comprise homogeneous coordinates of the nodes and corresponding sensor when the nodes are acquired; calculating the inter-point correlation between any two adjacent nodes in the point graph according to the measurement and estimation values; judging whether the inter-point correlation is smaller than a preset correlation threshold value or not; when the correlation between the points is smaller than apreset correlation threshold value, removing the edges corresponding to the corresponding adjacent nodes so that the static points and the dynamic points can be separated to complete map segmentation.The map segmentation method eliminates the influence of the dynamic points, and a foundation is laid for subsequent pose estimation.

The invention discloses an image enhancement processing method applied to correlated imaging, and the method comprises the steps: carrying out the correlated calculation of reference arm light field sampling data and signal arm light intensity response data, and obtaining a correlated imaging result graph; calculating a normalized autocorrelation matrix and a full width at half maximum of a resultgraph; subtracting the product of the normalized autocorrelation matrix and the gain coefficient from the result graph to obtain a residual graph; iteratively calculating a maximum value point in theresidual error graph and a corresponding normalized autocorrelation matrix, and subtracting a product of the matrix and a gain coefficient from the residual error graph; counting the position and theintensity of the point into a net point graph; stopping iteration when an iteration termination condition is met; and performing convolution on the Gaussian function and the net point graph through half-height full-width fitting, so that a correlated imaging result graph of an aperiodic structure can be obtained. The method can solve the periodic repeated structure problem caused by insufficientspatial frequency sampling, improves the visibility and the signal-to-noise ratio of the correlated imaging result graph, and is high in anti-noise capability, high in calculation speed and good in practical effect.

The invention discloses a parallel enumeration method of extremely large bipartite groups based on a sparse bipartite graph. Compared with the prior art, the invention adopts a parallel computing method, which can enable parallel computing of various computing tasks, including uniform initialization tasks Assignment and efficient task migration, as well as de-redundancy operations on the amount of information of a single task, so that redundant and repeated information is stored in a common area, and each task will only be queried and obtained when it is executed. , which not only reduces the pressure on the memory, but also speeds up the task migration, and can effectively improve the computing efficiency when solving the MBE problem.

The invention provides a project progress visual management method and system, and the method comprises the steps: predicting the project data of each construction region at a future moment, and the project data comprises the number of construction people, a predicted completion construction period, and the number of remaining construction projects, wherein, according to the key point graph of the constructors at the current moment, the key point graph of the constructors at the future moment, and the predicted completion period and the remaining construction project number of each construction area at the current moment, predicting the predicted completion period and the remaining construction project number of each construction area at the future moment; and monitoring whether the project progress is abnormal or not according to the project data of each construction area at the current moment and the future moment. The predicted completion construction period and the remaining construction project number of each construction area at the future moment are predicted, the construction progress of constructors in the period from the current moment to the future moment is considered, and the predicted predicted completion construction period and the remaining construction project number are more accurate.

A computer-implemented method for updating a dot graph on a system having communicatively coupled first and second hardware components, comprising: a first component performing a first process on the dot graph in a first state to generate a first change . The method also includes a second component performing a second process on the dot plot in the first state to generate a second change. The method further includes the second component applying the second change to the point map in the first state to generate a first updated point map in the second state. Additionally, the method includes the first component sending the first change to the second component. Additionally, the method includes the second component applying the first change to the first update point graph in the second state to generate a second update point graph in the third state.

The invention relates to an interest point duplicate removal method and device based on a graph neural network, computer equipment and a storage medium. The method comprises the following steps: acquiring all interest points in a target territorial range to be subjected to duplicate removal, and constructing an interest point diagram based on a geographic position according to all the interest points; screening out multiple pairs of interest point repeated pairs from all interest points, and labeling the multiple pairs of interest point repeated pairs to obtain multiple pairs of seed interest point repeated pairs; iteratively training the graph neural network model according to the interest point graph and the multiple pairs of seed interest point repetitive pairs to obtain a trained graph neural network model; processing the interest point diagram through a trained graph neural network model, and determining all interest point repeated pairs in all interest points according to a processing result; and deleting any one interest point in each interest point repeated pair. According to the embodiment of the invention, the method can improve the deduplication effect of the points of interest, is efficient and reasonable, and is wide in application range.