CN114363354B - Block chain consensus method based on DIKWP model - Google Patents
Block chain consensus method based on DIKWP model Download PDFInfo
- Publication number
- CN114363354B CN114363354B CN202111658319.XA CN202111658319A CN114363354B CN 114363354 B CN114363354 B CN 114363354B CN 202111658319 A CN202111658319 A CN 202111658319A CN 114363354 B CN114363354 B CN 114363354B
- Authority
- CN
- China
- Prior art keywords
- model
- dikwp
- block chain
- intention
- user
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a block chain consensus method based on a DIKWP model, which comprises the following steps: obtaining the typed resources of all blocks in a block chain, and constructing a DIKWP model of the block chain according to the typed resources; a user initiates request information, obtains typed resources according to the request information, and constructs a DIKWP model of the user according to the typed resources; the user DIKWP model conducts traversal search and intention comparison on the block chain DIKWP model, and a block chain to be added is obtained; the user DIKWP model packs the request information initiated by the user into a new block and is connected to the tail end of the block chain to be added, the block chain and the request information of the user are constructed, the block chain and the content initiated by the user are aggregated, the DIKWP model can convert and combine the internal content mutually, the block chain to be added can be quickly obtained after traversal search and intention comparison, and the uplink consensus efficiency is improved.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain consensus method based on a DIKWP model.
Background
The block chain is a distributed account book mainly used for solving the problems of trust and consistency among a plurality of main bodies, a distributed consensus mechanism of the block chain is mainly used for solving the problem of distributed consistency, namely, data is confirmed, verified and updated, the consensus mechanism is a core technology of the block chain and means that the verification and the confirmation of transactions are completed through voting of special nodes in a block chain network, the conventional block chain consensus technology needs a plurality of nodes for verification, and generally more than half of the nodes are required to confirm and then the verified information blocks are added into the corresponding block chains, so that the whole verification time is long, the efficiency is low, and the accuracy is low.
Each thing has its Data (Data), Information (Information), Knowledge (Knowledge), Wisdom (Wisdom) and intention (Purpose), and the combination of Data, Information, Knowledge, Wisdom and intention can form the DIKWP map, contains the detailed Information of thing in the DIKWP map, if can use the DIKWP map in the consensus of block chain, will very big improvement consensus efficiency and accuracy, therefore, how to combine the DIKWP map in the consensus of block chain is the present urgent problem that needs to solve.
Disclosure of Invention
In view of this, the invention provides a block chain consensus method based on a DIKWP model, which combines a DIKWP map into a block chain to perform consensus rapidly and realize rapid uplink of the block chain.
The technical scheme of the invention is realized as follows:
the block chain consensus method based on the DIKWP model comprises the following steps of:
step S1, obtaining the typed resources of all blocks in the block chain, and constructing a DIKWP model of the block chain according to the typed resources;
step S2, the user initiates request information, obtains typed resources according to the request information, and constructs a DIKWP model of the user according to the typed resources;
step S3, the user DIKWP model conducts traversal search and intention comparison on the block chain DIKWP model, and a block chain to be added is obtained;
step S4, the user DIKWP model packs the request information initiated by the user into a new tile to be connected to the end of the chain of tiles to be added.
Preferably, the blockchain DIKWP model and the user DIKWP model each include a data model, an information model, a knowledge model, and an intention model, the data model, the information model, and the knowledge model may be obtained by mutual conversion, and the intention model is obtained by combining the data model, the information model, and the knowledge model.
Preferably, the specific step of step S1 is:
step S11, obtaining semantic information contained in each block in the block chain, and mapping the semantic information into typed resources, wherein the typed resources comprise data resources, information resources, knowledge resources and intention resources;
step S12, building a block chain DIKWP model according to the data resources, the information resources, the knowledge resources and the intention resources.
Preferably, the specific step of step S2 is:
step S21, the user initiates a request, and the request information is mapped into typed resources, wherein the typed resources comprise data resources, information resources and knowledge resources;
step S22, extracting the obvious intention contained in the request information initiated by the user, converting and analyzing the data resource, the information resource and the knowledge resource to obtain the potential intention, wherein the obvious intention and the potential intention form the intention resource;
and step S23, constructing the user DIKWP model according to the typed resources and the intention resources.
Preferably, the specific step of step S3 is:
step S31, the user DIKWP model searches the block chain DIKWP model, and the block chain with the same content is obtained as the initial block chain;
step S32, comparing the user DIKWP model and the block chain DIKWP model of the initial block chain;
step S33, judging the connection value of the block chain according to the intention comparison result;
and step S34, sequencing the block chains according to the connection value result, and taking the block chain with the highest connection value as the block chain to be added.
Preferably, in the step S32, the priority of the obvious intention is higher than the potential intention when comparing the intentions, and if there is no obvious intention in the user DIKWP model, the potential intention is used for comparison.
Preferably, in the step S32, when comparing the intentions, it is determined whether the obvious intention or the potential intention of the user DIKWP model is different from the intention of the blockchain DIKWP model, and when the intention difference is larger, it is determined that the connection value of the blockchain DIKWP model is lower.
Preferably, the specific step of step S4 is: the user DIKWP model packs the request information initiated by the user into a new block, then the new block is moved to the tail end of the block chain to be added for connection, and meanwhile, the new block is marked.
Preferably, step S5 is further included, and a broadcast notification is made that the new tile is connected to the to-be-added tile chain.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a block chain consensus method based on a DIKWP model, which constructs corresponding block chain DIKWP models for all block chains, constructs the user DIKWP models for the requests of users when receiving the requests initiated by the users, then conducts traversal search and intention comparison on the block chain DIKWP models through the DIKWP models, searches for the block chain corresponding to the user requests, can obtain the block chain to be added which is finally consistent with the user requests after traversal search and intention comparison, packs the request information of the users into a new block and then connects the new block chain to the tail end of the block chain to be added, realizes uplink, and can compress the time of consensus uplink and improve the efficiency of data identification and storage compared with the traditional mode of consensus through node voting.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only preferred embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive exercise.
FIG. 1 is a flow chart of a block chain consensus method based on DIKWP model according to the present invention;
FIG. 2 is a flowchart illustrating step S1 of a block chain consensus method based on DIKWP model according to the present invention;
FIG. 3 is a flowchart illustrating step S2 of a block chain consensus method based on DIKWP model according to the present invention;
fig. 4 is a flowchart of step S3 of the blockchain consensus method based on the DIKWP model according to the present invention.
Detailed Description
For a better understanding of the technical content of the present invention, a specific embodiment is provided below, and the present invention is further described with reference to the accompanying drawings.
Referring to fig. 1 to 4, the block chain consensus method based on the DIKWP model provided in the present invention includes the following steps:
step S1, obtaining the typed resources of all blocks in the block chain, and constructing a DIKWP model of the block chain according to the typed resources;
step S2, the user initiates request information, obtains typed resources according to the request information, and constructs a DIKWP model of the user according to the typed resources;
step S3, the user DIKWP model conducts traversal search and intention comparison on the block chain DIKWP model, and a block chain to be added is obtained;
step S4, the user DIKWP model packs the request information initiated by the user into a new tile to be connected to the end of the chain of tiles to be added.
The invention relates to a block chain consensus method based on a DIKWP model, which combines the DIKWP model into the block chain consensus, wherein the DIKWP model comprises Data (Data), Information (Information), Knowledge (Knowledge) wisdom (wisdom) and intention (purpose), a block chain DIKWP model corresponding to each block chain is constructed for each block chain, before construction, the content of each block in the block chain needs to be extracted, the extracted content is converted into typed resources, then the block chain DIKWP model can be correspondingly constructed according to the typed resources, the constructed block chain DIKWP model comprises the Data, the Information, the Knowledge, the intention and the like contained in each block, different contents correspond to different block chains, the block chain to be searched can be rapidly determined by searching the content in the block chain DIKWP model, when a user initiates request Information, the request Information is converted into the typed resources, and then correspondingly constructing a user DIKWP model according to the typed resources, wherein the user DIKWP model contains the keywords, intentions and other contents of all contents in the request initiated by the user, traversing, searching and comparing the intentions by the user DIKWP model after the user DIKWP model is constructed, searching the block chain DIKWP model with the same contents as those in the user DIKWP model to be used as a block chain to be added, packaging the request information initiated by the user into a new block, connecting the new block to the tail end of the block chain to be added, realizing the common identification uplink of the block chain, and realizing automatic and efficient common identification without waiting for the response of other user nodes compared with the traditional node voting verification mode.
For a user initiating a request, the initiated content has a corresponding intention, the intention points to a certain blockchain, the blockchain has an intention related to the content, and the intention of the blockchain is used for providing a basis for uplink for a new block.
Preferably, the blockchain DIKWP model and the user DIKWP model each include a data model, an information model, a knowledge model, and an intention model, the data model, the information model, and the knowledge model may be obtained by mutual conversion, and the intention model is obtained by combining the data model, the information model, and the knowledge model.
The DIKWP model comprises a data model, an information model, a knowledge model and an intention model, wherein the data model, the information model and the knowledge model are the most basic models, the contents of the data model, the information model and the knowledge model can be obtained through mutual conversion, the intention model can be obtained through conversion according to the data model, the information model and the knowledge model or can be directly obtained according to the intention contents contained in a request initiated by a user, and the intention models in the block chain DIKWP model and the user DIKWP model can be subjected to intention comparison to search for a block chain conforming to the user request.
Preferably, the specific step of step S1 is:
step S11, obtaining semantic information contained in each block in the block chain, and mapping the semantic information into typed resources, wherein the typed resources comprise data resources, information resources, knowledge resources and intention resources;
step S12, building a block chain DIKWP model according to the data resource, the information resource, the knowledge resource and the intention resource.
When a block chain DIKWP model is constructed, firstly, semantic information contained in each block chain is obtained, after the semantic information is analyzed, the semantic information is decomposed into typed resources including data resources, information resources, knowledge resources and intention resources, and then the block chain DIKWP model can be correspondingly constructed according to the typed resources.
For a block chain, there will be many blocks in it, the blocks are connected into a chain in sequence, each block contains information, time, mark and main content corresponding to the user, the main content is generally composed by characters or numbers, and the detailed content of the block and block chain can be known by obtaining semantic information of all contents contained in the block.
Preferably, the specific step of step S2 is:
step S21, the user initiates a request, and the request information is mapped into typed resources, wherein the typed resources comprise data resources, information resources and knowledge resources;
step S22, extracting the obvious intention contained in the request information initiated by the user, converting and analyzing the data resource, the information resource and the knowledge resource to obtain the potential intention, wherein the obvious intention and the potential intention form the intention resource;
and step S23, constructing the user DIKWP model according to the typed resources and the intention resources.
When the DIKWP model of the user is constructed, because the intention of the user is not obviously reflected, therefore, when the user DIKWP model is constructed, the request information is firstly acquired and mapped into the typed resource, wherein the typed resources only comprise data resources, information resources and knowledge resources, and for the intention of the user, it needs to judge whether the request initiated by the user contains obvious intention, therefore, it is necessary to extract the request information of the user, determine whether the request information contains obvious intentions, meanwhile, the data resources, the information resources and the knowledge resources of the information requested by the user are combined, analyzed and converted to judge whether the potential intention exists or not, and finally the intention resources are composed of obvious intentions and potential intentions, and then constructing and obtaining a user DIKWP model according to the typed resources and the intention resources, wherein the user DIKWP model contains the intention of the user.
Preferably, the specific step of step S3 is:
step S31, the user DIKWP model searches the block chain DIKWP model, and the block chain with the same content is obtained as the initial block chain;
step S32, comparing the intention of the user DIKWP model and the block chain DIKWP model of the initial block chain;
step S33, judging the connection value of the block chain according to the intention comparison result;
and step S34, sequencing the block chains according to the connection value result, and taking the block chain with the highest connection value as the block chain to be added.
When searching for a block chain to be added, a user DIKWP model needs to perform traversal search and intention comparison on the block chain DIKWP model, the first process is traversal search, the user DIKWP model traverses the block chain DIKWP model according to data resources, information resources and knowledge resources contained in the user DIKWP model, the block chain with the content consistent with the content in the user DIKWP model is searched, and as the initial block chain, generally, the number of the initial block chains is multiple, and the initial block chain needs to be denoised, at this time, the user DIKWP model compares the intentions of the block chain DIKWP models of the initial block chain, compares the intentions of the user DIKWP model and the intentions of all the block chain DIKWP models of the initial block chain one by one, and finally, obtaining the block chain with the highest connection value according to the result of the connection value, and outputting the block chain as the block chain to be added.
Preferably, in the step S32, the obvious intention has a priority higher than that of the potential intention when comparing the intentions, and if no obvious intention exists in the user DIKWP model, the potential intention is used for comparison.
The intention model of the user DIKWP model contains obvious intention and potential intention, when comparing the intention, firstly judging whether the user DIKWP model contains obvious intention, if yes, comparing the obvious intention as a comparison object with the intention in the block chain DIKWP model, if no, taking the potential intention obtained by conversion as the comparison object, step S32 when comparing the intention, judging whether the obvious intention or the potential intention in the user DIKWP model is larger than the intention difference in the block chain DIKWP model, if the intention difference is larger, judging that the connection value of the block chain DIKWP model is lower, the block chain corresponding to the block chain DIKWP model with lower connection value is an unmatched block chain, and the block chain with higher connection value is output as a final block chain to be added.
Preferably, the specific step of step S4 is: the user DIKWP model packs the request information initiated by the user into a new block, then the new block is moved to the tail end of a block chain to be added for connection, and meanwhile, the new block is marked.
After obtaining the block chain to be added, the request information initiated by the user needs to be connected to the block chain to be added, so that the request information initiated by the user needs to be packaged into a new block, and then the new block needs to be correspondingly connected to the tail end of the block chain to be added, so as to realize the common uplink of the block chain.
Preferably, step S5 is further included, and a broadcast notification is made that the new tile is connected to the to-be-added tile chain.
After the common identity uplink is completed, a broadcast notification needs to be sent to the global so that other users can know that the request information has been entered into the corresponding block chain, so that other users can perform other common identity uplinks.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (5)
1. The block chain consensus method based on the DIKWP model is characterized by comprising the following steps of:
step S1, obtaining the typed resources of all blocks in the block chain, and constructing a DIKWP model of the block chain according to the typed resources, wherein the DIKWP respectively represents data, information, knowledge, wisdom and intention;
step S2, the user initiates request information, obtains typed resources according to the request information, and constructs a DIKWP model of the user according to the typed resources;
step S3, the user DIKWP model conducts traversal search and intention comparison on the block chain DIKWP model, and a block chain to be added is obtained;
step S4, packaging the request information initiated by the user into a new block by the user DIKWP model, and connecting the new block to the tail end of the block chain to be added;
the specific steps of step S2 are:
step S21, the user initiates a request, and the request information is mapped into typed resources, wherein the typed resources comprise data resources, information resources and knowledge resources;
step S22, extracting the obvious intention contained in the request information initiated by the user, converting and analyzing the data resource, the information resource and the knowledge resource to obtain the potential intention, wherein the obvious intention and the potential intention form the intention resource;
step S23, constructing a user DIKWP model according to the typed resources and the intention resources;
the specific steps of step S3 are:
step S31, the user DIKWP model searches the block chain DIKWP model, and the block chain with the same content is obtained as the initial block chain;
step S32, comparing the intention of the user DIKWP model and the block chain DIKWP model of the initial block chain;
step S33, judging the connection value of the block chain according to the intention comparison result;
step S34, sorting the block chains according to the connection value result, and taking the block chain with the highest connection value as the block chain to be added;
in the step S32, when comparing the intentions, the priority of the obvious intention is higher than that of the potential intention, and if there is no obvious intention in the user DIKWP model, the potential intention is used for comparison;
in the step S32, when comparing the intentions, it is determined whether the obvious intention or the potential intention in the user DIKWP model is different from the intention in the blockchain DIKWP model, and when the intention difference is larger, it is determined that the connection value of the blockchain DIKWP model is lower.
2. The DIKWP model-based block chain consensus method of claim 1, wherein the DIKWP model of the block chain and the DIKWP model of the user each comprise a data model, an information model, a knowledge model and an intention model, wherein the data model, the information model and the knowledge model are transformed into each other, and the intention model is obtained by combining the data model, the information model and the knowledge model.
3. The DIKWP model-based block chain consensus method as claimed in claim 1, wherein the specific steps of step S1 are:
step S11, obtaining semantic information contained in each block in the block chain, and mapping the semantic information into typed resources, wherein the typed resources comprise data resources, information resources, knowledge resources and intention resources;
step S12, building a block chain DIKWP model according to the data resources, the information resources, the knowledge resources and the intention resources.
4. The DIKWP model-based blockchain consensus method of claim 1, wherein the specific steps of step S4 are: the user DIKWP model packs the request information initiated by the user into a new block, then the new block is moved to the tail end of the block chain to be added for connection, and meanwhile, the new block is marked.
5. The DIKWP model-based blockchain consensus method of claim 1, further comprising step S5, making a broadcast notification that the new block is connected to the blockchain to be added.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111658319.XA CN114363354B (en) | 2021-12-30 | 2021-12-30 | Block chain consensus method based on DIKWP model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111658319.XA CN114363354B (en) | 2021-12-30 | 2021-12-30 | Block chain consensus method based on DIKWP model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114363354A CN114363354A (en) | 2022-04-15 |
| CN114363354B true CN114363354B (en) | 2022-09-30 |
Family
ID=81105018
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111658319.XA Active CN114363354B (en) | 2021-12-30 | 2021-12-30 | Block chain consensus method based on DIKWP model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114363354B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110471996A (en) * | 2019-08-25 | 2019-11-19 | 海南大学 | The contents semantic value calculation mechanism of imitative block chain node and meshed network towards fault-tolerant |
| CN111935207A (en) * | 2020-06-23 | 2020-11-13 | 海南大学 | Block chain system consensus method based on improved C4.5 algorithm |
| CN112016954A (en) * | 2020-07-14 | 2020-12-01 | 北京淇瑀信息科技有限公司 | Resource allocation method and device based on block chain network technology and electronic equipment |
| CN112949321A (en) * | 2021-04-21 | 2021-06-11 | 海南大学 | DIKW model construction method and device oriented to intention calculation and reasoning |
| CN113628753A (en) * | 2021-08-09 | 2021-11-09 | 海南大学 | DIKW resource analysis method and system oriented to intention calculation and reasoning |
| CN113643821A (en) * | 2021-10-13 | 2021-11-12 | 浙江大学 | Multi-center knowledge graph joint decision support method and system |
| CN113645284A (en) * | 2021-07-29 | 2021-11-12 | 海南大学 | Intention-driven multi-mode DIKW content transmission method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10380373B2 (en) * | 2017-09-07 | 2019-08-13 | Dataunitor AS | Network, method and computer program product for organizing and processing data |
| US11100483B2 (en) * | 2017-09-29 | 2021-08-24 | Intel Corporation | Hierarchical data information |
| US10776337B2 (en) * | 2018-07-06 | 2020-09-15 | International Business Machines Corporation | Multi-dimensional knowledge index and application thereof |
-
2021
- 2021-12-30 CN CN202111658319.XA patent/CN114363354B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110471996A (en) * | 2019-08-25 | 2019-11-19 | 海南大学 | The contents semantic value calculation mechanism of imitative block chain node and meshed network towards fault-tolerant |
| CN111935207A (en) * | 2020-06-23 | 2020-11-13 | 海南大学 | Block chain system consensus method based on improved C4.5 algorithm |
| CN112016954A (en) * | 2020-07-14 | 2020-12-01 | 北京淇瑀信息科技有限公司 | Resource allocation method and device based on block chain network technology and electronic equipment |
| CN112949321A (en) * | 2021-04-21 | 2021-06-11 | 海南大学 | DIKW model construction method and device oriented to intention calculation and reasoning |
| CN113645284A (en) * | 2021-07-29 | 2021-11-12 | 海南大学 | Intention-driven multi-mode DIKW content transmission method |
| CN113628753A (en) * | 2021-08-09 | 2021-11-09 | 海南大学 | DIKW resource analysis method and system oriented to intention calculation and reasoning |
| CN113643821A (en) * | 2021-10-13 | 2021-11-12 | 浙江大学 | Multi-center knowledge graph joint decision support method and system |
Non-Patent Citations (2)
| Title |
|---|
| "Service Recommendation based on Smart Contract and DIKW";Z. Haiyang, Y. Lei and D. Yucong;《 2021 IEEE World Congress on Services (SERVICES)》;20211115;全文 * |
| "类型化隐式资源的隐私保护方法";段玉聪等;《北京邮电大学学报》;20190815;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114363354A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105335403B (en) | Database access method and device and database system | |
| WO2022257436A1 (en) | Data warehouse construction method and system based on wireless communication network, and device and medium | |
| US7599922B1 (en) | System and method for federated searching | |
| CN106294593A (en) | In conjunction with subordinate clause level remote supervisory and the Relation extraction method of semi-supervised integrated study | |
| WO2008098502A1 (en) | Method and device for creating index as well as method and system for retrieving | |
| CN111538825B (en) | Knowledge question-answering method, device, system, equipment and storage medium | |
| CN106407377A (en) | Search method and device based on artificial intelligence | |
| CN105608113A (en) | Method and apparatus for judging POI data in text | |
| CN113900810A (en) | Distributed graph processing method, system and storage medium | |
| CN115510249A (en) | Knowledge graph construction method and device, electronic equipment and storage medium | |
| CN112102840A (en) | Semantic recognition method, device, terminal and storage medium | |
| CN114363354B (en) | Block chain consensus method based on DIKWP model | |
| CN104765763B (en) | A kind of semantic matching method of the Heterogeneous Spatial Information classification of service based on concept lattice | |
| CN110598003A (en) | Knowledge graph construction system and construction method based on public data resource catalog | |
| CN109992593A (en) | A kind of large-scale data parallel query method based on subgraph match | |
| US20080082516A1 (en) | System for and method of searching distributed data base, and information management device | |
| CN117033534A (en) | Geographic information processing method, device, computer equipment and storage medium | |
| CN105426490B (en) | A kind of indexing means based on tree structure | |
| CN116992880A (en) | Building name identification method, device, electronic equipment and storage medium | |
| CN113407702B (en) | Employee cooperation relationship intensity quantization method, system, computer and storage medium | |
| CN107506473A (en) | A kind of big data search method based on cloud computing | |
| CN105608122B (en) | A kind of method and apparatus storing electronic spreadsheet data | |
| CN112532414B (en) | Method, device, equipment and computer storage medium for determining ISP attribution | |
| CN104111965B (en) | OGC geographic information services based on differential matrix describe vocabulary reduction method | |
| CN113836395A (en) | Heterogeneous information network-based service developer on-demand recommendation method and system |
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 |