CN108520168A - A kind of fault tree module extension decomposition method based on linear time algorithm - Google Patents
A kind of fault tree module extension decomposition method based on linear time algorithm Download PDFInfo
- Publication number
- CN108520168A CN108520168A CN201810287529.4A CN201810287529A CN108520168A CN 108520168 A CN108520168 A CN 108520168A CN 201810287529 A CN201810287529 A CN 201810287529A CN 108520168 A CN108520168 A CN 108520168A
- Authority
- CN
- China
- Prior art keywords
- event
- fault tree
- module
- node
- eventorgate
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000000354 decomposition reaction Methods 0.000 title claims abstract description 24
- 238000009966 trimming Methods 0.000 claims abstract description 6
- 238000000605 extraction Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 3
- 238000004458 analytical method Methods 0.000 abstract description 14
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 230000009467 reduction Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000002129 infrared reflectance spectroscopy Methods 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003121 nonmonotonic effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000004451 qualitative analysis Methods 0.000 description 1
- 238000004445 quantitative analysis Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000012502 risk assessment Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Z—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR
- G16Z99/00—Subject matter not provided for in other main groups of this subclass
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of, and the fault tree module based on linear time algorithm extends decomposition method.The fault tree module extension decomposition method based on linear time algorithm includes the following steps：One, fault tree is simplified by trimming redundant node or subtree；Two, the module that linear time algorithm identifies is extended, identifies that the equal event in fault tree, division equal event are new module.The beneficial effects of the invention are as follows：The fault tree module extension decomposition method based on linear time algorithm proposes a set of new fault tree rule of simplification and module extension decomposition method, the redundancy not only reasonably removed in fault tree can also effectively optimize failure tree analysis (FTA), be further reduced calculating time and the memory consumption of industrial large-sized failure tree analysis (FTA).
Description
Technical field
The invention belongs to fault tree preconditioning technique fields, more particularly to a kind of fault tree based on linear time algorithm
Module extends decomposition method.
Background technology
Fault tree (fault tree, FT) is a kind of logic causality figure, it describes the base for causing top event to occur
Mutual logical relation between present event.Such as Fig. 1.R1 indicates that top event, set { g1, g2 ... g6 } indicate fault tree
Intermediate event, set { e1, e2 ... e7 } illustrate the elementary event in fault tree.There is a kind of basic element door in fault tree
Event, it illustrates the relationship type of incoming event.Shown in fault tree there are two types of the door event of type, and indicate
Have when all incoming events break down, can just lead to outgoing event failure, as long as or indicate that there are one incoming events
Failure may result in outgoing event failure.Fault tree can show its fault mode well, and image objectively describes event of failure
Between logical relation.
Failure tree analysis (FTA) (fault tree analysis, FTA) be a kind of system reliability, safety analysis it is important
Method.Failure tree analysis (FTA) is widely used in safety system engineering field.Failure tree analysis (FTA), which can be used as, occurs significant trouble
Or the effective means of failure investigation is carried out after accident；Instruct fault diagnosis, improve use and maintenance program etc.；It can also be used for finding
Reliability and safety weak link, take corrective measure, to improve reliability and the safety of product.Since automation generates
Tool is widely used, and the fault tree with hundreds of doors or event has become very common.And the analysis of large-scale fault tree is logical
A large amount of computer resource and time loss are often needed, some fault trees are too complicated so that some existing solution tools can not
It analyzes it.So how effectively to carry out pretreatment to large-scale fault tree becomes particularly important.
The pretreatment of fault tree carries out before carrying out qualitative and quantitative analysis to fault tree, generally includes to simplify and divide
Solution.Can effectively remove the redundancy of fault tree, reduce fault tree scale, the effective time for reducing failure tree analysis (FTA) and
The consumption of memory source.
Failure tree reduction is to eliminate node or subtree extra in fault tree according to certain rule to reduce fault tree
Scale.Earliest simplification algorithm, which eliminates, to be input to or the repeated events of door.Literary Platz O, Olsen J V.FAUNET:A
Program Package for Evaluation of Fault Trees and Networks [J] .1976. is to be based on failure
It is regular (Program Package for Evaluation of Fault Trees, FAUNET) to set appraisal procedure packet, abbreviation
Rule is one of most widely used traditional reduction rules, it has used some on the basis of not changing fault tree logical construction
Boolean Rule reduces the scale of fault tree.Some later scholars increase some new rules on this basis, such as disappear
It removes.Integrated reliability and risk system (Integrated Reliability and Risk Analysis System,
IRRAS the new of fault tree) is proposed in algorithm and simplifies method, and which employs some technologies from bottom to top, utilize a variety of optimizations
Method reconstructs and trims fault tree, including subtree is independent, and probability trimming and door event merge.Although these, which simplify methods, to incite somebody to action
Fault tree is reduced to the succinct form of comparison, but needs to pay prodigious time cost.
It refers to that fault tree is decomposed into several independent subtrees that fault tree, which is decomposed, is individually solved to every stalk tree.It is right
The analysis result of all subtrees is reconfigured, and the analysis result of primary fault tree can be obtained.Although there are many early stages
The method of decomposition has been suggested, and the linear time algorithm proposed after this decomposes fault tree, greatly reduced failure
Set the time decomposed so that compared with the processing time of tree, the time that decomposition fault tree itself needs can be ignored.Existing
In the algorithm that some fault trees are decomposed, literary Dutuit Y, Rauzy A.A linear-time algorithm to find
modules of fault trees[J].IEEE Transactions on Reliability,1996.45(3):p.422-
425. linear time algorithms proposed are widely used in failure tree analysis (FTA) field, can be detected in fault tree in linear session
Module, the method can apply to dull fault tree and non-monotonic fault tree.But this method is there are some defects, what it was decomposited
Subtree number is not most.
Invention content
It is an object of the invention in view of the drawbacks of the prior art or problem, provide it is a kind of based on linear time algorithm therefore
Barrier tree module extends decomposition method.
Technical scheme is as follows：It is a kind of based on linear time algorithm fault tree module extension decomposition method include
Following steps：One, fault tree is simplified by trimming redundant node or subtree；Two, linear time algorithm is identified
Module be extended, identify fault tree in equal event, divisions equal event be new module.
Preferably, in step 1, simplification is carried out to fault tree and is included the following steps：Specification step：Abbreviation is containing only there are one
The intermediate event of incoming event；Collapse step：The intermediate event of the same type continuously occurred is reduced；Extraction step：
It will be merged containing similar events intermediate event as input.
Preferably, in step 2, module extension decomposable process includes the following steps：Two set of initialization
EventOrGate (u), EventAndGate (u), wherein EventOrGate (u) indicates that all event types of node u are
Or father's node set, EventAndGate (u) indicate all event types of node u be with father's node set, u
For positive integer；The corresponding door event type between father's node and child is recorded during traversing fault tree, if door
The type of event is and, then father's node is recorded in EventAndGate (u) set of the child, corresponding
EventOrGate (u) set in record；If the type of door event is or, father's node is recorded in and goes back child
In EventOrGate (u) set, recorded in corresponding EventAndGate (u) is gathered；For several in fault tree
Event u, v ... w, if meet EventOrGate (u)=EventOrGate (v)=... EventOrGate (w), and So this several event
U, v ... w may be constructed a new module, wherein and u, v ... w are respectively positive integer, andFor empty set.
Preferably, if meet EventAndGate (u)=EventAndGate (v)=... EventAndGate (w), and
AndSo this several event u,
V ... w can also form a new module.
Technical solution provided by the invention has the advantages that：
The fault tree module extension decomposition method based on linear time algorithm proposes a set of new failure tree reduction rule
Decomposition method then is extended with module, the redundancy not only reasonably removed in fault tree can also effectively optimize fault tree point
Analysis, is further reduced calculating time and the memory consumption of industrial large-sized failure tree analysis (FTA)；
Moreover, the fault tree rule of simplification be simplified to by trimming redundant node or subtree by fault tree it is most succinct
Form reduces the complexity of calculating to reduce the size of fault tree.
Description of the drawings
Fig. 1 is the fault tree schematic diagram of motor2；
Fig. 2 is abbreviation specification procedure of rule figure；
Fig. 3 is that abbreviation shrinks procedure of rule figure；
Fig. 4 is that abbreviation extracts procedure of rule figure；
Failure tree graph after the abbreviation that Fig. 5 is motor2；
Fig. 6 is the set figure for constructing EventOrGate (u) and EventAndGate (u)；
Fig. 7 is the decomposition failure tree graph of motor2.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
The description of specific distinct unless the context otherwise, the present invention in element and component, the shape that quantity both can be single
Formula exists, and form that can also be multiple exists, and the present invention is defined not to this.Although step in the present invention with label into
It has gone arrangement, but is not used to limit the precedence of step, unless expressly stated the order of step or holding for certain step
Based on row needs other steps, otherwise the relative rank of step is adjustable.It is appreciated that used herein
Term "and/or" one of is related to and covers associated Listed Items or one or more of any and all possible groups
It closes.
Linear session involved by fault tree module extension decomposition method provided by the invention based on linear time algorithm
The principle of algorithm is：
Depth first left most ergodic algorithm is carried out to fault tree, uses tiThe access date of (i=1,2, last) flag event, time
During going through, if g is accessed for the first timeiBefore with back-call to giG is not all accessed lateriDescendent node,
So giIt can be identified as a module.In order to realize the algorithm, 3 counters are needed, the first time for separately including event visits
Ask date t1, back-call date t2The date t being accessed for the last timelast。
The algorithm of the above includes 3 steps：
1, initialization counter；
2, first time depth first left most ergodic algorithm is carried out to fault tree, for the leaf node not repeated, date t1And t2
It is identical；
3, the most right traversal of second of depth-first is carried out to fault tree, collects intermediate event giFirst of descendent node
The maximum value of the minimum value on date and second date；If：A) minimum value collected is more than giFirst date b) collect
Maximum value be less than giSecond date, then giIt is a module.
Fault tree module provided by the invention based on linear time algorithm extends decomposition method in linear time algorithm
On the basis of the extension of module is carried out to it, identify equivalent time and as module, that is, propose a set of new fault tree letter
Change rule and module extends decomposition method.
Specifically, the above-mentioned fault tree module extension decomposition method based on linear time algorithm includes the following steps：
One, fault tree is simplified by trimming redundant node or subtree.
In step 1, on the basis of considering time complexity and resource utilization, a set of new rule of simplification is proposed,
Reasonably remove the redundancy in fault tree.Include the following steps moreover, carrying out simplification to fault tree：
1, specification step：Abbreviation is containing only there are one the intermediate events of incoming event.
Specifically, in specification step, for containing only there are one the intermediate event of incoming event, since its output can be with
It is directly indicated with his incoming event, so containing only being redundancy in fact there are one the intermediate event of incoming event.Such as Fig. 2 (a),
The corresponding incoming events of intermediate event g1 only have g2, and in this case, for the structure of retention fault tree as much as possible, we take
Method for normalizing be to delete the intermediate event g2 of offspring, and regard the incoming event of g2 { e1, e2 } as upper layer intermediate event g1
Input, simplify shown in result such as Fig. 2 (b)；Another situation is the input of intermediate event only there are one elementary event, such as Fig. 2
(c) shown in, only there are one elementary events { e3 } by intermediate event g4 as input, under such circumstances, needs this intermediate event
It deletes, and its input is assigned to upper layer intermediate event g3 as input, simplify result such as Fig. 2 (d).
2, collapse step：The intermediate event of the same type continuously occurred is reduced.
Specifically, in collapse step, when in the input of an intermediate event containing there are one being intermediate event, and their institutes
Corresponding door event type is identical, then can merge the two intermediate events.As shown in Fig. 3 (a), g1 and g2 are corresponded to
Door event be all or door that and g2 is the incoming event of g1, then deletes g2, and the incoming event of g2 { e2, e3, e4 } is assigned to
G1 is as input, shown in result such as Fig. 3 (b) after simplifying.
3, extraction step：It will be merged containing similar events intermediate event as input.
Specifically, it in extraction step, when two intermediate events of the brotgher of node each other contain identical incoming event, needs
This same factors is extracted, then remaining incoming event is reconfigured to the input of the intermediate event new as one, and
According to the type of certain rules modification door event.As shown in Fig. 4 (a), g2 and the g3 incoming event as g1 simultaneously, e3 conducts
The same factors of the two intermediate events, are extracted, and construct a new intermediate event g4 (shown in such as Fig. 4 (b)),
The incoming event { e1, e2 } of former g2, g3 are assigned to g4 as input.The type of g1 events is revised as or and g4 respectively simultaneously
Door event type be revised as different from g2, g3 and door.Similarly, as shown in Fig. 4 (c), difference lies in levels with left figure
Door event type it is different.When the door event type of upper layer intermediate event g5 be or when, g5 event types will change after simplifying
For with while the intermediate event g8 generated is different with former lower layer's intermediate event g6, g7 event, simplification result such as Fig. 4 (d).
Two, the module that linear time algorithm identifies is extended, identifies the equal event in fault tree, divided equivalent
Event is new module.
In step 2, the number of modules that extension linear time algorithm is decomposed is realized more compared to linear time algorithm
Whole fault tree is divided into several modules of more small particle size by the identification of module.
Specifically, the outgoing event for the module that linear time algorithm is identified is indicated by intermediate event, but fault tree
In there is also another form of module, it can be elementary event, the logical groups of intermediate event, even module outgoing event
It closes.The definition of expansion module：Always occur together under the door event of same type in fault tree, the event with identical effectiveness
Referred to as equal event.The combination of equal event can be divided into a module.The combination of equal event can be divided into one
A module.For elementary event ei, ej(can also be intermediate event gi), if their father's nodes having the same, and these
The door event type of father's node is identical, then ei, ejIt can be identified as a module.
In the major architectural of algorithm, the input of algorithm is the root node of fault tree.Output is the failure after extension is decomposed
Tree.Here with EventOrGate (u) indicate all event types of node u be or father's node set,
EventAndGate (u) indicate all event types of node u be with father's node set.
Specifically, module extension decomposable process includes the following steps：
Initialize two set EventOrGate (u), EventAndGate (u), wherein EventOrGate (u) is indicated
All event types of node u be or father's node set, EventAndGate (u) indicates all events of node u
Type be with father's node set, u is positive integer；
The corresponding door event type between father's node and child is recorded during traversing fault tree, if door thing
The type of part is and, then father's node is recorded in EventAndGate (u) set of the child, corresponding
It is recorded in EventOrGate (u) set；If the type of door event is or, father's node is recorded in and goes back child
In EventOrGate (u) set, recorded in corresponding EventAndGate (u) is gathered
For several events u, v ... w in fault tree, if meeting EventOrGate (u)=EventOrGate (v)
=... EventOrGate (w), and That
This several event u, v ... w may be constructed a new module, wherein and u, v ... w are respectively positive integer, andFor empty set；And
And if meet EventAndGate (u)=EventAndGate (v)=... EventAndGate (w), also, So this several event u,
V ... w can also form a new module.
It is embodied below with document [Vesley B W E, Goldberg F F, Roberts N H, et al.Fault
Tree Handbook [J] .U.s.nuclear Regulatory Commission Rep.2010.] in motor2 fault trees
Model is example, and decomposition module is extended to motor2 fault trees using method proposed by the present invention.
According to the step of the previously described present invention, specific implementation step is as follows：
Step 1, according to above-mentioned reduction rules, abbreviation is carried out to motor2.
Step 1-1, according to specification rule, it is during an intermediate event does not have yet that this fault tree, which does not have the input of intermediate event,
Between event input only there are one elementary event, so step is not necessarily to abbreviation, into next step；
Step 1-2, according to rule is shunk, it can be found that the corresponding door events of g5 and g6 are all or door, and g6 is the defeated of g5
Incoming event then deletes g6, and the incoming event of g6 { e3, e7, e5 } is assigned to g5 and is used as input, result such as Fig. 5 after simplifying
It is shown；
Step 1-3, according to extraction rule, this fault tree contains identical defeated without two intermediate events of the brotgher of node each other
Incoming event, so step is without being simplified.
Step 2, decomposition algorithm is extended according to module to decompose the motor2 of abbreviation.
Step 2-1, by traversing fault tree, it can be found that father's node of e4 is g4, corresponding door event is or door, therefore
{ g4 } will be recorded in EventOrGate (e4), record in EventAndGate (e4)Father's node of e5 is g4, corresponding
Door event be or door that therefore { g4 } will be recorded in EventOrGate (e5), record in EventAndGate (e5)Successively
Traversal is gone down until traversal terminates whole fault tree.After EventOrGate (u) and EventAndGate (u) can be obtained
Set, as shown in Figure 6；
Step 2-2 can be found that EventAndGate according to the set of EventOrGate (u) He EventAndGate (u)
(e3) and EventAndGate (e7) be all empty set and EventOrGate (e3) and EventOrGate (e7) all be g3,
G5 }, therefore { e3, e7 } is divided into a module, it is used in combination m1 to indicate the top event of { e3, e7 }；
Step 2-3, according to set it has also been found that EventOrGate (e4) and EventOrGate (e6) all for empty set simultaneously
And EventAndGate (e4) and EventAndGate (e4) they are { g4 }, therefore { e4, e6 } is divided into a module, m2 is used in combination
Indicate the top event of { e4, e6 }；
Step 2-4, the fault tree module after the completion of decomposing are as shown in Figure 7.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie
In the case of without departing substantially from spirit or essential attributes of the invention, the present invention can be realized in other specific forms.Therefore, no matter
From the point of view of which point, the present embodiments are to be considered as illustrative and not restrictive, and the scope of the present invention is by appended power
Profit requires rather than above description limits, it is intended that all by what is fallen within the meaning and scope of the equivalent requirements of the claims
Variation is included within the present invention.Any reference signs in the claims should not be construed as limiting the involved claims.
In addition, it should be understood that although this specification is described in terms of embodiments, but not each embodiment is only wrapped
Containing an independent technical solution, this description of the specification is merely for the sake of clarity, and those skilled in the art should
It considers the specification as a whole, the technical solutions in the various embodiments may also be suitably combined, forms those skilled in the art
The other embodiment being appreciated that.
Claims (4)
1. a kind of fault tree module based on linear time algorithm extends decomposition method, it is characterised in that：Include the following steps：
One, fault tree is simplified by trimming redundant node or subtree；
Two, the module that linear time algorithm identifies is extended, identifies the equal event in fault tree, divide equal event
For new module.
2. a kind of fault tree module based on linear time algorithm according to claim 1 extends decomposition method, feature
It is, in step 1, simplification is carried out to fault tree and is included the following steps：
Specification step：Abbreviation is containing only there are one the intermediate events of incoming event；
Collapse step：The intermediate event of the same type continuously occurred is reduced；
Extraction step：It will be merged containing similar events intermediate event as input.
3. a kind of fault tree module based on linear time algorithm according to claim 1 extends decomposition method, feature
It is, in step 2, module extension decomposable process includes the following steps：
Initialize two set EventOrGate (u), EventAndGate (u), wherein EventOrGate (u) indicates node u
All event types be or father's node set, EventAndGate (u) indicates that all event types of node u are
With father's node set, u is positive integer；
The corresponding door event type between father's node and child is recorded during traversing fault tree, if door event
Type is and, then father's node is recorded in EventAndGate (u) set of the child, corresponding
It is recorded in EventOrGate (u) set；If the type of door event is or, father's node is recorded in and goes back child
In EventOrGate (u) set, recorded in corresponding EventAndGate (u) is gathered；
For several events u, v ... w in fault tree, if meet EventOrGate (u)=EventOrGate (v)=...
EventOrGate (w), and That
This several event u, v ... w may be constructed a new module, wherein and u, v ... w are respectively positive integer, andFor empty set.
4. a kind of fault tree module based on linear time algorithm according to claim 3 extends decomposition method, feature
Be, if meet EventAndGate (u)=EventAndGate (v)=... EventAndGate (w), also, So this several event u, v ...
W can also form a new module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810287529.4A CN108520168A (en) | 2018-03-30 | 2018-03-30 | A kind of fault tree module extension decomposition method based on linear time algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810287529.4A CN108520168A (en) | 2018-03-30 | 2018-03-30 | A kind of fault tree module extension decomposition method based on linear time algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108520168A true CN108520168A (en) | 2018-09-11 |
Family
ID=63431665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810287529.4A Pending CN108520168A (en) | 2018-03-30 | 2018-03-30 | A kind of fault tree module extension decomposition method based on linear time algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108520168A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110989558A (en) * | 2019-12-19 | 2020-04-10 | 浙江中控技术股份有限公司 | Fault diagnosis item processing method and system |
| CN113168544A (en) * | 2018-12-19 | 2021-07-23 | 西门子股份公司 | Method and system for providing services for complex industrial systems |
-
2018
- 2018-03-30 CN CN201810287529.4A patent/CN108520168A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113168544A (en) * | 2018-12-19 | 2021-07-23 | 西门子股份公司 | Method and system for providing services for complex industrial systems |
| CN110989558A (en) * | 2019-12-19 | 2020-04-10 | 浙江中控技术股份有限公司 | Fault diagnosis item processing method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11593408B2 (en) | Identifying data relationships from a spreadsheet | |
| CN103235881B (en) | A kind of nuclear reactor fault monitoring system based on minimal cut set | |
| CN109284626A (en) | Random forests algorithm towards difference secret protection | |
| DE112016005350T5 (en) | SAVING AND RECALLING DATA FROM A DATA CUBE | |
| DE102011106550A1 (en) | Methodology for extracting data for unstructured data using ontology-based text mining | |
| CN108647249A (en) | Public sentiment data prediction technique, device, terminal and storage medium | |
| CN102932195A (en) | Networking protocol analysis-based business analysis monitoring method and system | |
| CN108650684A (en) | A kind of correlation rule determines method and device | |
| CN108520168A (en) | A kind of fault tree module extension decomposition method based on linear time algorithm | |
| CN102750367A (en) | Big data checking system and method thereof on cloud platform | |
| CN106681169A (en) | Electrical power system safety control simulation integrated platform and simulation method thereof | |
| Krutanard et al. | Discovering organizational process models of resources in a hospital using Role Hierarchy Miner | |
| CN116541782A (en) | Power marketing data anomaly identification method | |
| CN107579844A (en) | It is a kind of that failure method for digging is dynamically associated based on service path and frequency matrix | |
| Tai et al. | An incremental approach to reachability analysis of distributed programs | |
| CN117316409A (en) | Hospital information management method and system based on big data | |
| Khoshgoftaar et al. | Detecting noisy instances with the rule-based classification model | |
| CN104573855B (en) | The maximum work dispatching method of the iterative and incremental for meeting temporal constraint based on bipartite graph | |
| CN110008239A (en) | Logic based on precomputation optimization executes optimization method and system | |
| CN111125078A (en) | Defect data correction method for relay protection device | |
| CN113986990A (en) | Data resource acquisition and labeling method and device based on block chain data mining | |
| CN113489602A (en) | Communication fault positioning method and system based on data mining | |
| CN109783464B (en) | Spark platform-based frequent item set mining method | |
| US20160162554A1 (en) | Methods for applying text mining to identify and visualize interactions with complex systems | |
| Yamamoto et al. | Including the user in the knowledge discovery loop: Interactive itemset-driven rule extraction |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180911 |