CN104376374A - Fast calculation method and device for capacity optimal matching and computer storage medium - Google Patents
Fast calculation method and device for capacity optimal matching and computer storage medium Download PDFInfo
- Publication number
- CN104376374A CN104376374A CN201410637856.XA CN201410637856A CN104376374A CN 104376374 A CN104376374 A CN 104376374A CN 201410637856 A CN201410637856 A CN 201410637856A CN 104376374 A CN104376374 A CN 104376374A
- Authority
- CN
- China
- Prior art keywords
- capacity
- generator
- group
- geocoding
- combination
- 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
- 238000004364 calculation method Methods 0.000 title claims abstract description 17
- 230000008878 coupling Effects 0.000 claims description 2
- 238000010168 coupling process Methods 0.000 claims description 2
- 238000005859 coupling reaction Methods 0.000 claims description 2
- 238000000034 method Methods 0.000 abstract description 10
- 230000000694 effects Effects 0.000 abstract description 2
- 238000005303 weighing Methods 0.000 abstract 1
- 238000011217 control strategy Methods 0.000 description 3
- 230000005611 electricity Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000000087 stabilizing effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Public Health (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Water Supply & Treatment (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a fast calculation method for capacity optimal matching based on a grouping capacity coding method. When a power system breaks down and is controlled emergently, after the capacity of a generator to be cut off is calculated, and selection is conducted on generators allowed to be cut off. In order to achieve the optimal control effect, it is required that the matching error of the capacity of the generator to be removed and the capacity to be cut is the minimum, when the number of the generators is large, the calculated quantity is much large, in order to fast find the optimal match, the generators are divided into two or more groups, a weighing offset address with the weight is distributed to each generator in each group first, then address coding is conducted on each arrangement combination of the generators in each group, the corresponding capacity code of each address code is calculated, and the optimal matching capacity can be calculated out rapidly by scanning the mutual intersection points of each group of codes. If the address codes of each group are mapped to a coordinate axis in a coordinate system, a searched object is mapped into an intersection point in a coordinate plane, and the searched object is shown in the drawing in the abstract.
Description
Technical field
The invention belongs to power automation control field, particularly relate to a kind of capacity Optimum Matching quick calculation method based on group capacity coding method, equipment and computer-readable storage medium.
Background technology
Along with electric system expanding day, interconnection power system and transferring electricity from the west to the east, the concentrated access of Large Copacity, remote, UHV (ultra-high voltage) and UHV transmission, AC/DC parallel transmission of electricity, a large amount of new forms of energy and electricity market be about to the features such as operation, make the stable problem of electric system more outstanding than ever, each electrical network is widely used in the whole nation for electric power system stability control technology and stabilizing control system, has become the important component part that electrical network day-to-day operation is indispensable.When electric system carries out emergency control after breaking down, first the generator total volume needing excision is calculated according to control strategy, then can supply to select in the generator of excision, for reaching best control effects, often require that the generator capacity of actual excision is minimum with the matching error need cutting total volume, when generator quantity is larger, the situation of permutation and combination is a lot, and calculated amount is very large.
Traditional searching method carries out permutation and combination to all generators, then the generator calculated inside each permutation and combination always can cut capacity, finally judge which permutation and combination and the total volume that need cut are closest, for 15 generators for excision: the first step selects 1 inside 15 generators, and find out generator capacity and the immediate machine of total volume need be cut, have 15 combinations; Second step selects 2 inside 15 generators, and finds out generator capacity and need cut immediate two machines of total volume, has 105 combinations; 3rd step selects 3 inside 15 generators, and finds out generator capacity and need cut immediate three machines of total volume, has 455 combinations; The capacity finally finding out which permutation and combination is closest with the total volume that need cut, and always has 32768 permutation and combination.When carrying out so many permutation and combination computing, except the total volume of each combination will be calculated, the selection situation of each permutation and combination also to be recorded; Real system can for excision generator number of units may much larger than 15, stabilized control system belongs to emergency control, after fault control measure perform speed faster, to system stablize more favourable; So many permutation and combination require that stabilizing control system calculates within the extremely short time, and its real-time calculated is difficult to ensure.
Summary of the invention
Object of the present invention, be to provide a kind of capacity Optimum Matching quick calculation method based on group capacity coding method, when generator number of units is more, the method significantly can shorten computing time, reaches the requirement controlled in real time.
In order to reach above-mentioned purpose, a kind of capacity Optimum Matching quick calculation method, is characterized in that:
1) first alternative generator is divided into groups when calculating coupling capacity;
2) distribute the weighted deviation address of a Weight in each packets inner to every platform generator, the weighted deviation address often organizing interior i-th generator is 2
(i-1), i gets 1 to n, the generator sum in this grouping of n; Permutation and combination is carried out to the generator in every group, obtains 2
nindividual permutation and combination, and geocoding is carried out to permutation and combination often kind described;
3) for often kind that often organizes interior generator described permutation and combination, generator capacity sum in this combination is calculated, as the capacity coding of this combination, and corresponding with the geocoding of this combination;
4) scanning often organizes the mutual intersection point of described geocoding, (x
1+ x
2× 2
n+ x
3× 2
2n+ ... x
m× 2
(m-1) n) step scans the xth of first group
1individual geocoding, second group of xth
2individual geocoding, the 3rd group of xth
3individual geocoding ... m group xth
mthe intersection point of individual geocoding, m is packet count, and the generator capacity of described intersection point representative is this capacity coding sum in each group, obtains Optimum Matching capacity, and finds the generator needing excision according to the geocoding of described Optimum Matching capacity in each group.
In such scheme: every group address coding covers all permutation and combination of generator in this group, the capacity coding that each geocoding correspondence one is unique.
In such scheme: during calculating generator capacity coding, adopt recursion encryption algorithm, coding below utilizes coding result of calculation above.
In such scheme: when calculating Optimum Matching capacity, the generator capacity of intersection point representative is this capacity coding sum in each group, and this generator selected by point is directly calculated by this some geocoding in each group.
In addition, the present invention also provides a kind of computer-readable storage medium, stores computer executable instructions in described computer-readable storage medium, and described computer executable instructions is used for the quick calculation method of enforcement of rights requirement described in 1 to 4 any one.
In addition, the present invention also provides a kind of capacity Optimum Matching quick computing equipment, it is characterized in that, comprises grouped element, weighted coding unit, capacity coding unit, scanning element, and wherein, described grouped element is used for dividing into groups to alternative generator;
Described weighted coding unit is used for distributing the weighted deviation address of a Weight in each packets inner to every platform generator, and the weighted deviation address often organizing interior i-th generator is 2
(i-1), i gets 1 to n, the generator sum in this grouping of n; And permutation and combination is carried out to the generator in every group, obtain 2
nindividual permutation and combination, and geocoding is carried out to permutation and combination often kind described;
Described capacity coding unit, for often kind that often organizes interior generator described permutation and combination, calculates generator capacity sum in this combination, as the capacity coding of this combination, and corresponding with the geocoding of this combination;
Described scanning element is for scanning the mutual intersection point often organized between described geocoding, (x
1+ x
2× 2
n+ x
3× 2
2n+ ... x
m× 2
(m-1) n) step scans the xth of first group
1individual geocoding, second group of xth
2individual geocoding, the 3rd group of xth
3individual geocoding ... m group xth
mthe intersection point of individual geocoding, m is packet count, and the generator capacity of described intersection point representative is this capacity coding sum in each group, obtains Optimum Matching capacity, and finds the generator needing excision according to the geocoding of described Optimum Matching capacity in each group
After adopting such scheme, by the searching method that group capacity is encoded, when generator number of units is more, the search speed of optimum capacity can be accelerated, meet the requirement of real-time that stabilized control system performs control strategy, for the contrast example of 12 machines, faster than classic method more than 4 times of the computing velocity of the method.
Accompanying drawing explanation
Fig. 1 is the schematic diagram that the present invention searches for the generator capacity after coding.
Embodiment
Below with reference to accompanying drawing, technical scheme of the present invention is described in detail.
The invention provides a kind of capacity Optimum Matching quick calculation method based on group capacity coding method, if after a certain grid collapses, 16 can be had for the generator of excision, first these 16 generators are divided into 2 groups, first group of generator is mapped to X-axis, second group of generator is mapped to as Y-axis, often organize 8, generator in first group is the generator in 8, second group, generator 1 ~ generator is generator 9 ~ generator 16; First distribute a weighted deviation address to the every platform generator in this group after grouping, in first group, the weighted deviation address of generator 1 is: 2
(1-1)=1, the weighted deviation address of generator 2 is: 2
(2-1)=2 ... the weighted deviation address of generator 8 is: 2
(8-1)=128; In second group, the weighted deviation address of generator 9 is 1 (generator 9 is the First generator in second group), and the weighted deviation address of generator 10 is 2 ... the weighted deviation address of generator 16 is 128; And geocoding is carried out to often kind of permutation and combination of the generator in every group, geocoding after often organizing in-line coding can cover all permutation and combination of generator in this group, for the often kind of permutation and combination often organizing interior generator, calculate total appearance sum of generator in this combination, as the capacity coding of this combination, and it is corresponding with the geocoding of this combination, the capacity coding that each like this geocoding correspondence one is unique, such as: in first group, geocoding 0 represents the generator of the inner ineligible of this group, and the capacity corresponding with it is encoded to 0; Geocoding 1 represents in this group and selects generator 1, and the capacity corresponding with it is encoded to the capacity of generator 1; Geocoding 2 represents in this group and selects generator 2, and the capacity corresponding with it is encoded to the capacity of generator 2; Geocoding 3 represents in this group and selects generator 1 and generator 2, and the capacity corresponding with it is encoded to the capacity of generator 1 and the capacity sum of generator 2;For saving computing time, recursion encryption algorithm is adopted during calculated capacity coding, coding below utilizes coding result of calculation above, and the addition of encoding of the capacity coding of capacity coding geocoding 3 correspondence of such as geocoding 7 correspondence and 4 corresponding capacity of encoding draws.The mutual intersection point between every group coding is scanned after end-of-encode, the first step scans the intersection point of first geocoding of first group and first geocoding of second group, second step scans the intersection point of first geocoding of first group and second geocoding of second group ... intersection point representative generator capacity be this in each group capacity coding sum, calculate the intersection point of Optimum Matching, and directly find the generator needing excision according to the geocoding of Optimum Matching point in each group found.The packet count of this sample is 2, volume coordinate is reduced to planimetric coordinates, as long as search is at the intersection point (comprising true origin) of planimetric coordinates first quartile during search, as shown in the figure, if the coordinate of certain fault search is (x1, y1), the geocoding of x1 is 9 in the figure, generator 1 and generator 4 are selected in representative, this capacity represented in X-axis is encoded to the capacity sum of generator 1 and generator 4, the geocoding of y1 is 7, generator 9 is selected in representative, generator 10, generator 11, this capacity represented in Y-axis is encoded to generator 9, generator 10, the capacity sum of generator 11.
With the capacity of each permutation and combination of traditional calculating, then the minimum assembled scheme of all permutation and combination medial error is selected to compare, the present invention's group capacity coding method, first alternative object carried out divide into groups and carry out geocoding to each group and capacity is encoded, each group can be mapped to a coordinate axis in coordinate system, then Optimum Matching is calculated by the intersection point of the every group coding of scanning in volume coordinate, the search speed of optimum capacity can be accelerated, meet the requirement of real-time that stabilized control system performs control strategy.
In addition, the present invention also provides a kind of computer-readable storage medium, stores computer executable instructions in described computer-readable storage medium, and described computer executable instructions is for performing quick calculation method described in the invention.
In addition, the present invention also provides a kind of capacity Optimum Matching quick computing equipment, comprises grouped element, weighted coding unit, capacity coding unit, scanning element, and wherein, described grouped element is used for dividing into groups to alternative generator;
Described weighted coding unit is used for distributing the weighted deviation address of a Weight in each packets inner to every platform generator, and the weighted deviation address often organizing interior i-th generator is 2
(i-1), i gets 1 to n, the generator sum in this grouping of n; And permutation and combination is carried out to the generator in every group, obtain 2
nindividual permutation and combination, and geocoding is carried out to permutation and combination often kind described;
Described capacity coding unit, for often kind that often organizes interior generator described permutation and combination, calculates generator capacity sum in this combination, as the capacity coding of this combination, and corresponding with the geocoding of this combination;
Described scanning element is for scanning the mutual intersection point often organized between described geocoding, (x
1+ x
2× 2
n+ x
3× 2
2n+ ... x
m× 2
(m-1) n) step scans the xth of first group
1individual geocoding, second group of xth
2individual geocoding, the 3rd group of xth
3individual geocoding ... m group xth
mthe intersection point of individual geocoding, m is packet count, and the generator capacity of described intersection point representative is this capacity coding sum in each group, obtains Optimum Matching capacity, and finds the generator needing excision according to the geocoding of described Optimum Matching capacity in each group.
Above embodiment is only and technological thought of the present invention is described, can not limit protection scope of the present invention with this, and every technological thought proposed according to the present invention, any change that technical scheme basis is done, all falls within scope.
Claims (6)
1. a capacity Optimum Matching quick calculation method, is characterized in that:
1) first alternative generator is divided into groups when calculating coupling capacity;
2) distribute the weighted deviation address of a Weight in each packets inner to every platform generator, the weighted deviation address often organizing interior i-th generator is 2
(i-1), i gets 1 to n, the generator sum in this grouping of n; Permutation and combination is carried out to the generator in every group, obtains 2
nindividual permutation and combination, and geocoding is carried out to permutation and combination often kind described;
3) for often kind that often organizes interior generator described permutation and combination, generator capacity sum in this combination is calculated, as the capacity coding of this combination, and corresponding with the geocoding of this combination;
4) scanning often organizes the mutual intersection point of described geocoding, (x
1+ x
2× 2
n+ x
3× 2
2n+ ... x
m× 2
(m-1) n) step scans the xth of first group
1individual geocoding, second group of xth
2individual geocoding, the 3rd group of xth
3individual geocoding ... m group xth
mthe intersection point of individual geocoding, m is packet count, and the generator capacity of described intersection point representative is this capacity coding sum in each group, obtains Optimum Matching capacity, and finds the generator needing excision according to the geocoding of described Optimum Matching capacity in each group.
2. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, is characterized in that: every group address coding covers all permutation and combination of generator in this group, the capacity coding that each geocoding correspondence one is unique.
3. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, is characterized in that: during calculating generator capacity coding, adopt recursion encryption algorithm, coding below utilizes coding result of calculation above.
4. a kind of capacity Optimum Matching quick calculation method as claimed in claim 1, it is characterized in that: when calculating Optimum Matching capacity, the generator capacity of intersection point representative is this capacity coding sum in each group, and this generator selected by point is directly calculated by this some geocoding in each group.
5. a computer-readable storage medium, stores computer executable instructions in described computer-readable storage medium, and described computer executable instructions is used for the quick calculation method of enforcement of rights requirement described in 1 to 4 any one.
6. the quick computing equipment of capacity Optimum Matching, is characterized in that, comprises grouped element, weighted coding unit, capacity coding unit, scanning element, and wherein, described grouped element is used for dividing into groups to alternative generator;
Described weighted coding unit is used for distributing the weighted deviation address of a Weight in each packets inner to every platform generator, and the weighted deviation address often organizing interior i-th generator is 2
(i-1), i gets 1 to n, the generator sum in this grouping of n; And permutation and combination is carried out to the generator in every group, obtain 2
nindividual permutation and combination, and geocoding is carried out to permutation and combination often kind described;
Described capacity coding unit, for often kind that often organizes interior generator described permutation and combination, calculates generator capacity sum in this combination, as the capacity coding of this combination, and corresponding with the geocoding of this combination;
Described scanning element is for scanning the mutual intersection point often organized between described geocoding, (x
1+ x
2× 2
n+ x
3× 2
2n+ ... x
m× 2
(m-1) n) step scans the xth of first group
1individual geocoding, second group of xth
2individual geocoding, the 3rd group of xth
3individual geocoding ... m group xth
mthe intersection point of individual geocoding, m is packet count, and the generator capacity of described intersection point representative is this capacity coding sum in each group, obtains Optimum Matching capacity, and finds the generator needing excision according to the geocoding of described Optimum Matching capacity in each group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410637856.XA CN104376374B (en) | 2014-11-12 | 2014-11-12 | A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410637856.XA CN104376374B (en) | 2014-11-12 | 2014-11-12 | A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104376374A true CN104376374A (en) | 2015-02-25 |
| CN104376374B CN104376374B (en) | 2017-07-18 |
Family
ID=52555269
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410637856.XA Active CN104376374B (en) | 2014-11-12 | 2014-11-12 | A kind of capacity Optimum Matching quick calculation method, equipment and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104376374B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107860972A (en) * | 2017-10-25 | 2018-03-30 | 北京信息科技大学 | Method for detecting harmonic wave and m-Acetyl chlorophosphonazo |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0516333A2 (en) * | 1991-05-31 | 1992-12-02 | AT&T Corp. | Automated resource allocation system employing a learning arrangement |
| CN103150606A (en) * | 2013-01-22 | 2013-06-12 | 中国电力科学研究院 | Optimal power flow optimization method of distributed power supplies |
| CN103186818A (en) * | 2011-12-27 | 2013-07-03 | 北京能高自动化技术股份有限公司 | Optimal matching method for wind turbine generator systems and wind resource conditions |
-
2014
- 2014-11-12 CN CN201410637856.XA patent/CN104376374B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0516333A2 (en) * | 1991-05-31 | 1992-12-02 | AT&T Corp. | Automated resource allocation system employing a learning arrangement |
| CN103186818A (en) * | 2011-12-27 | 2013-07-03 | 北京能高自动化技术股份有限公司 | Optimal matching method for wind turbine generator systems and wind resource conditions |
| CN103150606A (en) * | 2013-01-22 | 2013-06-12 | 中国电力科学研究院 | Optimal power flow optimization method of distributed power supplies |
Non-Patent Citations (1)
| Title |
|---|
| 吴迪 等: "一种基于暂态稳定风险的储能位置与容量优化方法", 《电力科学与技术学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107860972A (en) * | 2017-10-25 | 2018-03-30 | 北京信息科技大学 | Method for detecting harmonic wave and m-Acetyl chlorophosphonazo |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104376374B (en) | 2017-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101404032B (en) | Video retrieval method and system based on contents | |
| CN103383682B (en) | A kind of Geocoding, position enquiring system and method | |
| CN105786822B (en) | Search space object and the method and device for establishing spatial index in electronic map | |
| CN106156138B (en) | The foundation of the spatial index of point of interest, Perimeter method and apparatus | |
| CN104765749B (en) | A kind of date storage method and device | |
| CN104317795A (en) | Two-dimensional filter generation method, query method and device | |
| RU2017111038A (en) | Cryptographic system implemented for the joint use of keys | |
| CN104867402B (en) | A kind of method and device thereof and terminal device of offline inverse geocoding | |
| CN110377681B (en) | Data query method and device, readable storage medium and electronic equipment | |
| CN105320771A (en) | Hash ring based time sequence database service cluster implementation method and system | |
| CN103870591A (en) | Method and system for carrying out parallel spatial analysis service based on spatial data | |
| Mahdavi et al. | Comparing efficiency of PSO with GA in transmission expansion planning considering network adequacy | |
| CN106294484A (en) | A kind of method and device updating electronic map data | |
| CN104376374A (en) | Fast calculation method and device for capacity optimal matching and computer storage medium | |
| CN111460237B (en) | Data query method and device, readable storage medium and electronic equipment | |
| CN117368588A (en) | Method, device, equipment and storage medium for determining consistency of voltage phase sequence | |
| CN113378069B (en) | Main and distribution network automatic drawing method based on intelligent recommendation algorithm | |
| CN114089770A (en) | Inspection point position generation method and related device for inspection robot of transformer substation | |
| CN106998371B (en) | Credible IP information judging method, IP information base updating method and device | |
| CN105404734B (en) | The recognition methods and system of ferro-resonance over-voltage type | |
| CN106027369A (en) | Email address characteristic oriented email address matching method | |
| KR101568934B1 (en) | Method for processing tag of HMI | |
| CN103377241A (en) | Power grid data integration method and system | |
| CN108521128B (en) | Rapid search method for static voltage security domain boundary of electric power system | |
| Yuan et al. | Improving the accuracy of second-order cone AC optimal power flow by convex approximations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |