114 results about "Adjacency list" patented technology

A mutable multilevel data structure representing a graph structure may include multiple read-only levels and a single writable level. Each read-only level may include a vertex table (which includes references to edge tables on the same level or a different level containing elements of adjacency lists for some vertices) and an edge table (which includes elements of adjacency lists that changed since the previous read-only level). A hybrid variant may switch between a performance-optimized variant (whose edge tables include complete adjacency lists for vertices whose edge sets were modified) and a space-optimized variant (whose edge tables include only newly added adjacency list elements). The vertex tables and / or the writable level may be implemented using copy-on-write arrays, each including an indirection table and multiple fixed-sized data pages. Computations may be run on the read-only levels or on the writable level and read-only levels.

The invention discloses an adaptive self-healing protection method applied to a distribution network containing hybrid switches. The method comprises the following steps: dividing a region, and converting a regional topology into an adjacency list model; adaptively configuring intelligent terminal parameters in each region respectively according to the regional adjacency list model; performing periodic equipment self-check and communication mutual check; performing fault detection and fault type recognition; positioning and isolating a fault; recovering a non-fault line; recognizing an isolated power loss region and selecting an interconnection switch; recognizing the isolated power loss region and selecting the interconnection switch to be turned on or off according to the set arbitration rule, thereby completing load transfer; and updating the regional topology and the adjacency list thereof. The method can adaptively realize fault type recognition, fault positioning, fault isolation, non-fault regional line recovery and load transfer of the distribution network containing hybrid switches by using peer-to-peer communication and mutual cooperation of intelligent terminals, and has the characteristics of high fault positioning accuracy, high adaptive self-healing response speed and strong practicability.

A data structure for a graph, which is composed by points and line segments connecting adjacent pairs of the points, respectively, of a two- or three-dimensional object comprises a set of point data of the individual points, each of the point data of the points consists of a clockwise or counter clockwise circular ordered adjacency list written in storage areas of a storage medium individually allocated to the point. The adjacency list describes a plurality of adjacent points associated with the point sequentially according to a circular adjacency order as viewed from outside of the graph with address pointers to the storage areas allocated to the adjacent points, respectively, and location pointers associated with the address pointers, respectively, to storage locations of adjacency lists of the adjacent points, respectively, where an address pointer of the point is written.

The invention relates to a method for carrying out combined detection on source code file cloning adjacency lists. For an engineering project file, a fingerprint Chunk is constructed by using MD5 and a fingerprint library is established by taking the file as a unit and by taking scanning carried out on each line and fixed line number of codes as a granularity. The fingerprint library is stored in a MySQL database, and a detection algorithm is carried out by taking an ID of an open source project where a fingerprint is located and a Hash value of the Chunk as indexes so that detection of 0 to 3 clone classes can be performed. Namely, the invention discloses a scheme and algorithm for carrying out combined detection on source code file cloning adjacency lists on the basis of distributed indexes. According to the algorithm, cloned code files can be detected under the conditions that the time complexity is O (nm) and the space complexity is O (nm), so as to realize mass detection.

The invention relates to the technical field of industrial automation control, in particular to an automatic construction method for a PLC (Programmable Logic Controller) program to a NuSMV input model. The method comprises the following steps that: analyzing the ST (Structured Text) language of the PLC, and constructing the grammar of the ST language; according to the given ST grammar, carrying out processing on a ST program, and analyzing the ST program into an AST (Abstract Syntax Tree); processing the AST, analyzing the control flow characteristics of a ST language statement, and determining the algorithm of each statement for generating a CFG (Control Flow Graph); according to the CFG, carrying out data flow analysis on the ST program, and constructing a state transition adjacency list and a variable value change adjacency list; and according to the constructed state transition adjacency list and variable value change adjacency list, generating the NuSMV input model. By use of the method, efficiency and accuracy for a NuSMV tool to carry out model detection on a PLM program are greatly improved, and the safety verification of an industrial control system PLC code is realized.

The invention discloses a Tibetan language thesis copying detection method and a Tibetan language thesis copying detection system based on Tibetan language sentence levels. The Tibetan language thesis copying detection method includes: subjecting Tibetan language text characters to code conversion and noise removal preprocessing; segmenting a text into text blocks according to sentences through boundary identification of Tibetan language sentences and establishing a temporary table of segmented text blocks; extracting and computing text features from a sentence-document inverted index table and the temporary table according to the number of the sentences to obtain sentence similarity; establishing an adjacency list in accordance with the sentence similarity, computing text block similarity and detecting copying of two Tibetan language theses according to a text block similarity value. The Tibetan language thesis copying detection system comprises a Tibetan language thesis copying detection device and a database, wherein the Tibetan language thesis copying detection device is connected to a client terminal server through the Internet, and the database is connected to the server and used for storing Tibetan language theses. The Tibetan language thesis copying detection device comprises a preprocessing module for code conversion and noise removal of the text characters, a temporary table module for constructing the segmented text blocks, an extracting module for constructing sentence text features and a copying detection module for detecting whether the theses have similar copied data or not.

A mutable multilevel data structure representing a graph structure may include multiple read-only levels and a single writable level. Each read-only level may include a vertex table (with references to edge tables on the same level or a different level containing elements of adjacency lists for some vertices) and an edge table (with elements of adjacency lists that changed since the previous read-only level). A hybrid variant may switch between a performance-optimized variant (whose edge tables include complete adjacency lists for vertices whose edge sets were modified) and a space-optimized variant (whose edge tables include only newly added adjacency list elements). The vertex tables and / or the writable level may be implemented using copy-on-write arrays, each including an indirection table and multiple fixed-sized data pages. Computations may be run on the read-only levels or on the writable level and read-only levels.

In recent years, with the rapid development of a computer network, the RDF data volume on the Web rapidly increases, especially a large number of large-scale RDF data sets appear, and the mass data often has a complex network relationship, so that a traditional centralized query scheme cannot rapidly and accurately obtain a query result. The invention discloses a large-scale data parallel query method based on subgraph matching. The method is combined with a distributed platform, and mainly aims to improve the data query efficiency in a large-scale data set. Firstly, an adjacency list storagescheme is adopted for a data graph and a query graph, topological information and attribute information of the graph are fully utilized, and a query process is converted into fields including a judgment process; and then, the problem of matching sequence selection is solved by accurately evaluating the candidate number of the query points of each candidate region, the generation of intermediate results is reduced, and the exploration process of multiple candidate regions can be solved in parallel. Through the mode, the query efficiency can be effectively improved, and an accurate query resultcan be obtained.

The invention discloses a transformer substation intelligent tour inspection three-dimensional GIS (geographic information system) building method. The method includes: generating a route network; adopting Garmin equipment to collect longitude and latitude data of all points in all routes in a transformer substation; inputting the data of the points into a Map-source, selecting all key points to form an adjacency list, drawing specific routes according to information acquired by Garmin through AutoCAD software, and generating a file in a .shp format; step 2, building a three-dimensional scene. By the method, the main technical problems of a three-dimensional GIS system in the aspect of realization technology of power related industry in the prior art include low graphic rendering efficiency, incomplete display of geologic information, a lot of three-dimensional modeling work and difficulty in maintenance are solved.

The invention provides a cable network branch diagram manufacturing method based on topological graph automatic layout. The method includes the following steps of browsing a cable network model structural tree and reading three-dimensional cable network model information to obtain all cable wire harness information (2) of a cable network model, and browsing all branches for a certain cable to obtain information of two ports of the cable and the length information; thirdly, browsing a connecting relation list, and establishing an adjacency list; fourthly, arranging all vortexes on grid points through the combination of tree-shaped layered layout and mesh layout, and calculating the actual positions of the nodes in the page according to the grid positions of nodes and the size of the page; fifthly, folding up branch diagrams; sixthly, browsing all the nodes on a trunk, doing different movements according to the types of the nodes so that no crossing or overlapping happens to drawing of the branch diagrams; seventhly, marking the length of connecting cords of the branch diagrams; eighthly, sequentially drawing other cable branch diagrams, and outputting the branch diagrams drawn in batches into a file for guiding production.