CN113313419B - Method and device for acquiring window change risk of information system - Google Patents
Method and device for acquiring window change risk of information system Download PDFInfo
- Publication number
- CN113313419B CN113313419B CN202110696955.5A CN202110696955A CN113313419B CN 113313419 B CN113313419 B CN 113313419B CN 202110696955 A CN202110696955 A CN 202110696955A CN 113313419 B CN113313419 B CN 113313419B
- Authority
- CN
- China
- Prior art keywords
- change
- window
- risk value
- evaluated
- acyclic graph
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0635—Risk analysis of enterprise or organisation activities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Technology Law (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method and a device for acquiring window change risks of an information system, wherein the method for acquiring the window change risks of the information system comprises the following steps: acquiring a first change of a change window to be evaluated and an initial change risk value of the first change; acquiring one or more associated changes which are changed after the first change of the change window to be evaluated, and acquiring a change risk value of each associated change; establishing a directed acyclic graph of a first change and associated change of a change window to be evaluated, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes; and acquiring the output degree of the initial node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the initial node and the initial change risk value. The application can more comprehensively and accurately reflect the change risk when the information system is upgraded.
Description
Technical Field
The present application relates to information security technologies, and in particular, to a method and an apparatus for acquiring a risk of window modification of an information system.
Background
With the deep integration of the emerging information technologies such as mobile internet and the like with the traditional financial business, the number of information systems of banks is increased, and the scale is also increased. With this, the scale of the information system is increased and the risk of change is increased every time the information system is upgraded. Therefore, the risk of change occurring at the time of system upgrade is calculated to grasp the situation at the time of system upgrade.
When the information system is updated or changed, each window in the information system is changed sequentially, for example, one window is changed every week. In determining risk values caused by upgrading and changing an information system by a change window, the prior art generally calculates the risk values for a single change window. However, there is a complex association between a single window change and other window changes when the information system is updated and changed, and the risk value calculation for the single window change is too single to accurately and comprehensively reflect the risk when the information system is updated.
Therefore, how to obtain the change risk value caused by the window change in the information system more comprehensively is still a problem to be considered.
Disclosure of Invention
The application provides a method and a device for acquiring a window change risk of an information system, which are used for solving the problems that the window change risk value of the information system is too single to accurately and comprehensively reflect the risk of the information system when the information system is updated in the prior art.
In one aspect, the present application provides a method for acquiring a risk of window modification of an information system, including:
acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two mutually connected nodes is equal to a change risk value of an outbound node in the two nodes;
and acquiring the degree of departure of the starting node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the degree of departure of the starting node and the initial change risk value.
In one embodiment, after the establishing the directed acyclic graph of the first change of the change window to be evaluated and the associated change, the method further includes:
establishing a directed tree of the directed acyclic graph;
Acquiring a change risk value of each node on the longest branch in the directed tree, and determining a second change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
when the second change risk value of the change window to be evaluated is larger than the first change risk value of the change window to be evaluated, the first change risk value of the change window to be evaluated is updated to the second change risk value of the change window to be evaluated.
In one embodiment, the establishing the directed acyclic graph of the first change of the change window under evaluation and the associated change includes:
creating the first altered expression and the associated altered expression, the expressions comprising an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression and an altered post-altered sub-expression;
establishing nodes in the directed acyclic graph according to the changed sub-expressions, the changed pre-changed sub-expressions and the changed post-changed sub-expressions of the associated changes;
and establishing connection lines between nodes according to the change and the expression of the change risk value of the change.
In one embodiment, the building the directed tree of the directed acyclic graph includes:
creating a virtual starting point and a virtual ending point in the directed acyclic graph;
equidistant connection is carried out on the virtual starting point and M nodes without the preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without the preamble change window, and M is an integer larger than zero;
wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point;
and a plurality of links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches from the starting vertex to the ending point in the directed tree.
In one embodiment, the change risk value of the virtual starting point is zero.
In another aspect, the present application provides a method for acquiring a risk of window modification of an information system, including:
acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
Establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two mutually connected nodes is equal to a change risk value of an outbound node in the two nodes;
establishing a directed tree of the directed acyclic graph;
and acquiring the change risk value of each node on the longest branch in the directed tree, and determining a first change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch.
In another aspect, the present application provides an information system window change risk obtaining apparatus, including:
the acquisition module is used for acquiring a first change of the change window to be evaluated and an initial change risk value of the first change;
the acquisition module is further used for acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
the diagram building module is used for building a directed acyclic graph of a first change of the change window to be evaluated and the associated change, one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
And the processing module is used for acquiring the output degree of the starting node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the starting node and the initial change risk value.
In one embodiment, the mapping module is further configured to build a directed tree of the directed acyclic graph;
the acquisition module is further used for acquiring a change risk value of each node on the longest branch in the directed tree, and determining a second change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
the processing module is further configured to update the first change risk value of the change window to be evaluated to the second change risk value of the change window to be evaluated when the second change risk value of the change window to be evaluated is greater than the first change risk value of the change window to be evaluated.
In one embodiment, the method further comprises:
a creation module for creating the first altered expression and the associated altered expression, the expressions including an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression, and an altered post-altered sub-expression;
The mapping module is further used for building nodes in the directed acyclic graph according to the changed sub-expressions, the changed sub-expressions of the related change, the changed sub-expressions of the previous change and the changed sub-expressions of the subsequent change;
the mapping module is also used for establishing connection lines between nodes according to the change and the expression of the change risk value of the change.
In another aspect, the present application provides an information system window change risk calculating apparatus, including:
the acquisition module is used for acquiring a first change of the change window to be evaluated and an initial change risk value of the first change;
the acquisition module is further used for acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
the diagram building module is used for building a directed acyclic graph of a first change of the change window to be evaluated and the associated change, one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
The mapping module is also used for building a directed tree of the directed acyclic graph;
the processing module is used for acquiring the change risk value of each node on the longest branch in the directed tree, and determining the first change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch.
In another aspect, the present application provides a computer device comprising a memory for storing instructions, a processor for executing the instructions stored in the memory, and a transceiver for communicating with other devices, to cause the computer device to perform the information system window change risk acquisition method of the first aspect.
In another aspect, the application provides a computer device comprising a memory for storing instructions, a processor for executing the instructions stored in the memory, and a transceiver for communicating with other devices, to cause the computer device to perform the information system window change risk calculation method of the second aspect.
In another aspect, the present application provides a computer-readable storage medium having stored therein computer-executable instructions that, when executed, cause a computer to perform the information system window change risk obtaining method according to the first aspect.
In another aspect, the present application provides a computer-readable storage medium having stored therein computer-executable instructions that, when executed, cause a computer to perform the information system window change risk calculation method of the second aspect.
In another aspect, the application provides a computer program product comprising a computer program which, when executed by a processor, implements the information system window change risk acquisition method according to the first aspect.
In another aspect, the application provides a computer program product comprising a computer program which, when executed by a processor, implements the information system window change risk calculation method according to the first aspect.
The information system window change risk obtaining method provided by the application establishes a directed acyclic graph of a first change in a change window to be evaluated and other changes related to the first change, and obtains the degree of the first change in the directed acyclic graph. And determining the risk value of the change window to be evaluated when the change window is changed through the output degree of the first change and the initial change risk value of the first change. The output degree of the first change indicates the number of subsequent changes affected by the change of the first change, and the change risk value calculation of introducing the output degree of the first change into the change window to be evaluated can more comprehensively reflect the influence of a single change on the change of the change window to be evaluated. Therefore, the information system window change risk acquisition method provided by the application can more comprehensively, multidimensional and accurately reflect the change risk when the information system is updated.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure.
Fig. 1 is a flowchart of a method for acquiring risk of window modification of an information system according to an embodiment of the application.
Fig. 2 is a schematic diagram of a change in a window according to an embodiment of the application.
Fig. 3 is a schematic illustration of the output of the modification according to the first embodiment of the present application.
Fig. 4 is a flowchart of a method for calculating window changes of an information system according to a second embodiment of the present application.
Fig. 5 is a schematic diagram of a directed acyclic graph according to a second embodiment of the application.
Fig. 6 is a flowchart of a method for acquiring window changes of an information system according to a third embodiment of the present application.
Fig. 7 is a schematic diagram of an information system window change acquiring device according to a fourth embodiment of the present application.
Fig. 8 is a schematic diagram of an information system window modification calculating device according to a fifth embodiment of the present application.
Fig. 9 is a schematic diagram of a computer device according to a sixth embodiment of the present application.
Fig. 10 is a schematic diagram of a computer device according to a seventh embodiment of the present application.
Specific embodiments of the present disclosure have been shown by way of the above drawings and will be described in more detail below. These drawings and the written description are not intended to limit the scope of the disclosed concepts in any way, but rather to illustrate the disclosed concepts to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as detailed in the accompanying claims.
First, the terms involved in the present application will be explained:
change of information system: the method is to perform necessary local update, modification and perfection on the original information system in order to adapt the information system to the change of the user environment, or meet the new requirements of users, or clear faults and errors occurring in the operation of the information system.
Risk value: and quantitatively evaluating the probability of risk occurrence and the value of the influence degree of the production result. The greater the risk value, the greater the degree of impact of the consequences produced.
The figure: the figures referred to in this application refer in particular to the objects studied in the mathematical graph theory. It is a graph made up of several given points and lines connecting the two points, which is commonly used to describe some specific relationship between something: points represent things, and a line connecting the two points represents a relationship that the two corresponding things have.
Directed graph: the graph consisting entirely of directional sides is a directed graph.
Directed acyclic graph: a loop-free directed graph, in short, a graph that starts from any node and proceeds in the direction of the edge, and no matter which path is selected, cannot return to the starting point.
Degree, out degree, and in degree: in the directed graph, the number of edges with the node as the tail is called the ingress of the node, the data of the edges with the node as the head is called the egress of the node, and the sum of the ingress and egress of a node is called the degree of the node.
Tree: the tree in the application is a data structure in computer science. It is a set of n (n > =0) finite nodes with a hierarchical relationship. The tree is called because it looks like an upside down tree with its root up and leaf down.
Depth traversal: depth traversal (DFS, depth First Search, also known as depth-first search) refers to the penetration of each possible branch path until it is no longer possible, and each node can only access once.
With the deep integration of the emerging information technologies such as mobile internet and the like with the traditional financial business, the number of information systems of banks is increased, and the scale is also increased. With this, the scale of the information system is increased and the risk of change is increased every time the information system is upgraded. Therefore, the risk of change occurring at the time of system upgrade is calculated to grasp the situation at the time of system upgrade.
When the information system is updated or changed, each change in the change window in the information system is sequentially performed, for example, 10 changes are included in the change window, and the 10 changes are performed 1 change before 2 changes and 7 changes. When determining a risk value caused by upgrading and changing an information system by a change window, namely, a change risk value of the change window, one method in the prior art is to calculate a risk value of a single change of the change window to obtain the change risk value of the change window. However, since there is a complex association relationship between a plurality of changes of a change window in an upgrade change of an information system, a method of calculating a risk value for only a single change of the change window cannot reflect the association relationship, and thus the overall risk degree in the upgrade and change of the information system cannot be accurately and comprehensively reflected.
Another method in the prior art is to add each change risk value in the plurality of changes calculated to obtain the window to obtain the overall risk level, but this method has a problem that the calculation amount is too large as the number of changes in the window increases and the complexity of the change content increases. And the change window risk value obtained by simply and roughly adding all the change risk values of the change window cannot reflect the association relation described above, so that the method cannot accurately and comprehensively reflect the overall risk degree during the upgrading and changing of the information system,
Based on the above, the application provides a method and a device for acquiring the risk of window change of an information system, which acquire a risk value when the window change to be evaluated is changed by establishing an association relation among a plurality of changes in the window change to be evaluated. Thus, the obtained risk value at the time of window change of the information system upgrade can reflect the whole risk degree of window change at the time of information system upgrade and change.
The information system window change risk acquisition method provided by the application is applied to computer equipment, such as a computer, a server special for a laboratory and the like. When the information system window change risk acquisition method is executed, the computer equipment establishes a directed acyclic graph about all associated changes in the change window to be evaluated, and determines a change risk value of the change window to be evaluated based on the directed acyclic graph.
Referring to fig. 1, a first embodiment of the present application provides a method for acquiring risk of window modification of an information system, including:
s110, acquiring a first change of a change window to be evaluated and an initial change risk value of the first change.
Each change window contains a plurality of changes, and the initial change risk value refers to the change risk value of the first change in the change window to be evaluated. The first change may be any change, such as an initial change, of the change window under evaluation.
As described in the above, the risk value of a single change of the change window may be calculated by a mature method, which is not described here.
The change window to be evaluated refers to a change window to be evaluated in the period to be evaluated. At present, the bank adopts a mode of changing a window to update and change the whole information system, namely, a researcher and a developer can only optimize, update and put into production the information system in a specified changing window, and other times do not allow any change to the information system. The period to be evaluated refers to the period of time that allows for changes to the information system. The period to be evaluated and the change window to be evaluated can be selected according to actual needs, and the application is not limited.
S120, acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change.
The related change refers to a change performed sequentially after the first change. For example, there are two associated changes after the first change is made, there are three associated changes after the two associated changes, and the three associated changes are followed by the end of the change. At this time, there are five associated changes of the first change.
After determining the one or more associated changes of the first change, a change risk value for each associated change is obtained for use in building the directed acyclic graph in step S130.
S130, establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes.
The outbound node refers to a node extending from an edge connecting two nodes, that is, a node corresponding to a first change in two changes corresponding to the two nodes is an outbound node. The change risk value of the previous change determines the length of the connection line between the two nodes, and the larger the change risk value of the previous change is, the longer the connection line between the two nodes is.
Optionally, before establishing the directed acyclic graph of the first change and the associated change, it is also necessary to create an expression of the first change and an expression of the associated change. Wherein the expression includes a modified sub-expression, a modified sub-expression of a modified risk value, a modified pre-modified sub-expression, and a modified post-modified sub-expression.
Specifically, assume that a change is denoted as C N The change risk value of the change is denoted as R N The preamble of this change is denoted as C FRONT_N The subsequent change of the change is denoted as C BACK_N . Then each change may be represented as { C } N ，R N ，C FRONT_N ，C BACK_N }. Wherein when change C N When no preamble is changed, record C FRONT_N =null, when change C N Record C when no subsequent changes BACK_N =null. Thus, all changes to a window can be represented as shown in FIG. 2, where the arrow in FIG. 2 represents the direction of dependency. As shown in FIG. 2, there are multiple unassociated windows in a window, e.g., { C } 1 ，R 1 ，NULL，NULL}、{C I ，R I ，NULL，C K Sum { C } 0 ，R 0 ，NULL，C N Three mutually uncorrelated changes. And { C in FIG. 2 I ，R I ，NULL，C K }、{C K ，R K ，C I ，C 2 }、{C 2 ，R 2 ，C K ，C L Sum { C } L ，R L ，C 2 NULL is a change associated with each other.
S140, obtaining the output degree of the initial node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the initial node and the initial change risk value.
The first modification { C is shown in FIG. 3 M ，R M ，NULL，(C A ，C B ，C C ，C D … as the initial node has an outbound degree, as shown in the figure, the first change has an outbound degree equal to 5, and the first change risk value is equal to 5R M 。
According to the information system window change risk obtaining method provided by the embodiment, a directed acyclic graph between associated changes in the change window to be evaluated is established, and then a change risk value of the change window to be evaluated is determined based on the directed acyclic graph. In actual calculation, the first change may be updated continuously, that is, the computer device may calculate each change in the to-be-evaluated change window as a change risk value of the to-be-evaluated change window corresponding to the first change. And the computing equipment determines the maximum change risk value from all the calculated change risk values of the change window to be evaluated as the final wanted change risk value. Compared with the calculation method for simply calculating the risk value of a single change and simply adding the risk values of a plurality of changes in the prior art, the method provided by the embodiment can screen the change risk value which can reflect the change association relationship most from the change window to be evaluated, so that the obtained change risk value of the change window to be evaluated can reflect the risk and the maximum risk of the change window to be evaluated in the process of changing more accurately and comprehensively.
Referring to fig. 4, a second embodiment provides a method for calculating a window change risk of an information system, including:
s410, acquiring a first change of a change window to be evaluated and an initial change risk value of the first change.
S420, acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change.
S430, establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes.
The description of step S430 may refer to the description of step S130, and will not be repeated here.
S440, establishing a directed tree of the directed acyclic graph.
Before the directed tree is generated, all the changes in the change window to be evaluated need to be acquired, and the directed acyclic graph is updated according to the changes, that is, nodes, and connections between nodes, which are not previously established in the directed acyclic graph established in step S430 are added.
In building the directed tree of the directed acyclic graph, a virtual starting point C can be created in the directed acyclic graph 0 And virtual end point C N+1 . Wherein the virtual starting point C 0 Refers to the node whose preamble is NULL, the virtual ending point C N+1 Refers to the node whose subsequent node is NULL. The virtual starting point C 0 Equidistant from the M nodes without preamble changes and connecting the virtual ending point C N+1 And nodes of the M non-subsequent change windows. Wherein the M nodes without preamble changes include the starting node. The multiple links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to multiple branches from the starting vertex to the ending point in the directed tree.
Fig. 5 shows a directed five-ring graph including nodes corresponding to all changes, the virtual start point and the virtual end point. Wherein the virtual starting point C 0 Is zero, representing the virtual starting point C 0 And the M numbersThe distances of the nodes are equal.
After obtaining the directed acyclic graph with virtual starting point and virtual ending point, traversing the directed pentacyclic graph deeply, creating a virtual starting point C 0 The tree is a tree with vertexes, at this time, vertexes of the directed tree correspond to the virtual starting points, end points of the directed tree correspond to the virtual end points, and the number of the virtual end points is M.
S450, acquiring the change risk value of each node on the longest branch in the directed tree, and determining the first change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch.
Unlike step S140, which determines the change risk value of the change window under evaluation, this step is a change risk value determined from a directed tree containing all the changes of the change window under evaluation. As well as the length of the connection line between nodes in the directed acyclic graph, the length of the connection line between nodes in the directed tree is also dependent on the change risk value that the outbound node of the two nodes has.
Therefore, when a branch on the tree is longer, the sum of the change risk values corresponding to the branch is proved to be larger. For example, as shown in FIG. 5, when the non-preface change node is { C I ，R I ，NULL，C K Having the longest branch with a change risk value including R I 、R K 、R 2 And R is L The first change risk value of the change window to be evaluated is R I +R K +R 2 +R L 。
At this time, the non-preamble change node corresponding to the longest branch in the directed tree may or may not be the start node corresponding to the first change.
The method for acquiring the change risk of the information system window provided by the embodiment determines the change risk value of the change window to be evaluated by establishing a directed tree corresponding to all changes of the change window to be evaluated. Compared with the calculation method for simply calculating the risk value of a single change and simply adding the risk values of a plurality of changes in the prior art, the method provided by the embodiment can screen the change risk value which can reflect the change association relationship most from the change window to be evaluated, so that the obtained change risk value of the change window to be evaluated can reflect the risk and the maximum risk of the change window to be evaluated during the change more accurately and comprehensively.
Referring to fig. 6, a third embodiment of the present application further provides a method for acquiring a risk of window modification of an information system, including:
s610, acquiring a first change of a change window to be evaluated and an initial change risk value of the first change.
S620, acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change.
S630, a first change of the change window to be evaluated and a directed acyclic graph of the associated change are established, one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes.
The descriptions of steps S610 to S630 may refer to those of steps S110 to S130 in the first embodiment, and are not repeated here.
S640, establishing a directed tree of the directed acyclic graph.
In building the directed tree of the directed acyclic graph, a virtual starting point C can be created in the directed acyclic graph 0 And virtual end point C N+1 。
Wherein the virtual starting point C 0 Refers to the node whose preamble is NULL, the virtual ending point C N+1 Refers to the node whose subsequent node is NULL. The virtual starting point C 0 Equidistant from the M nodes without preamble changes and connecting the virtual ending point C N+1 And nodes of the M non-subsequent change windows. Wherein the M nodes without preamble changes include the starting node. Before generating the directed tree, all changes in the change window to be evaluated need to be acquired, and a directed acyclic is established according to all the changesA drawing. Fig. 5 shows a directed five-ring graph including nodes corresponding to all changes, the virtual start point and the virtual end point. Wherein the virtual starting point C 0 Is zero, representing the virtual starting point C 0 Equal in distance to the M nodes.
After obtaining the directed acyclic graph with virtual starting point and virtual ending point, creating a virtual starting point C 0 The tree is a tree with vertexes, at this time, vertexes of the directed tree correspond to the virtual starting points, end points of the directed tree correspond to the virtual end points, and the number of the virtual end points is M.
S650, obtaining the output degree of the initial node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the initial node and the initial change risk value.
The description of step S650 may refer to the description of step S140, and will not be repeated here.
S660, obtaining the change risk value of each node on the longest branch in the directed tree, and determining a second change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch.
The related description with respect to step S660 may refer to the related description of step S450, and the second change risk value in this step may be understood as the first change risk value in step S450.
S670, when the second change risk value of the change window to be evaluated is larger than the first change risk value of the change window to be evaluated, updating the first change risk value of the change window to be evaluated to the second change risk value of the change window to be evaluated.
The first change risk value is obtained by multiplying the initial change risk value of the first change by the output degree of the first change, and the second change risk value is obtained by adding all change risk values of the longest branches of the directed tree established based on all changes in the change window to be evaluated. In order to obtain the maximum change risk value of the change window to be evaluated, so as to estimate the influence of the change window to be evaluated on the information system, a larger value of the first change risk value and the second change risk value needs to be output as the change risk value of the change window to be evaluated.
The method for acquiring the risk of changing the window of the information system adds all the changes in the window to be evaluated into the directed acyclic graph of one embodiment, and establishes the directed tree corresponding to the directed acyclic graph of all the changes. And after the longest branch in the directed tree is obtained, superposing all the change risk values of all the changes contained in the longest branch to obtain a second change risk value of the change window to be evaluated. Comparing the first change risk value obtained in the first embodiment with the second change risk value obtained in the second embodiment, and updating the larger value of the first change risk value and the second change risk value to be the first change risk value of the change window to be evaluated. Therefore, the method for acquiring the change risk value of the change window to be evaluated is further perfected and increased on the basis of the first embodiment, so that the finally acquired change risk value of the change window to be evaluated is guaranteed to be the largest. Therefore, the embodiment further enables the change risk value of the change window to be evaluated to more accurately and comprehensively reflect the change risk degree of the change window to be evaluated on the basis of the first embodiment.
Referring to fig. 7, a fourth embodiment of the present application provides an information system window change risk obtaining apparatus 20, including:
an obtaining module 11, configured to obtain a first change of a change window to be evaluated and an initial change risk value of the first change;
the obtaining module 11 is further configured to obtain one or more associated changes that are changed after the first change of the to-be-evaluated change window, and obtain a change risk value of each associated change;
the mapping module 12 is configured to create a directed acyclic graph of a first change of the change window to be evaluated and the associated change, where a node of the directed acyclic graph represents a change, a node corresponding to the first change is a starting node, and a length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
the processing module 13 is configured to obtain the degree of departure of the starting node based on the directed acyclic graph, and determine a first change risk value of the change window to be evaluated according to the degree of departure of the starting node and the initial change risk value.
The mapping module 12 is further configured to build a directed tree of the directed acyclic graph;
the obtaining module 11 is further configured to obtain a change risk value of each node on a longest branch in the directed tree, and determine a second change risk value of the to-be-evaluated change window according to the change risk value of each node on the longest branch;
The processing module 13 is further configured to update the first change risk value of the change window to be evaluated to the second change risk value of the change window to be evaluated when the second change risk value of the change window to be evaluated is greater than the first change risk value of the change window to be evaluated.
The information system window change risk obtaining device 20 further includes a creating module 14, where the creating module 14 is configured to create the first changed expression and the associated changed expression, where the expressions include a changed sub-expression, a changed sub-expression of a changed risk value, a changed sub-expression of a previous change of a change, and a changed sub-expression of a subsequent change of a change;
the mapping module 12 is further configured to create nodes in the directed acyclic graph according to the changed and associated changed sub-expressions, the changed pre-changed sub-expressions, and the changed post-changed sub-expressions;
the mapping module 12 is further configured to establish connection lines between nodes according to the change and the expression of the change risk value of the change.
The mapping module 12 is further configured to create a virtual starting point and a virtual ending point in the directed acyclic graph; equidistant connection is carried out on the virtual starting point and M nodes without preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without postorder change windows, and M is an integer larger than zero; wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point; the multiple links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to multiple branches from the starting vertex to the ending point in the directed tree. The change risk value of the virtual starting point is zero.
Referring to fig. 8, a fifth embodiment of the present application provides an information system window change risk calculating apparatus 30, including:
an obtaining module 21, configured to obtain a first change of the change window to be evaluated and an initial change risk value of the first change;
the obtaining module 21 is further configured to obtain one or more associated changes that are changed after the first change of the change window to be evaluated, and obtain a change risk value of each associated change;
the mapping module 22 is configured to create a directed acyclic graph of the first change of the change window to be evaluated and the associated change, where one node of the directed acyclic graph represents a change, a node corresponding to the first change is a starting node, and a length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
the mapping module 22 is further configured to build a directed tree of the directed acyclic graph;
the processing module 23 is configured to obtain a change risk value of each node on a longest branch in the directed tree, and determine a first change risk value of the to-be-evaluated change window according to the change risk value of each node on the longest branch.
Referring to fig. 9, a sixth embodiment of the present application further provides a computer device 30, including a memory 31, a processor 32 and a transceiver 33, where the memory 31 is configured to store instructions, the transceiver 33 is configured to communicate with other devices, and the processor 32 is configured to execute the instructions stored in the memory 31, so that the computer device executes the information system window change risk obtaining method provided in the first embodiment and the third embodiment, and detailed implementation and technical effects are similar, and are not repeated herein.
Referring to fig. 10, a seventh embodiment of the present application further provides a computer device 40, including a memory 41, a processor 42 and a transceiver 43, where the memory 41 is configured to store instructions, the transceiver 43 is configured to communicate with other devices, and the processor 42 is configured to execute the instructions stored in the memory 41, so that the computer device executes the information system window change risk calculation method provided in the second embodiment, and detailed implementation and technical effects are similar, and are not repeated herein.
The present application also provides a computer-readable storage medium having stored therein computer-executable instructions that, when executed, cause a computer to execute the instructions when executed by a processor for implementing the information system window change risk acquisition method provided in any one of the embodiments above. The present application also provides another computer-readable storage medium having stored therein computer-executable instructions that, when executed, cause a computer to perform the information system window change risk calculation method provided in any of the embodiments above.
The present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for acquiring the risk of window change of the information system provided in the first embodiment and the third embodiment is implemented, and specific implementation manner and technical effect are similar, and are not repeated here. The present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for calculating the risk of window change of an information system provided in the second embodiment is implemented, and the specific implementation manner and technical effect are similar, and are not repeated here.
The computer readable storage medium may be a Read Only Memory (ROM), a programmable Read Only Memory (Programmable Read-Only Memory, PROM), an erasable programmable Read Only Memory (Erasable Programmable Read-Only Memory, EPROM), an electrically erasable programmable Read Only Memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic random access Memory (Ferromagnetic Random Access Memory, FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical disk, or a compact disk Read Only Memory (Compact Disc Read-Only Memory, CD-ROM). But may be various electronic devices such as mobile phones, computers, tablet devices, personal digital assistants, etc., that include one or any combination of the above-mentioned memories.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing embodiment numbers of the present application are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the embodiments of the present application.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the application, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (9)
1. An information system window change risk obtaining method is characterized by comprising the following steps:
acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two mutually connected nodes is equal to a change risk value of an outbound node in the two nodes;
acquiring the output degree of the starting node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the starting node and the initial change risk value;
after the first change of the change window to be evaluated and the directed acyclic graph of the associated change are established, the method further comprises:
establishing a directed tree of the directed acyclic graph;
acquiring a change risk value of each node on the longest branch in the directed tree, and determining a second change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
When the second change risk value of the change window to be evaluated is larger than the first change risk value of the change window to be evaluated, updating the first change risk value of the change window to be evaluated into the second change risk value of the change window to be evaluated;
the establishing the directed acyclic graph of the first change of the change window to be evaluated and the associated change includes:
creating the first altered expression and the associated altered expression, the expressions comprising an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression and an altered post-altered sub-expression;
establishing nodes in the directed acyclic graph according to the changed sub-expressions, the changed pre-changed sub-expressions and the changed post-changed sub-expressions of the associated changes;
establishing a connection line between nodes according to the change and the expression of the change risk value of the change;
the building the directed tree of the directed acyclic graph includes:
creating a virtual starting point and a virtual ending point in the directed acyclic graph;
equidistant connection is carried out on the virtual starting point and M nodes without the preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without the preamble change window, and M is an integer larger than zero;
Wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point;
and a plurality of links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches from the starting point to the ending point in the directed tree.
2. The method of claim 1, wherein the change risk value for the virtual starting point is zero.
3. An information system window change risk obtaining method is characterized by comprising the following steps:
acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
establishing a first change of the change window to be evaluated and a directed acyclic graph of the associated change, wherein one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two mutually connected nodes is equal to a change risk value of an outbound node in the two nodes;
Establishing a directed tree of the directed acyclic graph;
acquiring a change risk value of each node on the longest branch in the directed tree, and determining a first change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
when the second change risk value of the change window to be evaluated is larger than the first change risk value of the change window to be evaluated, updating the first change risk value of the change window to be evaluated into the second change risk value of the change window to be evaluated;
the establishing the directed acyclic graph of the first change of the change window to be evaluated and the associated change includes:
creating the first altered expression and the associated altered expression, the expressions comprising an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression and an altered post-altered sub-expression;
establishing nodes in the directed acyclic graph according to the changed sub-expressions, the changed pre-changed sub-expressions and the changed post-changed sub-expressions of the associated changes;
establishing a connection line between nodes according to the change and the expression of the change risk value of the change;
The building the directed tree of the directed acyclic graph includes:
creating a virtual starting point and a virtual ending point in the directed acyclic graph;
equidistant connection is carried out on the virtual starting point and M nodes without the preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without the preamble change window, and M is an integer larger than zero;
wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point;
and a plurality of links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches from the starting point to the ending point in the directed tree.
4. An information system window change risk acquiring device, comprising:
the acquisition module is used for acquiring a first change of the change window to be evaluated and an initial change risk value of the first change;
the acquisition module is further used for acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
the diagram building module is used for building a directed acyclic graph of a first change of the change window to be evaluated and the associated change, one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
The processing module is used for acquiring the output degree of the starting node based on the directed acyclic graph, and determining a first change risk value of the change window to be evaluated according to the output degree of the starting node and the initial change risk value;
the mapping module is also used for building a directed tree of the directed acyclic graph;
the acquisition module is further used for acquiring a change risk value of each node on the longest branch in the directed tree, and determining a second change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
the processing module is further configured to update the first change risk value of the change window to be evaluated to a second change risk value of the change window to be evaluated when the second change risk value of the change window to be evaluated is greater than the first change risk value of the change window to be evaluated;
a creation module for creating the first altered expression and the associated altered expression, the expressions including an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression, and an altered post-altered sub-expression;
the mapping module is further used for building nodes in the directed acyclic graph according to the changed sub-expressions, the changed sub-expressions of the related change, the changed sub-expressions of the previous change and the changed sub-expressions of the subsequent change;
The mapping module is also used for establishing connection lines between nodes according to the change and the expression of the change risk value of the change;
the mapping module is specifically used for creating a virtual starting point and a virtual ending point in the directed acyclic graph; equidistant connection is carried out on the virtual starting point and M nodes without the preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without the preamble change window, and M is an integer larger than zero; wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point; and a plurality of links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches from the starting point to the ending point in the directed tree.
5. An information system window change risk acquiring device, comprising:
the acquisition module is used for acquiring a first change of the change window to be evaluated and an initial change risk value of the first change;
the acquisition module is further used for acquiring one or more associated changes which are changed after the first change of the to-be-evaluated change window, and acquiring a change risk value of each associated change;
The diagram building module is used for building a directed acyclic graph of a first change of the change window to be evaluated and the associated change, one node of the directed acyclic graph represents one change, the node corresponding to the first change is a starting node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an outbound node in the two nodes;
the mapping module is also used for building a directed tree of the directed acyclic graph;
the processing module is used for acquiring the change risk value of each node on the longest branch in the directed tree, and determining a first change risk value of the change window to be evaluated according to the change risk value of each node on the longest branch;
the processing module is further configured to update the first change risk value of the change window to be evaluated to a second change risk value of the change window to be evaluated when the second change risk value of the change window to be evaluated is greater than the first change risk value of the change window to be evaluated;
a creation module for creating the first altered expression and the associated altered expression, the expressions including an altered sub-expression, an altered sub-expression of an altered risk value, an altered pre-altered sub-expression, and an altered post-altered sub-expression;
The mapping module is further used for building nodes in the directed acyclic graph according to the changed sub-expressions, the changed sub-expressions of the related change, the changed sub-expressions of the previous change and the changed sub-expressions of the subsequent change;
the mapping module is also used for establishing connection lines between nodes according to the change and the expression of the change risk value of the change;
the mapping module is specifically used for creating a virtual starting point and a virtual ending point in the directed acyclic graph; equidistant connection is carried out on the virtual starting point and M nodes without the preamble change in the directed acyclic graph, the virtual ending point is connected with M nodes without the preamble change window, and M is an integer larger than zero; wherein, the vertex of the directed tree corresponds to the virtual starting point, and the ending point of the directed tree corresponds to the virtual ending point; and a plurality of links from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches from the starting point to the ending point in the directed tree.
6. A computer device comprising a memory for storing instructions, a processor for executing the instructions stored in the memory, and a transceiver for communicating with other devices, to cause the computer device to perform the information system window change risk acquisition method of any one of claims 1-2.
7. A computer device comprising a memory for storing instructions, a processor for executing the instructions stored in the memory, and a transceiver for communicating with other devices, to cause the computer device to perform the information system window change risk acquisition method of claim 3.
8. A computer readable storage medium having stored therein computer executable instructions which when executed cause a computer to perform the information system window change risk acquisition method of any of claims 1-2.
9. A computer-readable storage medium having stored therein computer-executable instructions that, when executed, cause a computer to perform the information system window change risk acquisition method of claim 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110696955.5A CN113313419B (en) | 2021-06-23 | 2021-06-23 | Method and device for acquiring window change risk of information system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110696955.5A CN113313419B (en) | 2021-06-23 | 2021-06-23 | Method and device for acquiring window change risk of information system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113313419A CN113313419A (en) | 2021-08-27 |
| CN113313419B true CN113313419B (en) | 2023-10-10 |
Family
ID=77380123
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110696955.5A Active CN113313419B (en) | 2021-06-23 | 2021-06-23 | Method and device for acquiring window change risk of information system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113313419B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115102834B (en) * | 2022-04-27 | 2024-04-16 | 浙江大学 | Change risk assessment method, device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018152319A1 (en) * | 2017-02-16 | 2018-08-23 | North Carolina State University | Spreadsheet recalculation algorithm for directed acyclic graph processing |
| CN109726216A (en) * | 2018-12-29 | 2019-05-07 | 北京九章云极科技有限公司 | A kind of data processing method and processing system based on directed acyclic graph |
| CN111476511A (en) * | 2020-06-24 | 2020-07-31 | 支付宝(杭州)信息技术有限公司 | Data display method and device for specific risks faced by server |
| CN112686532A (en) * | 2020-12-29 | 2021-04-20 | 中国航天标准化研究所 | Passive operation risk analysis and evaluation method and device based on Bayesian network model |
-
2021
- 2021-06-23 CN CN202110696955.5A patent/CN113313419B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018152319A1 (en) * | 2017-02-16 | 2018-08-23 | North Carolina State University | Spreadsheet recalculation algorithm for directed acyclic graph processing |
| CN109726216A (en) * | 2018-12-29 | 2019-05-07 | 北京九章云极科技有限公司 | A kind of data processing method and processing system based on directed acyclic graph |
| CN111476511A (en) * | 2020-06-24 | 2020-07-31 | 支付宝(杭州)信息技术有限公司 | Data display method and device for specific risks faced by server |
| CN112686532A (en) * | 2020-12-29 | 2021-04-20 | 中国航天标准化研究所 | Passive operation risk analysis and evaluation method and device based on Bayesian network model |
Non-Patent Citations (1)
| Title |
|---|
| 基于贝叶斯网络的软件项目风险评估模型;唐爱国;王如龙;;计算机工程(第22期);第97-99页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113313419A (en) | 2021-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102302609B1 (en) | Neural Network Architecture Optimization | |
| JP2019533257A (en) | Neural architecture search | |
| KR20170052344A (en) | Method and apparatus for searching new material | |
| CN110798467B (en) | Target object identification method and device, computer equipment and storage medium | |
| US9824494B2 (en) | Hybrid surfaces for mesh repair | |
| CN112541310B (en) | Logic comprehensive control method and device | |
| CN113313419B (en) | Method and device for acquiring window change risk of information system | |
| CN114863385B (en) | Road curved surface information generation method, device, equipment and computer readable medium | |
| CN110321458B (en) | Data flow analysis method and device based on control flow graph | |
| CN113726545B (en) | Network traffic generation method and device for generating countermeasure network based on knowledge enhancement | |
| US11372854B2 (en) | Provenance analysis systems and methods | |
| EP3806023A1 (en) | Search device, search method, computer-readable medium, search system, and arbitrage system | |
| CN111260056B (en) | Network model distillation method and device | |
| CN112181827A (en) | Software graphic interface testing method and device and software development system | |
| CN116108286A (en) | False information detection method, device and equipment based on propagation reconstruction | |
| US20230186108A1 (en) | Control device, method, and program | |
| US11307867B2 (en) | Optimizing the startup speed of a modular system using machine learning | |
| CN113360300A (en) | Interface calling link generation method, device, equipment and readable storage medium | |
| CN109362027B (en) | Positioning method, device, equipment and storage medium | |
| CN109840790B (en) | User loss prediction method and device and computer equipment | |
| CN111723247A (en) | Graph-based hypothetical computation | |
| KR102590540B1 (en) | Artificial neural network learning method and pronunciation evaluation method using the same | |
| CN113343366B (en) | Method for determining main section parameters of vehicle body and related equipment | |
| CN116523052B (en) | Rapid reasoning method, device and equipment | |
| CN116340942B (en) | Function call graph construction method based on object propagation graph and pointer analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |