CN112950078B - Method and system for generating trial risk emergency disposal scheme - Google Patents

Method and system for generating trial risk emergency disposal scheme Download PDF

Info

Publication number
CN112950078B
CN112950078B CN202110356095.0A CN202110356095A CN112950078B CN 112950078 B CN112950078 B CN 112950078B CN 202110356095 A CN202110356095 A CN 202110356095A CN 112950078 B CN112950078 B CN 112950078B
Authority
CN
China
Prior art keywords
risk
trial
state
disposal
state transition
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
Application number
CN202110356095.0A
Other languages
Chinese (zh)
Other versions
CN112950078A (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.)
Shandong University
Shandong Computer Science Center National Super Computing Center in Jinan
Original Assignee
Shandong University
Shandong Computer Science Center National Super Computing Center in Jinan
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 Shandong University, Shandong Computer Science Center National Super Computing Center in Jinan filed Critical Shandong University
Priority to CN202110356095.0A priority Critical patent/CN112950078B/en
Publication of CN112950078A publication Critical patent/CN112950078A/en
Application granted granted Critical
Publication of CN112950078B publication Critical patent/CN112950078B/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/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
    • 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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • 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
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services; Handling legal documents

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Technology Law (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a generation method and a generation system of an adjudication risk emergency disposal scheme. Acquiring court personnel and resource information, and constructing an adjudication risk disposal responsibility map; receiving and analyzing trial risk alarm information, obtaining trial risk characteristics, inquiring all possible states of risks from a risk knowledge base, and constructing a risk state transition diagram; updating a trial risk handling responsibility map, calculating an optimal implementation strategy of all state transfers in a risk state transfer graph under the current personnel and resource states, and taking the handling cost of the optimal implementation strategy as the weight of a corresponding edge in the risk state transfer graph; based on the weight of the corresponding edge in the risk state transition diagram, taking the trial risk state when the alarm is received as an initial state, calculating the shortest path from the initial state to a risk solution state in the risk state transition diagram, and further generating an optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.

Description

Method and system for generating trial risk emergency disposal scheme
Technical Field
The invention belongs to the field of data processing, and particularly relates to a generation method and a generation system of an adjudication risk emergency disposal scheme.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
The risk in the judging process is treated legally, timely and properly through an efficient risk emergency disposal scheme, the occurrence of emergency events is prevented, and the risk hazard is controlled, reduced and eliminated, so that the method is very important for all levels of courts. At present, most of courts at all levels realize high informatization of trial services. However, in terms of emergency disposal of trial risks, the existing service information system can only provide a step-by-step reporting function according to pre-divided responsibility authorities, and after receiving a risk report, a related responsible person considers to formulate a disposal scheme according to own experience and a related word plan. However, the inventors have found that with increasing complexity and diversification of trial risks, the drawbacks of the human decision-making approach are increasingly highlighted: (1) the required selection and judgment time is longer, and the timeliness of the scheme is reduced; (2) there may be instances of overlooking and not being considered thoroughly; (3) it is difficult to dynamically and globally generate an emergency treatment plan according to a change in risk state and a change in resources such as manpower and materials.
Disclosure of Invention
In order to solve the technical problems in the background art, the invention provides a trial risk emergency disposal scheme generation method and a trial risk emergency disposal scheme generation system, which can automatically generate and adjust an optimal emergency disposal scheme according to risk characteristics, state changes of the risk characteristics, current manpower and resource states after receiving trial risk information, so as to overcome the defects of the existing trial risk disposal mode depending on artificial decision in timeliness, dynamics and global aspects, improve the timeliness of air trap disposal, and control, reduce and eliminate risk hazards to the greatest extent.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention provides a generation method of a trial risk emergency disposal scheme.
A generation method of a trial risk emergency disposal scheme comprises the following steps:
acquiring personnel and resource information of a court, and constructing an audition risk disposal responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes;
receiving and analyzing trial risk alarm information, obtaining trial risk characteristics, inquiring all possible states of risks from a risk knowledge base, and constructing a risk state transition diagram;
updating a trial risk handling responsibility map, calculating an optimal implementation strategy of all state transfer in a risk state transfer graph under the current personnel and resource states based on the map, and taking the handling cost of the optimal implementation strategy as the weight of a corresponding edge in the risk state transfer graph;
based on the weight of the corresponding edge in the risk state transition diagram, taking the trial risk state when the alarm is received as an initial state, calculating the shortest path from the initial state to a risk solution state in the risk state transition diagram, and further generating an optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
A second aspect of the present invention provides a system for generating a trial risk emergency disposal plan.
A system for generating a trial risk emergency disposition scenario, comprising:
the judging risk handling responsibility map construction module is used for acquiring the information of court personnel and resources and constructing a judging risk handling responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes;
the risk state transition diagram building module is used for receiving and analyzing the trial risk alarm information, obtaining the trial risk characteristics, inquiring all possible states of risks from the risk knowledge base and building a risk state transition diagram;
the risk state transition graph edge weight calculation module is used for updating the judge risk handling responsibility graph, calculating the optimal implementation strategies of all state transitions in the risk state transition graph under the current personnel and resource states based on the graph, and taking the handling cost of the optimal implementation strategies as the weight of the corresponding edge in the risk state transition graph;
the risk disposal optimal scheme generation module is used for calculating the shortest path from the initial state to the risk solution state in the risk state transition diagram by taking the trial risk state when the alarm is received as the initial state based on the weight of the corresponding edge in the risk state transition diagram, and further generating the optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
A third aspect of the invention provides a computer-readable storage medium.
A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, carries out the steps in the trial risk emergency disposal plan generating method as described above.
A fourth aspect of the invention provides a computer apparatus.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps in the trial risk emergency disposal scheme generating method as described above when executing the program.
Compared with the prior art, the invention has the beneficial effects that:
according to the invention, after the judgment risk alarm information is received, an optimal emergency disposal scheme can be automatically generated and adjusted according to the risk characteristics and the state change thereof as well as the current human and resource states, so that the defects of the conventional judgment risk disposal mode depending on artificial decision in timeliness, dynamics and globality are overcome, the timeliness of air trap disposal is improved, risk hazards are controlled, reduced and eliminated to the greatest extent, and positive effects on maintaining judicial authority and public confidence are achieved.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
Fig. 1 is a flowchart of a trial risk emergency disposal scheme generation according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a "risk-state" mapping table according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a risk state transition table according to an embodiment of the present invention;
FIG. 4 is an example of a trial risk disposition responsibility map provided by an embodiment of the present invention;
FIG. 5 is a schematic flow chart of a risk state transition diagram according to an embodiment of the present invention;
FIG. 6 is an example of a state transition diagram provided by embodiments of the present invention;
fig. 7 is a schematic diagram of a calculation flow of a state transition optimal implementation policy according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a trial risk emergency disposal scheme generation system according to an embodiment of the present invention.
Detailed Description
The invention is further described with reference to the following figures and examples.
It is to be understood that the following detailed description is exemplary and is intended to provide further explanation of the invention as claimed. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments according to the invention. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
Example one
As shown in fig. 1, the present embodiment provides a method for generating a trial risk emergency disposal plan, which specifically includes the following steps:
s101: acquiring personnel and resource information of a court, and constructing an audition risk disposal responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes.
And directed edges are formed between the nodes of the trial risk handling responsibility map, and represent responsibility relations among personnel and between the personnel and resources. The weights of the edges of the trial risk handling responsibility map represent the costs required for a person or resource to be mobilized by its responsible person.
Specifically, an audition risk handling responsibility map is constructed according to the authority relationship of risk handling personnel and resources established by the court. Let G ═ { H, R, E } represent a trial risk disposition responsibility map, where: h is a member node set, and each node HiThe epsilon H can represent a single person or the totality of a class of persons, and the persons can comprise workers at all levels in a court, and the like; r is a resource node set, and each node RiThe epsilon R can represent a single resource or the totality of a class of resources, and the resources can comprise equipment, materials, vehicles, information networks, guarantee and life guarantee, medical rescue resources and the like; e is a set of directed edges, each edge EijE describes the responsibility relationship between node i and node j. If person hiThe upper level of responsibility person of (1) is hjThen there is a directed edge h in Ej→hiThe weight of an edge is hjMobilize hiThe cost of the required expenditure; if resource riThe person responsible for management of (1) is a person hjThen there is an edge h in Ej→riThe weight of an edge is hjTransfer riThe cost of the required expenditure. The movement cost can be calculated according to specific requirements based on factors such as convenience, timeliness and distance.
In this embodiment: the structure of the trial risk disposition responsibility map G and the weights of the edges are dynamically changing and can be dynamically updated based on data provided by the court business information system.
For example, person hiIf the user leaves vacation or leaves, the corresponding node in G needs to be deleted. As another example, resource riIs the responsibility h ofj，hjUpper level responsibility person of hk(ii) a According to the responsibility relationship, hkAlso has mobilizing resources riDue to h, butjIs riThe direct person in charge of, for riIs more familiar with the situation, thus starting from hjTransfer riIs generally less than hkDirect movement of riThe cost of (d); and if hjIn the business trip state, then hkDirect movement of riThe cost of (a) is less than that of hjTransfer riThe cost of (a). Fig. 4 shows an example of a trial risk handling responsibility graph, where 401 is a personnel node, 402 resource nodes.
S102: and receiving and analyzing trial risk alarm information, obtaining trial risk characteristics, inquiring all possible states of risks from a risk knowledge base, and constructing a risk state transition diagram.
In this embodiment, the trial risk warning information includes category, stage, cause, grade, hazard index, and influence surface feature fields of the trial risk.
Specifically, as shown in fig. 5, the specific process of step S102 is:
s1021: and analyzing the risk alarm information, and extracting fields ran such as a risk category cat, an occurrence stage pha, a risk cause res, a current level lev, a current hazard index idx, a current influence surface and the like.
S1022: searching matched predefined risk rsk in trial risk knowledge base according to < cat, pha, res > triple, namely rsk meets rskcatCat and rskphaPha and rskres＝res。
S1023: obtaining a list of applicable states for rsk in a "risk-state" mapping table in a trial risk knowledge base
Figure GDA0003361450790000061
Wherein
Figure GDA0003361450790000062
For the status of risk rsk, sfIs a risky solution state.
S1024: according to < lev, idx, ran > triple at SrskInitial state of intermediate localization risk
Figure GDA0003361450790000063
Namely risk rating, hazard index and impact area as lev, idx and ran, respectively.
S1025: to be provided with
Figure GDA0003361450790000064
A state transition diagram is constructed for the starting point. First, look up all previous states in the state transition table as
Figure GDA0003361450790000065
Table entry of (2), post-acquisition state set
Figure GDA0003361450790000066
Then, respectively in
Figure GDA0003361450790000067
The previous state continues to search the state transition table for the subsequent state. Repeating the process until the process is completed
Figure GDA0003361450790000068
All paths from which arrive sf. From
Figure GDA0003361450790000069
To sfAll paths and state nodes on the paths form a state transition graph.
Fig. 6 is a state transition diagram constructed according to the method of this embodiment, where 601 is an initial state node of a risk, 602 is an intermediate state node, and 603 is a solution state of the risk.
In a specific implementation, a trial risk knowledge base is constructed based on historical trial risk handling experience of the court, and the knowledge base is composed of risk definitions, risk state definitions, a 'risk-state' mapping table and a state transition table.
The risk definition includes, but is not limited to, field information such as "risk name", "risk category", "occurrence stage", "risk cause", etc. Wherein, the "risk category" includes but is not limited to "endanger personnel safety", "endanger institution safety", "endanger social safety", "public opinion risk", and the like; the "occurrence phase" includes but is not limited to a case setting phase, a case division phase, a trial phase, an execution phase and a case settlement phase; "risk causes" include, but are not limited to, party causes, attorney/agent causes, public prosecution causes, third party causes, court personnel causes, case causes, process/program causes, trial quality causes, and the like.
The risk status definition includes, but is not limited to, field information such as "status ID", "risk level", "hazard index", "impact area", and the like. Wherein, the state ID is an index value of the risk state; the risk level is set according to factors such as the definition, severity and urgency of the risk. For example, three levels of risks, namely low, medium and high, can be set, the risk of small hidden danger, small harm and easy handling is set as low level, and the risk of serious, difficult handling, personnel safety threat and institution safety is set as medium level; setting the risks of easily causing great public sentiment, harming social security and difficult processing as high-grade; further refinement can be made by setting hazard indices of 1-5 for each level of risk. "influencing surfaces" includes, but is not limited to, principals, lawyers/agents, court personnel, present court, upper and lower court, other administrative authorities and their personnel, the public community, and the like. Each risk has a solution state sfAs the final state of risk handling.
The "risk-state" mapping table is organized in the form described in fig. 2. Wherein the index column (201) of the table corresponds to the "risk name" in the risk definition; the "applicable states list" column (202) lists the IDs of all applicable states of risk.
The state transition table is organized in the form described in fig. 3, describing possible transitions between states and the handling policies that can be taken to effect the transitions. The first column (301) of the table is the ID of the state before the transition, the second column (302) is the ID of the state after the transition, and the third column (303) lists all policy sets P that can be taken to implement the state transition. Each policy pie.P includes the required mobilization to complete the policySet of people HiResource set RiAnd policy enforcement rule di。
S103: updating a trial risk handling responsibility map, calculating the optimal implementation strategies of all state transfer in the risk state transfer graph under the current personnel and resource states based on the map, and taking the handling cost of the optimal implementation strategies as the weight of the corresponding edge in the risk state transfer graph.
S104: based on the weight of the corresponding edge in the risk state transition diagram, taking the trial risk state when the alarm is received as an initial state, calculating the shortest path from the initial state to a risk solution state in the risk state transition diagram, and further generating an optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
Fig. 7 is a schematic diagram of a calculation flow of the state transition optimal implementation policy provided in this embodiment. Wherein:
step S1041: firstly, updating a trial risk disposal responsibility map by using related information of personnel and resources in a court business information system, including updating of nodes, edges and edge weights.
Step S1042: for state transition si→sjStep S1042 searches the state transition table for all feasible policy lists P ═ { P } for the state transition1,p2,…,pm}。
Step S1043: for policy piBelongs to P, and step S1043 locates P on the judge risk disposition responsibility map GiPersonnel node required to be mobilized
Figure GDA0003361450790000081
And resource node
Figure GDA0003361450790000082
Step S1044: order node set
Figure GDA0003361450790000083
Step S1044 of extracting an overlay
Figure GDA0003361450790000084
Subgraph of G of all nodes in
Figure GDA0003361450790000085
Step S1045: finding
Figure GDA0003361450790000086
And (4) nodes with the medium degree of 0. If the node is unique, step S1045 uses the node as root to calculate by using "Zhuliu algorithm
Figure GDA0003361450790000087
Minimum treemap of
Figure GDA0003361450790000088
Wherein
Figure GDA0003361450790000089
Is the edge set of the minimum tree graph; to be provided with
Figure GDA00033614507900000810
The sum of the weights of all edges in the policy piAt a cost of disposal of
Figure GDA0003361450790000091
It should be noted here that the "ZhuLiu algorithm" described herein may be replaced by another algorithm for solving the minimum tree graph of the directed graph.
Step S1046: if it is not
Figure GDA0003361450790000092
The node with the medium degree of 0 is not unique, so that N is0＝{n1,n2,...,nzFor all the node sets with an incoming degree of 0, step 1046 searches for N in G0Nearest common ancestor node n of the middle nodescpStep 1047 transfers n from GcpTo N0Edge and point join on paths of all nodes in a cluster
Figure GDA0003361450790000093
Then n is addedcpComputing policy p for root node via step S1045iThe cost of the disposal of.
Step S1047: cost (p) per disposal for all policiesi) Sorting is carried out, and a strategy p with the minimum treatment cost is selectedoptAs means for effecting state transition si→sjThe optimal treatment strategy of (1).
Specifically, in the state transition diagram, s is transitioned in a statei→sjUsing Dijisra algorithm to calculate the optimal treatment cost of the optimal treatment strategy as the weight of the corresponding edge
Figure GDA0003361450790000094
To sfShortest path of
Figure GDA0003361450790000095
Wherein s iso1,so2,...sonIntermediate states on the shortest path. The optimal disposal Strategy set for realizing each pair of state transition on the shortest path forms the optimal scheme of the trial risk disposal, namely the optimal disposal scheme Strategyopt＝{pstart-o1,po1-o2,...,pon-fIn which p isi-jFor implementing state transitions on shortest paths s, respectivelyi→sjThe optimal treatment strategy of (1).
It is understood that the Dijistra algorithm of the present embodiment may be replaced by other algorithms for solving the shortest path between two points of the directed graph.
It should be noted here that the sequence between step S101 and step S102 may also be adjusted, and does not affect the result generated by the whole trial risk emergency disposal scheme.
Example two
The embodiment provides a system for generating a trial risk emergency disposal scheme, which comprises:
the judging risk handling responsibility map construction module is used for acquiring the information of court personnel and resources and constructing a judging risk handling responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes;
the risk state transition diagram building module is used for receiving and analyzing the trial risk alarm information, obtaining the trial risk characteristics, inquiring all possible states of risks from the risk knowledge base and building a risk state transition diagram;
the risk state transition graph edge weight calculation module is used for updating the judge risk handling responsibility graph, calculating the optimal implementation strategies of all state transitions in the risk state transition graph under the current personnel and resource states based on the graph, and taking the handling cost of the optimal implementation strategies as the weight of the corresponding edge in the risk state transition graph;
the risk disposal optimal scheme generation module is used for calculating the shortest path from the initial state to the risk solution state in the risk state transition diagram by taking the trial risk state when the alarm is received as the initial state based on the weight of the corresponding edge in the risk state transition diagram, and further generating the optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
It should be noted that, each module in the trial risk emergency disposal scheme generating system provided in this embodiment corresponds to a step in the trial risk emergency disposal scheme generating method in the first embodiment one to one, and the specific implementation process is the same, which is not described herein again.
EXAMPLE III
The present embodiment provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps in the trial risk emergency disposal plan generating method as described above.
Example four
As shown in fig. 8, the present embodiment provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the processor implements the steps in the trial risk emergency disposal scheme generating method as described above.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. 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.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. A generation method of a trial risk emergency disposal scheme is characterized by comprising the following steps:
acquiring personnel and resource information of a court, and constructing an audition risk disposal responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes;
receiving and analyzing trial risk alarm information, obtaining trial risk characteristics, inquiring all possible states of risks from a risk knowledge base, and constructing a risk state transition diagram;
updating a trial risk handling responsibility map, calculating an optimal implementation strategy of all state transfer in a risk state transfer graph under the current personnel and resource states based on the map, and taking the handling cost of the optimal implementation strategy as the weight of a corresponding edge in the risk state transfer graph; the weight of an edge of the trial risk disposition responsibility graph represents the cost required for a person or resource to be mobilized by its responsible person, each policy piE P includes the set of people H that need to be mobilized to complete the policyiResource set RiAnd policy enforcement rule di(ii) a The method comprises the following specific steps:
firstly, updating a trial risk disposal responsibility map by using related information of personnel and resources in a court business information system, wherein the updating comprises updating of nodes, edges and edge weights; for theState transition si→sjLooking up all feasible strategy lists P ═ P for the state transition in the state transition table1,p2,…,pm}; for policy piBelongs to P, and positions P on the judge risk handling responsibility map GiPersonnel node required to be mobilized
Figure FDA0003361450780000011
And resource node
Figure FDA0003361450780000012
Order node set
Figure FDA0003361450780000013
Extracting an overlay
Figure FDA0003361450780000014
Subgraph of G of all nodes in
Figure FDA0003361450780000015
Finding
Figure FDA0003361450780000016
A node with a medium degree of 0; if the node is unique, the node is taken as the root to calculate by using the Zhuliu algorithm
Figure FDA0003361450780000017
Minimum treemap of
Figure FDA0003361450780000018
Wherein
Figure FDA0003361450780000019
Is the edge set of the minimum tree graph; to be provided with
Figure FDA00033614507800000110
The sum of the weights of all edges in the policy piAt a cost of disposal of
Figure FDA00033614507800000111
If it is not
Figure FDA00033614507800000112
The node with the medium degree of 0 is not unique, so that N is0＝{n1,n2,…,nzSearching N in G for all the nodes with the degree of entry of 00Nearest common ancestor node n of the middle nodescpFrom n in GcpTo N0Edge and point join on paths of all nodes in a cluster
Figure FDA00033614507800000113
Then n is addedcpPassing a computational policy p for a root nodeiThe disposal cost of (c); cost (p) per disposal for all policiesi) Sorting is carried out, and a strategy p with the minimum treatment cost is selectedoptAs means for effecting state transition si→sjThe optimal treatment strategy of (1);
based on the weight of the corresponding edge in the risk state transition diagram, taking the trial risk state when the alarm is received as an initial state, calculating the shortest path from the initial state to a risk solution state in the risk state transition diagram, and further generating an optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
2. The trial risk emergency disposal scheme generating method according to claim 1, wherein directed edges are formed between nodes of the trial risk disposal responsibility map, and represent responsibility relationships among persons and between persons and resources.
3. The trial risk emergency disposal scheme generating method of claim 1, wherein the risk knowledge base is constructed based on historical trial risk disposal experience of the court.
4. The trial risk emergency disposal scheme generating method of claim 1, wherein the risk knowledge base is comprised of a risk definition, a risk state definition, a "risk-state" mapping table, and a state transition table.
5. The trial risk emergency disposal scheme generating method according to claim 1, wherein the trial risk warning information includes category, stage, cause, grade, hazard index and influence surface feature fields of the trial risk.
6. The trial risk emergency disposal scheme generating method according to claim 1, wherein the trial risk disposal responsibility map is updated by using related information of personnel and resources in a court business information system, including updating of node, edge and edge weights.
7. A system for generating a trial risk emergency disposal plan, comprising:
the judging risk handling responsibility map construction module is used for acquiring the information of court personnel and resources and constructing a judging risk handling responsibility map; the trial risk handling responsibility map comprises personnel nodes and resource nodes;
the risk state transition diagram building module is used for receiving and analyzing the trial risk alarm information, obtaining the trial risk characteristics, inquiring all possible states of risks from the risk knowledge base and building a risk state transition diagram;
the risk state transition graph edge weight calculation module is used for updating the judge risk handling responsibility graph, calculating the optimal implementation strategies of all state transitions in the risk state transition graph under the current personnel and resource states based on the graph, and taking the handling cost of the optimal implementation strategies as the weight of the corresponding edge in the risk state transition graph; the weight of an edge of the trial risk disposition responsibility graph represents the cost required for a person or resource to be mobilized by its responsible person, each policy piE P includes the set of people H that need to be mobilized to complete the policyiResource set RiAnd policy enforcement rule di(ii) a The method comprises the following specific steps:
firstly, the methodUpdating the trial risk disposal responsibility map by using related information of personnel and resources in the court business information system, wherein the updating comprises the updating of nodes, edges and edge weights; for state transition si→sjLooking up all feasible strategy lists P ═ P for the state transition in the state transition table1,p2,…,pm}; for policy piBelongs to P, and positions P on the judge risk handling responsibility map GiPersonnel node required to be mobilized
Figure FDA0003361450780000031
And resource node
Figure FDA0003361450780000032
Order node set
Figure FDA0003361450780000033
Extracting an overlay
Figure FDA0003361450780000034
Subgraph of G of all nodes in
Figure FDA0003361450780000035
Finding
Figure FDA0003361450780000036
A node with a medium degree of 0; if the node is unique, the node is taken as the root to calculate by using the Zhuliu algorithm
Figure FDA0003361450780000037
Minimum treemap of
Figure FDA0003361450780000038
Wherein
Figure FDA0003361450780000039
Is the edge set of the minimum tree graph; to be provided with
Figure FDA00033614507800000310
The sum of the weights of all edges in the policy piAt a cost of disposal of
Figure FDA00033614507800000311
If it is not
Figure FDA00033614507800000312
The node with the medium degree of 0 is not unique, so that N is0＝{n1,n2,…,nzSearching N in G for all the nodes with the degree of entry of 00Nearest common ancestor node n of the middle nodescpFrom n in GcpTo N0Edge and point join on paths of all nodes in a cluster
Figure FDA00033614507800000313
Then n is addedcpPassing a computational policy p for a root nodeiThe disposal cost of (c); cost (p) per disposal for all policiesi) Sorting is carried out, and a strategy p with the minimum treatment cost is selectedoptAs means for effecting state transition si→sjThe optimal treatment strategy of (1);
the risk disposal optimal scheme generation module is used for calculating the shortest path from the initial state to the risk solution state in the risk state transition diagram by taking the trial risk state when the alarm is received as the initial state based on the weight of the corresponding edge in the risk state transition diagram, and further generating the optimal scheme of risk disposal; wherein, the optimal scheme is composed of optimal treatment strategies required by all state transitions on the shortest path.
8. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the steps of the trial risk emergency disposal scheme generating method according to any one of claims 1 to 6.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps in the trial risk emergency treatment scenario generation method of any of claims 1-6 when executing the program.
CN202110356095.0A 2021-04-01 2021-04-01 Method and system for generating trial risk emergency disposal scheme Active CN112950078B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110356095.0A CN112950078B (en) 2021-04-01 2021-04-01 Method and system for generating trial risk emergency disposal scheme

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110356095.0A CN112950078B (en) 2021-04-01 2021-04-01 Method and system for generating trial risk emergency disposal scheme

Publications (2)

Publication Number Publication Date
CN112950078A CN112950078A (en) 2021-06-11
CN112950078B true CN112950078B (en) 2022-02-11

Family

ID=76232051

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110356095.0A Active CN112950078B (en) 2021-04-01 2021-04-01 Method and system for generating trial risk emergency disposal scheme

Country Status (1)

Country Link
CN (1) CN112950078B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111260223A (en) * 2020-01-17 2020-06-09 山东省计算中心（国家超级计算济南中心） Intelligent identification and early warning method, system, medium and equipment for trial and judgment risk
CN111523831A (en) * 2020-07-03 2020-08-11 支付宝(杭州)信息技术有限公司 Risk group identification method and device, storage medium and computer equipment
CN112232824A (en) * 2019-07-15 2021-01-15 招商证券股份有限公司 Abstract syntax tree-based risk result calculation method and equipment
CN112559762A (en) * 2020-12-09 2021-03-26 中电科新型智慧城市研究院有限公司 Public safety knowledge graph construction method and device and readable storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140129457A1 (en) * 2012-11-02 2014-05-08 Stroz Friedberg, LLC An interactive organizational decision-making and compliance facilitation portal
US20190259033A1 (en) * 2015-06-20 2019-08-22 Quantiply Corporation System and method for using a data genome to identify suspicious financial transactions
CN106940567B (en) * 2017-05-08 2020-02-21 合肥工业大学 Unmanned aerial vehicle formation optimal information interaction topology generation method and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112232824A (en) * 2019-07-15 2021-01-15 招商证券股份有限公司 Abstract syntax tree-based risk result calculation method and equipment
CN111260223A (en) * 2020-01-17 2020-06-09 山东省计算中心（国家超级计算济南中心） Intelligent identification and early warning method, system, medium and equipment for trial and judgment risk
CN111523831A (en) * 2020-07-03 2020-08-11 支付宝(杭州)信息技术有限公司 Risk group identification method and device, storage medium and computer equipment
CN112559762A (en) * 2020-12-09 2021-03-26 中电科新型智慧城市研究院有限公司 Public safety knowledge graph construction method and device and readable storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于隐式马尔科夫模型的法律命名实体识别模型的设计与应用;周晓辉;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20180615(第06期);I138-2271 *

Also Published As

Publication number Publication date
CN112950078A (en) 2021-06-11

Similar Documents

Publication Publication Date Title
Miehling et al. Optimal defense policies for partially observable spreading processes on Bayesian attack graphs
CN109361690B (en) Method and system for generating threat handling strategy in network
US9680649B2 (en) Policy-based key sharing
Natarajan Cyber secure man-in-the-middle attack intrusion detection using machine learning algorithms
US20130179937A1 (en) Security model analysis
CN110968865B (en) Android software risk assessment method based on probability ontology
CN112950078B (en) Method and system for generating trial risk emergency disposal scheme
Anikin Information security risk assessment and management method in computer networks
Argyropoulos et al. Risk-aware decision support with constrained goal models
Rezaee et al. A threat risk estimation model for computer network security
CN103841095A (en) Firewall rule updating method based on bigraph
Bidar et al. Discrete particle swarm optimization algorithm for dynamic constraint satisfaction with minimal perturbation
CN102238037A (en) Cooperative target strategy detailing method
Giang et al. Application of Bayesian network in risk assessment for website deployment scenarios
Zulueta et al. A dynamic multi-expert multi-criteria decision making model for risk analysis
Al Mamun et al. Cyber Security Awareness in Bangladesh: An Overview of Challenges and Strategies
Wang et al. New approach for information security evaluation and management of IT systems in educational institutions
Jaisankar et al. Intelligent intrusion detection system using fuzzy rough set based C4. 5 algorithm
Badr et al. Managing end-to-end security risks with fuzzy logic in service-oriented architectures
Arosio et al. Natural hazard risk of complex systems–the whole is more than the sum of its parts: II. A pilot study in Mexico City
CN113139878A (en) Method and system for identifying network security risk of power distribution automation master station
Ikuta et al. Integer programming approach for directed minimum spanning tree problem on temporal graphs
Aradea et al. Self-adaptive cybersecurity system
Heverin et al. Ontology modelling of industrial control system ethical hacking
CN110969349B (en) Network security risk probability determination method and device and electronic 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