CN113313419A - Information system window change risk obtaining method and device - Google Patents

Information system window change risk obtaining method and device Download PDF

Info

Publication number
CN113313419A
CN113313419A CN202110696955.5A CN202110696955A CN113313419A CN 113313419 A CN113313419 A CN 113313419A CN 202110696955 A CN202110696955 A CN 202110696955A CN 113313419 A CN113313419 A CN 113313419A
Authority
CN
China
Prior art keywords
change
window
risk value
evaluated
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110696955.5A
Other languages
Chinese (zh)
Other versions
CN113313419B (en
Inventor
徐龙
余阳
耿鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Agricultural Bank of China
Original Assignee
Agricultural Bank of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Agricultural Bank of China filed Critical Agricultural Bank of China
Priority to CN202110696955.5A priority Critical patent/CN113313419B/en
Publication of CN113313419A publication Critical patent/CN113313419A/en
Application granted granted Critical
Publication of CN113313419B publication Critical patent/CN113313419B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (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 a change window to be evaluated, and acquiring a change risk value of each associated change; establishing a first change of a change window to be evaluated and a directed acyclic graph associated with the change, wherein one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of an out-degree node in the two nodes; and obtaining the output degree of the initial node based on the directed acyclic graph, and determining a first change risk value of a change window to be evaluated according to the output degree of the initial node and the initial change risk value. The application provides the method and the device for reflecting the change risk during the upgrading of the information system more comprehensively and accurately.

Description

Information system window change risk obtaining method and device
Technical Field
The present application relates to information security technologies, and in particular, to a method and an apparatus for acquiring a window change risk of an information system.
Background
With the deep integration of emerging information technologies such as mobile internet and the like and traditional financial services, the number of information systems of banks is more and more, and the scale of the information systems is larger and larger. Consequently, the information system is scaled up and down each time it is upgraded, and the risk of alteration is increased. Therefore, the risk of change generated when the system is upgraded is calculated to grasp the situation when the system is upgraded.
When the information system is upgraded and changed, each window in the information system is changed in sequence, for example, one window is changed every week. When determining the risk value caused by upgrading and changing the information system by the change window, the prior art generally calculates the risk value for a single change window. However, when the information system is upgraded, a complex incidence relation exists between a single window change and other window changes, and the risk value calculation for the single window change is too single, so that the risk of the information system during upgrading cannot be accurately and comprehensively reflected.
Therefore, how to more comprehensively acquire the change risk value brought by the window change in the information system is still a problem to be considered.
Disclosure of Invention
The application provides a method and a device for acquiring information system window change risk, which are used for solving the problem that the risk of information system upgrading cannot be accurately and comprehensively reflected due to too single calculation of an information system window change risk value in the prior art.
In one aspect, the present application provides a method for acquiring a window change risk 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 change window to be evaluated, 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out 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 creating the first change of the change window to be evaluated and the directed acyclic graph of the associated changes, the method further includes:
establishing a directed tree of the directed acyclic graph;
Obtaining 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;
and 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.
In one embodiment, the creating a directed acyclic graph of the first change and the associated change of the change window to be evaluated includes:
creating an expression of the first change and an expression of the associated change, the expressions including a sub-expression of the change, a sub-expression of the change risk value of the change, a sub-expression of the preceding change of the change, and a sub-expression of the subsequent change of the change;
establishing nodes in the directed acyclic graph according to the change and the sub-expression of the associated change, the sub-expression of the preorder change of the change and the sub-expression of the postorder change of the change;
and establishing a connecting line between the nodes according to the change and the expression of the changed risk value of the change.
In one embodiment, the creating a directed tree of the directed acyclic graph includes:
creating a virtual starting point and a virtual ending point in the directed acyclic graph;
connecting the virtual starting point with M nodes without front order change in the directed acyclic graph at equal distance, and connecting the virtual ending point with M nodes without back order change windows, wherein M is an integer greater than zero;
the top point of the directed tree corresponds to the virtual starting point, and the end point of the directed tree corresponds to the virtual end point;
and a plurality of links starting from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches starting 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 change in 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 change window to be evaluated, 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out node in the two nodes;
establishing a directed tree of the directed acyclic graph;
and obtaining 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 an information system window change risk obtaining apparatus, including:
the system comprises an acquisition module, a judgment module and a processing module, wherein the acquisition module is used for acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
the obtaining module 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;
a graph building module, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated changes, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of an out-degree node of 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 graph building module is further configured to build a directed tree of the directed acyclic graph;
the obtaining module 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 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 the following steps:
a creation module configured to create an expression of the first change and an expression of the associated change, where the expressions include a sub-expression of a change, a sub-expression of a change risk value of a change, a sub-expression of a preorder change of a change, and a sub-expression of a postorder change of a change;
The graph building module is further configured to build a node in the directed acyclic graph according to the change and the sub-expression of the associated change, the sub-expression of the preorder change of the change, and the sub-expression of the postorder change of the change;
and the mapping module is also used for establishing a connecting line between the nodes according to the change and the expression of the changed risk value of the change.
In another aspect, the present application provides an information system window change risk calculation device, including:
the system comprises an acquisition module, a judgment module and a processing module, wherein the acquisition module is used for acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
the obtaining module 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;
a graph building module, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated changes, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of an out-degree node of the two nodes;
The mapping module is further used for establishing a directed tree of the directed acyclic graph;
and 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, including a memory, a processor and a transceiver, where the memory is used to store instructions, and the transceiver is used to communicate with other devices, and the processor is used to execute the instructions stored in the memory, so that the computer device executes the information system window change risk obtaining method according to the first aspect.
In another aspect, the present application provides a computer device comprising a memory for storing instructions, a processor for communicating with other devices, and a transceiver for executing the instructions stored in the memory to cause the computer device to perform the information system window change risk calculation method according to the second aspect.
In another aspect, the present application provides a computer-readable storage medium, in which computer-executable instructions are stored, and when the instructions are executed, the instructions cause a computer to execute the information system window change risk acquiring method according to the first aspect.
In another aspect, the present application provides 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 calculation method according to the second aspect.
In another aspect, the present 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 present 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 method for acquiring the change risk of the information system window establishes the directed acyclic graph of the first change and other changes associated with the first change in the change window to be evaluated, and acquires the out degree of the first change in the directed acyclic graph. And determining the risk value when the change window to be evaluated is changed according to the out-degree of the first change and the initial change risk value of the first change. The out-degree of the first change indicates the number of subsequent changes which can be influenced by the change of the first change, and the influence of the single change on the change of the change window to be evaluated can be reflected more comprehensively by introducing the out-degree of the first change into the calculation of the change risk value of the change window to be evaluated. Therefore, the information system window change risk obtaining method can reflect the change risk of the information system during upgrading more comprehensively, in multiple dimensions and accurately.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
Fig. 1 is a schematic flowchart of a method for acquiring a window change risk of an information system according to an embodiment of the present application.
Fig. 2 is a schematic diagram of a change in a window according to a first embodiment of the present application.
Fig. 3 is a schematic out-degree diagram of a modification provided in the first embodiment of the present application.
Fig. 4 is a flowchart illustrating a method for calculating a window change 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 the second embodiment of the present application.
Fig. 6 is a flowchart illustrating an information system window change acquiring method according to a third embodiment of the present application.
Fig. 7 is a schematic diagram of an information system window change acquiring apparatus according to a fourth embodiment of the present application.
Fig. 8 is a schematic diagram of an information system window change calculation apparatus according to the 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.
With the foregoing drawings in mind, certain embodiments of the disclosure have been shown and described in more detail below. These drawings and written description are not intended to limit the scope of the disclosed concepts in any way, but rather to illustrate the concepts of the disclosure to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The terms referred to in this application are explained first:
change of information system: the method is characterized in that necessary local updating, modification and perfection are carried out on an original information system in order to enable the information system to adapt to the change of user environment, or meet the newly proposed requirements of users, or eliminate faults and errors generated in the operation of the information system.
Risk value: and quantitatively evaluating the risk occurrence probability and the value of the influence degree of the generated consequence. The greater the risk value, the greater the impact of the resulting outcome.
The following drawings: the figures referred to in this application refer specifically to the objects studied in the mathematical graph theory. It is a graph made up of a number of given points and lines connecting the two points, usually used to describe some specific relationship between something: points represent objects, and a line connecting two points represents a relationship that the respective two objects have.
Directed graph: a graph composed entirely of directional edges is a directed graph.
Directed acyclic graph: a loop-free directed graph, in short, is a graph that proceeds from any node in the direction of an edge and cannot return to the starting point regardless of which path is selected.
Degree, out degree and in degree: in the directed graph, the number of edges with a node as a tail is called the in-degree of the node, the data of the edges with the node as a head is called the out-degree of the node, and the sum of the in-degree and the out-degree of one node is called the degree of the node.
Tree: the tree in the application refers to a data structure in computer science. It is a set with hierarchical relationship composed of n (n > ═ 0) finite nodes. It is called a "tree" because it looks like an upside-down tree with its root facing up and its leaves facing down.
Depth traversal: depth traversal (DFS), also known as Depth-First Search, refers to the process of deepening every possible branch path until it can not be deepened any more, and each node can only be accessed once.
With the deep integration of emerging information technologies such as mobile internet and the like and traditional financial services, the number of information systems of banks is more and more, and the scale of the information systems is larger and larger. Consequently, the information system is scaled up and down each time it is upgraded, and the risk of alteration is increased. Therefore, the risk of change generated when the system is upgraded is calculated to grasp the situation when the system is upgraded.
When the information system is upgraded and changed, each change in the change window in the information system is performed in sequence, for example, the change window includes 10 changes, and the 10 changes are performed by 1 change, then 2 changes, and then 7 changes. When determining a risk value caused by upgrading and changing an information system by a change window, namely the change risk value of the change window, one method in the prior art is to calculate the risk value of a single change of the change window to obtain the change risk value of the change window. However, since a plurality of changes in the change window of the information system have a complicated association relationship when the change is updated, the method of calculating the risk value only for a single change in the change window cannot reflect the association relationship, and thus cannot accurately and comprehensively reflect the overall risk level when the information system is updated and changed.
Another method in the prior art is to add each of the plurality of changes calculated into 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 incidence relation described above, so that the method cannot accurately and comprehensively reflect the overall risk degree of the information system during upgrading and changing,
Based on the above, the application provides a method and a device for acquiring the change risk of the window of the information system, which are used for acquiring the risk value when the change window to be evaluated is changed by establishing the incidence relation among a plurality of changes in the change window to be evaluated. Therefore, the obtained risk value when the window of the information system upgrading is changed can reflect the whole risk degree of the window change when the information system is upgraded and changed.
The information system window change risk obtaining method 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 obtaining method is executed, the computer device establishes a directed acyclic graph related to 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, an embodiment of the present application provides a method for acquiring a window change risk 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 comprises 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 to the window of changes to be evaluated, such as a start change.
As described above, the risk value of a single change in the change window can be calculated by a well-established method, and is not described herein again.
The change window to be evaluated refers to a change window to be evaluated in the period to be evaluated. At present, a bank adopts a mode of changing a window to implement upgrading and changing of the whole information system, namely, research and development personnel can only optimize, upgrade and put into production the information system in the specified changing window, and the information system is not allowed to be changed at other times. The period to be evaluated refers to a time period during which modification of the information system is allowed. 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, one or more associated changes which are changed after the first change of the change window to be evaluated are obtained, and change risk values of the associated changes are obtained.
The association change refers to a change that is performed sequentially after the first change. For example, there are two associated changes after the first change is changed, there are three associated changes after the two associated changes, and the change is terminated after the three associated changes. At this time, there are five associated changes of the first change.
After determining one or more associated changes of the first change, a change risk value for each associated change is obtained for 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out node in the two nodes.
The out-degree node refers to a node extended from an edge for connecting two nodes, that is, a node corresponding to a change performed earlier in two changes corresponding to the two nodes is the out-degree node. The change risk value of the change made earlier determines the length of the connection line between two nodes, and the connection line between the two nodes is longer as the change risk value of the change made earlier is larger.
Optionally, before establishing the directed acyclic graph of the first change and the associated change, an expression of the first change and an expression of the associated change also need to be created. Wherein the expression includes a sub-expression of the change, a sub-expression of the change risk value of the change, a sub-expression of the preorder change of the change, and a sub-expression of the postorder change of the change.
Specifically, assume that a change is denoted as CNAnd the change risk value of the change is denoted as RNThe preceding change of the change is denoted as CFRONT_NThe subsequent alteration of the alteration is denoted as CBACK_N. Then, each change may be represented as { C }N，RN，CFRONT_N，CBACK_N}. Wherein, when changing CNWhen there is no preamble change, record CFRONT_NWhen C is changed to NULLNWhen there is no subsequent change, record CBACK_NNULL. Thus, all changes to a window can be represented as shown in FIG. 2, where the arrows in FIG. 2 represent the direction of dependence. As shown in FIG. 2, there are multiple unassociated windows in a window, e.g., { C }1，R1，NULL，NULL}、{CI，RI，NULL，CKAnd { C }0，R0，NULL，CNAre three mutually unassociated changes. And { C in FIG. 2I，RI，NULL，CK}、{CK，RK，CI，C2}、{C2，R2，CK，CLAnd { C }L，RL，C2NULL is a change that is correlated with each other.
And S140, 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.
The first change { C is shown in FIG. 3M，RM，NULL，(CA，CB，CC，CD… as the start node has a degree of departure as shown in the figure, the degree of departure of the first change is equal to 5, and the first change risk value is equal to 5RM。
The information system window change risk obtaining method provided by this embodiment establishes a directed acyclic graph between associated changes in a change window to be evaluated, and determines a change risk value of the change window to be evaluated 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 change window to be evaluated as a change risk value of the change window to be evaluated corresponding to the first change. And the computing equipment determines the maximum change risk value as the final desired change risk value from all the calculated change risk values of the change window to be evaluated. Therefore, compared with a calculation method for simply calculating a single changed risk value and simply adding a plurality of changed risk values in the prior art, the method provided by the embodiment can screen the changed risk value which can most reflect the change association relationship from the change window to be evaluated, so that the obtained changed risk value of the change window to be evaluated can more accurately and comprehensively reflect the risk and the maximum risk of the change window to be evaluated when the change window to be evaluated is changed.
Referring to fig. 4, a second embodiment provides a method for calculating a risk of window change in 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 change window to be evaluated, and acquiring change risk values of the associated changes.
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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out node in the two nodes.
The related description of step S430 may refer to the related description of step S130, and is not repeated here.
S440, establishing a directed tree of the directed acyclic graph.
Before generating the directed tree, all changes in the change window to be evaluated need to be acquired, and the directed acyclic graph is updated according to all the changes, that is, the nodes and the connections between the nodes of the changes that are not established before are added to the directed acyclic graph established in step S430.
When building a directed tree of the directed acyclic graph, a virtual starting point C may be created in the directed acyclic graph0And virtual end point CN+1. Wherein the virtual starting point C0Refers to a node whose preamble node is NULL, the dummy nodeBeam spot CN+1Refers to a node whose subsequent node is NULL. The virtual starting point C0Are connected with the M nodes without the front order change at equal intervals and are connected with the virtual end point CN+1And the M nodes without the subsequent change window. Wherein the M nodes without the change of the front order comprise the starting node. Links in the directed acyclic graph from the virtual start point to the virtual end point correspond to branches in the directed tree from the start vertex to the end point.
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 C0Is zero, representing the virtual starting point C0The distance from the M nodes is equal.
After a directed acyclic graph with a virtual starting point and a virtual ending point is obtained, the directed five-ring graph is deeply traversed, and a virtual starting point C is created0And the number of the virtual end points is M.
S450, obtaining 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 the step S140 of determining the change risk value of the change window to be evaluated, the step is to determine the change risk value from the directed tree including all changes of the change window to be evaluated. If the length of the connecting line between the nodes in the acyclic graph is the same, the length of the connecting line between the nodes in the directed tree also depends on the change risk value of the out-of-degree node in the two nodes.
Thus, the longer a branch is to the tree, the greater the sum of the change risk values corresponding to that branch is justified. For example, as shown in FIG. 5, when the node without the preceding change is { C }I，RI，NULL，CKHas the longest branch with an alteration risk value comprising RI、RK、R2And RLIf the first change risk value of the change window to be evaluated is RI+RK+R2+RL。
In this case, the unordered 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 this 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 a calculation method for simply calculating a single changed risk value and simply adding a plurality of changed risk values in the prior art, the method provided by the embodiment can screen the changed risk value which can most reflect the change association relationship from the change window to be evaluated, so that the obtained changed risk value of the change window to be evaluated can more accurately and comprehensively reflect the risk and the maximum risk of the change window to be evaluated when the change window to be evaluated is changed.
Referring to fig. 6, a third embodiment of the present application further provides an information system window change risk obtaining method, including:
s610, acquiring a first change of a change window to be evaluated and an initial change risk value of the first change.
S620, one or more associated changes which are changed after the first change of the change window to be evaluated are obtained, and change risk values of the associated changes are obtained.
S630, 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out node in the two nodes.
For the related description of step S610 to step S630, reference may be made to the related description of step S110 to step S130 in the first embodiment, and details are not repeated here.
And S640, establishing a directed tree of the directed acyclic graph.
When building a directed tree of the directed acyclic graph, a virtual starting point C may be created in the directed acyclic graph0And virtual end point CN+1。
Wherein the virtual starting point C0Refers to a node whose preamble node is NULL, the virtual end point C N+1Refers to a node whose subsequent node is NULL. The virtual starting point C0Are connected with the M nodes without the front order change at equal intervals and are connected with the virtual end point CN+1And the M nodes without the subsequent change window. Wherein the M nodes without the change of the front order comprise 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 graph is established according to all the changes. 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 C0Is zero, representing the virtual starting point C0The distance from the M nodes is equal.
After a directed acyclic graph with a virtual starting point and a virtual ending point is obtained, a virtual starting point C is created0And the number of the virtual end points is M.
S650, obtaining the degree of departure 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 degree of departure of the initial node and the initial change risk value.
For the related description of step S650, reference may be made to the related description of step S140, and details are not repeated here.
And S660, acquiring 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 relevant description about step S660 may refer to the relevant description about step S450, and the second alteration risk value in this step may be understood as the first alteration risk value in step S450.
And 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 a value obtained by multiplying the initial change risk value of the first change by the out-degree of the first change, and the second change risk value is a value obtained by adding all change risk values of the longest branch of the directed tree established by 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, the 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 information system window change risk obtaining method provided in this embodiment adds all changes in the change window to be evaluated to the directed acyclic graph of the embodiment, and establishes a directed tree corresponding to the directed acyclic graph of all the changes. And after the longest branch in the directed tree is obtained, the change risk values of all changes contained in the longest branch are superposed to obtain a second change risk value of the change window to be evaluated. And 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 as 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 improved and added on the basis of the first embodiment, so as to ensure that the finally acquired change risk value of the change window to be evaluated is the maximum. Therefore, the present embodiment further makes the change risk value of the change window to be evaluated more accurate 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:
the obtaining module 11 is 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 change window to be evaluated, and obtain a change risk value of each associated change;
a graph building module 12, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated change, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of a degree node in the two nodes;
and the processing module 13 is configured to obtain the degree of departure of the start 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 start node and the initial change risk value.
The graph building 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 change window to be evaluated 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 modification window to be evaluated to the second change risk value of the modification window to be evaluated when the second change risk value of the modification window to be evaluated is greater than the first change risk value of the modification 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 expression of the first change and the expression of the associated change, where the expression includes a sub-expression of change, a sub-expression of change risk value of change, a sub-expression of change preamble change, and a sub-expression of change subsequent change;
the graph building module 12 is further configured to build a node in the directed acyclic graph according to the change and the sub-expression of the associated change, the sub-expression of the change in the preamble of the change, and the sub-expression of the change in the subsequent change;
the mapping module 12 is further configured to establish a connection line between the nodes according to the change and the expression of the change risk value of the change.
The map creating module 12 is further configured to create a virtual start point and a virtual end point in the directed acyclic graph; connecting the virtual starting point with M nodes without front order change in the directed acyclic graph at equal distance, and connecting the virtual ending point with M nodes without back order change windows, wherein M is an integer greater than zero; wherein, the top point of the directed tree corresponds to the virtual starting point, and the end point of the directed tree corresponds to the virtual end point; links in the directed acyclic graph from the virtual start point to the virtual end point correspond to branches in the directed tree from the start vertex to the end point. 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 calculation device 30, including:
an obtaining module 21, 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 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;
a graph building module 22, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated change, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of a degree node in the two nodes;
the graph building 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 the longest branch in the directed tree, and determine 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.
Referring to fig. 9, a sixth embodiment of the present application further provides a computer device 30, which includes a memory 31, a processor 32 and a transceiver 33, where the memory 31 is used to store instructions, the transceiver 33 is used to communicate with other devices, and the processor 32 is used 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 specific implementation manners and technical effects are similar and are not described herein again.
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 used to store instructions, the transceiver 43 is used to communicate with other devices, and the processor 42 is used 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.
The present application also provides a computer-readable storage medium, in which computer-executable instructions are stored, and when the instructions are executed, the computer-executable instructions are executed by a processor to implement the information system window change risk obtaining method provided in any one of the above embodiments. The present application also provides another computer-readable storage medium, in which computer-executable instructions are stored, and when the instructions are executed, the instructions cause a computer to execute the information system window change risk calculation method provided in any one of the above embodiments.
The present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for acquiring a window change risk of an information system according to the first embodiment and the third embodiment is implemented, and the specific implementation manner and the technical effect are similar, and are not described herein again. The present application further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for calculating risk of changing a window of an information system according to the second embodiment is implemented, and the specific implementation manner and the technical effect are similar, and are not described herein again.
The computer-readable storage medium may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read Only Memory (EPROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a magnetic Random Access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical Disc, or a Compact Disc Read-Only Memory (CD-ROM). And may be various electronic devices such as mobile phones, computers, tablet devices, personal digital assistants, etc., including 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 an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are included in the scope of the present application.

Claims (16)

1. An information system window change risk acquisition 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 change window to be evaluated, 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out 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.
2. The method of claim 1, wherein after establishing the directed acyclic graph of the first changes and the associated changes of the window of changes to be evaluated, further comprising:
establishing a directed tree of the directed acyclic graph;
Obtaining 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;
and 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.
3. The method of claim 2, wherein the establishing a directed acyclic graph of the first changes and the associated changes for the window of changes to be evaluated comprises:
creating an expression of the first change and an expression of the associated change, the expressions including a sub-expression of the change, a sub-expression of the change risk value of the change, a sub-expression of the preceding change of the change, and a sub-expression of the subsequent change of the change;
establishing nodes in the directed acyclic graph according to the change and the sub-expression of the associated change, the sub-expression of the preorder change of the change and the sub-expression of the postorder change of the change;
and establishing a connecting line between the nodes according to the change and the expression of the changed risk value of the change.
4. The method of claim 3, wherein the building the directed tree of the directed acyclic graph comprises:
creating a virtual starting point and a virtual ending point in the directed acyclic graph;
connecting the virtual starting point with M nodes without front order change in the directed acyclic graph at equal distance, and connecting the virtual ending point with M nodes without back order change windows, wherein M is an integer greater than zero;
the top point of the directed tree corresponds to the virtual starting point, and the end point of the directed tree corresponds to the virtual end point;
and a plurality of links starting from the virtual starting point to the virtual ending point in the directed acyclic graph correspond to a plurality of branches starting from the starting vertex to the ending point in the directed tree.
5. The method of claim 4, wherein the risk value of change for the virtual starting point is zero.
6. An information system window change risk acquisition 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 change window to be evaluated, 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 an initial node, and the length of a connecting line between two interconnected nodes is equal to a change risk value of a degree-out node in the two nodes;
establishing a directed tree of the directed acyclic graph;
and obtaining 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.
7. An information system window change risk acquisition apparatus, comprising:
the system comprises an acquisition module, a judgment module and a processing module, wherein the acquisition module is used for acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
the obtaining module 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;
a graph building module, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated changes, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of an out-degree node of 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.
8. The apparatus of claim 7, wherein the graph building module is further configured to build a directed tree of the directed acyclic graph;
the obtaining module 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 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.
9. The apparatus of claim 8, further comprising:
a creation module configured to create an expression of the first change and an expression of the associated change, where the expressions include a sub-expression of a change, a sub-expression of a change risk value of a change, a sub-expression of a preorder change of a change, and a sub-expression of a postorder change of a change;
The graph building module is further configured to build a node in the directed acyclic graph according to the change and the sub-expression of the associated change, the sub-expression of the preorder change of the change, and the sub-expression of the postorder change of the change;
and the mapping module is also used for establishing a connecting line between the nodes according to the change and the expression of the changed risk value of the change.
10. An information system window change risk calculation apparatus, comprising:
the system comprises an acquisition module, a judgment module and a processing module, wherein the acquisition module is used for acquiring a first change of a change window to be evaluated and an initial change risk value of the first change;
the obtaining module 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;
a graph building module, configured to build a first change of the change window to be evaluated and a directed acyclic graph of the associated changes, where one node of the directed acyclic graph represents one change, a node corresponding to the first change is an initial node, and a length of a connection line between two interconnected nodes is equal to a change risk value of an out-degree node of the two nodes;
The mapping module is further used for establishing a directed tree of the directed acyclic graph;
and 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.
11. A computer device comprising a memory for storing instructions, a processor and a transceiver for communicating with other devices, the processor being configured to execute the instructions stored in the memory to cause the computer device to perform the information system window change risk acquisition method of any one of claims 1-5.
12. A computer device comprising a memory for storing instructions, a processor for communicating with other devices, and a transceiver for executing the instructions stored in the memory to cause the computer device to perform the information system window change risk calculation method of claim 6.
13. 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 according to any one of claims 1 to 5.
14. A computer-readable storage medium having computer-executable instructions stored therein, which when executed, cause a computer to perform the information system window change risk calculation method of claim 6.
15. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the information system window change risk acquisition method according to any of claims 1-5.
16. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, carries out the information system window change risk calculation method according to claim 6.
CN202110696955.5A 2021-06-23 2021-06-23 Method and device for acquiring window change risk of information system Active CN113313419B (en)

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 true CN113313419A (en) 2021-08-27
CN113313419B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023207689A1 (en) * 2022-04-27 2023-11-02 浙江大学 Change risk assessment method and apparatus, and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
唐爱国;王如龙;: "基于贝叶斯网络的软件项目风险评估模型", 计算机工程, no. 22, pages 97 - 99 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023207689A1 (en) * 2022-04-27 2023-11-02 浙江大学 Change risk assessment method and apparatus, and storage medium

Also Published As

Publication number Publication date
CN113313419B (en) 2023-10-10

Similar Documents

Publication Publication Date Title
KR101999409B1 (en) Formatting data by example
KR20170052344A (en) Method and apparatus for searching new material
CN112541310B (en) Logic comprehensive control method and device
CN110798467B (en) Target object identification method and device, computer equipment and storage medium
EP3806023A1 (en) Search device, search method, computer-readable medium, search system, and arbitrage system
CN111596945B (en) Differential upgrading method for dynamic multi-partition firmware of embedded system
CN108959359A (en) A kind of uniform resource locator semanteme De-weight method, device, equipment and medium
CN113313419A (en) Information system window change risk obtaining method and device
CN114863385A (en) Road curved surface information generation method, device, equipment and computer readable medium
CN111338955B (en) Software graphical interface testing method and device, software development system and server
CN111367528B (en) Compiling method and device of software development kit, software development system and server
CN110011964B (en) Webpage environment detection method and device
CN114580170B (en) Data processing method and device for multi-task parallel construction
CN114564523B (en) Big data vulnerability analysis method and cloud AI system for intelligent virtual scene
CN113761746B (en) Algebraic ring identification method and device
CN115203747A (en) Data account creation method and device
CN114494506A (en) Method and system for judging loop in directed acyclic graph
CN110544113B (en) Method and device for determining input of fuel charge in transaction based on intelligent contract
CN113448870A (en) Intelligent contract reentry defect detection method based on dynamic execution information analysis
CN113343366B (en) Method for determining main section parameters of vehicle body and related equipment
CN116383088B (en) Source code form verification method, device, equipment and storage medium
CN112446109B (en) Calibration method and device for fuel injection pressure of engine
CN111340215B (en) Network model reasoning acceleration method and device, storage medium and intelligent equipment
CN114647578B (en) System testing method, device, equipment and storage medium
CN116523052B (en) Rapid reasoning method, device and equipment

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