CN109710240A - Flow chart decomposition method and system - Google Patents
Flow chart decomposition method and system Download PDFInfo
- Publication number
- CN109710240A CN109710240A CN201811332149.4A CN201811332149A CN109710240A CN 109710240 A CN109710240 A CN 109710240A CN 201811332149 A CN201811332149 A CN 201811332149A CN 109710240 A CN109710240 A CN 109710240A
- Authority
- CN
- China
- Prior art keywords
- node
- decomposed
- flow chart
- father
- son
- 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.)
- Pending
Links
Abstract
The present invention relates to financial application development technique fields.The embodiment of the present invention provides a kind of flow chart decomposition method and system, wherein this method comprises: obtain flow chart to be decomposed, and the process element of flow chart to be decomposed is extracted, wherein the process element includes arrow and flow nodes；Based on extracted process element, father and son's node relationships in flow chart to be decomposed between each flow nodes are determined；According to father and son's node relationships, the root node and leaf node in flow chart to be decomposed are determined, wherein root node indicates that the upper node connected through arrow is not present in it, and leaf node indicates that the next node connected through arrow is not present in it；And according to father and son's node relationships, with the sequence of root node to leaf node, flow chart to be decomposed correspondence is decomposed into multiple independent sub-process figures.The root node and leaf node in screening process figure are proposed as a result, and decomposes sub-process figure accordingly, have ensured the accuracy of the sub-process figure decomposited and comprehensive.
Description
Technical field
The present invention relates to financial application development technique fields, more particularly to a kind of flow chart decomposition method and system.
Background technique
Can all there be flow chart in the R&D process of product at present, it is known that flow chart includes multiple individual paths, it is real
During the research and development of products of border, in requirements review, network analysis, need to pass through decomposition process in the links such as Test Sample Design
How many sub-process figure confirms.
Subclass involved in current financial application product and product quantity are numerous, such as general loan product has 30
Subclass and 50 a plurality of loan products, with business growth and constantly access new demand, required by the flow chart comb that is related to
The work of reason can be more and more.
For there is the Complicated Flow of multiple branches, or have across multiple system complex flow charts, if desired the complexity is flowed
Cheng Jinhang is manually decomposed, then can exist and omit, and be also easy to lead to the tremendous increase of cost of labor.
To sum up, how will accurately decomposite corresponding to multiple sub-processes under complicated flow chart is current financial application
Development field technical problem urgently to be resolved.
Summary of the invention
The purpose of the embodiment of the present invention is that a kind of flow chart decomposition method and system are provided, at least to solve the prior art
In manually decompose cost of labor caused by Complicated Flow it is excessive and it is easy omit decompose sub-process the problem of.
To achieve the goals above, on the one hand the embodiment of the present invention provides a kind of flow chart decomposition method, comprising: obtain to
Decomposition process figure, and the process element of the flow chart to be decomposed is extracted, wherein the process element includes arrow and process section
Point；Based on extracted process element, father and son's node relationships in the flow chart to be decomposed between each flow nodes are determined；Root
According to father and son's node relationships, root node and leaf node in the flow chart to be decomposed are determined, wherein the root node table
Show that the upper node connected through arrow is not present in it, the leaf node indicates that the next node connected through arrow is not present in it；
And according to father and son's node relationships, with the root node to the sequence of the leaf node, by the flow chart to be decomposed
Correspondence is decomposed into multiple independent sub-process figures.
On the other hand the embodiment of the present invention provides a kind of flow chart decomposing system, comprising: process element extraction unit is used for
Obtain flow chart to be decomposed, and extract the process element of the flow chart to be decomposed, wherein the process element include arrow and
Flow nodes；Father and son's node relationships determination unit determines in the flow chart to be decomposed for being based on extracted process element
Father and son's node relationships between each flow nodes；Node-classification unit, for according to father and son's node relationships, determine it is described to
Root node and leaf node in decomposition process figure, wherein the root node, which indicates that it is not present, connects a upper node through arrow,
The leaf node indicates that the next node connected through arrow is not present in it；Flow chart decomposition unit, for according to the father and son
The flow chart correspondence to be decomposed is decomposed into multiple only by node relationships with the root node to the sequence of the leaf node
Vertical sub-process figure.
On the other hand the embodiment of the present invention provides a kind of computer equipment, including memory and processor, the memory
It is stored with computer program, wherein the processor realizes the step of the above-mentioned method of the application when executing the computer program
Suddenly.
On the other hand the embodiment of the present invention provides a kind of computer storage medium, be stored thereon with computer program, wherein
The computer program realizes the step of the application above-mentioned method when being executed by processor.
Through the above technical solutions, proposing the automation decomposition process for decompositing sub-process figure from flow chart, it is not required to
Artificial decomposition in the prior art is wanted, to reduce cost of labor；Also, the technical program proposes to be decomposed by determination
Then father and son's node relationships in flow chart between each flow nodes screen root node and leaf section by father and son's node relationships
Point, and then the rule of application sub-process figure, go out sub-process figure with the sequential breakdown from root node to leaf node, have ensured and divided
The accuracy of the sub-process figure solved and comprehensive.
The other feature and advantage of the embodiment of the present invention will the following detailed description will be given in the detailed implementation section.
Detailed description of the invention
Attached drawing is to further understand for providing to the embodiment of the present invention, and constitute part of specification, under
The specific embodiment in face is used to explain the present invention embodiment together, but does not constitute the limitation to the embodiment of the present invention.Attached
In figure:
Fig. 1 is the flow chart of the flow chart decomposition method of one embodiment of the invention；
Fig. 2 is to realize the specific execution process determined to root node and leaf node in the S13 of Fig. 1 by decision tree
Figure；
Fig. 3 is to realize the specific execution flow chart generated to sub-process figure in the S14 of Fig. 1 by decision tree；
Fig. 4 is the principle process schematic diagram of the flow chart decomposition method of one embodiment of the invention；
Fig. 5 is the structural block diagram of the flow chart decomposing system of one embodiment of the invention.
Specific embodiment
It is described in detail below in conjunction with specific embodiment of the attached drawing to the embodiment of the present invention.It should be understood that this
Locate described specific embodiment and be merely to illustrate and explain the present invention embodiment, is not intended to restrict the invention embodiment.
During current financial application product development, the demand of each product can provide a corresponding Business Stream
Turn flow chart, the developer then applied can carry out the carry out code of actual code logic according to this work flow flow chart
It writes and tester can cover full-range use-case according to flow chart, test；Therefore start rank in R&D work
Section, requires to comb process involved in flow chart.In view of this, the embodiment of the present invention is in a variety of automatic cardings of the displosure
The specific embodiment of sub-process figure is in a manner of substituting in the prior art manually combing sub-process figure.
Such as Fig. 1, the flow chart decomposition method of one embodiment of the invention, comprising:
S11, flow chart to be decomposed is obtained, and extracts the process element of flow chart to be decomposed, wherein the process element includes
Arrow and flow nodes.
About the implementation object of present invention method, one side can be the Special clothes for being exclusively used in decomposition process figure
Business device or special-purpose terminal (such as special instrument)；On the other hand, it can also be common apparatus to implement, wherein the common apparatus
It is equipped with for the module of decomposition process figure or configured with the program code for decomposition process figure, and belongs to guarantor of the invention
It protects in range.
About the acquisition modes of flow chart to be decomposed, can be through developer to the terminal or equipment for decomposition
Middle input flow chart to be decomposed；In addition, the extracting mode about process element, can be application image identification technology from wait divide
Identify in the solution flow chart and image recognition technology can be image recognition technology or more novel general at present
Image recognition technology, and belong in protection scope of the present invention above.
S12, it is based on extracted process element, determines that father and son's node in flow chart to be decomposed between each flow nodes closes
System.
As an example, including flow nodes and arrow in process element, the section for being connected the head of arrow can be
Point is known as child node, and the node that the tail portion of arrow is connected is known as father node.
S13, according to father and son's node relationships, determine the root node and leaf node in flow chart to be decomposed, wherein root node
Indicate that the upper node connected through arrow is not present in it, leaf node indicates that the next node connected through arrow is not present in it.
It should be understood that root node can be flow nodes when a flow chart starts and leaf node can be with
It is the flow nodes at the end of a flow chart.
S14, flow chart to be decomposed is corresponded to and is decomposed with the sequence of root node to leaf node according to father and son's node relationships
For multiple independent sub-process figures.
In embodiments of the present invention, due to the beginning and end of root node and the leaf node person's of indicating respectively flow chart, certainly
Root node can be derived that accurate sub-process figure to the sub-process figure that leaf node is extracted.
It, specifically can be with during process element extraction as the further open and optimization of the embodiment of the present invention
It is: firstly, identifying the type of the process element in flow chart to be decomposed and the content of process element；Later, based on being identified
The type of process element extracts arrow and flow nodes；Then, the content based on the process element identified, filling are extracted
Arrow and flow nodes.
As the further open and optimization of the embodiment of the present invention, can be by means of decision tree determine root node and
Leaf node, being specifically referred to process as shown in Figure 2 includes: S131, according to father and son's node relationships, by flow chart to be decomposed
Each flow nodes correspondence store to decision tree dictionary, with construct correspond to flow chart to be decomposed decision tree；S132, parsing
Decision tree, with the root node and leaf node in determination flow chart to be decomposed, such as just by the tree of analytical strategy tree
It can be concluded that corresponding and leaf node.As an example, can be according to father and son's node relationships, each flow nodes are converted
For the required dictionary type of decision tree dictionary, then each flow nodes are stored according to father and son's node relationships to decision tree word
Allusion quotation.
Further, the process of decision tree building may include that decision tree framework determines subprocess and fills process,
Specifically may is that firstly, according to father and son's node relationships, by each flow nodes of flow chart to be decomposed and its between connection close
System maps to decision tree dictionary, to generate decision tree framework；Then, right by content of text documented in each flow nodes
It should fill into decision tree framework, to construct the decision tree for corresponding to flow chart to be decomposed.Wherein, documented by flow nodes
Content of text equally can be obtained by image recognition technology, such as it can be in S11 image recognition process element
The content of identification process element is gone back while type (such as arrow and flow nodes).
In some embodiments, it can also be the extraction by decision tree realization to sub-process figure, it is specific as shown in Figure 3
Process: S141: determining the height and width of each flow nodes in decision tree, and for each flow nodes assign it is corresponding certainly
Plan tree coordinate；S142: go out a plurality of individual path to leaf node recurrence from the root node of decision tree, and count a plurality of individual path
The decision tree coordinate of the flow nodes sequentially passed through respectively；S143, according to the decision tree coordinate under the individual path counted, it is raw
At with the unique corresponding sub-process figure of individual path.
For example, the flow nodes in decision tree can be expressed as A (a, b), and wherein a indicates that the width of node, b indicate
The height of node；Root node is found towards the direction of leaf node by recursion method, finds the flow nodes sequentially passed through,
And node coordinate corresponding to corresponding flow nodes, such as A1-A2-A3 are recorded, the decision tree being then based under individual path sits
Mark (such as A1-A2-A3) can realize the sequence calling to specific flow nodes, to generate corresponding sub-process figure.
Leaf node in view of decision tree should be uniquely corresponding with sub-process figure, therefore can be based on to decision tree
Leaf node statistics, so that whether the decomposed sub-process figure of verifying is omitted；Specifically, it can be statistical decision
Then first quantity of the leaf node of tree, and count the second quantity of sub-process figure generated judges the first quantity and the
Whether two quantity match, to verify with the presence or absence of the sub-process figure not being decomposed out.For example, when the first quantity is greater than the second number
When amount, then show there is the sub-process figure for omitting corresponding leaf node, can be prompt developer at this time to flow chart again
Carry out combing and it is perfect.
In some preferred embodiments, by flow chart to be decomposed it is corresponding be decomposed into multiple independent sub-process figures it
Afterwards, this method further include: multiple independent sub-process figures are individually stored as corresponding multiple data files, and exporting should
The multiple data files stored, in order to carry out the combing work of subsequent development, test.
Such as Fig. 4, it illustrates the example of the principle process of the flow chart decomposition method of one embodiment of the invention, including
Following several stages: image recognition stage-phase data memory-decision tree framework establishment stage-node coordinate calculation stages-section
Point note stage-sub-process catabolic phase.It is specific:
1) the image recognition stage
The various types of other process element treated in decomposition process figure carries out recognition, specifically identifies the arrow in flow chart
Included content in head direction, node ID, node type (for example whether for leaf node or root node) and node；For example,
About the identification of leaf node, the arrow for whether being also directed toward next node for judging node can be, if not having, it is determined that should
Node is leaf node, on the contrary then determine that the node is father node, and the relationship between the node at arrow both ends is determined as father
Child node relationships.
2) phase data memory
According to each node and father and son's node relationships, each flow nodes are saved as into dictionary type；To be based on python
Structure type for, structure type is as follows:
S=' a':{ 0:'no', 1:{ ' aa':{ 0:'no', 1:'no'}
Wherein, a is the key of root node, and a is 0 and 1 father node, and 1 is the father node of aa again, hereby based on the stream of recognition
Flow nodes correspondence is stored in decision tree dictionary by Cheng Yuansu and the set membership for combining each flow nodes.
3) decision tree constructs the stage
According to 2) data presented dictionary s, each flow nodes are parsed whether also comprising child node, to obtain the height of tree
It spends (i.e. the number of plies), such as in the next node for determining that a node has corresponding arrow, whether analyzes the next node at this time
There is also the next nodes that arrow is directed toward, and thereby determine that out the height set accordingly；In addition, by statistics leaf node,
The quantity of leaf node can be determined as to the width of tree.The width of height and tree based on tree constructs decision tree frame.
4) node coordinate calculation stages
According to height value, the width value of result and decision tree in 3), calculates each flow nodes and determine relative to whole
The decision tree coordinate of plan tree.
5) node explains the stage
It is that node corresponding to each node ID adds annotating information (such as mark father according to the decision tree coordinate in 4)
Node, leaf node, relative position), such as can be and be identified as leaf node with no, and it is identified as father node using value
(i.e. its there are also child nodes), to generate decision tree.
6) sub-process catabolic phase
On the basis of 5), using recursive method from the root node of decision tree to leaf node extracting branch path, solve
The nodal information that analysis individual path is passed through, and then generate the sub-process after decomposing.
For example, the node A (a, b) in final decision tree, wherein a indicates that the width of node, b indicate the height of node
Degree；Root node is found by recursion method and combines father and son's node relationships towards the direction of leaf node, is found and is constituted branch's process
Each node position coordinates, and be associated with generate branch's process；Each sub-process is exported with text or node sequence
The form of figure saves as individual file, and decision tree is finally to obtain as the correctness of intermediate product verifying decomposable process
Multiple sub-processes are target after decomposition, in order to carry out subsequent development, test combing work.It is converted as a result, based on data dictionary
Technology generates the decision tree for corresponding to flow chart, and by the corresponding process of each branch, can efficiently and rapidly complete to flow
Work is extracted in the automation of journey figure.
As shown in figure 5, the flow chart decomposing system 50 of one embodiment of the invention, comprising:
Process element extraction unit 501 for obtaining flow chart to be decomposed, and extracts the process of the flow chart to be decomposed
Element, wherein the process element includes arrow and flow nodes；
Father and son's node relationships determination unit 502 determines the flow chart to be decomposed for being based on extracted process element
In father and son's node relationships between each flow nodes；
Node-classification unit 503, for determining the root section in the flow chart to be decomposed according to father and son's node relationships
Point and leaf node, wherein the root node, which indicates that it is not present, connects a upper node through arrow, the leaf node indicates it
There is no the next nodes connected through arrow；
Flow chart decomposition unit 504 is used for according to father and son's node relationships, with the root node to the leaf node
Sequence, the flow chart to be decomposed correspondence is decomposed into multiple independent sub-process figures.
Another embodiment of the present invention additionally provides computer equipment, including memory and processor, the memory storage
There is computer program, wherein the processor realizes the application above-mentioned flow chart decomposition side when executing the computer program
The step of method.
Further embodiment of this invention provides computer storage medium, is stored thereon with computer program, wherein the meter
Calculation machine program realizes the step of above-mentioned flow chart decomposition method when being executed by processor.
About the flow chart decomposing system of the embodiment of the present invention, computer equipment and the more details of computer storage medium
And effect, it is referred to the description above for embodiment of the method, is not just repeated herein.
The optional embodiment of the embodiment of the present invention is described in detail in conjunction with attached drawing above, still, the embodiment of the present invention is simultaneously
The detail being not limited in above embodiment can be to of the invention real in the range of the technology design of the embodiment of the present invention
The technical solution for applying example carries out a variety of simple variants, these simple variants belong to the protection scope of the embodiment of the present invention.
It is further to note that specific technical features described in the above specific embodiments, in not lance
In the case where shield, it can be combined in any appropriate way.In order to avoid unnecessary repetition, the embodiment of the present invention pair
No further explanation will be given for various combinations of possible ways.
It will be appreciated by those skilled in the art that implementing the method for the above embodiments is that can pass through
Program is completed to instruct relevant hardware, which is stored in a storage medium, including some instructions are used so that single
Piece machine, chip or processor (processor) execute all or part of the steps of each embodiment the method for the application.And it is preceding
The storage medium stated includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory
The various media that can store program code such as (RAM, Random Access Memory), magnetic or disk.
In addition, any combination can also be carried out between a variety of different embodiments of the embodiment of the present invention, as long as it is not
The thought of the embodiment of the present invention is violated, equally should be considered as disclosure of that of the embodiment of the present invention.
Claims (10)
1. a kind of flow chart decomposition method, comprising:
Flow chart to be decomposed is obtained, and extracts the process element of the flow chart to be decomposed, wherein the process element includes arrow
Head and flow nodes；
Based on extracted process element, father and son's node relationships in the flow chart to be decomposed between each flow nodes are determined；
According to father and son's node relationships, root node and leaf node in the flow chart to be decomposed are determined, wherein described
Node indicates that the upper node connected through arrow is not present in it, and the leaf node indicates that it is next there is no connecting through arrow
Node；And
According to father and son's node relationships, with the root node to the sequence of the leaf node, by the flow chart to be decomposed
Correspondence is decomposed into multiple independent sub-process figures.
2. it is described according to father and son's node relationships according to the method described in claim 1, wherein, determine the stream to be decomposed
Root node and leaf node in journey figure, comprising:
According to father and son's node relationships, each flow nodes correspondence of the flow chart to be decomposed is stored to decision tree word
Allusion quotation, to construct the decision tree for corresponding to the flow chart to be decomposed；And
The decision tree is parsed, with the root node and leaf node in the determination flow chart to be decomposed.
3. according to the method described in claim 1, wherein, the process element for extracting the flow chart to be decomposed includes:
Identify the type of the process element in the flow chart to be decomposed and the content of process element；
Based on the type of the process element identified, arrow and flow nodes are extracted；
Based on the content of the process element identified, extracted arrow and flow nodes are filled.
4. it is described according to father and son's node relationships according to the method described in claim 2, wherein, by the process to be decomposed
Each node correspondence of figure is stored to decision tree dictionary, includes: corresponding to the decision tree of the flow chart to be decomposed to construct
According to father and son's node relationships, by each flow nodes of the flow chart to be decomposed and its between connection relationship reflect
It is incident upon decision tree dictionary, to generate decision tree framework；
By documented content of text in each identified flow nodes, corresponding filling is into the decision tree framework, with structure
Build the decision tree corresponding to the flow chart to be decomposed.
5. it is described according to father and son's node relationships according to the method described in claim 2, wherein, with the root node to institute
The sequence for stating leaf node, the flow chart correspondence to be decomposed, which is decomposed into multiple independent sub-process figures, includes:
It determines the height and width of each flow nodes in the decision tree, and assigns corresponding determine for each flow nodes
Plan tree coordinate；
Go out a plurality of individual path to the leaf node recurrence from the root node of the decision tree, and counts described a plurality of point
The decision tree coordinate for the flow nodes that branch path sequentially passes through respectively；And
According to the decision tree coordinate under the individual path counted, generate and the unique corresponding sub-process of the individual path
Figure.
6. according to the method described in claim 5, wherein, the flow chart correspondence to be decomposed is being decomposed into multiple independent sons
After flow chart, this method further include:
Count the first quantity of the leaf node of the decision tree；
Count the second quantity of sub-process figure generated；
Judge whether first quantity matches with second quantity, to verify with the presence or absence of the sub-process not being decomposed out
Figure.
7. method according to claim 1 to 6, wherein described by the corresponding decomposition of the flow chart to be decomposed
After multiple independent sub-process figures, this method further include:
The multiple independent sub-process figure is individually stored as corresponding multiple data files；And
Export the multiple data file.
8. a kind of flow chart decomposing system, comprising:
Process element extraction unit for obtaining flow chart to be decomposed, and extracts the process element of the flow chart to be decomposed,
Described in process element include arrow and flow nodes；
Father and son's node relationships determination unit is determined and is respectively flowed in the flow chart to be decomposed for being based on extracted process element
Father and son's node relationships between Cheng Jiedian；
Node-classification unit, for determining root node and leaf in the flow chart to be decomposed according to father and son's node relationships
Child node, wherein the root node, which indicates that it is not present, connects a upper node through arrow, the leaf node indicates that it is not present
The next node connected through arrow；
Flow chart decomposition unit, for according to father and son's node relationships, with the root node to the sequence of the leaf node,
The flow chart correspondence to be decomposed is decomposed into multiple independent sub-process figures.
9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, wherein described
The step of processor realizes any one of claims 1 to 7 the method when executing the computer program.
10. a kind of computer storage medium, is stored thereon with computer program, wherein the computer program is held by processor
The step of method described in any one of claims 1 to 7 is realized when row.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811332149.4A CN109710240A (en) | 2018-11-09 | 2018-11-09 | Flow chart decomposition method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811332149.4A CN109710240A (en) | 2018-11-09 | 2018-11-09 | Flow chart decomposition method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109710240A true CN109710240A (en) | 2019-05-03 |
Family
ID=66254272
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811332149.4A Pending CN109710240A (en) | 2018-11-09 | 2018-11-09 | Flow chart decomposition method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109710240A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111444776A (en) * | 2020-03-03 | 2020-07-24 | 广东博智林机器人有限公司 | Method, device, storage medium and computer equipment for analyzing flow chart |
| CN112287742A (en) * | 2020-06-22 | 2021-01-29 | 上海柯林布瑞信息技术有限公司 | Method and device for analyzing flow chart in file, computing equipment and storage medium |
| WO2021068987A1 (en) * | 2019-10-09 | 2021-04-15 | Elsevier, Inc. | Systems, methods and computer program products for automatically extracting information from a flowchart image |
| CN116167727A (en) * | 2023-04-25 | 2023-05-26 | 公安部信息通信中心 | Image analysis-based flow node identification and processing system |
-
2018
- 2018-11-09 CN CN201811332149.4A patent/CN109710240A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021068987A1 (en) * | 2019-10-09 | 2021-04-15 | Elsevier, Inc. | Systems, methods and computer program products for automatically extracting information from a flowchart image |
| US11151372B2 (en) | 2019-10-09 | 2021-10-19 | Elsevier, Inc. | Systems, methods and computer program products for automatically extracting information from a flowchart image |
| US11704922B2 (en) | 2019-10-09 | 2023-07-18 | Elsevier, Inc. | Systems, methods and computer program products for automatically extracting information from a flowchart image |
| CN111444776A (en) * | 2020-03-03 | 2020-07-24 | 广东博智林机器人有限公司 | Method, device, storage medium and computer equipment for analyzing flow chart |
| CN112287742A (en) * | 2020-06-22 | 2021-01-29 | 上海柯林布瑞信息技术有限公司 | Method and device for analyzing flow chart in file, computing equipment and storage medium |
| CN112287742B (en) * | 2020-06-22 | 2023-12-26 | 上海柯林布瑞信息技术有限公司 | Method and device for analyzing flow chart in file, computing equipment and storage medium |
| CN116167727A (en) * | 2023-04-25 | 2023-05-26 | 公安部信息通信中心 | Image analysis-based flow node identification and processing system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Buccino et al. | SpikeInterface, a unified framework for spike sorting | |
| CN109710240A (en) | Flow chart decomposition method and system | |
| CN105868050A (en) | Verification method and device based on JSON data | |
| CN110377524B (en) | Method, device, system and medium for testing report system | |
| CN108766557B (en) | Automatic arrhythmia analysis method based on channel signal fusion neural network | |
| CN106326116B (en) | The method and apparatus of product test | |
| CN106776339A (en) | Automated testing method and device | |
| CN110162335A (en) | Code refactoring method, apparatus, computer equipment and medium | |
| CN109885541A (en) | The method and apparatus of information batch processing | |
| CN109828900A (en) | Test script automatic generation method, device, electronic equipment and storage medium | |
| CN111767277A (en) | Data processing method and device | |
| CN106326904A (en) | Device and method of acquiring feature ranking model and feature ranking method | |
| CN108629124A (en) | A kind of simulation parameter data auto-generation method based on activity diagram path | |
| CN109344229A (en) | Method, apparatus, computer equipment and the storage medium of dialog analysis evaluation | |
| CN105373473B (en) | CDR accuracys method of testing and test system based on original signaling decoding | |
| CN112685291A (en) | System joint test method and related device | |
| CN111858331A (en) | Method, device and equipment for detecting coverage of front-end control | |
| CN106649121A (en) | Test result analysis method and apparatus | |
| CN109088793B (en) | Method and apparatus for detecting network failure | |
| CN106569944A (en) | Constraint-tree-based onboard software test data analysis method | |
| CN110597728A (en) | Method, device and system for constructing test data | |
| US9092203B2 (en) | Apparatus and method for recommending software process improvement | |
| CN114741300A (en) | Test case based test method and device | |
| CN108286972A (en) | The intelligent error-checking method and device and hybrid navigation system of data in navigation electronic map | |
| CN102737143B (en) | Verification method of digital integrated circuit design |
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 |