CN107562914B - Resource mask based demand response resource rapid positioning method - Google Patents
Resource mask based demand response resource rapid positioning method Download PDFInfo
- Publication number
- CN107562914B CN107562914B CN201710817340.7A CN201710817340A CN107562914B CN 107562914 B CN107562914 B CN 107562914B CN 201710817340 A CN201710817340 A CN 201710817340A CN 107562914 B CN107562914 B CN 107562914B
- Authority
- CN
- China
- Prior art keywords
- demand response
- node
- data structure
- resource
- tree data
- 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
- Supply And Distribution Of Alternating Current (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a resource mask based demand response resource rapid positioning method, which allocates numbers to address initial data of demand response resources, inputs destination addresses of the demand response resources, inquires and positions in a processed complete path compressed tree data structure, can rapidly search and position the demand response resources, can reduce the execution time of demand response projects, enables the command issuing time of demand response to be faster, shortens the command issuing time and the demand response project execution time, enables the capacity of demand response to be more accurate, can help an electric power dispatching center to rapidly dispatch the demand response resources, effectively optimizes the dispatching of the demand response projects, achieves the maximum benefit, and has good economic value.
Description
Technical Field
The invention relates to a demand response resource rapid positioning method based on a resource mask, and belongs to the technical field of power dispatching.
Background
At present, the mainstream of research on demand response of an electric power system mainly tends to research on peak clipping and valley filling, that is, on the premise that some loads on a user side are interruptible loads or transferable loads, a power grid directly or indirectly transfers the enthusiasm of users through effective economic means or technical means to realize peak clipping and valley filling.
The power grid can use electricity orderly by taking incentive measures such as electricity charge compensation, differential electricity price, time-of-use electricity price and the like, namely, the power market can reduce the peak-valley difference of the power grid, reduce the loss and load impact of the power grid and ensure the reliable operation of the power grid.
According to the analysis of the current research results of demand response, the following directions are mainly provided,
(1) researching a demand response business mode, adopting a flexible demand response policy, implementing interruptible load electricity charge subsidy for large users, and simultaneously fully utilizing time-of-use electricity price and differential electricity price policies to promote peak clipping and valley filling and realize dynamic power balance;
(2) based on the analysis of the power utilization behavior of the user and the establishment of a corresponding demand model, an optimized regulation and control method of user response is provided;
(3) establishing an optimization model of load aggregation, and performing local consumption on the new energy by adopting the aggregation optimization load model without considering the electricity consumption feeling of a user and the unstable condition of the new energy;
(4) the method comprises the steps of providing a power demand side management strategy taking power grid peak clipping and valley filling as targets, establishing a multi-target function of most economical power consumption of a user layer and peak clipping and valley filling of the power grid, carrying out optimization solution by adopting a differential evolution algorithm based on time-of-use power price, and dividing time periods of the time-of-use power price by adopting a fuzzy clustering algorithm, but the method has the defect that the pricing of the time-of-use power price is not researched.
In addition, the demand response controls the grid loss, the load fluctuation and the peak-valley difference at the user side of the power grid as target functions, and can simultaneously consider the local consumption of new energy and each target function of the power grid or consider the satisfaction degree and the charging cost of users as targets. However, these methods do not consider the demand response resource to quickly find and locate, and ensure the satisfaction of the power consumer, and the scheduling execution speed of the demand response project is not correspondingly studied, which is a problem to be solved currently.
Disclosure of Invention
The invention aims to overcome the problem that the demand response resource is not considered to be quickly searched and positioned in the existing demand response research. The resource mask-based demand response resource quick positioning method can quickly search and position demand response resources, can help the power dispatching center to quickly dispatch the demand response resources, effectively optimizes the dispatching of demand response projects, achieves the maximum benefit, and has good economic value.
In order to achieve the purpose, the invention adopts the technical scheme that:
a demand response resource rapid positioning method based on resource masks is characterized in that: comprises the following steps of (a) carrying out,
step (A), collecting address initial data participating in demand response resources;
preprocessing the acquired address initial data, converting the address initial data into a standard binary tree data structure, and storing the standard binary tree data structure;
step (C), the standard binary tree data structure is reprocessed and is subjected to path compression to generate a new path compression tree data structure;
step (D), storing two fields in each node of the path compression tree-shaped data structure, wherein the two fields comprise a skip value skip and a skip segment string, and forming a complete path compression tree-shaped data structure capable of being quickly and accurately positioned;
step (E), the user inputs the destination address of the demand response resource to be positioned and inquires in the complete path compression tree data structure;
step (F), when the corresponding demand response resource node is inquired, checking whether the last bit of the destination address is inquired, if so, returning the current demand response resource node, wherein the position corresponding to the demand response resource node is the required position; if not, returning to the next node of the current demand response resource node for continuous query, when no corresponding demand response resource node is queried, checking whether the current node contains branches, and if so, continuing the query; and if no branch exists, returning to the current demand response resource node, wherein the position corresponding to the demand response resource node is the demand.
The demand response resource quick positioning method based on the resource mask is characterized in that: the steps (A) to (F) are realized based on a power grid dispatching center platform.
The demand response resource quick positioning method based on the resource mask is characterized in that: and (A) the address initial data participating in the demand response resource is a 32-bit address sequence specified by an OpenADR protocol, and when the address is configured for the demand response resource, the address of the demand response resource is sequentially configured according to the sequence of participating in the demand response project.
The demand response resource quick positioning method based on the resource mask is characterized in that: and (B) converting the address initial data into a standard binary tree data structure, wherein the address initial data is arranged into a visible standard binary tree topological graph in a digital form.
The demand response resource quick positioning method based on the resource mask is characterized in that: and (C) reprocessing the standard binary tree data structure, performing path compression on the standard binary tree data structure, and generating a new path compression tree data structure.
The demand response resource quick positioning method based on the resource mask is characterized in that: step (E), the user inputs the destination address of the demand response resource to be positioned and inquires in the complete path compression tree data structure, comprising the following steps,
(E1) the query positioning is started from the first node of the complete path compressed tree data structure;
(E2) judging the first digit value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the first digit value is '0'; when the number is 1, inquiring the right branch of the first node of the complete path compressed tree data structure;
(E3) after the last numerical value of the destination address is inquired, judging the next numerical value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the next numerical value is '0'; when it is "1", then the query is made to the right branch of the first node of the full path compressed tree data structure.
The invention has the beneficial effects that: the resource mask based demand response resource quick positioning method disclosed by the invention has the advantages that the initial address data of the demand response resource is distributed with a serial number, the destination address of the demand response resource is input, the query positioning is carried out in the processed complete path compressed tree-shaped data structure, the demand response resource can be quickly searched and positioned, the execution time of a demand response project can be reduced, the command issuing time of the demand response is quicker, the command issuing time and the execution time of the demand response project are shortened, the capacity of the demand response is more accurate, the demand response resource can be quickly scheduled by a power scheduling center, the scheduling of the demand response project is effectively optimized, the benefit maximization is achieved, and the economic value is good.
Drawings
FIG. 1 is a flow chart of a resource mask based demand response resource fast location method of the present invention;
FIG. 2 is a diagram of a power dispatch center platform and power aggregators, demand response resources relationship;
FIG. 3 is a diagram of a standard binary tree data structure according to one embodiment of the invention;
FIG. 4 is a diagram of a full path compression tree data structure according to an embodiment of the invention.
Detailed Description
The invention will be further explained with reference to the drawings attached to the specification. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
As shown in fig. 1, the demand response resource quick location method based on resource mask of the present invention includes the following steps,
and (A) acquiring initial address data of the participating demand response resources, wherein the initial address data is acquired based on a power grid dispatching center platform, the initial address data of the participating demand response resources is a 32-bit address sequence specified by an OpenADR protocol, and when the addresses are configured for the demand response resources, the addresses of the demand response resources are sequentially configured according to the sequence of participating demand response items.
Step (B), preprocessing the acquired address initial data, converting the address initial data into a standard binary tree data structure and storing the standard binary tree data structure based on a power grid dispatching center platform, wherein the specific process is that the address initial data is arranged into a visual standard binary tree topological graph in a digital form;
step (C), the standard binary tree data structure is reprocessed and is subjected to path compression to generate a new path compression tree data structure, and the specific process is that nodes without demand response resources in the standard binary tree data structure are omitted or compressed;
step (D), storing two fields in each node of the path compression tree-shaped data structure, wherein the two fields comprise a skip value skip and a skip segment string, and forming a complete path compression tree-shaped data structure capable of being quickly and accurately positioned;
step (E), the user inputs the destination address of the demand response resource to be positioned and inquires in the complete path compression tree data structure, comprising the following steps,
(E1) the query positioning is started from the first node of the complete path compressed tree data structure;
(E2) judging the first digit value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the first digit value is '0'; when the number is 1, inquiring the right branch of the first node of the complete path compressed tree data structure;
(E3) after the last numerical value of the destination address is inquired, judging the next numerical value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the next numerical value is '0'; when the number is 1, inquiring the right branch of the first node of the complete path compressed tree data structure;
step (F), when the corresponding demand response resource node is inquired, checking whether the last bit of the destination address is inquired, if so, returning the current demand response resource node, wherein the position corresponding to the demand response resource node is the required position; if not, returning to the next node of the current demand response resource node for continuous query, when no corresponding demand response resource node is queried, checking whether the current node contains branches, and if so, continuing the query; and if no branch exists, returning to the current demand response resource node, wherein the position corresponding to the demand response resource node is the demand.
Preferably, the steps (a) to (F) are implemented based on a power grid dispatching center platform.
The following describes a method for quickly locating a demand response resource based on a resource mask according to an embodiment of the present invention,
fig. 2 is a relationship diagram of a power dispatching center platform, a power aggregator and demand response resources, and as shown in fig. 2, the power aggregator manages the demand response resources, and the power dispatching center can also directly manage the demand response resources.
In the prior art, for a standard binary tree data structure, each search starts from a root node, as shown in fig. 3, (each node in fig. 3 contains two pointers, namely, a pointer "0" points to a left branch and a pointer "1" points to a right branch), a P1 node starts a one-bit search, and the search efficiency is low. For example, when searching for the P7 node, in the worst case, the P7 node can be found after six hops, i.e., 7 searches, and when the number of address bits is large and the number of search bits is large, the search efficiency is low and the time is long. According to the method, the address of the demand response resource is a 32-bit address sequence, namely a 32-bit binary number, according to the definition of the OpenADR protocol, therefore, when the destination address of the demand response resource is searched, under the worst condition, 32 times of searching are needed to accurately find the corresponding demand response resource, and when the address sequence of the binary number is 7 bits in length, 128 leaf nodes are provided from the memory, and when the sequence is 32 bits in length, 232 leaf nodes are required to be stored.
Through the above description, problems in the prior art have been found. The method for quickly positioning the demand response resource based on the resource mask is improved on a standard binary tree data structure, namely, nodes without demand response resources are compressed or omitted, and the tree structure which is simplified and improved is called a path compression tree data structure. At this time, some fields need to be added to supplement the lost information, so two fields are additionally stored in each node of the path compression tree structure: skipping the value skip and omitting the segment string to form a complete path compression tree data structure capable of being quickly and accurately positioned.
For example, fig. 4 is a simpler path compression according to fig. 3 than fig. 3. Fig. 4 is the same as fig. 3, and each node contains two pointers: pointer "0" points to the left branch, pointer "1" points to the right branch, and the destination demand response resource node P7 is also searched, and the search starts from the root node and traverses according to the destination address, and the specific process is as follows:
the first bit of the destination address 110010 is 1, the pointer points to the right, P3 is found (skip 1, string 1), P3 is checked not to be the last bit of the destination address, and the query is continued; the third bit of the destination address is 0, the pointer points to the left, a point W1 is found, W1 is a node corresponding to the resource without the demand response, and the inquiry is continued after a branch is detected in W1; the fourth bit of the destination address is 0, the pointer points to the left, a point W2 is found, W2 is a node corresponding to the resource without the demand response, and the query is continued after a branch is detected in W2; the fifth bit of the destination address is 1, the pointer points to the right, and a point P7 is found (skip 1, string 0); if the sixth bit of the destination address is not equal to the omitted segment "0" of point P7, the lookup results in the penultimate node, i.e., the P3 node in FIG. 4. The search times of the standard binary tree data structure are 7, the search times of the complete path compression tree data structure are 5, the search times are reduced by 2 compared with the search times of the standard binary tree data structure, the method is applied to a more huge standard binary tree data structure, the search times of the path compression tree structure demand response resource search method are less, the search speed is higher, the execution time of demand response items is correspondingly reduced, the command issuing time of demand response is faster, the command issuing time and the demand response item execution time are shortened, the capacity of demand response is more accurate, and the income of a power grid is increased.
In summary, according to the resource mask-based demand response resource quick positioning method, the number is allocated to the address initial data of the demand response resource, the destination address of the demand response resource is input, the query positioning is performed in the processed complete path compressed tree-shaped data structure, the demand response resource can be quickly searched and positioned, the execution time of the demand response project can be reduced, the command issuing time of the demand response is shortened, the command issuing time and the demand response project execution time are shortened, the demand response capacity is more accurate, the demand response resource can be quickly scheduled by the power scheduling center, the demand response project scheduling is effectively optimized, the benefit maximization is achieved, and the economic value is good.
The foregoing illustrates and describes the principles, general features, and advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (5)
1. A demand response resource rapid positioning method based on resource masks is characterized in that: comprises the following steps of (a) carrying out,
step (A), collecting address initial data participating in demand response resources;
preprocessing the acquired address initial data, converting the address initial data into a standard binary tree data structure, and storing the standard binary tree data structure;
step (C), the standard binary tree data structure is reprocessed and is subjected to path compression to generate a new path compression tree data structure;
step (D), storing two fields in each node of the path compression tree-shaped data structure, wherein the two fields comprise a skip value skip and a skip segment string, and forming a complete path compression tree-shaped data structure capable of being quickly and accurately positioned;
step (E), the user inputs the destination address of the demand response resource to be positioned and inquires in the complete path compression tree data structure, and the method specifically comprises the following steps:
(E1) the query positioning is started from the first node of the complete path compressed tree data structure;
(E2) judging the first digit value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the first digit value is '0'; when the node is '1', inquiring the right branch of the first node of the complete path compressed tree data structure;
(E3) after the last numerical value of the destination address is inquired, judging the next numerical value of the destination address, and inquiring the left branch of the first node of the complete path compressed tree data structure when the next numerical value is 0; when the node is '1', inquiring the right branch of the first node of the complete path compressed tree data structure;
step (F), when the corresponding demand response resource node is inquired, checking whether the last bit of the destination address is inquired, if so, returning the current demand response resource node, wherein the position corresponding to the demand response resource node is the required position; if not, returning to the next node of the current demand response resource node for continuous query, when no corresponding demand response resource node is queried, checking whether the current node contains branches, and if so, continuing the query; and if no branch exists, returning to the current demand response resource node, wherein the position corresponding to the demand response resource node is the demand.
2. The method for fast locating demand response resources based on resource masks according to claim 1, wherein: the steps (A) to (F) are realized based on a power grid dispatching center platform.
3. The method for fast locating demand response resources based on resource masks according to claim 1, wherein: and step (A), the address initial data participating in the demand response resource is a 32-bit address sequence specified by an OpenADR protocol, and when the address is configured for the demand response resource, the demand response resource is configured according to the sequence of participating in the demand response project.
4. The method for fast locating demand response resources based on resource masks according to claim 1, wherein: and (B) converting the address initial data into a standard binary tree data structure, wherein the address initial data is arranged into a visible standard binary tree topological graph in a digital form.
5. The method for fast locating demand response resources based on resource masks according to claim 1, wherein: and (C) reprocessing the standard binary tree data structure, performing path compression on the standard binary tree data structure, and generating a new path compression tree data structure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710817340.7A CN107562914B (en) | 2017-09-12 | 2017-09-12 | Resource mask based demand response resource rapid positioning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710817340.7A CN107562914B (en) | 2017-09-12 | 2017-09-12 | Resource mask based demand response resource rapid positioning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107562914A CN107562914A (en) | 2018-01-09 |
| CN107562914B true CN107562914B (en) | 2021-04-09 |
Family
ID=60979685
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710817340.7A Active CN107562914B (en) | 2017-09-12 | 2017-09-12 | Resource mask based demand response resource rapid positioning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107562914B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116881339B (en) * | 2023-09-08 | 2023-11-10 | 深圳时空数字科技有限公司 | Multimedia touch inquiry and command scheduling system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8707456B2 (en) * | 2009-07-24 | 2014-04-22 | Broadcom Corporation | Method and system for integrating remote devices into a domestic VLAN |
| CN103812789A (en) * | 2013-09-18 | 2014-05-21 | 广东电网公司佛山供电局 | Cloud service resource automatic allocating method and system |
| CN106301843A (en) * | 2015-05-28 | 2017-01-04 | 亿阳信通股份有限公司 | A kind of cloud platform safeguards system and method |
| CN106326331A (en) * | 2016-06-29 | 2017-01-11 | 河南许继仪表有限公司 | Intelligent power utilization data service system based on cloud computation |
| CN106302742B (en) * | 2016-08-17 | 2019-10-01 | 云南电网有限责任公司电力科学研究院 | A kind of electrical power services resource information interactive system and method |
| CN106786542A (en) * | 2017-01-04 | 2017-05-31 | 国家电网公司 | A kind of demand response system |
-
2017
- 2017-09-12 CN CN201710817340.7A patent/CN107562914B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107562914A (en) | 2018-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jiang et al. | Energy-efficient scheduling for a job shop using grey wolf optimization algorithm with double-searching mode | |
| CN102722432B (en) | Follow the trail of the method and apparatus of internal storage access | |
| CN104778203B (en) | Take the storage of load record block index and querying method in control intelligent electric energy meter | |
| CN102254024A (en) | Mass data processing system and method | |
| CN107657019B (en) | Network topology structure obtaining method and system of power grid system | |
| CN110086643A (en) | A kind of Risk Identification Method, terminal and storage medium | |
| CN112865089A (en) | Improved large-scale scene analysis method for active power distribution network | |
| CN107562914B (en) | Resource mask based demand response resource rapid positioning method | |
| CN105005503A (en) | Cellular automaton based cloud computing load balancing task scheduling method | |
| CN104283966A (en) | Data distribution algorithm and device of cloud storage system | |
| CN116307336B (en) | Method and device for planning path of electricity exchanging and computer equipment | |
| CN102420812A (en) | Automatic quality of service (QoS) combination method supporting distributed parallel processing in web service | |
| CN112700099A (en) | Resource scheduling planning method based on reinforcement learning and operation research | |
| CN110032586B (en) | Storage method, query method and acquisition and storage system for energy storage cell data | |
| Dabhi et al. | Metaheuristic optimization algorithm for day-ahead energy resource management (ERM) in microgrid environment of power system | |
| CN106648304A (en) | Method and device for classifying intelligent device desktop | |
| CN111124313A (en) | Data reading and writing method and device for power acquisition terminal and electronic equipment | |
| CN113297218B (en) | Multi-system data interaction method, device and system | |
| CN115018322A (en) | Intelligent crowdsourcing task allocation method and system | |
| CN110146102B (en) | Path planning method, device, equipment and storage medium | |
| CN102663099A (en) | Address table management method for collecting terminal | |
| CN113421004A (en) | Transmission and distribution cooperative active power distribution network distributed robust extension planning system and method | |
| CN113778681A (en) | Data processing method and device based on cloud computing and storage medium | |
| Liu et al. | Grid resource scheduling algorithm based on optimization hierarchy | |
| CN109687464B (en) | Power grid power flow analysis method and device, storage medium and processor |
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 | ||
| CB02 | Change of applicant information |
Address after: PA Weier road Jiangning District of Nanjing City, Jiangsu Province, No. 1 211103 Applicant after: STATE GRID JIANGSU ELECTRIC POWER COMPANY Research Institute Applicant after: STATE GRID CORPORATION OF CHINA Applicant after: BEIJING CHINA POWER INFORMATION TECHNOLOGY Co.,Ltd. Applicant after: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Applicant after: CHINA ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. Applicant after: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. Applicant after: JIANGSU ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. Address before: PA Weier road Jiangning District of Nanjing City, Jiangsu Province, No. 1 211103 Applicant before: STATE GRID JIANGSU ELECTRIC POWER COMPANY Research Institute Applicant before: State Grid Corporation of China Applicant before: BEIJING CHINA POWER INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Applicant before: China Electric Power Research Institute Applicant before: STATE GRID JIANGSU ELECTRIC POWER Co. Applicant before: JIANGSU ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20191205 Address after: PA Weier road Jiangning District of Nanjing City, Jiangsu Province, No. 1 211103 Applicant after: STATE GRID JIANGSU ELECTRIC POWER COMPANY Research Institute Applicant after: STATE GRID CORPORATION OF CHINA Applicant after: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant after: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Applicant after: CHINA ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. Applicant after: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. Applicant after: JIANGSU ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. Address before: PA Weier road Jiangning District of Nanjing City, Jiangsu Province, No. 1 211103 Applicant before: STATE GRID JIANGSU ELECTRIC POWER COMPANY Research Institute Applicant before: STATE GRID CORPORATION OF CHINA Applicant before: BEIJING CHINA POWER INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd. Applicant before: CHINA ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. Applicant before: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. Applicant before: JIANGSU ELECTRIC POWER RESEARCH INSTITUTE Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |