39 results about "Simple graph" patented technology

The invention discloses a data aggregation method based on a minimum spanning tree. The data aggregation method mainly includes the steps of wireless sensor arrangement, cluster head selection, clustering, simple graph model formation through nodes in clusters, calculation of weight in the clusters, minimum spanning tree building through the nodes in the clusters, aggregation of data in the clusters, cluster head weight calculation, simple graph model formation through nodes in cluster heads, minimum spanning tree building through the nodes in the cluster heads, cluster head data aggregation, node energy consumption balancing and cluster maintaining. According to the data aggregation method, by means of reasonable arrangement of the sensor nodes and clustering of the nodes, energy consumption of the sensor nodes is distributed evenly, the life cycle of a whole wireless sensor network is prolonged, and energy of all the nodes can be used efficiently.

The invention discloses an art stylization image processing method. The art stylization image processing method comprises the steps of: performing simple graph expression generation processing on an input real image; performing and-or graph expression generation processing on the result of the simple graph expression generation processing; performing stroke distribution graph generation processing on the result of the and-or graph expression generation processing to obtain a needed image. According to the invention, the drawbacks such as a bad layering effect, inflexible rendering and complex man-machine interaction operation in the prior art can be overcome, and the advantages of a good layering effect, flexible rendering and simple man-machine interaction operation are realized.

The invention discloses an individualized traffic guidance method and an individualized traffic guidance system on the basis of mobile terminal display. The individualized traffic guidance method includes: S01, a server acquires current position information of mobile terminals; S02, the server acquires traffic service information in front the current position from a traffic information data processing system according to the current position information; S03, the server transmits the traffic service information to the mobile terminals; and S04, the mobile terminals receive the traffic service information and convert traffic road condition information in the traffic service information into a graph showing the integral outline of roads and displaying on the mobile terminals, wherein the current position information includes coordinates of the current position and the current running direction, and the traffic service information includes road condition information. By converting the road condition information into the simple graph to be displayed on the mobile terminals simply and clearly, traffic safety is favorably guaranteed. Further, information displayed on each mobile terminal is given specifically according to the current positions of the mobile terminals, and pertinence is high.

The invention is applicable to the field of television sets, which provides a display controlling method, a device and a facility of television set opening pictures, wherein the method comprises the following steps: switching a television display circuit into a custom picture display circuit, reading and displaying pictures custom-built by users before opening a television set. When a television is opened, the invention can switch the television display circuit to the custom picture display circuit and display pictures custom-built by users after determining display opening pictures, which solves problems in the prior art that only some simple graphs and words can be displayed when the television is opened, and pictures with high capability and high definition can not be displayed according to the need of users, and enables the television set to be more humanized.

The invention belongs to the field of integrated circuits and relates to a graph isomorphism judging method based on spectrum analysis. The method includes: large-scale pure-resistor network graphs are modeled into non-mixing undirected simple graphs, two-dimensional planar graphs are mapped into one-dimensional distribution, and isomorphism of two graphs is judged according to processed one-dimensional distribution conditions. The method has the advantages that the method is accurate and fast in judging of the non-mixing undirected simple graphs, especially the large-scale non-mixing undirected simple graphs; the method is evidently faster than a Nauty method which is good in performance currently, and the method is well applicable to fields such as judging of identical sub-circuits in large-scale integrated circuits and judging the isomeride in organic chemistry.

The invention discloses a video abstract generation method and a video abstract generation device based on the shortest path. The method comprises the steps of acquiring video frame information of a video to be processed; sampling the video frame information, and acquiring sampling information of the video frame information; determining a segmentation position of the video to be processed according to the sampling information, and segmenting the video to be processed at the segmentation position to acquire a segmented video; clustering video frames in the segmented video, and acquiring a candidate key frame; and building a digraph, computing the shortest path through combining the digraph with the shortest path algorithm, eliminating redundancy of the candidate key frame of the shortest path to acquire a key frame, and generating a video abstract according to the key frame. The method and device provided by the invention have the advantages of simple graph model, small calculation amount and high video abstract acquisition efficiency.

The invention discloses an on-site sampling method of a dislocation interface-containing rock body. The on-site sampling method specifically comprises the following steps: clearing away a weathered layer and a loosened layer from the selected sampling section, so as to lead the cutting surface to be identical with the occurrence of a dislocation interface and make a 1m*2m plane, clearly away a test surface cleanly, drawing a test sample general layout, a test sample region geology simple graph, test sample geology descriptive graph and combining photograph, and distributing test samples with asample layout board; and keeping the natural moisture content of the dislocation interface by adopting a wax sealing method, selecting a lath with thickness of 0.5cm, melting paraffin with a small barrel, evenly smearing the initially condensed paraffin on a to-be-sealed lath with a lath after the paraffin is initially condensed. The obtained test sample can be used for performing experimental study on the shearing mechanical characteristic of a dislocation interface-containing non-continuous surface, including a normal load and normal rigidity shearing mechanical experiments; in addition, sampled or unsuccessfully processed test samples contain small dislocation interface disturbance, and can be used for producing true triaxial test samples of a combined body of a dislocation interface original sample and mother rock.

The invention provides a method for determining porosity of rock at any time of loading which relates to the technical field of geotechnical engineering. The method includes the following steps: taking a rock sample and trimming on the spot; taking a core of the rock sample by using a core taking machine to form a test piece; obtaining an initial pore volume and an initial volume of the test piece; performing a triaxial compression test on the test piece, and obtaining axial radical stress strain data of the test piece during a process from starting of the test to fracture; drawing a axial radical stress strain curve graph of the test piece, and eliminating abnormal values in the curve graph; drawing a simple graph of internal pores and a solid matrix of the test piece; and determining theporosity of the test piece at any time of loading. According to the method for determining the porosity of the rock at any time of loading, an indoor test is carried out through on-site sampling; theporosity of the rock at any time of loading can be rapidly determined while a basic rock mechanic test is carried out; the method is convenient and simple; and a computed result is accuracy, so thatthe actual porosity of the rock can be really reflected.

The invention discloses a method for conversion between a lattice graph and a CAD/CAM vector graph. The method comprises: S1, a straight line standard is defined and a straight line graph pair is formed; S2, an arc line standard is defined and an arc line graph pair is formed; S3, a simple graph file in a standard lattice graph is decomposed by means of adjustment, a simple graph vector file is generated, and a simple graph pair is formed; S4, an original graph pair is stored into a database to form an original graph pair database; S5, a complex pixel graph file in the standard lattice graph is decomposed by means of adjustment to form original graph file combination and a complex pixel graph vector file of the complex pixel picture is generated; and a complex pixel graph pair is generatedand is stored into the database to form a complex pixel graph pair database; and S6, in a CAD/CAM environment, a CAD/CAM program reads the complex pixel graph vector file of the complex pixel graph pair in the complex pixel graph pair database and generates a complex pixel graph file corresponding to the complex pixel graph vector file.

The invention belongs to the technical field of quantum error correction codes and discloses a method applied to a quantum communication system and based on the generalized graph state of the Hadamardmatrix construction. The method comprises the steps of selecting an appropriate H matrix; determining a meaningful graph in a simple graph of four points as a research object; replacing the discreteFourier transform in a multi-element graph state by the H matrix; replacing a corresponding controlled gate by a controlled Z gate defined by the H matrix; for a specific graph, calculating the entanglement characteristic of the specific graph, and analyzing the relation between the equivalence of the H matrix and the equivalent performance of the local area of a corresponding graph state. According to the invention, based on a coding line instead of a stabistor-based mode-expanded graph state, the method is provided. Meanwhile, the entanglement characteristics and the relevant properties of the generalized graph state of some simple graphs are given. Therefore, non-volatile quantum codes can be constructed.

The invention is suitable for the field of network technology, and provides an incremental structure clustering method on a dynamic graph. The method comprises the steps of receiving an undirected and unweighted simple graph, performing initializing processing on the undirected and unweighted simple graph by means of a structure clustering algorithm of the graph, and obtaining an initialized breadth-first forest and a non-tree-side set; when insertion of a new side is detected, performing cluster combining or cluster splitting processing according to the new side and the initialized breadth-first forest and the non-tree-side set, and obtaining the breadth-first forest. Through the method provided by the embodiment, re-calculation of the whole graph is not required, dividing and clustering can be performed just through updating partial side. Compared with an existing SCAN algorithm, the incremental structure clustering method can improve updating operation speed by three orders of magnitude, thereby settling a problem of re-calculation of the whole network and time wasting in a calculation process when static graph updating occurs in prior art.

The invention discloses a weak signal detection method based on a grouping range map, which comprises the following steps of: firstly, Fourier transform is carried out on an oversampled receiving signal for further calculation to obtain a power spectrum of the receiving signal; a range spectrum is then extracted from the power spectrum and converted into a specific undirected simple graph having a plurality of vertexes and edges; finally, the GINI coefficient of the graph is used as a judgment index, and whether a signal is detected or not is judged by checking whether the graph is a complete graph or not. The performance of the method provided by the invention is superior to that of a conventional signal detection algorithm under the conditions of small signal-to-noise ratio and medium samples.

The invention provides an advanced intelligent drawing board which comprises a drawing board bracket, a solar panel, a display screen, an intelligent control module, a charging port, a voice recognition module, and a USB interface. The solar panel is fixed at the top end of the drawing board bracket. The display screen is fixed at the front end of the drawing board bracket. The intelligent control module and the voice recognition module are arranged in the cavity of the bottom end of the drawing board bracket. According to an automatic drawing board, the bottom end of the drawing board is provided with the intelligent control module and the voice recognition module, and when the drawing board is used, the display function of a pattern can be realized only through voice. Since a light-sensitive display screen is selected, the drawing board action function can be realized through only placing a simple graph on the display screen. The drawing board is connected to a computer through USB, a pattern is displayed in real time in the computer, and the pattern can be printed or stored at any time.

The invention relates to a method and a system for detecting an abnormal account of an online social network. The method comprises the steps of generating a simple graph according to a user relationship data set of an online social network; calculating the importance of each node through a node importance evaluation algorithm according to the simple graph, wherein the importance of the nodes comprises the in-degree centrality, the near centrality and the intermediary centrality of the nodes; fusing the importance of each node to obtain an importance fusion value of each node; taking the importance fusion value of each node as the weight of the corresponding node, and converting the simple graph into a weighted graph; combining the weight and the out-degree of each node in the weighted graph to carry out power iteration of trust seed transmission, and endowing each node in the weighted graph with a corresponding trust value; and determining the account corresponding to the node with thesmaller trust value in the weighted graph as an abnormal account. According to the invention, the accuracy of abnormal account detection can be improved.

The invention discloses an article marking management method and apparatus. An identification graph formed by successive nesting of intersection-point-free closed graphs between a plurality of adjacent closed graphs is arranged at an article; and according to a management serial number sequence of a current to-be-managed article and a preset correspondence relationship of all closed graphs and elements in the management serial number sequence, elements corresponding to all identification graphs are determined to form to-be-represented number sequences of all the marking graphs, and marking points are set in sub regions corresponding to all the closed graphs based on a preset mapping relationship between sub regions of all closed graphs and number sequences. Therefore, a novel article identity management way is realized. With the novel way, the identification graph arranged at the article is completely different from existing identification graphs like a two-dimensional code and other people only can watch a simple graph at the article instead of obtaining any identity information of the article, so that the safety article management control ways are enriched and safety and diversity of article management are enhanced.

The invention discloses a simple graph counting verification code verifying method and a simple graph counting verification code verifying system. The simple graph counting verification code verifying system comprises an image generator 1, an information reminder 2 which instructs a user in how to operate the simple graph counting verification code verifying system, an image element number input device 3 and a verification code judging mechanism 4. The simple graph counting verification code verifying system is characterized in that the image generator 1 only generates one image, the information reminder 2 which instructs the user in how to operate the simple graph counting verification code verifying system generates prompt information and asks the user to input sums of numbers of all designated image elements of a corresponding image, the user inputs the sums of the numbers of all the designated image elements of the corresponding image through the image element number input device 3 according to operation requirements, and the verification code judging mechanism 4 judges whether the sums of the numbers of all the designated image elements of the corresponding image input by the user are all correct or not, if yes, the verification code judging mechanism 4 affirms that the user passes validation of a verification code, and if not, the verification code judging mechanism 4 affirms that the user does not pass the validation of the verification code.

The invention belongs to the technical field of graph neural network recommendation, and discloses a graph neural network recommendation method and system fusing a social relation and a semantic relation, which utilize a simple graph neural network recommendation model to recommend a graph neural network based on user social information, score interaction information of users and items and label information of the items. Constructing the information of the non-graph structure into graph information; clustering the labels of the items by using the label information of the items; and calculating the relevancy between the items and the label clusters, carrying out cosine similarity calculation by utilizing an item-label cluster relevancy matrix, and when the similarity is greater than a certain threshold value, adding a trust relationship between the two items to form a semantic relationship graph structure of the items. According to the method, the user-project score bipartite graph is used as a basis, other isomorphic graphs are used as supplements, so that the purpose of using more neighbor nodes for aggregation is achieved, the problem of data sparsity is solved, and tests prove that the proposed model has higher recommendation accuracy than GrpahRec.

The invention discloses a loophole finding method based on a loophole correlation distribution model. The method comprises the following steps of 1, building a loophole knowledge base, completing collecting and cooperative sharing work for specific information system loophole knowledge to form a loophole correlation simple graph; 2, on the basis of the loophole knowledge base, adopting a loophole correlation calculation module for calculating the loophole influence degree and loophole correlation compactness; 3, according to the calculated loophole influence degree and relevancy indexes, perfecting the loophole correlation simple graph into the loophole correlation distribution model; 4, by comparing a detected loophole set and the loophole correlation distribution graph, predicting loophole positions. According to the loophole finding method based on the loophole correlation distribution model, the loophole correlation distribution graph comparison mode is adopted for performing known security loophole finding work, then, the conventional loophole excavation work is guided cooperatively, and the loophole finding efficiency and accuracy are improved.

The invention discloses a face simple graph generation method with a remarkable texture effect. The method comprises the following steps of step1, inputting a face test photograph; step2, carrying out edge reinforcement processing on the above test photograph; step3, carrying out Laplace sharpening processing on the reinforced test photograph; step4, using K-NN neighbor search between the test photograph and a training photograph so as to obtain a simple graph; step5, carrying out noise removing processing on the obtained simple graph; and step6, outputting the simple graph. A purpose of enhancing a texture effect of the simple graph is realized.

The invention discloses an Android malicious software family clustering method based on a method call graph. The method belongs to the field of Android malicious software detection, and comprises thefollowing steps: S1, generating a method call graph: obtaining an entry point list of an Android application and an application program interface API call relationship by decompiling an APK file, andautonomously constructing the method call graph of the Android application; s2, preprocessing a method call graph: preprocessing the method call graph to generate a simplified call graph, performing graph division on the simplified call graph by a community discovery algorithm, and dividing the simplified call graph into a plurality of relatively independent sub-graphs SG; S3, performing feature extraction; S4, performing malicious family clustering. According to the method for constructing the method call graph provided by the invention, the method call graph is used as a malicious software detection feature, and the method call graph is cut in combination with a community discovery algorithm and simple graph division, so that the detection efficiency of the Android malicious software isimproved.

The invention provides a progress bar display method and device based on an Android system and equipment. The method comprises the steps that a first graph layer and a second graph layer are obtained, the first graph layer comprises a hollow graph, the second graph layer comprises a graph progress bar, the first graph layer and the second graph layer are overlapped, the first graph layer is located on the upper layer of the second graph layer, the projection of the hollow graph of the first graph layer on the second graph layer is located in the coverage range of the graph progress bar; and a target progress associated with the second layer is acquired in real time, and the display of the graphic progress bar is controlled in the second layer according to the target progress, so that the progress displayed after the graphic progress bar passes through the hollowed-out graph is consistent with the target progress. The simple graph progress bar is drawn on the first graph layer, and the complicated progress bar (mainly an irregular progress bar) is realized by utilizing the hollow graph, so that the development difficulty of the complicated progress bar can be greatly reduced, and the development cost is reduced.

The invention provides a map image processing method, device and equipment and a readable storage medium, and the method comprises the steps: repeatedly executing a preset graph with the maximum area, which can be accommodated by a communication region of a map image of a determined region, a step of covering a preset graph with an receivable maximum area in a connected region of the map image of the region until a connected region larger than a preset area threshold does not exist in the map image of the region; and taking the position range corresponding to all the preset graphs as the position range of the region. According to the method, the map image of the area is processed, the position range of the simple graph with the point located inside or outside the area is used for replacing the position range of the covered map area, the positioning of the target object in the map area is simplified, and the positioning robustness is improved while the positioning time is saved.