CN108920435A - A kind of visualization procedure page data node matching method - Google Patents
A kind of visualization procedure page data node matching method Download PDFInfo
- Publication number
- CN108920435A CN108920435A CN201810694363.8A CN201810694363A CN108920435A CN 108920435 A CN108920435 A CN 108920435A CN 201810694363 A CN201810694363 A CN 201810694363A CN 108920435 A CN108920435 A CN 108920435A
- Authority
- CN
- China
- Prior art keywords
- connecting line
- visualization procedure
- symbol
- programmed
- matched
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 157
- 238000012800 visualization Methods 0.000 title claims abstract description 126
- 230000008569 process Effects 0.000 claims description 8
- 230000000007 visual effect Effects 0.000 claims description 8
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 claims description 3
- 230000015572 biosynthetic process Effects 0.000 claims 1
- 238000004458 analytical method Methods 0.000 abstract description 4
- 230000008859 change Effects 0.000 abstract description 3
- 230000004048 modification Effects 0.000 abstract description 3
- 238000012986 modification Methods 0.000 abstract description 3
- 238000010835 comparative analysis Methods 0.000 abstract description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/194—Calculation of difference between files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/34—Graphical or visual programming
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Stored Programmes (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of visualization procedure page data node matching methods, including reading two visualization procedure pages to be compared, the matching condition gradually weakened is set, is compared according to from optimal to the matching that programmed symbol and connecting line of the matching condition of suboptimum to the visualization procedure page carry out back end.The matching condition that the method for the present invention successively weakens carries out matching layer by layer to the programmed symbol and connecting line of the visualization procedure page to be compared and screens, on the one hand guarantee that the programmed symbol that do not change can be matched accurately first, on the other hand guarantee that attribute and the changed programmed symbol of connection relationship can also match；The method of the present invention is when the visualization procedure page is compared, the programmed symbol for being used for comparative analysis, the matched node of connecting line can be formed in the method for optimal-suboptimum, the various of page modification front and back can be fully taken into account to create, delete, after the variation of position connection relationship, more accurate matching pair is formed, is laid the foundation for the variance analysis of single symbol.
Description
Technical field
The invention belongs to visual programming fields, and in particular to a kind of visualization procedure page data node matching method.
Background technique
Visual programming is due to intuitive visual feature, in the exploitation of the embedded equipments such as electric system, Industry Control
Through being widely applied.There is the demand of modification maintenance in visualization procedure, need to carry out the comparison and difference point of visual page data
Analysis, and the key of variance analysis is to carry out node matching to programmed symbol and connecting line, finds the 2 side symbol sections for comparing
Thus point, this case generate.
Summary of the invention
The purpose of the present invention is the matched node for being used for analysis to be compared is formed in more excellent, relatively accurate method.In order to
Reach above-mentioned purpose, provides a kind of visualization procedure page data node matching method, characterized in that include the following steps：
S1：Page file information is read, network topology sequence is formed according to data flow dependence, determines programmed symbol chain
Table and connecting line chained list；
S2：Read two visualization procedure pages to be compared, the matching condition gradually weakened be set, according to from it is optimal to
The matching that the matching condition of suboptimum carries out back end to the programmed symbol and connecting line of the visualization procedure page compares.
Further, it reads page file information and includes the data of programmed symbol, connecting line, relay point, and connection is set
Line beginning and end information.
Further, the programmed symbol has several input-output points to connect for connection；The connecting line is for connecting
Output-input point between symbol indicates the data flow relation between programmed symbol；The relay point is the circle on connecting line
Point, for drawing new connecting line from connecting line and being segmented former connecting line.
Still further, including matching when the programmed symbol and connecting line to the visualization procedure page to be compared match
The UUID of programmed symbol and connecting line, characteristic information, description information, link information and location information.
Further, the UUID is a string of the random strings automatically formed when programmed symbol and connecting line are newly-built, is adjusted
It is formed with the api interface of operating system, there is uniqueness.
Further, the characteristic information is to be formed when reading the visualization procedure page according to programmed symbol information
One character string；Characteristic information describes programmed symbol self attributes and external connection relationship, specifically includes the class of programmed symbol
Type and title, the type of all variables and title and the opposite side tie point being connected with input and output tie point and opposite side programming symbol
Number type and title.
Further, the description information is to be generated when reading the visualization procedure page according to programmed symbol information
One character string, description information describe programmed symbol self attributes, but do not include link information, specifically include programmed symbol
The type and title of type and title and all variables.
Still further, the matching for carrying out back end to the programmed symbol of the visualization procedure page to be compared compares, tool
Body includes the following steps：
A) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol is compared with each of the visualization procedure page 2 programmed symbol carries out UUID, if two programmed symbol UUID
It is identical, then be formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
B) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol is compared with each of the visualization procedure page 2 programmed symbol carries out characteristic information；If two programmed symbols
Characteristic information is identical, then is formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
C) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol information is described with each of the visualization procedure page 2 programmed symbol compared with, the pass with matched node
Connection information compares.If the description information of two programmed symbols, identical as the related information of matched node, be formed as matching section
Point, and matched programmed symbol is deleted in programmed symbol list；
D) whether judgement generates new matched node by step c), if there is new matched node, repeats step c), otherwise
Step e) is carried out down；
E) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol matches compared with carrying out type, title with each of the visualization procedure page 2 programmed symbol with relative position；Institute
State less than one threshold value of grid deviation that relative position matching refers to two programmed symbols；If two programmed symbol types,
Title is matched just as, relative position, then is formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
F) whether judgement generates new matched node by step e), if there is new matched node, just repeats step f), no
Then exit single programming Symbol matching process.
G) programmed symbol not matched in the visualization procedure page 1 is set as being deleted label, for visualizing journey
Non- matching symbols are set as newly-built label in the sequence page 2.
Further, the related information with matched node refers to two programmed symbols with the presence or absence of company of the same name
Contact is connected to other matched same type programmed symbols.
Further, the matching for carrying out back end to the connecting line of the visualization procedure page to be compared compares, specifically
Include the following steps：
A) connecting line in the visualization procedure page 1 and the visualization procedure page 2 is handled, if connecting line terminal is relaying
Point is then not involved in matching, if connecting line starting point is relay point, the starting point for resetting connecting line rises to what is connect with relay point
Point repeats this process, until the starting point of connecting line is no longer relay point；
B) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Wiring, if UUID is identical, is formed as matching section compared with each connecting line in the visualization procedure page 2 carries out UUID
Point, and matched connecting line is deleted in connecting line list；
C) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Wiring is compared with each connecting line in the visualization procedure page 2 carries out beginning and end information；Beginning and end information ratio
Relatively include the tie point title for comparing beginning and end, connect whether programmed symbol matches correspondence, is formed as matching if equal
Node, and matched connecting line is deleted in connecting line list；
D) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Compared with each connecting line in the visualization procedure page 2 carries out endpoint information, endpoint information compares including comparing for wiring
Whether the tie point title of terminal, terminal connection programmed symbol match correspondence, are formed as matched node if equal, and from connection
Matched connecting line is deleted in alignment table；
E) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Compared with each connecting line in the visualization procedure page 2 carries out origin information, origin information compares including comparing for wiring
Whether the tie point title of starting point, connection programmed symbol match correspondence, are formed as matched node if equal, and from connection alignment
Matched connecting line is deleted in table；
F) connecting line not matched in the visualization procedure page 1 is set as being deleted label, for visualization procedure
Connecting line is not matched in the page 2 and is set as newly-built label.
The beneficial effects obtained by the present invention are as follows：The method of the present invention, can be with most when the visualization procedure page is compared
The method of excellent-suboptimum forms the matched node of the programmed symbol, connecting line that are used for comparative analysis, can fully take into account page modification
The various of front and back create, delete, after the variation of position connection relationship, more accurate matching pair are formed, for the difference of single symbol
Different analysis lays the foundation, and this method is protected in visualization engineering maintenance exploitation in multiple DC controls and used, and providing can
Relative efficiency is analyzed depending on changing program.
Detailed description of the invention
Fig. 1 is the node matching flow diagram of the method for the present invention specific embodiment.
Specific embodiment
The invention will be further described below in conjunction with the accompanying drawings.Following embodiment is only used for clearly illustrating the present invention
Technical solution, and not intended to limit the protection scope of the present invention.
Embodiment 1：
Read the data such as page file, including programmed symbol, connecting line, relay point, setting connecting line starting point, terminal letter
Breath forms network structure；The description information and characteristic information for generating each symbol are for Symbol matching；Traversing to be compared two can
Depending on changing the symbol in the program page visualization procedure page 1 and 2, closed by characteristic information, description information, connection relationship, position
It is to match the programmed symbol in two pages of alignment；It is matched by the bound symbol of beginning and end, connection point information pair
Connecting line in neat two pages.
The programmed symbol is a symbolic blocks in visual programming, represents a kind of specific function, such as add and subtract
Operation, delay, filtering etc., it has the attributes such as input, output, parameter.
Connecting line is a kind of special programmed symbol, it is connected to the input and output node of programmed symbol, it certain
The input of the programmed symbol of the output and terminal of the attribute record programmed symbol of starting point, that is, the meaning of link information.
The location information of programmed symbol is exactly X, Y-axis pixel coordinate in visual programming interface, it is programmed symbol
An attribute.All programmed symbols are all stored in page file by a kind of description language.When reading page file
All programmed symbols and its attribute can be obtained, complete programmed page can be constructed by these attributes.
Programmed symbol, connecting line have UUID (Universally Unique Identifier, Universally Unique Identifier's
Abbreviation) attribute, UUID is a string of the random strings automatically formed when programmed symbol and connecting line are newly-built, call operation system
Api interface is formed, and has uniqueness, it is preferable that uses Qt::CreateUUID interface is formed.Programmed symbol signed,
The attributes such as designation, input-output name variable, types of variables.Connecting line has the variable name of connecting line starting point connection, starting point
Variable name, the terminal symbol UUID that symbol UUID, terminal connect.By analyzing above-mentioned page data, topological network can be formed.
Preferably, programmed symbol matching process is as follows in specific embodiment：
A) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol is compared with each of the visualization procedure page 2 programmed symbol carries out UUID, if two programmed symbol UUID
It is identical, then be formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
B) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol is compared with each of the visualization procedure page 2 programmed symbol carries out characteristic information.The characteristic information
It is when reading the visualization procedure page, according to the character string that programmed symbol information is formed, it describes programmed symbol certainly
Body attribute and external connection relationship, specifically include type/title of programmed symbol, type/title of all variables and with it is defeated
Enter type/title of output connection connected opposite side tie point and opposite side programmed symbol；If two programmed symbol characteristic informations
It is identical, then be formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
C) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol information is described with each of the visualization procedure page 2 programmed symbol compared with, the pass with matched node
Connection information compares；The description information is when reading the visualization procedure page, according to one of the generation of programmed symbol information
Character string, it describes programmed symbol self attributes, but does not include link information, specifically includes type/title of programmed symbol
With type/title of all variables.The described related information with matched node refers to two programmed symbols with the presence or absence of same
The tie point of name is connected to other matched same type programmed symbols.If the description information of two programmed symbols, with
Related information with node is identical, then is formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
D) whether judgement generates new matched node by step c), if there is new matched node, repeats step c), otherwise
Step e) is carried out down；
E) the programmed symbol list for successively traversing 2 visualization procedure pages, by each of visualization procedure page 1
Programmed symbol matches compared with carrying out type, title with each of the visualization procedure page 2 programmed symbol with relative position, institute
The relative position matching stated refers to less than one threshold value of grid deviation of two programmed symbols, such as (x2-x1)2+(y2-y1)2
<=100.If two programmed symbol types, title are matched just as, relative position, be formed as matched node, and accord with from programming
Matched programmed symbol is deleted in number list；
F) whether judgement generates new matched node by step e), if there is new matched node, just repeats step f), no
Then exit single programming Symbol matching process.
G) programmed symbol not matched in the visualization procedure page 1 is set as being deleted label, for visualizing journey
Non- matching symbols are set as newly-built label in the sequence page 2.
Above-mentioned programmed symbol matching embodiment uses 4 matching conditions successively weakened to the visualization procedure page 1
Programmed symbol with 2 carries out matching screening layer by layer, on the one hand guarantees that the programmed symbol that do not change can be matched accurately first, another party
Face guarantees that attribute and the changed programmed symbol of connection relationship can also match.
Connecting line matching process is as follows in specific embodiment：
A) connecting line in the visualization procedure page 1 and the visualization procedure page 2 is handled, if connecting line terminal is relaying
Point is then not involved in matching, if connecting line starting point is relay point, the starting point for resetting connecting line rises to what is connect with relay point
Point repeats this process, until the starting point of connecting line is no longer relay point；
B) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Wiring, if UUID is identical, is formed as matching section compared with each connecting line in the visualization procedure page 2 carries out UUID
Point, and matched connecting line is deleted in connecting line list；
C) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Wiring is compared with each connecting line in the visualization procedure page 2 carries out beginning and end information, beginning and end information ratio
Relatively include compare the tie point title of beginning and end, whether bound symbol matches correspondence, be formed as matched node if equal,
And matched connecting line is deleted in connecting line list；
D) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Compared with each connecting line in the visualization procedure page 2 carries out endpoint information, endpoint information compares including comparing for wiring
Whether the tie point title of terminal, terminal connection programmed symbol match correspondence, are formed as matched node if equal, and from connection
Matched connecting line is deleted in alignment table；
E) the connecting line list for successively traversing 2 visualization procedure pages, each in the visualization procedure page 1 is connected
Compared with each connecting line in the visualization procedure page 2 carries out origin information, origin information compares including comparing for wiring
Whether the tie point title of starting point, connection programmed symbol match correspondence, are formed as matched node if equal, and from connection alignment
Matched connecting line is deleted in table；
F) connecting line not matched in the visualization procedure page 1 is set as being deleted label, for visualization procedure
Connecting line is not matched in the page 2 and is set as newly-built label.
Above-mentioned connection lines matching embodiment constructs 4 and successively weakens using UUID and the programmed symbol matched
Matching condition in the visualization procedure page 1 and 2 connecting line carry out layer by layer matching screen, on the one hand guarantee the company not changed
Wiring can be matched accurately first, and the connecting line on the other hand guaranteeing that starting point or terminal change can also match.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (10)
1. a kind of visualization procedure page data node matching method, characterized in that include the following steps：
S1：Read page file information, according to data flow dependence formed network topology sequence, determine programmed symbol chained list and
Connecting line chained list；
S2：Two visualization procedure pages to be compared are read, the matching condition gradually weakened is set, according to from optimal to suboptimum
Matching condition back end is carried out to the programmed symbol and connecting line of the visualization procedure page matching compare.
2. visualization procedure page data node matching method according to claim 1, characterized in that
It reads page file information and includes the data of programmed symbol, connecting line, relay point, and connecting line beginning and end letter is set
Breath.
3. visualization procedure page data node matching method according to claim 2, characterized in that the programmed symbol
There are several input-output points for connection；The connecting line indicates programming for output-input point between bound symbol
Data flow relation between symbol；The relay point is the dot on connecting line, for drawing new connection from connecting line
Former connecting line is simultaneously segmented by line.
4. visualization procedure page data node matching method according to claim 3, characterized in to be compared visual
The programmed symbol and connecting line for changing the program page include the UUID for matching programmed symbol and connecting line, feature letter when being matched
Breath, description information, link information and location information.
5. visualization procedure page data node matching method according to claim 4, characterized in that the UUID is to compile
A string of the random strings automatically formed when journey symbol and newly-built connecting line, the api interface of call operation system are formed, and are had only
One property.
6. visualization procedure page data node matching method according to claim 4, characterized in that the characteristic information
It is when reading the visualization procedure page, according to a character string of programmed symbol information formation；Characteristic information describes programming
Symbol self attributes and external connection relationship specifically include the type and title, the type and title of all variables of programmed symbol
And the type and title for the opposite side tie point and opposite side programmed symbol being connected with input and output tie point.
7. visualization procedure page data node matching method according to claim 4, characterized in that the description information
It is when reading the visualization procedure page, according to the character string that programmed symbol information generates, description information describes programming
Symbol self attributes, but do not include link information, specifically include programmed symbol type and title and the type of all variables and
Title.
8. visualization procedure page data node matching method according to claim 4, characterized in to be compared visual
The programmed symbol for changing the program page carries out the matching comparison of back end, specifically includes following steps：
A) the programmed symbol list for successively traversing 2 visualization procedure pages, each of visualization procedure page 1 is programmed
Symbol is compared with each of the visualization procedure page 2 programmed symbol carries out UUID, if two programmed symbol UUID are identical,
Then be formed as matched node, and delete matched programmed symbol in programmed symbol list；
B) the programmed symbol list for successively traversing 2 visualization procedure pages, each of visualization procedure page 1 is programmed
Symbol is compared with each of the visualization procedure page 2 programmed symbol carries out characteristic information；If two programmed symbol features
Information is identical, then is formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
C) the programmed symbol list for successively traversing 2 visualization procedure pages, each of visualization procedure page 1 is programmed
Symbol information is described with each of the visualization procedure page 2 programmed symbol compared with, with matched node be associated with letter
Breath compares；If the description information of two programmed symbols, identical as the related information of matched node, be formed as matched node,
And matched programmed symbol is deleted in programmed symbol list；
D) whether judgement generates new matched node by step c), if there is new matched node, repeats step c), otherwise down
Carry out step e)；
E) the programmed symbol list for successively traversing 2 visualization procedure pages, each of visualization procedure page 1 is programmed
Symbol matches compared with carrying out type, title with each of the visualization procedure page 2 programmed symbol with relative position；The phase
Location matches are referred to less than one threshold value of grid deviation of two programmed symbols；If two programmed symbol types, titles
Just as the matching of, relative position, be then formed as matched node, and matched programmed symbol is deleted in programmed symbol list；
F) whether judgement generates new matched node by step e), if there is new matched node, just repeats step f), otherwise moves back
Single programming Symbol matching process out；
G) programmed symbol not matched in the visualization procedure page 1 is set as being deleted label, for visualization procedure page
Non- matching symbols are set as newly-built label in face 2.
9. visualization procedure page data node matching method according to claim 5, characterized in that it is described with matched
The related information of node refers to that two programmed symbols are connected to other matched same types with the presence or absence of tie point of the same name
Programmed symbol.
10. visualization procedure page data node matching method according to claim 4, characterized in that it is to be compared can
Connecting line depending on changing the program page carries out the matching comparison of back end, specifically includes following steps：
A) connecting line in the visualization procedure page 1 and the visualization procedure page 2 is handled, if connecting line terminal is relay point,
It is then not involved in matching, if connecting line starting point is relay point, resets the starting point of connecting line to the starting point connecting with relay point, again
This multiple process, until the starting point of connecting line is no longer relay point；
B) the connecting line list for successively traversing 2 visualization procedure pages, by each connecting line in the visualization procedure page 1
Compared with each connecting line in the visualization procedure page 2 carries out UUID, if UUID is identical, be formed as matched node, and
Matched connecting line is deleted in connecting line list；
C) the connecting line list for successively traversing 2 visualization procedure pages, by each connecting line in the visualization procedure page 1
Compared with each connecting line in the visualization procedure page 2 carries out beginning and end information；Beginning and end information compares packet
Whether the programmed symbol for including the tie point title, connection that compare beginning and end matches correspondence, is formed as matching section if equal
Point, and matched connecting line is deleted in connecting line list；
D) the connecting line list for successively traversing 2 visualization procedure pages, by each connecting line in the visualization procedure page 1
Compared with each connecting line in the visualization procedure page 2 carries out endpoint information, endpoint information compares including comparing terminal
Tie point title, terminal connection programmed symbol whether match correspondence, be formed as matched node if equal, and from connection alignment
Matched connecting line is deleted in table；
E) the connecting line list for successively traversing 2 visualization procedure pages, by each connecting line in the visualization procedure page 1
Compared with each connecting line in the visualization procedure page 2 carries out origin information, origin information compares including comparing starting point
Tie point title, connection programmed symbol whether match correspondence, be formed as matched node if equal, and in connecting line list
Delete matched connecting line；
F) connecting line not matched in the visualization procedure page 1 is set as being deleted label, for the visualization procedure page 2
In do not match connecting line and be set as newly-built label.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810694363.8A CN108920435B (en) | 2018-06-29 | 2018-06-29 | Visual program page data node matching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810694363.8A CN108920435B (en) | 2018-06-29 | 2018-06-29 | Visual program page data node matching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108920435A true CN108920435A (en) | 2018-11-30 |
| CN108920435B CN108920435B (en) | 2022-08-26 |
Family
ID=64422454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810694363.8A Expired - Fee Related CN108920435B (en) | 2018-06-29 | 2018-06-29 | Visual program page data node matching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108920435B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109871205A (en) * | 2018-12-15 | 2019-06-11 | 中国平安人寿保险股份有限公司 | GUI code method of adjustment, device, computer installation and storage medium |
| CN112230910A (en) * | 2019-07-15 | 2021-01-15 | 腾讯科技（深圳）有限公司 | Page generation method, device, equipment and storage medium of embedded program |
| CN113900853A (en) * | 2021-11-03 | 2022-01-07 | 中国南方电网有限责任公司超高压输电公司昆明局 | Method, device and equipment for checking direct current control protection program and storage medium |
| CN116631552A (en) * | 2023-07-21 | 2023-08-22 | 浙江太美医疗科技股份有限公司 | Random grouping scheme generation method, device, equipment and medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150074260A1 (en) * | 2013-09-11 | 2015-03-12 | Cisco Technology, Inc. | Auto discovery and topology rendering in substation networks |
| CN104834525A (en) * | 2015-05-14 | 2015-08-12 | 南京南瑞继保电气有限公司 | Graphical page linked network processing method based on relay points |
| CN105930174A (en) * | 2016-05-22 | 2016-09-07 | 南京南瑞继保电气有限公司 | Difference comparison method and system for graphical page programs |
| CN106910140A (en) * | 2017-01-09 | 2017-06-30 | 浙江大学 | A kind of method based on SVG form power system wiring diagram Network topologies |
| CN107766428A (en) * | 2017-09-15 | 2018-03-06 | 北京大学 | A kind of automatic method and system for realizing data visualization |
-
2018
- 2018-06-29 CN CN201810694363.8A patent/CN108920435B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150074260A1 (en) * | 2013-09-11 | 2015-03-12 | Cisco Technology, Inc. | Auto discovery and topology rendering in substation networks |
| CN104834525A (en) * | 2015-05-14 | 2015-08-12 | 南京南瑞继保电气有限公司 | Graphical page linked network processing method based on relay points |
| CN105930174A (en) * | 2016-05-22 | 2016-09-07 | 南京南瑞继保电气有限公司 | Difference comparison method and system for graphical page programs |
| CN106910140A (en) * | 2017-01-09 | 2017-06-30 | 浙江大学 | A kind of method based on SVG form power system wiring diagram Network topologies |
| CN107766428A (en) * | 2017-09-15 | 2018-03-06 | 北京大学 | A kind of automatic method and system for realizing data visualization |
Non-Patent Citations (3)
| Title |
|---|
| DAVID BENNETT 等: "《Visual C++5开发人员指南》", 30 June 1998, 机械工业出版社 * |
| 刘国伟 等: "嵌入式装置可视化页面程序代码处理架构设计", 《单片机与嵌入式系统应用》 * |
| 刘秀秀: "基于序列比对方法的金融波动研究", 《中国优秀博硕士学位论文全文数据库（硕士）经济与管理科学辑（月刊）》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109871205A (en) * | 2018-12-15 | 2019-06-11 | 中国平安人寿保险股份有限公司 | GUI code method of adjustment, device, computer installation and storage medium |
| CN109871205B (en) * | 2018-12-15 | 2023-07-18 | 中国平安人寿保险股份有限公司 | Interface code adjustment method, device, computer device and storage medium |
| CN112230910A (en) * | 2019-07-15 | 2021-01-15 | 腾讯科技（深圳）有限公司 | Page generation method, device, equipment and storage medium of embedded program |
| CN112230910B (en) * | 2019-07-15 | 2023-09-15 | 腾讯科技（深圳）有限公司 | Page generation method, device and equipment of embedded program and storage medium |
| CN113900853A (en) * | 2021-11-03 | 2022-01-07 | 中国南方电网有限责任公司超高压输电公司昆明局 | Method, device and equipment for checking direct current control protection program and storage medium |
| CN116631552A (en) * | 2023-07-21 | 2023-08-22 | 浙江太美医疗科技股份有限公司 | Random grouping scheme generation method, device, equipment and medium |
| CN116631552B (en) * | 2023-07-21 | 2023-11-21 | 浙江太美医疗科技股份有限公司 | Random grouping scheme generation method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108920435B (en) | 2022-08-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108920435A (en) | A kind of visualization procedure page data node matching method | |
| Fan et al. | Optimal routing for maximizing the travel time reliability | |
| EP1972093B1 (en) | A method for the automatic generation of workflow models, in particular for interventions in a telecommunication network | |
| Giua et al. | Fault detection for discrete event systems using Petri nets with unobservable transitions | |
| CN101753369A (en) | Method and device for detecting firewall rule conflict | |
| CN102693317A (en) | Method and device for data mining process generating | |
| CN106033388A (en) | A test use case library management method and system | |
| US20220012233A1 (en) | Creation of a Blockchain with Blocks Comprising an Adjustable Number of Transaction Blocks and Multiple Intermediate Blocks | |
| CN112287423B (en) | Power distribution network visual planning method and terminal based on graph-model integration | |
| CN109408916A (en) | A kind of recognition methods of graphics logic configuration | |
| Decreusefond | The Stein-Dirichlet-Malliavin method | |
| Chakravorty et al. | Sufficient conditions for the value function and optimal strategy to be even and quasi-convex | |
| CN115169891B (en) | Method for realizing workflow engine comprising multi-start-point multi-branch flow | |
| US11799721B2 (en) | Document driven network configuration updater | |
| CN109088771B (en) | Internet of things node template inheritance system of Internet of things application platform | |
| CN107579837A (en) | The method and device that a kind of damaged business is repaired automatically | |
| Kukluk et al. | Inference of node replacement recursive graph grammars | |
| Cisco | Basic Configuration | |
| Cisco | Creating IPX SAP Requirements and Modifying Router Attributes | |
| Cisco | Creating IPX SAP Requirements and Modifying Router Attributes | |
| Cisco | Creating IPX SAP Requirements and Modifying Router Attributes | |
| Cisco | Creating IPX SAP Requirements and Modifying Router Attributes | |
| Cisco | Creating IPX SAP Requirements and Modifying Router Attributes | |
| Egerton et al. | Some criticisms of stochastic shrinkage and ridge regression, with counterexamples | |
| CN104135382B (en) | The implementation method of business configuration view in PON system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20220826 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |