CN109657111B - Method and device for processing connectivity graph - Google Patents
Method and device for processing connectivity graph Download PDFInfo
- Publication number
- CN109657111B CN109657111B CN201811564358.1A CN201811564358A CN109657111B CN 109657111 B CN109657111 B CN 109657111B CN 201811564358 A CN201811564358 A CN 201811564358A CN 109657111 B CN109657111 B CN 109657111B
- Authority
- CN
- China
- Prior art keywords
- graph
- authorization
- complexity
- structural complexity
- structural
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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 invention provides a processing method and a device of a connectivity graph, wherein the method comprises the steps of acquiring the authorized path number in a preset connectivity graph; determining the structural complexity corresponding to the preset connected graph based on the authorized path number; and adjusting the resource configuration corresponding to the preset connected graph based on the structural complexity. The invention mainly aims at the complexity caused by the structural difference of the authorization relationship diagram, provides a metering method, calculates the structural complexity index, facilitates the user to adjust the authorization relationship diagram according to the index, reduces the complexity of the authorization relationship diagram, improves the intuitiveness of the authorization relationship diagram and improves the visual effect.
Description
Technical Field
The invention relates to the field of data processing, in particular to a method and a device for processing a connectivity graph.
Background
The fort machine is an operation and maintenance safety audit system, resource authorization and account management are core functions of the fort machine, fine authorization management can be performed on users, accounts and resources, and the operation and maintenance problems of numerous personnel, crossed authorities, various assets and various disordered authorities are solved. In the prior art, the authority relationship among the user, the account and the resource can be established through the authorization policy, but because the authorization rules are numerous and the internal configuration of the authority rules is complex, the authorization relationship cannot be clearly shown through the authorization policy, and various authority hidden dangers may still exist, such as: repeated authorization, over-authorization, invalid authorization, etc. In order to better display the authorization relationship, a visualization technology is introduced, namely the authorization relationship is displayed through an authorization relationship diagram, so that a visual display effect can be brought, and a user can conveniently find the permission vulnerability.
In the prior art, the complexity of the authorization relationship is mainly measured by counting the number of the authorization relationships, and the complexity can be reduced by adjusting the number of the authorization relationships, so that the visual effect is improved. Although the intuitiveness of the authorization relationship diagram can reduce the difficulty of finding the authority vulnerability, if enough authorization relationships are displayed and the structure is complex enough, the intuitiveness is reduced linearly, namely, the main defect in the prior art is that the complexity caused by the scale can be measured, and the complexity caused by the structure cannot be measured, namely, the complexity is different on the premise of the same number of authorization relationships.
Disclosure of Invention
The invention provides a method and a device for processing a connectivity graph. The invention mainly researches the complexity caused by the structure difference of the authorization relationship diagram, provides a metering method, calculates the structure complexity index, facilitates the user to adjust the authorization relationship diagram according to the index, reduces the complexity of the authorization relationship diagram, improves the intuition of the authorization relationship diagram and improves the visual effect.
In order to solve the above technical problem, an embodiment of the present invention provides the following technical solutions:
the invention provides a processing method of a connected graph in a first aspect, which comprises the steps of,
obtaining the number of authorized paths in a preset connected graph;
determining the structural complexity corresponding to the preset connected graph based on the authorization path number;
and adjusting the resource configuration corresponding to the preset connected graph based on the structural complexity.
Preferably, the method further comprises the step of,
acquiring the structural complexity of each connected graph in the authorization relationship graph in which the preset connected graph is positioned;
and determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs.
Preferably, the determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs includes,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
Preferably, after obtaining the structural complexity of the authorization relationship graph, further comprising,
and carrying out logarithm processing on the structural complexity of the authorization relation graph to obtain the standard structural complexity of the authorization relation graph.
Preferably, before obtaining the structural complexity of each connected graph in the authorization relationship graph, the method further includes,
and decomposing the authorization relationship graph into a plurality of the connectivity graphs.
In a second aspect, the present invention provides a processing apparatus for a connectivity map, the apparatus comprising,
the authorization path number acquisition module is used for acquiring the authorization path number in a preset connection graph;
the first structural complexity obtaining module is used for determining the structural complexity corresponding to the preset connected graph based on the authorized path number;
and the resource configuration module adjusts the resource configuration corresponding to the preset connected graph based on the structural complexity.
Preferably, the apparatus further comprises a second sensor,
the second structure complexity obtaining module is used for obtaining the structure complexity of each connected graph in the authorization relationship graph where the preset connected graph is located; and determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs.
Preferably, the second structural complexity obtaining module is further configured to,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
Preferably, the apparatus further comprises a second sensor,
and the standard structure complexity acquisition module is used for carrying out logarithm processing on the structure complexity of the authorization relation graph to obtain the standard structure complexity of the authorization relation graph.
Preferably, the apparatus further comprises a second sensor,
a connectivity graph obtaining module for decomposing the authorization relationship graph into a plurality of the connectivity graphs before obtaining the structural complexity of each of the authorization relationship graphs.
Based on the disclosure of the above embodiments, it can be known that the embodiments of the present invention have the following beneficial effects:
the invention analyzes the connected graph with the complex structure through the authorized path number so as to know how many independent branches one connected graph can be split into, and further determines the structural complexity of the connected graph, so that the resource readjustment configuration is carried out according to the structural complexity. The authorization relationship diagram is complex in structure and is composed of a plurality of connected graphs, and after the structural complexity of each connected graph is analyzed, the structural complexity of the whole authorization relationship diagram can be known, so that the resource configuration performance of the system is improved.
The invention mainly aims at the complexity caused by the structure difference of the authorization relationship diagram, provides a metering method, calculates the index of the structure complexity, can measure the complexity caused by the structure state difference, and is beneficial to make up for the scale complexity. The structure complexity and the scale complexity can provide a better indication effect for a user, the user can conveniently adjust the authorization relationship diagram according to the index, the user can adopt the concept of divide and conquer, the connection between nodes is reduced, and the complexity of the authorization relationship diagram is reduced, such as: the number of resource hosts is increased, the functions of a single host are reduced, the number of users and accounts is increased, the number of the accounts bound by one user is reduced, the number of the accounts authorized to the users is reduced, and the like. Therefore, the authority management of the user is facilitated, the intuition of the authorization relation graph is improved, and the visual effect is improved.
Drawings
FIG. 1 is a logic block diagram of a method of processing a connectivity graph in an embodiment of the invention;
FIG. 2 is a diagram of an authorization relationship in an embodiment of the present invention;
FIG. 3 is a diagram of another authorization relationship in an embodiment of the present invention;
FIG. 4 is a structural state of a connectivity graph including 1 authorization path in an embodiment of the present invention;
FIG. 5 is a structural state of a connectivity graph including 2 authorization paths in an embodiment of the present invention;
FIG. 6 is a schematic diagram of the structure state of a connectivity graph including 3 authorization paths in an embodiment of the present invention;
FIG. 7 is a schematic structural diagram of a processing apparatus of a connectivity graph in an embodiment of the present invention.
Detailed Description
The following detailed description of specific embodiments of the present invention is provided in connection with the accompanying drawings, which are not intended to limit the invention.
It will be understood that various modifications may be made to the embodiments disclosed herein. Accordingly, the foregoing description should not be construed as limiting, but merely as exemplifications of embodiments. Other modifications will occur to those skilled in the art within the scope and spirit of the disclosure.
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the disclosure and, together with a general description of the disclosure given above, and the detailed description of the embodiments given below, serve to explain the principles of the disclosure.
These and other characteristics of the invention will become apparent from the following description of a preferred form of embodiment, given as a non-limiting example, with reference to the accompanying drawings.
It should also be understood that although the present invention has been described with reference to some specific examples, a person of skill in the art shall certainly be able to achieve many other equivalent forms of the invention, having the characteristics as set forth in the claims and hence all coming within the field of protection defined thereby.
The above and other aspects, features and advantages of the present disclosure will become more apparent in view of the following detailed description when taken in conjunction with the accompanying drawings.
Specific embodiments of the present disclosure are described hereinafter with reference to the accompanying drawings; however, it is to be understood that the disclosed embodiments are merely examples of the disclosure that may be embodied in various forms. Well-known and/or repeated functions and structures have not been described in detail so as not to obscure the present disclosure with unnecessary or unnecessary detail. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a basis for the claims and as a representative basis for teaching one skilled in the art to variously employ the present disclosure in virtually any appropriately detailed structure.
The specification may use the phrases "in one embodiment," "in another embodiment," "in yet another embodiment," or "in other embodiments," which may each refer to one or more of the same or different embodiments in accordance with the disclosure.
The embodiments of the invention will be described in detail with reference to the accompanying drawings,
as shown in fig. 1, an embodiment of the present invention provides a method for processing a connectivity graph, where the method includes,
obtaining the authorization path number in a preset connection graph;
determining the structural complexity corresponding to the preset connected graph based on the authorized path number;
and adjusting the resource configuration corresponding to the preset connected graph based on the structural complexity.
A connectivity graph may be composed of multiple authorization paths. In practical applications, the authorization path includes several basic elements of a user, an account, and a resource host, and may further include other nodes such as a user group and an account group, and in order to better explain the metering model, the present invention is simplified, that is, an authorization path only includes several basic elements of a user, an account, and a resource host, that is, a path for a user to operate and maintain a resource host through an account, for example, as shown in fig. 2 or fig. 3, a directed arrow is associated in a graph. Wherein, the user identifier is u, the account identifier is a, and the resource host identifier is h.
Two authorization relationship graphs as shown in fig. 2 and fig. 3, each of which has 5 authorization paths, but it is obvious that fig. 2 is more complex, because firstly, it is easy to find that the difference between the two graphs is that the connection mode between nodes is very different, and the different connection modes between nodes make the graphs form different structural forms. The different structural forms of the figures show different degrees of clarity. Careful observation will also reveal that fig. 3 contains only one connectivity graph, while fig. 2 contains a total of five connectivity graphs corresponding to one grant path. This means that the more the correlation between the paths, the more complex the structure is formed, and the less the correlation, the simpler and clearer the structure is formed.
In another aspect, the more authorization paths contained in a connectivity graph, the more complex the structure formed. This is because the more the number of authorized paths included in one connected graph is, the more the possibility of forming different structural forms is, and the more difficult it is to see the authorized path information included in the graph.
For example, fig. 4, fig. 5 and fig. 6 respectively show possible structural states of the connectivity graph including different authorization paths, as shown in fig. 4, the structural state of the connectivity graph including only 1 authorization path is only 1, as shown in fig. 5, the structural state of the connectivity graph including 2 authorization paths is 4, as shown in fig. 6, the structural state of the connectivity graph including 3 authorization paths is 10, and the like, where fig. 6 only exemplarily shows 4 structural states among 10, and as can be seen from the above graph, the more possible structural states of the connectivity graph including the authorization paths are.
For convenience of description, we make a convention on symbols, where p denotes the number of authorized paths in the connectivity graph; s represents the number of possible structural states of the connected graph; f () represents a functional relationship therebetween, for example, as shown in formula (i).
S = f (p), p =1, S =1, formula (I)
The specific calculation formula of f (p) is not given, because in practical engineering application, the calculation formula may be different due to the difference of the authorization relationship model. However, for a general engineering algorithm of n authorized paths, all possible graphs are constructed according to a { u, a, h } (the number of nodes is less than n) node set, non-connected graphs are removed, then the same graph is removed, and finally the structural state number of the graph, namely S, is obtained.
In the invention, the obtained structural state number S is the structural complexity corresponding to the predetermined connected graph, the structural complexity and the scale complexity can provide a better indication for a user, the user can conveniently adjust the connected graph according to the index, and the user can adopt a divide-and-conquer idea, reduce the connection between nodes, and reduce the complexity of the connected graph, such as: the number of resource hosts is increased, the functions of a single host are reduced, the number of users and accounts is increased, the number of too many accounts bound by one user is reduced, one account is authorized for too many users, and the like. Therefore, the authority management of the user is facilitated, the intuition of the connected graph is improved, and the visual effect is improved.
In another embodiment, the method further comprises,
acquiring the structural complexity of each connected graph in the authorization relationship graph where the preset connected graph is located;
and determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs.
Therefore, in this embodiment, the structure complexity of each connected graph in the authorization relationship graph may be obtained first, and then the structure complexity of the authorization relationship graph may be determined according to the structure complexities of all connected graphs.
The specific way of determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs is not limited in the present invention, for example, in other embodiments, the determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs includes,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
In practical applications, the calculated value of the structural complexity of the authorized relational graph may be very large, and the value needs to be controlled for convenient use, so as to be more convenient for users to view, and after the structural complexity of the authorized relational graph is obtained, the method further includes,
and carrying out logarithm taking processing on the structural complexity of the authorization relation graph to obtain the standard structural complexity of the authorization relation graph. In this implementation, the standard structural complexity of the authorization relationship diagram can be obtained by performing logarithm processing on the structural complexity of the authorization relationship diagram. In addition, in the invention, there is no limitation on the base number taking logarithm processing, a user can set according to the use requirement of the user, and for the convenience of computer calculation, in one embodiment, the base number taking logarithm processing can be carried out by taking 2 as a base.
In one embodiment, before obtaining the structural complexity of each connected graph in the authorization relationship graph, further comprising,
and decomposing the authorization relationship graph into a plurality of the connectivity graphs.
Based on the same inventive concept, the embodiment of the present invention provides a processing apparatus of a connected graph, the structure of which is schematically shown in fig. 7, the apparatus comprises,
an authorized path number obtaining module 10, configured to obtain the authorized path number in a predetermined connectivity graph; a first structural complexity obtaining module 20, coupled to the authorized path number obtaining module 10, for determining the structural complexity corresponding to the predetermined connectivity graph based on the authorized path number; and a resource configuration module 30, coupled to the first structural complexity obtaining module 20, for adjusting the resource configuration corresponding to the predetermined connected graph based on the structural complexity.
In one embodiment, the apparatus further comprises,
the second structure complexity obtaining module is used for obtaining the structure complexity of each connected graph in the authorization relationship graph where the preset connected graph is located; and determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs.
In other embodiments, the second structural complexity acquisition module is further configured to,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
In another embodiment, the apparatus further comprises,
and the standard structure complexity acquisition module is used for carrying out logarithm processing on the structure complexity of the authorization relation graph to obtain the standard structure complexity of the authorization relation graph.
In this embodiment, the apparatus further comprises,
a connectivity graph obtaining module for decomposing the authorization relationship graph into a plurality of the connectivity graphs before obtaining the structural complexity of each of the authorization relationship graphs.
The above embodiments are only exemplary embodiments of the present invention, and are not intended to limit the present invention, and the scope of the present invention is defined by the claims. Various modifications and equivalents may be made by those skilled in the art within the spirit and scope of the present invention, and such modifications and equivalents should also be considered as falling within the scope of the present invention.
Claims (8)
1. A method for processing a connectivity graph, the method comprising,
obtaining the number of authorized paths in a preset connected graph; the preset connection graph consists of an authorization path containing a user, an account and a resource host;
determining the structural complexity corresponding to the preset connected graph based on the authorized path number;
adjusting the resource configuration corresponding to the predetermined connected graph based on the structural complexity, wherein the resource configuration at least comprises: the number of resource hosts, the function of a single host, the number of users and/or accounts, one user binding multiple accounts and one account authorization to multiple users;
wherein:
and under the condition of obtaining the structure complexity of each connected graph in the authorization relation graph where the preset connected graph is located, determining the structure complexity of the authorization relation graph according to the structure complexity of all connected graphs.
2. The method according to claim 1, wherein determining the structural complexity of the authorization relationship graph according to the structural complexity of all connected graphs comprises,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
3. The method of claim 2, wherein obtaining the structural complexity of the authorization relationship graph further comprises,
and carrying out logarithm taking processing on the structural complexity of the authorization relation graph to obtain the standard structural complexity of the authorization relation graph.
4. The method of claim 1, wherein before obtaining the structural complexity of each of the authority relationship graphs, further comprising,
and decomposing the authorization relationship graph into a plurality of the connectivity graphs.
5. A processing apparatus for a connectivity graph, the apparatus comprising,
the authorization path number acquisition module is used for acquiring the authorization path number in a preset connection graph; the preset connection graph consists of an authorization path containing a user, an account and a resource host;
the first structural complexity obtaining module is used for determining the structural complexity corresponding to the preset connected graph based on the authorized path number;
a resource configuration module, configured to adjust a resource configuration corresponding to the predetermined connectivity graph based on the structural complexity, where the resource configuration at least includes: the number of resource hosts, the function of a single host, the number of users and/or accounts, one user binding multiple accounts and one account authorization for multiple users;
the second structure complexity obtaining module is used for obtaining the structure complexity of each connected graph in the authorization relationship graph where the preset connected graph is located; and determining the structural complexity of the authorization relationship graph according to the structural complexity of all the connected graphs.
6. The apparatus of claim 5, wherein the second structural complexity acquisition module is further configured to,
and adding the structural complexity of all the connected graphs to obtain the structural complexity of the authorization relationship graph.
7. The apparatus of claim 6, further comprising,
and the standard structure complexity acquisition module is used for carrying out logarithm processing on the structure complexity of the authorization relation graph to obtain the standard structure complexity of the authorization relation graph.
8. The apparatus of claim 5, further comprising,
a connectivity graph obtaining module configured to decompose the authorization relationship graph into a plurality of connectivity graphs before obtaining the structural complexity of each of the authorization relationship 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 CN109657111A (en) | 2019-04-19 |
| CN109657111B true 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) |
Families Citing this family (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安全方案;赵化冰等;《计算机工程》;20031130;第29卷(第22期);98-100 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109657111A (en) | 2019-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yan et al. | Mapping library and information science in China: A coauthorship network analysis | |
| CN110611651B (en) | Network monitoring method, network monitoring device and electronic equipment | |
| CN107315968B (en) | A kind of data processing method and equipment | |
| Goh et al. | Fluctuation-driven dynamics of the Internet topology | |
| US8943575B2 (en) | Method and system for policy simulation | |
| Ding et al. | Privacy-preserving triangle counting in large graphs | |
| CN102509044B (en) | Mouse behavior characteristic-based password authentication method | |
| US8549628B2 (en) | Method and apparatus to measure the security of a system, network, or application | |
| CN109657111B (en) | Method and device for processing connectivity graph | |
| Liu et al. | Dynamics of a stochastic heroin epidemic model with bilinear incidence and varying population size | |
| CN110110160A (en) | Determine the method and device of data exception | |
| CN115080574B (en) | Method and device for processing electronic product test data, computer equipment and storage medium | |
| CN106095641A (en) | A kind of monitoring methods, devices and systems | |
| DE112020005373T5 (en) | AUTHENTICATION MECHANISM USING POSITION CONFIRMATION | |
| CN111475803A (en) | Background authority management system and management method | |
| EP3465513B1 (en) | User authentication by means of an id token | |
| CN108833442A (en) | A kind of distributed network security monitoring device and its method | |
| CN110298328A (en) | Test data forming method, test data form device, electronic equipment and medium | |
| CN107742141B (en) | Intelligent identity information acquisition method and system based on RFID technology | |
| CN109617746B (en) | SCD network configuration verification method based on SPCD file | |
| EP4133761A2 (en) | Monitoring system with multistage request verification | |
| CN116910023A (en) | Data management system | |
| CN116663026A (en) | Block chain-based data processing method and device, electronic equipment and medium | |
| CN110505229A (en) | A kind of account number safety detection method based on storm | |
| CN111818047B (en) | Cloud host monitoring management system and method in cloud environment |
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 |