CN109657111A - A kind of processing method and processing device of connected graph - Google Patents
A kind of processing method and processing device of connected graph Download PDFInfo
- Publication number
- CN109657111A CN109657111A CN201811564358.1A CN201811564358A CN109657111A CN 109657111 A CN109657111 A CN 109657111A CN 201811564358 A CN201811564358 A CN 201811564358A CN 109657111 A CN109657111 A CN 109657111A
- Authority
- CN
- China
- Prior art keywords
- authorization
- graph
- structure complexity
- relational graph
- relational
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Image Generation (AREA)
Abstract
The present invention provides a kind of processing method and processing device of connected graph, and the method includes obtaining the authorization number of path in predetermined connected graph；The corresponding structure complexity of the predetermined connected graph is determined based on the authorization number of path；The corresponding resource distribution of the predetermined connected graph is adjusted based on the structure complexity.Present invention is generally directed to authorize relational graph architectural difference bring complexity to be studied, provide a kind of metering method, calculate structure complexity index, user is facilitated to adjust authorization relational graph according to this index, reduce the complexity for authorizing relational graph, the intuitive of authorization relational graph is improved, visual effect is improved.
Description
Technical field
The present invention relates to data processing fields, and in particular to a kind of processing method and processing device of connected graph.
Background technique
Fort machine is a kind of O&M safety auditing system, and resource authorization and Account Administration are the core function of fort machine, energy
Enough to carry out fining empowerment management to user, account number, resource, solution personnel are numerous, and crossed privilege, assets are various, all kinds of permissions
Mixed and disorderly O&M problem.In the prior art, user, account number, the authority relation between resource can be established by delegated strategy, still
Since authorization rule item number is various, configuration is complicated inside the rules of competence, and authorization relationship can not clearly be shown by delegated strategy, still
There may be various permission hidden danger, such as: repetitive endowment, excessively authorize, Lame delegation etc. rights management issues.In order to preferably
It shows authorization relationship, introduces visualization technique, i.e., authorization relationship is shown by authorization relational graph, can bring and intuitively show effect
Fruit facilitates user to find permission loophole.
Prior art mainly measures authorization relationship complexity by counting the quantity of authorization relationship, and can lead to
Adjustment authorization relationship quantity is crossed to reduce complexity, improves visual effect.Although the intuitive of authorization relational graph can reduce hair
The difficulty of existing permission loophole, but if the enough structures of authorization relationship quantity shown are complicated enough, intuitive meeting straight line decline,
I.e. prior art major defect can be measured out due to scale bring complexity, can not measure out since structure bring is multiple
Miscellaneous degree, that is to say, that under the premise of identical quantity authorization relationship, complexity is also different.
Summary of the invention
The present invention provides a kind of processing method and processing devices of connected graph.Present invention is generally directed to authorize relationship graph structure poor
Different bring complexity is studied, and a kind of metering method is provided, and calculates structure complexity index, user is facilitated to be referred to according to this
Mark adjustment authorization relational graph, reduces the complexity for authorizing relational graph, improves the intuitive of authorization relational graph, raising can visual effect
Fruit.
In order to solve the above-mentioned technical problem, the embodiment of the invention provides the following technical solutions:
First aspect present invention provides a kind of processing method of connected graph, the method includes,
Obtain the authorization number of path in predetermined connected graph；
The corresponding structure complexity of the predetermined connected graph is determined based on the authorization number of path；
The corresponding resource distribution of the predetermined connected graph is adjusted based on the structure complexity.
Preferably, the method also includes,
Obtain the structure complexity of each connected graph in the authorization relational graph where the predetermined connected graph；
The structure complexity of the authorization relational graph is determined according to the structure complexity of all connected graphs.
Preferably, the structure complexity according to all connected graphs determines the authorization relational graph, structure is complicated
Degree, including,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
Preferably, further include after obtaining the structure complexity of the authorization relational graph,
The structure complexity of the authorization relational graph is carried out taking logarithm process, obtains the standard knots of the authorization relational graph
Structure complexity.
Preferably, further include before obtaining the structure complexity for authorizing each connected graph in relational graph,
The authorization relational graph is resolved into multiple connected graphs.
Second aspect of the present invention provides a kind of processing unit of connected graph, and described device includes,
It authorizes number of path to obtain module, is used to obtain the authorization number of path in predetermined connected graph；
First structure complexity obtains module, determines the corresponding knot of the predetermined connected graph based on the authorization number of path
Structure complexity；
Resource configuration module adjusts the corresponding resource distribution of the predetermined connected graph based on the structure complexity.
Preferably, described device further includes,
Second structure complexity obtains module, is used to obtain every in the authorization relational graph where the predetermined connected graph
The structure complexity of a connected graph；Determining the authorization relational graph according to the structure complexity of all connected graphs, structure is complicated
Degree.
It is also used to preferably, second structure complexity obtains module,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
Preferably, described device further includes,
Normal structure complexity obtains module, is used to take at logarithm to the structure complexity of the authorization relational graph
Reason obtains the normal structure complexity of the authorization relational graph.
Preferably, described device further includes,
Connected graph obtain module, be used for obtain it is described authorization relational graph in each connected graph structure complexity it
Before, the authorization relational graph is resolved into multiple connected graphs.
Disclosure based on the above embodiment can know, the embodiment of the present invention have it is following the utility model has the advantages that
The present invention parses complicated connected graph by authorization number of path, to know that connected graph can be with
Splitting becomes how many independent branches, and then determines the structure complexity of the connected graph, so as to spent according to its structure is complicated into
Row resource readjusts configuration.Authorization relationship graph structure is complex, is to be made of many connected graphs, the present invention will be every
After the structure complexity of a connected graph is parsed, then entirely the structure complexity of authorization relational graph also understand that, promote system
The resource distribution performance of system.
Present invention is generally directed to authorize relational graph architectural difference bring complexity to be studied, a kind of metering side is provided
Method calculates structure complexity index, and structure complexity can measure the complexity introduced due to configuration state difference,
It is one to scale complexity beneficial to make up.Structure complexity combination scale complexity can provide preferably instruction for user and make
With, facilitate user to adjust authorization relational graph according to this index, thought of dividing and rule can be used in user, and it reduces and is connected between node,
The complexity of authorization relational graph is reduced, such as: increase the quantity of resource host, reduces single host function, increase user, account
Quantity reduces by a user and binds excessive account, and an account authorization gave multi-user etc..To facilitate the permission pipe of user
Reason improves the intuitive of authorization relational graph, improves visual effect.
Detailed description of the invention
Fig. 1 is the logic diagram of the processing method of the connected graph in the embodiment of the present invention；
Fig. 2 is that one of embodiment of the present invention authorizes relational graph；
Fig. 3 is another authorization relational graph in the embodiment of the present invention；
Fig. 4 is the configuration state of the connected graph comprising 1 authorization path in the embodiment of the present invention；
Fig. 5 is the configuration state of the connected graph comprising 2 authorization paths in the embodiment of the present invention；
Fig. 6 is the configuration state schematic diagram of the connected graph comprising 3 authorization paths in the embodiment of the present invention；
Fig. 7 is the structural schematic diagram of the processing unit of the connected graph in the embodiment of the present invention.
Specific embodiment
In the following, specific embodiments of the present invention are described in detail in conjunction with attached drawing, but not as the limitation of the invention.
It should be understood that various modifications can be made to disclosed embodiments.Therefore, description above should not regard
To limit, and only as the example of embodiment.Those skilled in the art will expect within the scope and spirit of this
Other modifications.
The attached drawing being included in the description and forms part of the description shows embodiment of the disclosure, and with it is upper
What face provided is used to explain the disclosure together to substantially description and the detailed description given below to embodiment of the disclosure
Principle.
It is of the invention by the description of the preferred form with reference to the accompanying drawings to the embodiment for being given as non-limiting example
These and other characteristic will become apparent.
Although being also understood that invention has been described referring to some specific examples, those skilled in the art
Member realizes many other equivalents of the invention in which can determine, they have feature as claimed in claim and therefore all
In the protection scope defined by whereby.
When read in conjunction with the accompanying drawings, in view of following detailed description, above and other aspect, the feature and advantage of the disclosure will become
It is more readily apparent.
The specific embodiment of the disclosure is described hereinafter with reference to attached drawing；It will be appreciated, however, that the disclosed embodiments are only
Various ways implementation can be used in the example of the disclosure.Known and/or duplicate function and structure and be not described in detail to avoid
Unnecessary or extra details makes the disclosure smudgy.Therefore, specific structural and functionality disclosed herein is thin
Section is not intended to restrictions, but as just the basis of claim and representative basis be used to instructing those skilled in the art with
Substantially any appropriate detailed construction diversely uses the disclosure.
This specification can be used phrase " in one embodiment ", " in another embodiment ", " in another embodiment
In " or " in other embodiments ", it can be referred to one or more of the identical or different embodiment according to the disclosure.
In the following, the embodiment of the present invention is described in detail in conjunction with attached drawing,
As shown in Figure 1, the embodiment of the present invention provides a kind of processing method of connected graph, the method includes,
Obtain the authorization number of path in predetermined connected graph；
The corresponding structure complexity of the predetermined connected graph is determined based on the authorization number of path；
The corresponding resource distribution of the predetermined connected graph is adjusted based on the structure complexity.
One connected graph can be made of a plurality of authorization path.In practical applications, authorization path includes user, account, money
These fundamentals of source host may also include other nodes such as user group, account group, in order to more preferably illustrate this metering
Model has done simplification in the present invention, as soon as a that is, authorization path only includes user, account, resource host these fundamentals,
It is the path that a user passes through an one Taiwan investment source host of account O&M, for example, as shown in Figure 2 or Figure 3, one is had in figure
A oriented arrow association.Wherein, user identifier is identified at a, resource host into h at u, account identification.
Two width authorization relational graphs as shown in Figures 2 and 3 all have 5 authorization number of path in two width figures, it is apparent that,
Fig. 2 seems more complicated, the reason is that, firstly, the difference that we are very easy to find between two width figures is connection side between node
Formula has very big difference, and the different connection types between node make figure form different structure form.The figure of different structure form
Shown in clarity be different.Us are examined also, it can be seen that Fig. 3 is only comprising a connected graph, and Fig. 2 is then one
Item authorization path corresponds to a connected graph, in total includes five connected graphs.This illustrate between path association get over multiform at structure
More complicated, the structure for being associated with fewer formation is simpler clear.
It changes an angle to say, that is, the authorization number of path for including in a connected graph is more, the structure of formation is more complicated.This
As soon as being because the connected graph authorization number of path that includes is more, a possibility that forming different structure form, is more, also more not
It is easy to see clearly and authorizes routing information included in figure.
For example, Fig. 4, Fig. 5 and Fig. 6 respectively show the connected graph structure shape that may be present comprising different authorization number of path
State, as shown in figure 4, the configuration state of the connected graph only comprising 1 authorization path only has a kind, as shown in figure 5, authorizing comprising 2
The configuration state of the connected graph in path has 4 kinds, as shown in fig. 6, the configuration state of the connected graph comprising 3 authorization paths has 10 kinds
Deng, wherein Fig. 6 only schematically illustrates 4 kinds of configuration states in 10 kinds, in conjunction with upper figure it is found that comprising authorization path
The possibility configuration state of the more connected graph of number is more.
Arrange for the convenience of description, we do on symbol, p indicates the authorization number of path in connected graph；S indicates to connect
Logical figure configuration state number that may be present；F () indicates the functional relation between them, for example, as shown in formula (I).
S=f (p), p=1, S=1, formula (I)
Do not provide the specific formula for calculation of f (p) herein, because in practical engineering applications, due to authorizing relationship
The difference of model, calculation formula will be different.But the common engineering algorithm for n item authorization path is, according to { u, a, h }
(number of nodes is less than n) node collection constructs all possible figure, removes non-interconnected figure, then remove isomorphic graphs, finally obtains figure
Configuration state number, that is, S.
In the present invention, above structure status number S obtained, the corresponding structure complexity of as predetermined connected graph, structure
Complexity combination scale complexity can provide better indicative function for user, and user is facilitated to adjust connected graph according to this index,
Thought of dividing and rule can be used in user, reduces and connects between node, reduces the complexity of connected graph, such as: increase resource host
Quantity, reduce single host function, increase user, account quantity, reduce by a user and bind excessive account, an account is awarded
Weigh to multi-user etc..To facilitate the rights management of user, the intuitive of connected graph is improved, improves visual effect.
In another embodiment, the method also includes,
Obtain the structure complexity of each connected graph in the authorization relational graph where the predetermined connected graph；
The structure complexity of the authorization relational graph is determined according to the structure complexity of all connected graphs.
Authorizing often includes multiple connected graphs in relational graph, and the structure that can obtain connected graph in the above-described embodiments is multiple
Therefore miscellaneous degree in the present embodiment, can first acquire the structure complexity of each connected graph in authorization relational graph, then again
The structure complexity of the authorization relational graph is determined according to the structure complexity of all connected graphs.
For determining the structure complexity for authorizing relational graph according to the structure complexity of all connected graphs in the present invention
Concrete mode do not limit, for example, in other embodiments, it is described determined according to the structure complexity of all connected graphs described in
The structure complexity of relational graph is authorized, including,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
In practical applications, the numerical value of the structure complexity for the authorization relational graph calculated may be very big, for side
Just use need to control numerical values recited, easily facilitate user's viewing, after obtaining the structure complexity of the authorization relational graph,
Further include,
The structure complexity of the authorization relational graph is carried out taking logarithm process, obtains the standard knots of the authorization relational graph
Structure complexity.In this implementation, carry out taking logarithm process by the structure complexity to the authorization relational graph, so that it may obtain institute
State the normal structure complexity of authorization relational graph.And in the present invention, for the bottom of for take logarithm process with several there is no limit using
Family can need to be configured according to the use of oneself, in order to facilitate computer calculating, in one embodiment, can be with 2
Bottom carries out taking logarithm process.
In one embodiment, it before the structure complexity for obtaining each connected graph in the authorization relational graph, also wraps
It includes,
The authorization relational graph is resolved into multiple connected graphs.
Based on the same inventive concept, the embodiment of the present invention provides a kind of processing unit of connected graph, and the structure of the device is shown
Meaning as shown in fig. 7, described device includes,
It authorizes number of path to obtain module 10, is used to obtain the authorization number of path in predetermined connected graph；First structure is complicated
Degree obtains module 20, obtains module 10 with authorization number of path and couples, determines the predetermined connection based on the authorization number of path
Scheme corresponding structure complexity；Resource configuration module 30 obtains module 20 with first structure complexity and couples, is based on the knot
Structure complexity adjusts the corresponding resource distribution of the predetermined connected graph.
In one embodiment, described device further includes,
Second structure complexity obtains module, is used to obtain every in the authorization relational graph where the predetermined connected graph
The structure complexity of a connected graph；Determining the authorization relational graph according to the structure complexity of all connected graphs, structure is complicated
Degree.
In other embodiments, second structure complexity obtains module and is also used to,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
In another embodiment, described device further includes,
Normal structure complexity obtains module, is used to take at logarithm to the structure complexity of the authorization relational graph
Reason obtains the normal structure complexity of the authorization relational graph.
In the present embodiment, described device further includes,
Connected graph obtain module, be used for obtain it is described authorization relational graph in each connected graph structure complexity it
Before, the authorization relational graph is resolved into multiple connected graphs.
Above embodiments are only exemplary embodiment of the present invention, are not used in the limitation present invention, protection scope of the present invention
It is defined by the claims.Those skilled in the art can within the spirit and scope of the present invention make respectively the present invention
Kind modification or equivalent replacement, this modification or equivalent replacement also should be regarded as being within the scope of the present invention.
Claims (10)
1. a kind of processing method of connected graph, which is characterized in that the method includes,
Obtain the authorization number of path in predetermined connected graph；
The corresponding structure complexity of the predetermined connected graph is determined based on the authorization number of path；
The corresponding resource distribution of the predetermined connected graph is adjusted based on the structure complexity.
2. the method according to claim 1, wherein the method also includes,
Obtain the structure complexity of each connected graph in the authorization relational graph where the predetermined connected graph；
The structure complexity of the authorization relational graph is determined according to the structure complexity of all connected graphs.
3. according to the method described in claim 2, it is characterized in that, the structure complexity according to all connected graphs determines institute
The structure complexity of authorization relational graph is stated, including,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
4. according to the method described in claim 3, it is characterized in that, obtain it is described authorization relational graph structure complexity after,
Further include,
The structure complexity of the authorization relational graph is carried out taking logarithm process, the normal structure for obtaining the authorization relational graph is multiple
Miscellaneous degree.
5. according to the method described in claim 2, it is characterized in that, obtaining the knot of each connected graph in the authorization relational graph
Before structure complexity, further include,
The authorization relational graph is resolved into multiple connected graphs.
6. a kind of processing unit of connected graph, which is characterized in that described device includes,
It authorizes number of path to obtain module, is used to obtain the authorization number of path in predetermined connected graph；
First structure complexity obtains module, determines that the corresponding structure of the predetermined connected graph is multiple based on the authorization number of path
Miscellaneous degree；
Resource configuration module adjusts the corresponding resource distribution of the predetermined connected graph based on the structure complexity.
7. device according to claim 6, which is characterized in that described device further includes,
Second structure complexity obtains module, is used to obtain each company in the authorization relational graph where the predetermined connected graph
The structure complexity of logical figure；The structure complexity of the authorization relational graph is determined according to the structure complexity of all connected graphs.
8. device according to claim 7, which is characterized in that second structure complexity obtains module and is also used to,
The structure complexity of all connected graphs is added, the structure complexity of the authorization relational graph is obtained.
9. device according to claim 8, which is characterized in that described device further includes,
Normal structure complexity obtains module, is used to carry out taking logarithm process to the structure complexity of the authorization relational graph,
Obtain the normal structure complexity of the authorization relational graph.
10. device according to claim 7, which is characterized in that described device further includes,
Connected graph obtains module, is used for before the structure complexity for obtaining each connected graph in the authorization relational graph,
The authorization relational graph is resolved into multiple connected graphs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564358.1A CN109657111B (en) | 2018-12-20 | 2018-12-20 | Method and device for processing connectivity graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811564358.1A CN109657111B (en) | 2018-12-20 | 2018-12-20 | Method and device for processing connectivity graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109657111A true CN109657111A (en) | 2019-04-19 |
| CN109657111B CN109657111B (en) | 2023-03-14 |
Family
ID=66115147
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811564358.1A Active CN109657111B (en) | 2018-12-20 | 2018-12-20 | Method and device for processing connectivity graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109657111B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110134732A (en) * | 2019-05-17 | 2019-08-16 | 北京天融信网络安全技术有限公司 | A kind of methods of exhibiting and device of authorization relationship quantity |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102148696A (en) * | 2010-09-06 | 2011-08-10 | 华为技术有限公司 | Method and system for managing network service |
| US8024794B1 (en) * | 2005-11-30 | 2011-09-20 | Amdocs Software Systems Limited | Dynamic role based authorization system and method |
| CN106355052A (en) * | 2016-11-03 | 2017-01-25 | 广东浪潮大数据研究有限公司 | Authorization centralized management method, device and system |
| CN107451224A (en) * | 2017-07-17 | 2017-12-08 | 广州特道信息科技有限公司 | A kind of clustering method and system based on big data parallel computation |
| CN108390874A (en) * | 2018-02-12 | 2018-08-10 | 北京工业大学 | Access control model and access method based on certificate in network structure |
-
2018
- 2018-12-20 CN CN201811564358.1A patent/CN109657111B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8024794B1 (en) * | 2005-11-30 | 2011-09-20 | Amdocs Software Systems Limited | Dynamic role based authorization system and method |
| CN102148696A (en) * | 2010-09-06 | 2011-08-10 | 华为技术有限公司 | Method and system for managing network service |
| CN106355052A (en) * | 2016-11-03 | 2017-01-25 | 广东浪潮大数据研究有限公司 | Authorization centralized management method, device and system |
| CN107451224A (en) * | 2017-07-17 | 2017-12-08 | 广州特道信息科技有限公司 | A kind of clustering method and system based on big data parallel computation |
| CN108390874A (en) * | 2018-02-12 | 2018-08-10 | 北京工业大学 | Access control model and access method based on certificate in network structure |
Non-Patent Citations (1)
| Title |
|---|
| 赵化冰等: "一种通过资源和操作进行权限控制的TMN安全方案", 《计算机工程》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110134732A (en) * | 2019-05-17 | 2019-08-16 | 北京天融信网络安全技术有限公司 | A kind of methods of exhibiting and device of authorization relationship quantity |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109657111B (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103902459B (en) | Determine the method and relevant device of shared virtual memory page management pattern | |
| Peng et al. | Hesitant fuzzy soft decision making methods based on WASPAS, MABAC and COPRAS with combined weights | |
| Aziz et al. | Pareto optimality in coalition formation | |
| CN105373480B (en) | Optimize the method and system of ABTest systems shunting | |
| AU2018267853A1 (en) | Method for setting form field operation authority of workflow, and method for setting form field operation authority of approval node | |
| Fallat et al. | Minimum rank, maximum nullity, and zero forcing number of graphs | |
| Zhang et al. | Analytical solution of average path length for Apollonian networks | |
| Ashlagi et al. | Individual rationality and participation in large scale, multi-hospital kidney exchange | |
| Tan et al. | Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers | |
| Chau et al. | Harnessing the forces of urban expansion: The public economics of farmland development allowances | |
| CN109657111A (en) | A kind of processing method and processing device of connected graph | |
| Bennett et al. | Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams | |
| Albin et al. | Spanning tree modulus for secure broadcast games | |
| CN105653962B (en) | A kind of user role access authorization for resource model management method of object-oriented | |
| CN104754626B (en) | A kind of transmission network physical node Analysis of Networking method and apparatus | |
| CN102930189A (en) | Role authority limiting method and system | |
| CN107657050A (en) | One kind is based on " with the one-to-one join of conflation algorithm calculating, one-to-many join " contraposition segmentation parallel method | |
| Tang et al. | Collaborative management and control of blockchain in cloud computing environment | |
| Zimmermann | Finite-state strategies in delay games | |
| CN104102579B (en) | A kind of network measuring system and method based on multinuclear or many-core embeded processor | |
| CN109302409A (en) | Analysis method, device, equipment and the storage medium of ACL access control policy | |
| Cesco | Hedonic games related to many-to-one matching problems | |
| CN101299758A (en) | Well-regulated group system for cosmically processing event as well as processing method | |
| CN110378580A (en) | A kind of electric network fault multi-agent system preferentially diagnostic method and device | |
| Enokido et al. | Concurrency control using subject-and purpose-oriented (SPO) view |
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 |