CN103618650A - Method and system for detection loops - Google Patents
Method and system for detection loops Download PDFInfo
- Publication number
- CN103618650A CN103618650A CN201310654813.8A CN201310654813A CN103618650A CN 103618650 A CN103618650 A CN 103618650A CN 201310654813 A CN201310654813 A CN 201310654813A CN 103618650 A CN103618650 A CN 103618650A
- Authority
- CN
- China
- Prior art keywords
- node
- relation
- partner
- becoming
- module
- 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
Images
Abstract
The invention relates to a method and system for detection circulating loops existing in a software system and/or a hardware system, in particular to a loop detection method and a system adopting the method. According to the method, whether circulating loops exist in the software system and/or the hardware system or not is determined through the relation between the number of entry nodes of the software system and/or the hardware system and the number of exit nodes of the software system and/or the hardware system. Besides, the invention provides the system adopting the method so as to support detection on the software system and/or the hardware system. By the adoption of the technical scheme, through the loop detection method and the system adopting the method, whether the circulating loops exist in the software system and/or the hardware system or not can be detected conveniently, the working process is simple, efficiency is improved, and performance can be substantially improved.
Description
Technical field
The present invention relates to a kind of method and system that the circulation loop existing in software systems and/or hardware system is detected, relate more specifically to the system of a kind of loop detecting method and employing the method.
Background technology
In the constructive process of present software systems and/or hardware system, occur that sometimes unwanted cyclic design occurs, causes system to occur defect.And existing solution is to create whole process or the structure of describing complete software systems and/or hardware system such as the chart of flow chart, structure chart etc., this chart is comprised of two above steps or module, and two above nodes form.And judge in this chart, whether to exist the mode of loop to travel through exactly each node, from starting point, through all nodes, reach home to carry out and finish.
The deep application in each row every profession and trade work along with software systems and/or hardware system, provides the various workflows that can customize and system configuration to become function very common in software systems and/or hardware system.Yet, in the workflow and system configuration of customization, may form loop because a variety of causes occurs not needing loop, the node of having carried out to get back to the current node of having carried out after some conditioned disjunction steps, cannot jump out circulation.Therefore, in software systems and/or hardware system, there is loop, system need to or be carried out flow process when customization workflow or system configuration or realize before system configuration, detects in software systems and/or hardware system whether have loop, to revise accordingly.
Although prior art can solve the problem of the loop detection in software systems and/or hardware system, but node and path in software systems and/or hardware system are too much, and relation is when very complicated, the way of traversal system and/or hardware system can cause logic complicated, and consumption in operation amount is huge, especially when software systems and/or hardware system itself are when very complicated, performance issue will be more outstanding.
Summary of the invention
Shortcoming based on above-mentioned prior art, the system that goal of the invention of the present invention is to provide a kind of loop detecting method and adopts the method, it can conveniently detect in software systems and/or hardware system, whether there is loop, the course of work is simple, improve efficiency, and can also significantly improve performance.
In order to realize above-mentioned goal of the invention, the present invention adopts following technical scheme:
A loop detecting method, described method comprises:
1) determine detected object, determine the node of described detected object, and be the relation of becoming a partner that described node creates Ingress node and Egress node;
2) calculate the quantity of the described Ingress node of the relation of becoming a partner described in current, identical described Ingress node is repeat count not;
3) whether the quantity that judges described Ingress node is greater than zero, if YES, carries out next step; If NO, finish after forwarding step 9) Output rusults to;
4) judgement is the node of described Egress node and described Ingress node and is labeled as access point node, and identical described access point node is repeat count not, records the quantity of described access point node;
5) judge whether the quantity of described Ingress node is greater than the quantity of described access point node, if YES, carry out next step; If NO, forward step 8) Output rusults to and finish;
6) relation of becoming a partner corresponding to described Ingress node not occurring in described Egress node removed;
7) then for the current relation of becoming a partner described in remaining, return to step 2) start to carry out successively;
8) if the determination result is NO, represent to exist described loop, detect and finish;
9), if described Ingress node quantity is zero, represent not exist to detect described loop and finish.
Particularly, in step 1), in order to determine the node of described detected object, in execution step 1) according to the operation principle of described detected object and/or electrical relation and/or architectural feature, make at least one in the flow chart, line map, structural representation of described detected object before.
Further, described node is a step or an assembly in described line map or the module in described structural representation in described flow chart.
In addition, described in the relation of becoming a partner comprise the mapping relations that have respectively between inlet function and the adjacent node of outlet function, the node wherein with outlet function comprises virtual node.Between described adjacent node, there is upstream and downstream relation.
A loop detection system that adopts method as above, described system comprises:
Become a partner and be related to creation module, it is for creating the relational data structure of becoming a partner of Ingress node and Egress node according to the relation between node;
Ingress node is counted computing module, and it is for the quantity of the Ingress node of the relation of becoming a partner described in calculating;
Access point node is counted computing module, its for calculate current described in the relation of becoming a partner be the quantity of the access point node of Ingress node and Egress node;
Judge module, it judges whether to exist loop for count the result of calculation of computing module and result of calculation that described access point node is counted computing module according to described Ingress node;
The relation of becoming a partner removes module, and it is for the relation of becoming a partner described in removing or shielding;
Described become a partner be related to creation module, described Ingress node count computing module, described access point node count computing module, described judge module and described in the relation of becoming a partner remove module each other data be communicated with.
Particularly, described becoming a partner, be related in creation module, the pass between described node is the upstream and downstream relation between adjacent node.
Preferably, described in the relation of becoming a partner remove module removal or shielding described in the relation of becoming a partner be the relation of becoming a partner corresponding to described Ingress node not occurring as described Egress node.
More specifically, described judge module is comparator, described comparator at least stores up described Ingress node at predetermined threshold time memory and counts the result of calculation of computing module and the result of calculation that described access point node is counted computing module, and compare, according to the result relatively, export the judged result that whether has loop.
In addition, described system also comprises the control module for controlling being communicated with other module, and described control module at least has for the unified bus clock of other module work and the controller of controlling other module work coordinated.
What need to illustrate is, for detected object, be that existing software systems and/or hardware system can adopt any known method to facilitate and to complete exactly while making flow chart, line map, structural representation, and step, the electric component in line map or assembly or the module in other system and structural representation or unit etc. in flow chart can be all the nodes that the present invention mentions; The end position that term " virtual node " is illustrated in chart only has Ingress node and there is no corresponding Egress node, and the corresponding relation of becoming a partner is the corresponding corresponding relation that only has Ingress node that shows as.
By adopting above-mentioned technical scheme, the system that the invention provides a kind of loop detecting method and employing the method, it can conveniently detect in software systems and/or hardware system whether have loop, and the course of work is simple, improve efficiency, and can also significantly improve performance.
Accompanying drawing explanation
Shown in Fig. 1 is the flow chart of loop detecting method of the present invention;
Shown in Fig. 2 is the flow chart of the detected object (being software systems) of the first example of the loop detecting method shown in application drawing 1;
Shown in Fig. 3 is the syndeton schematic diagram of the detected object (being hardware system) of the second example of the loop detecting method shown in application drawing 1;
Shown in Fig. 4 is to adopt as the syndeton schematic diagram of the system of the method in Fig. 1.
Embodiment
The invention reside in the system that a kind of loop detecting method is provided and adopts the method, it can conveniently detect in software systems and/or hardware system whether have loop, and its course of work is simple, has improved efficiency, and can also improve significantly performance.Below in conjunction with Figure of description and adopt the form of embodiment to explain the present invention.
Shown in Fig. 1 is the flow chart of loop detecting method of the present invention.The invention provides a kind of method that whether has loop in software systems and/or hardware system that detects simply, efficiently.The concrete scheme of the method is as follows:
1) determine detected object, determine the node of detected object, and create the relation of becoming a partner of Ingress node and Egress node for node;
2) calculate the quantity of the Ingress node of the current relation of becoming a partner, identical Ingress node is repeat count not;
3) whether the quantity that judges Ingress node is greater than zero, if YES, carries out next step; If NO, finish after forwarding step 9) Output rusults to;
4) judgement is the node of Egress node and Ingress node and is labeled as access point node, and identical access point node is repeat count not, records the quantity of access point node;
5) judge whether the quantity of Ingress node is greater than the quantity of access point node, if YES, carry out next step; If NO, forward step 8) Output rusults to and finish;
6) relation of becoming a partner corresponding to the Ingress node not occurring in Egress node removed;
7) then for the current remaining relation of becoming a partner, return to step 2) start to carry out successively;
8) if the determination result is NO, represent to exist loop, detect and finish;
9), if Ingress node quantity is zero, represent not exist to detect loop and finish.
In order to make content of the present invention more cheer and bright, below in conjunction with concrete example, further describe the specific implementation process of method of the present invention.
Embodiment 1: detect simple flow chart loop
Shown in Fig. 2 is the flow chart of the detected object (being software systems) of the first example of the loop detecting method shown in application drawing 1.
1) according to the relation of becoming a partner of the flow chart of these software systems, establishment Ingress node and Egress node;
In this example, for Fig. 2, can create the as shown in the table relation of becoming a partner.
| Entrance | Outlet |
| A | B |
| B | C |
| C | D |
| D | E |
| E | B |
2) calculate the quantity of the Ingress node of the current relation of becoming a partner, same node point is repeat count not;
The quantity of the Ingress node calculating according to upper table in this example, is 5.
3) judge whether Ingress node quantity is greater than zero, if YES, carries out next step, if NO, finish after forwarding step 9) Output rusults to;
In this example, judged result is to be greater than zero, carries out next step.
4) calculate the quantity of the access point node that is Egress node and Ingress node, same node point is repeat count not, result is designated as to the quantity of access point node;
In this example, therefore the quantity of the access point node of calculating is 4 (Node B repeating is identical node, not repeat count).
5) judge whether the quantity of Ingress node is greater than the quantity of access point node, if YES, carry out next step, if NO, finish after forwarding step 8) Output rusults to;
In this example, " Ingress node=5 " are greater than " access point node=4 ", continue to carry out next step.
6) using only removing or stamp as all relations of becoming a partner of Ingress node, remove mark;
In this example, carry out and remove the just relation of becoming a partner of Ingress node A, the result after removing is as follows:
| Entrance | Outlet |
| B | C |
| C | D |
| D | E |
| E | B |
7) then for the current remaining relation of becoming a partner, get back to step 2) start to carry out successively, until jump out circulation;
Enter circulation, second takes turns execution:
A) calculate the quantity of current Ingress node, result of calculation is 4;
Whether the quantity that b) judges Ingress node is greater than zero, judgment result is that to be;
C) calculate the quantity of Ingress node, result of calculation is 4;
D) judge whether the quantity of Ingress node is greater than the quantity of access point node, and the determination result is NO, jumps out circulation.
8) if the determination result is NO, represent to exist circulation, detect and finish;
In this example, through once removing just becoming a partner after relation of Ingress node, the quantity that final result is Ingress node equals the quantity of access point node, shows to have circulation in flow chart, carries out and finishes.
At this embodiment, do not pass through node and traversal path, adopt simple calculating and compare, just detect the loop of figure, clear logic, realizes simple.
Embodiment 2: the loop in detection of complex relation
Shown in Fig. 3 is the syndeton schematic diagram of the detected object (being hardware system) of the second example of the loop detecting method shown in application drawing 1; In Fig. 3, under branch node C, hang node F, under node F, hang Node B, and under the branch node D of branch node B, hung node F, between Node B and node F, formed loop.
The present embodiment further illustrates loop detecting method by the syndeton schematic diagram of complicated hardware system, referring to Fig. 3:
1) according to flow chart, create the relation of becoming a partner of Ingress node and Egress node;
In this example, according to Fig. 3, create from top to bottom the relation of becoming a partner, wherein virtual node is treated as in the outlet of the node of lowermost layer, as shown in the table:
| Entrance | Outlet |
| A | B |
| A | C |
| B | D |
| B | E |
| C | F |
| D | F |
| E | M |
| F | B |
| F | ? |
| M | ? |
| B | ? |
2) calculate the quantity of the Ingress node of the current relation of becoming a partner, same node point is repeat count not;
The quantity of the Ingress node calculating according to upper table in this example, is 7 (duplicate keys is not counted).
3) whether the quantity that judges Ingress node is greater than zero, if YES, carries out next step, if NO, finishes after forwarding step 9) Output rusults to;
In this example, the quantity 7 of Ingress node is greater than zero, therefore carries out next step.
4) calculate the quantity of Ingress node, same node point is repeat count not, result is designated as to the quantity of access point node;
In this example, calculate the quantity of Ingress node, result is 6 (duplicate keys is not counted).
5) judge whether the quantity of Ingress node is greater than the quantity of access point node, if YES, carry out next step, if NO, finish after forwarding step 8) Output rusults to;
In this example, " Ingress node=7 " are greater than " access point node=6 ", continue to carry out next step.
6) using only removing or stamp as all relations of becoming a partner of Ingress node, remove mark;
In this example, the relation of becoming a partner is removed to the just relevant relation of becoming a partner of node A of entrance, the result after removing is as follows:
| Entrance | Outlet |
| B | D |
| B | E |
| C | F |
| D | F |
| E | M |
| F | B |
| F | ? |
| M | ? |
| B | ? |
7) then for the current remaining relation of becoming a partner, get back to step 2) start to carry out successively, until jump out circulation;
Enter circulation, second takes turns execution:
A) calculate the quantity of current Ingress node, result of calculation is 6;
Whether the quantity that b) judges Ingress node is greater than zero, judgment result is that to be;
C) calculate the quantity of Ingress node, result of calculation is 5;
D) judge that whether the quantity of Ingress node is greater than the quantity of access point node, judgment result is that to be;
E) remove all relations of becoming a partner of a node as entrance in the current relation of becoming a partner, this node that is entrance is C, and result is as follows:
| Entrance | Outlet |
| B | D |
| B | E |
| D | F |
| E | M |
| F | B |
| F | ? |
| M | ? |
| B | ? |
Enter circulation, third round is carried out:
A) calculate the quantity of current Ingress node, result of calculation is 5;
Whether the quantity that b) judges Ingress node is greater than zero, judgment result is that to be;
C) calculating is the access point node quantity of Ingress node and Egress node, and result of calculation is 5;
D) judge whether the quantity of Ingress node is greater than the quantity of access point node, and the determination result is NO, jump out and carry out circulation, carry out next step
8) if the determination result is NO, represent to exist loop, detect and finish;
In this example, through 2 circulations, remove the just node of entrance and become a partner after relation, occur the situation that the quantity of Ingress node is equal with the quantity of access point node, show that remainder exists loop, detect and finish.
The present embodiment does not pass through node and traversal path, adopts simple calculate and manner of comparison has solved the loop detection of complex figure, and algorithm is simple, for the performance optimization of the loop of the hardware system of detection big data quantity complexity provides solution.
Certainly above-mentioned two embodiment are all the situations of loop that exist in explanation software systems or hardware system, and do not specify in software systems or hardware system that the not embodiment of loop, actual difference are only not exist the embodiment of loop can carry out circulation for several times finally to exit this method in step 9) more below.
In addition, in Fig. 4, also show and adopt as the syndeton schematic diagram of the system of the method in Fig. 1.Wherein show a kind of loop detection system of method as above that adopts and obtain embodiment, system in this embodiment comprises:
Become a partner and be related to creation module, it is for creating the relational data structure of becoming a partner of Ingress node and Egress node according to the relation between node;
Ingress node is counted computing module, and it is for calculating the Ingress node quantity of the relation of becoming a partner of Ingress node and Egress node;
Access point node is counted computing module, and it is for calculating the number of nodes that the relation of becoming a partner of current Ingress node and Egress node is Ingress node and Egress node;
Judge module, it judges whether to exist loop for count the result of calculation of computing module and result of calculation that access point node is counted computing module according to Ingress node;
The relation of becoming a partner removes module, and it is for removing or shield the relation of becoming a partner;
Become a partner and be related to that creation module, Ingress node are counted computing module, access point node is counted computing module, judge module and the relation of becoming a partner and removed module data connection each other.
Particularly, be related in creation module becoming a partner, the pass between node is the upstream and downstream relation between adjacent node.The relation of becoming a partner that the relation of becoming a partner removes module removal or shielding is the relation of becoming a partner corresponding to Ingress node not occurring as Egress node.
More specifically, judge module is comparator, comparator is at least counted the result of calculation of computing module and the result of calculation that access point node is counted computing module at predetermined threshold time memory storage Ingress node, and compares, and according to the result relatively, exports the judged result that whether has loop; This predetermined threshold time can be according to the needs of comparator and definite different time threshold, and need not be concrete be limited in a certain fixed value.
In addition, system can also comprise the control module for controlling being communicated with other module, this control module is not shown in Fig. 4, and this control module at least has for the unified bus clock of other module work and the controller of controlling other module work coordinated.
Compare with prior art scheme, system of the present invention need not travel through each node in flow chart, just by simple relatively Ingress node quantity and access point node quantity, just can judge whether there is loop, clear logic, be easy to safeguard, in the situation that needs detect mass data, can significantly improve performance.
Therefore,, by adopting above-mentioned technical scheme, the invention provides the system of a kind of loop detecting method and employing the method, it can conveniently detect in software systems and/or hardware system, whether there is loop, the course of work is simple, has improved efficiency, and can also significantly improve performance.
Protection scope of the present invention is not limited to specific embodiment illustrated in above-mentioned embodiment, as long as but the combination that meets the technical characterictic of claims of the present invention just fallen among protection scope of the present invention.
Claims (10)
1. a loop detecting method, is characterized in that, described method comprises:
1) determine detected object, determine the node of described detected object, and be the relation of becoming a partner that described node creates Ingress node and Egress node;
2) calculate the quantity of the described Ingress node of the relation of becoming a partner described in current, identical described Ingress node is repeat count not;
3) whether the quantity that judges described Ingress node is greater than zero, if YES, carries out next step; If NO, finish after forwarding step 9) Output rusults to;
4) judgement is the node of described Egress node and described Ingress node and is labeled as access point node, and identical described access point node is repeat count not, records the quantity of described access point node;
5) judge whether the quantity of described Ingress node is greater than the quantity of described access point node, if YES, carry out next step; If NO, forward step 8) Output rusults to and finish;
6) relation of becoming a partner corresponding to described Ingress node not occurring in described Egress node removed;
7) then for the current relation of becoming a partner described in remaining, return to step 2) start to carry out successively;
8) if the determination result is NO, represent to exist described loop, detect and finish;
9), if described Ingress node quantity is zero, represent not exist to detect described loop and finish.
2. method according to claim 1, it is characterized in that, in step 1), in order to determine the node of described detected object, before carrying out described step 1), according to the operation principle of described detected object and/or electrical relation and/or architectural feature, make at least one in the flow chart, line map, structural representation of described detected object.
3. method according to claim 2, is characterized in that, described node is a step or an assembly in described line map or the module in described structural representation in described flow chart.
4. method according to claim 1, is characterized in that, described in the relation of becoming a partner comprise the mapping relations that have respectively between inlet function and the adjacent node of outlet function, the node wherein with outlet function comprises virtual node.
5. method according to claim 4, is characterized in that, has upstream and downstream relation between described adjacent node.
6. a loop detection system for the method for employing as described in any one in claim 1 to 5, is characterized in that, described system comprises:
Become a partner and be related to creation module, it is for creating the relation of becoming a partner of Ingress node and Egress node according to the relation between node;
Ingress node is counted computing module, and it is for the Ingress node quantity of the relation of becoming a partner described in calculating;
Access point node is counted computing module, its for calculate current described in the relation of becoming a partner be the quantity of the access point node of Ingress node and Egress node;
Judge module, it judges whether to exist loop for count the result of calculation of computing module and result of calculation that described access point node is counted computing module according to described Ingress node;
The relation of becoming a partner removes module, and it is for the relation of becoming a partner described in removing or shielding;
Described become a partner be related to creation module, described Ingress node count computing module, described access point node count computing module, described judge module and described in the relation of becoming a partner remove module each other data be communicated with.
7. system according to claim 6, is characterized in that, described becoming a partner, is related in creation module, and the pass between described node is the upstream and downstream relation between adjacent node.
8. system according to claim 6, is characterized in that, described in the relation of becoming a partner remove module removal or shielding described in the relation of becoming a partner be the relation of becoming a partner corresponding to described Ingress node not occurring as described Egress node.
9. system according to claim 6, it is characterized in that, described judge module is comparator, described comparator at least stores up described Ingress node at predetermined threshold time memory and counts the result of calculation of computing module and the result of calculation that described access point node is counted computing module, and compare, according to the result relatively, export the judged result that whether has loop.
10. system according to claim 6, it is characterized in that, described system also comprises the control module for controlling being communicated with other module, and described control module at least has for the unified bus clock of other module work and the controller of controlling other module work coordinated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310654813.8A CN103618650B (en) | 2013-12-05 | 2013-12-05 | Loop detecting method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310654813.8A CN103618650B (en) | 2013-12-05 | 2013-12-05 | Loop detecting method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103618650A true CN103618650A (en) | 2014-03-05 |
| CN103618650B CN103618650B (en) | 2016-07-06 |
Family
ID=50169354
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310654813.8A Active CN103618650B (en) | 2013-12-05 | 2013-12-05 | Loop detecting method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103618650B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117250480A (en) * | 2023-11-08 | 2023-12-19 | 英诺达(成都)电子科技有限公司 | Loop detection method, device, equipment and storage medium of combinational logic circuit |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1145323C (en) * | 2000-12-29 | 2004-04-07 | 北京邮电大学 | Simple adaptive fast convergence mark exchange path loop preventing technique |
| CN203301517U (en) * | 2013-03-28 | 2013-11-20 | 江西山水光电科技有限公司 | Node device for access to ring Ethernet |
-
2013
- 2013-12-05 CN CN201310654813.8A patent/CN103618650B/en active Active
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117250480A (en) * | 2023-11-08 | 2023-12-19 | 英诺达(成都)电子科技有限公司 | Loop detection method, device, equipment and storage medium of combinational logic circuit |
| CN117250480B (en) * | 2023-11-08 | 2024-02-23 | 英诺达(成都)电子科技有限公司 | Loop detection method, device, equipment and storage medium of combinational logic circuit |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103618650B (en) | 2016-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103914365B (en) | Method and device for acquiring power consumption of mobile terminal application | |
| CN110995482B (en) | Alarm analysis method and device, computer equipment and computer readable storage medium | |
| US11018507B2 (en) | Detection apparatus, power conditioner, detection method, and computer readable medium | |
| CN113853528A (en) | Power utilization abnormality recognition method, device and computer readable storage medium | |
| CN103605574A (en) | Virtual machine resource scheduling method and system for server clusters | |
| CN103744730B (en) | Task scheduling method and device | |
| Ghasemieh et al. | Survivability evaluation of fluid critical infrastructures using hybrid Petri nets | |
| CN112214481A (en) | Data cleaning method for power quality data | |
| US20150040144A1 (en) | Program, information processing apparatus, and event processing method | |
| US9934325B2 (en) | Method and apparatus for distributing graph data in distributed computing environment | |
| CN108683155B (en) | A kind of converter valve thyristor and capacitance-resistance parameter optimization method and device | |
| CN102828383A (en) | Washing machine, control method for washing machine and cleaning judgment method for executing washing procedures | |
| CN106021296B (en) | Method and device for detecting batch operation paths of core bank system | |
| CN103400025B (en) | A kind of analysis method of reachability of hybrid system | |
| CN103618650A (en) | Method and system for detection loops | |
| CN106407233A (en) | A data processing method and apparatus | |
| CN104535827A (en) | Defective point removing method and system used in AD sampling | |
| CN105224721B (en) | A kind of automatic identifying method of electromechanical transient Failure Model | |
| CN104251913B (en) | Rotating machinery monitors system start and stop intelligent determination method | |
| CN106681837A (en) | Data sheet based data eliminating method and device | |
| CN114498760B (en) | Island detection method and device and electronic equipment thereof | |
| CN108123920B (en) | Method for detecting malicious users in neighborhood network of smart power grid based on suspected electricity stealing degree | |
| CN104090838A (en) | Method for generating test case | |
| CN102183952A (en) | Method for diagnosing embedded nonfatal fault in PLC (programmable logic controller) | |
| KR102145402B1 (en) | Method and apparatus for determining energy conservation measure for buliding retrofit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant after: Yonyou Network Technology Co., Ltd. Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant before: UFIDA Software Co., Ltd. |
|
| COR | Change of bibliographic data | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |